| Back to Multiple platform build/check report for BioC 3.21: simplified long |
|
This page was generated on 2025-01-04 11:47 -0500 (Sat, 04 Jan 2025).
| Hostname | OS | Arch (*) | R version | Installed pkgs |
|---|---|---|---|---|
| nebbiolo1 | Linux (Ubuntu 24.04.1 LTS) | x86_64 | R Under development (unstable) (2024-10-21 r87258) -- "Unsuffered Consequences" | 4756 |
| palomino7 | Windows Server 2022 Datacenter | x64 | R Under development (unstable) (2024-10-26 r87273 ucrt) -- "Unsuffered Consequences" | 4475 |
| lconway | macOS 12.7.1 Monterey | x86_64 | R Under development (unstable) (2024-11-20 r87352) -- "Unsuffered Consequences" | 4435 |
| kjohnson3 | macOS 13.7.1 Ventura | arm64 | R Under development (unstable) (2024-11-20 r87352) -- "Unsuffered Consequences" | 4390 |
| kunpeng2 | Linux (openEuler 22.03 LTS-SP1) | aarch64 | R Under development (unstable) (2024-11-24 r87369) -- "Unsuffered Consequences" | 4383 |
| Click on any hostname to see more info about the system (e.g. compilers) (*) as reported by 'uname -p', except on Windows and Mac OS X | ||||
| Package 1658/2275 | Hostname | OS / Arch | INSTALL | BUILD | CHECK | BUILD BIN | ||||||||
| RBGL 1.83.0 (landing page) Bioconductor Package Maintainer
| nebbiolo1 | Linux (Ubuntu 24.04.1 LTS) / x86_64 | OK | OK | WARNINGS |  | ||||||||
| palomino7 | Windows Server 2022 Datacenter / x64 | OK | OK | WARNINGS | OK | | ||||||||
| lconway | macOS 12.7.1 Monterey / x86_64 | OK | OK | OK | OK | | ||||||||
| kjohnson3 | macOS 13.7.1 Ventura / arm64 | OK | OK | OK | OK | | ||||||||
| kunpeng2 | Linux (openEuler 22.03 LTS-SP1) / aarch64 | OK | OK | WARNINGS | ||||||||||
|
To the developers/maintainers of the RBGL package: - Allow up to 24 hours (and sometimes 48 hours) for your latest push to git@git.bioconductor.org:packages/RBGL.git to reflect on this report. See Troubleshooting Build Report for more information. - Use the following Renviron settings to reproduce errors and warnings. - If 'R CMD check' started to fail recently on the Linux builder(s) over a missing dependency, add the missing dependency to 'Suggests:' in your DESCRIPTION file. See Renviron.bioc for more information. - See Martin Grigorov's blog post for how to debug Linux ARM64 related issues on a x86_64 host. |
| Package: RBGL |
| Version: 1.83.0 |
| Command: /home/biocbuild/R/R/bin/R CMD INSTALL RBGL |
| StartedAt: 2025-01-03 19:28:32 -0000 (Fri, 03 Jan 2025) |
| EndedAt: 2025-01-03 19:31:27 -0000 (Fri, 03 Jan 2025) |
| EllapsedTime: 175.2 seconds |
| RetCode: 0 |
| Status: OK |
##############################################################################
##############################################################################
###
### Running command:
###
### /home/biocbuild/R/R/bin/R CMD INSTALL RBGL
###
##############################################################################
##############################################################################
* installing to library ‘/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library’
* installing *source* package ‘RBGL’ ...
** using staged installation
** libs
using C++ compiler: ‘aarch64-unknown-linux-gnu-g++ (GCC) 14.2.0’
/opt/ohpc/pub/compiler/gcc/14.2.0/bin/aarch64-unknown-linux-gnu-g++ -std=gnu++17 -I"/home/biocbuild/R/R/include" -DNDEBUG -I'/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include' -I/usr/local/include -fPIC -g -O2 -Wall -Werror=format-security -DR_NO_REMAP -c bbc.cpp -o bbc.o
In file included from bbc.cpp:1:
RBGL.hpp:41:9: warning: "R_NO_REMAP" redefined
41 | #define R_NO_REMAP
| ^~~~~~~~~~
<command-line>: note: this is the location of the previous definition
In file included from /home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:22,
from RBGL.hpp:17:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/mpl/assert.hpp:194:21: warning: unnecessary parentheses in declaration of ‘assert_arg’ [-Wparentheses]
194 | failed ************ (Pred::************
| ^~~~~~~~~~~~~~~~~~~
195 | assert_arg( void (*)(Pred), typename assert_arg_pred<Pred>::type )
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
196 | );
| ~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/mpl/assert.hpp:194:21: note: remove parentheses
194 | failed ************ (Pred::************
| ^~~~~~~~~~~~~~~~~~~
| -
195 | assert_arg( void (*)(Pred), typename assert_arg_pred<Pred>::type )
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
196 | );
| ~
| -
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/mpl/assert.hpp:199:21: warning: unnecessary parentheses in declaration of ‘assert_not_arg’ [-Wparentheses]
199 | failed ************ (boost::mpl::not_<Pred>::************
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
200 | assert_not_arg( void (*)(Pred), typename assert_arg_pred_not<Pred>::type )
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
201 | );
| ~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/mpl/assert.hpp:199:21: note: remove parentheses
199 | failed ************ (boost::mpl::not_<Pred>::************
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
| -
200 | assert_not_arg( void (*)(Pred), typename assert_arg_pred_not<Pred>::type )
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
201 | );
| ~
| -
In file included from /home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/smart_ptr/shared_ptr.hpp:17,
from /home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/vector_property_map.hpp:14,
from /home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:598:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/smart_ptr/detail/shared_count.hpp:326:33: warning: ‘template<class> class std::auto_ptr’ is deprecated: use 'std::unique_ptr' instead [-Wdeprecated-declarations]
326 | explicit shared_count( std::auto_ptr<Y> & r ): pi_( new sp_counted_impl_p<Y>( r.get() ) )
| ^~~~~~~~
In file included from /opt/ohpc/pub/compiler/gcc/14.2.0/include/c++/14.2.0/memory:78,
from /home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/smart_ptr/detail/sp_counted_impl.hpp:35,
from /home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/smart_ptr/detail/shared_count.hpp:23:
/opt/ohpc/pub/compiler/gcc/14.2.0/include/c++/14.2.0/bits/unique_ptr.h:59:28: note: declared here
59 | template<typename> class auto_ptr;
| ^~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/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()
| ^~~~~~~~
/opt/ohpc/pub/compiler/gcc/14.2.0/include/c++/14.2.0/bits/unique_ptr.h:59:28: note: declared here
59 | template<typename> class auto_ptr;
| ^~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/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()
| ^~~~~~~~
/opt/ohpc/pub/compiler/gcc/14.2.0/include/c++/14.2.0/bits/unique_ptr.h:59:28: note: declared here
59 | template<typename> class auto_ptr;
| ^~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/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 )
| ^~~~~~~~
/opt/ohpc/pub/compiler/gcc/14.2.0/include/c++/14.2.0/bits/unique_ptr.h:59:28: note: declared here
59 | template<typename> class auto_ptr;
| ^~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/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 )
| ^~~~~~~~
/opt/ohpc/pub/compiler/gcc/14.2.0/include/c++/14.2.0/bits/unique_ptr.h:59:28: note: declared here
59 | template<typename> class auto_ptr;
| ^~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/smart_ptr/shared_ptr.hpp: In member function ‘boost::shared_ptr<T>& boost::shared_ptr<T>::operator=(std::auto_ptr<_Up>&&)’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/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 );
| ^~~~~~~~
/opt/ohpc/pub/compiler/gcc/14.2.0/include/c++/14.2.0/bits/unique_ptr.h:59:28: note: declared here
59 | template<typename> class auto_ptr;
| ^~~~~~~~
In file included from /home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/scoped_ptr.hpp:13,
from /home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/adjacency_list.hpp:22,
from RBGL.hpp:38:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/smart_ptr/scoped_ptr.hpp: At global scope:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/smart_ptr/scoped_ptr.hpp:75:31: warning: ‘template<class> class std::auto_ptr’ is deprecated: use 'std::unique_ptr' instead [-Wdeprecated-declarations]
75 | explicit scoped_ptr( std::auto_ptr<T> p ) noexcept : px( p.release() )
| ^~~~~~~~
/opt/ohpc/pub/compiler/gcc/14.2.0/include/c++/14.2.0/bits/unique_ptr.h:59:28: note: declared here
59 | template<typename> class auto_ptr;
| ^~~~~~~~
In file included from /home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/assert.hpp:35,
from /home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:19:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/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<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >*, std::vector<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >, std::allocator<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > > > > > > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:145:5: required from ‘struct boost::Assignable<__gnu_cxx::__normal_iterator<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >*, std::vector<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >, std::allocator<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > > > > > >’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator<__gnu_cxx::__normal_iterator<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >*, std::vector<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >, std::allocator<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > > > > > >’
502 | BOOST_concept(InputIterator,(TT))
| ^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:540:3: required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >*, std::vector<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >, std::allocator<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > > > > > >’
540 | BOOST_concept(ForwardIterator,(TT))
| ^~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >*, std::vector<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >, std::allocator<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > > > > > >’
568 | BOOST_concept(BidirectionalIterator,(TT))
| ^~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >*, std::vector<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >, std::allocator<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > > > > > >’
597 | BOOST_concept(RandomAccessIterator,(TT))
| ^~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3: [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_<void (*)(boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >*, std::vector<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >, std::allocator<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > > > > > >)>’
72 | struct requirement_<void(*)(Model)>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map<RAIter, ID, typename std::iterator_traits< <template-parameter-1-1> >::value_type, typename std::iterator_traits< <template-parameter-1-1> >::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = __gnu_cxx::__normal_iterator<std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<undirected_tag, long unsigned int> > >*, std::vector<std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<undirected_tag, long unsigned int> > >, std::allocator<std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<undirected_tag, long unsigned int> > > > > >; ID = vec_adj_list_vertex_id_map<property<vertex_index_t, int, property<vertex_centrality_t, double> >, long unsigned int>; typename std::iterator_traits< <template-parameter-1-1> >::value_type = std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<undirected_tag, long unsigned int> > >; typename std::iterator_traits< <template-parameter-1-1> >::reference = std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<undirected_tag, long unsigned int> > >&]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:469:43: required from ‘void boost::detail::graph::brandes_betweenness_centrality_dispatch2(const Graph&, CentralityMap, EdgeCentralityMap, WeightMap, VertexIndexMap) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >; CentralityMap = boost::vec_adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >, boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_centrality_t>; WeightMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_weight_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>]’
469 | make_iterator_property_map(incoming.begin(), vertex_index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:517:57: required from ‘static void boost::detail::graph::brandes_betweenness_centrality_dispatch1<WeightMap>::run(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap, WeightMap) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >; CentralityMap = boost::vec_adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >, boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>; WeightMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_weight_t>]’
517 | brandes_betweenness_centrality_dispatch2(g, centrality,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~
518 | edge_centrality_map, weight_map, vertex_index);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:558:71: required from ‘void boost::brandes_betweenness_centrality(const Graph&, const bgl_named_params<T, Tag, Base>&, typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >; Param = adj_list_edge_property_map<undirected_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_centrality_t, double> >, edge_weight_t>; Tag = edge_weight_t; Rest = bgl_named_params<adj_list_edge_property_map<undirected_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_centrality_t, double> >, edge_centrality_t>, edge_centrality_t, bgl_named_params<vec_adj_list_vertex_property_map<adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >, adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >*, double, double&, vertex_centrality_t>, vertex_centrality_t, no_property> >; typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits<Graph>::traversal_category = undir_adj_list_traversal_tag]’
558 | detail::graph::brandes_betweenness_centrality_dispatch1< ew >::run(g,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
559 | choose_param(
| ~~~~~~~~~~~~~
560 | get_param(params, vertex_centrality), dummy_property_map()),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
561 | choose_param(get_param(params, edge_centrality), dummy_property_map()),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
562 | choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
563 | get_param(params, edge_weight));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
bbc.cpp:67:33: required from here
67 | brandes_betweenness_centrality(g,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
68 | centrality_map(get(vertex_centrality, g)).
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
69 | edge_centrality_map(get(edge_centrality, g)).
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
70 | weight_map(get(edge_weight, g)));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
In file included from /home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:31,
from /home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:20:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/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<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >*, std::vector<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >, std::allocator<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > > > > > >]’
20 | ~usage_requirements() { ((Model*)0)->~Model(); }
| ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/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<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >*, std::vector<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >, std::allocator<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > > > > > > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable<__gnu_cxx::__normal_iterator<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >*, std::vector<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >, std::allocator<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > > > > > >’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator<__gnu_cxx::__normal_iterator<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >*, std::vector<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >, std::allocator<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > > > > > >’
502 | BOOST_concept(InputIterator,(TT))
| ^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:540:3: required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >*, std::vector<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >, std::allocator<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > > > > > >’
540 | BOOST_concept(ForwardIterator,(TT))
| ^~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >*, std::vector<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >, std::allocator<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > > > > > >’
568 | BOOST_concept(BidirectionalIterator,(TT))
| ^~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >*, std::vector<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >, std::allocator<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > > > > > >’
597 | BOOST_concept(RandomAccessIterator,(TT))
| ^~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3: [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_<void (*)(boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >*, std::vector<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >, std::allocator<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > > > > > >)>’
72 | struct requirement_<void(*)(Model)>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map<RAIter, ID, typename std::iterator_traits< <template-parameter-1-1> >::value_type, typename std::iterator_traits< <template-parameter-1-1> >::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = __gnu_cxx::__normal_iterator<std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<undirected_tag, long unsigned int> > >*, std::vector<std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<undirected_tag, long unsigned int> > >, std::allocator<std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<undirected_tag, long unsigned int> > > > > >; ID = vec_adj_list_vertex_id_map<property<vertex_index_t, int, property<vertex_centrality_t, double> >, long unsigned int>; typename std::iterator_traits< <template-parameter-1-1> >::value_type = std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<undirected_tag, long unsigned int> > >; typename std::iterator_traits< <template-parameter-1-1> >::reference = std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<undirected_tag, long unsigned int> > >&]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:469:43: required from ‘void boost::detail::graph::brandes_betweenness_centrality_dispatch2(const Graph&, CentralityMap, EdgeCentralityMap, WeightMap, VertexIndexMap) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >; CentralityMap = boost::vec_adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >, boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_centrality_t>; WeightMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_weight_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>]’
469 | make_iterator_property_map(incoming.begin(), vertex_index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:517:57: required from ‘static void boost::detail::graph::brandes_betweenness_centrality_dispatch1<WeightMap>::run(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap, WeightMap) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >; CentralityMap = boost::vec_adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >, boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>; WeightMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_weight_t>]’
517 | brandes_betweenness_centrality_dispatch2(g, centrality,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~
518 | edge_centrality_map, weight_map, vertex_index);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:558:71: required from ‘void boost::brandes_betweenness_centrality(const Graph&, const bgl_named_params<T, Tag, Base>&, typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >; Param = adj_list_edge_property_map<undirected_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_centrality_t, double> >, edge_weight_t>; Tag = edge_weight_t; Rest = bgl_named_params<adj_list_edge_property_map<undirected_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_centrality_t, double> >, edge_centrality_t>, edge_centrality_t, bgl_named_params<vec_adj_list_vertex_property_map<adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >, adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >*, double, double&, vertex_centrality_t>, vertex_centrality_t, no_property> >; typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits<Graph>::traversal_category = undir_adj_list_traversal_tag]’
558 | detail::graph::brandes_betweenness_centrality_dispatch1< ew >::run(g,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
559 | choose_param(
| ~~~~~~~~~~~~~
560 | get_param(params, vertex_centrality), dummy_property_map()),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
561 | choose_param(get_param(params, edge_centrality), dummy_property_map()),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
562 | choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
563 | get_param(params, edge_weight));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
bbc.cpp:67:33: required from here
67 | brandes_betweenness_centrality(g,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
68 | centrality_map(get(vertex_centrality, g)).
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
69 | edge_centrality_map(get(edge_centrality, g)).
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
70 | weight_map(get(edge_weight, g)));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/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<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >*, std::vector<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >, std::allocator<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > > > > > >]’
20 | ~usage_requirements() { ((Model*)0)->~Model(); }
| ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/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<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >*, std::vector<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >, std::allocator<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > > > > > > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:512:7: required from ‘struct boost::InputIterator<__gnu_cxx::__normal_iterator<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >*, std::vector<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >, std::allocator<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > > > > > >’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:540:3: required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >*, std::vector<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >, std::allocator<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > > > > > >’
540 | BOOST_concept(ForwardIterator,(TT))
| ^~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >*, std::vector<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >, std::allocator<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > > > > > >’
568 | BOOST_concept(BidirectionalIterator,(TT))
| ^~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >*, std::vector<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >, std::allocator<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > > > > > >’
597 | BOOST_concept(RandomAccessIterator,(TT))
| ^~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >*, std::vector<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >, std::allocator<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > > > > > >’
597 | BOOST_concept(RandomAccessIterator,(TT))
| ^~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_<void (*)(boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >*, std::vector<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >, std::allocator<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > > > > > >)>’
72 | struct requirement_<void(*)(Model)>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map<RAIter, ID, typename std::iterator_traits< <template-parameter-1-1> >::value_type, typename std::iterator_traits< <template-parameter-1-1> >::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = __gnu_cxx::__normal_iterator<std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<undirected_tag, long unsigned int> > >*, std::vector<std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<undirected_tag, long unsigned int> > >, std::allocator<std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<undirected_tag, long unsigned int> > > > > >; ID = vec_adj_list_vertex_id_map<property<vertex_index_t, int, property<vertex_centrality_t, double> >, long unsigned int>; typename std::iterator_traits< <template-parameter-1-1> >::value_type = std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<undirected_tag, long unsigned int> > >; typename std::iterator_traits< <template-parameter-1-1> >::reference = std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<undirected_tag, long unsigned int> > >&]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:469:43: required from ‘void boost::detail::graph::brandes_betweenness_centrality_dispatch2(const Graph&, CentralityMap, EdgeCentralityMap, WeightMap, VertexIndexMap) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >; CentralityMap = boost::vec_adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >, boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_centrality_t>; WeightMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_weight_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>]’
469 | make_iterator_property_map(incoming.begin(), vertex_index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:517:57: required from ‘static void boost::detail::graph::brandes_betweenness_centrality_dispatch1<WeightMap>::run(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap, WeightMap) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >; CentralityMap = boost::vec_adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >, boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>; WeightMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_weight_t>]’
517 | brandes_betweenness_centrality_dispatch2(g, centrality,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~
518 | edge_centrality_map, weight_map, vertex_index);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:558:71: required from ‘void boost::brandes_betweenness_centrality(const Graph&, const bgl_named_params<T, Tag, Base>&, typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >; Param = adj_list_edge_property_map<undirected_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_centrality_t, double> >, edge_weight_t>; Tag = edge_weight_t; Rest = bgl_named_params<adj_list_edge_property_map<undirected_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_centrality_t, double> >, edge_centrality_t>, edge_centrality_t, bgl_named_params<vec_adj_list_vertex_property_map<adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >, adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >*, double, double&, vertex_centrality_t>, vertex_centrality_t, no_property> >; typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits<Graph>::traversal_category = undir_adj_list_traversal_tag]’
558 | detail::graph::brandes_betweenness_centrality_dispatch1< ew >::run(g,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
559 | choose_param(
| ~~~~~~~~~~~~~
560 | get_param(params, vertex_centrality), dummy_property_map()),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
561 | choose_param(get_param(params, edge_centrality), dummy_property_map()),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
562 | choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
563 | get_param(params, edge_weight));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
bbc.cpp:67:33: required from here
67 | brandes_betweenness_centrality(g,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
68 | centrality_map(get(vertex_centrality, g)).
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
69 | edge_centrality_map(get(edge_centrality, g)).
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
70 | weight_map(get(edge_weight, g)));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/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<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >*, std::vector<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >, std::allocator<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > > > > > >]’
20 | ~usage_requirements() { ((Model*)0)->~Model(); }
| ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/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<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >*, std::vector<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >, std::allocator<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > > > > > > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:543:7: required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >*, std::vector<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >, std::allocator<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > > > > > >’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >*, std::vector<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >, std::allocator<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > > > > > >’
568 | BOOST_concept(BidirectionalIterator,(TT))
| ^~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >*, std::vector<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >, std::allocator<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > > > > > >’
597 | BOOST_concept(RandomAccessIterator,(TT))
| ^~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >*, std::vector<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >, std::allocator<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > > > > > >’
597 | BOOST_concept(RandomAccessIterator,(TT))
| ^~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >*, std::vector<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >, std::allocator<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > > > > > >]’
32 | inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
| ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_<void (*)(boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >*, std::vector<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >, std::allocator<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > > > > > >)>’
72 | struct requirement_<void(*)(Model)>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map<RAIter, ID, typename std::iterator_traits< <template-parameter-1-1> >::value_type, typename std::iterator_traits< <template-parameter-1-1> >::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = __gnu_cxx::__normal_iterator<std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<undirected_tag, long unsigned int> > >*, std::vector<std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<undirected_tag, long unsigned int> > >, std::allocator<std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<undirected_tag, long unsigned int> > > > > >; ID = vec_adj_list_vertex_id_map<property<vertex_index_t, int, property<vertex_centrality_t, double> >, long unsigned int>; typename std::iterator_traits< <template-parameter-1-1> >::value_type = std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<undirected_tag, long unsigned int> > >; typename std::iterator_traits< <template-parameter-1-1> >::reference = std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<undirected_tag, long unsigned int> > >&]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:469:43: required from ‘void boost::detail::graph::brandes_betweenness_centrality_dispatch2(const Graph&, CentralityMap, EdgeCentralityMap, WeightMap, VertexIndexMap) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >; CentralityMap = boost::vec_adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >, boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_centrality_t>; WeightMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_weight_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>]’
469 | make_iterator_property_map(incoming.begin(), vertex_index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:517:57: required from ‘static void boost::detail::graph::brandes_betweenness_centrality_dispatch1<WeightMap>::run(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap, WeightMap) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >; CentralityMap = boost::vec_adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >, boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>; WeightMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_weight_t>]’
517 | brandes_betweenness_centrality_dispatch2(g, centrality,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~
518 | edge_centrality_map, weight_map, vertex_index);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:558:71: required from ‘void boost::brandes_betweenness_centrality(const Graph&, const bgl_named_params<T, Tag, Base>&, typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >; Param = adj_list_edge_property_map<undirected_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_centrality_t, double> >, edge_weight_t>; Tag = edge_weight_t; Rest = bgl_named_params<adj_list_edge_property_map<undirected_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_centrality_t, double> >, edge_centrality_t>, edge_centrality_t, bgl_named_params<vec_adj_list_vertex_property_map<adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >, adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >*, double, double&, vertex_centrality_t>, vertex_centrality_t, no_property> >; typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits<Graph>::traversal_category = undir_adj_list_traversal_tag]’
558 | detail::graph::brandes_betweenness_centrality_dispatch1< ew >::run(g,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
559 | choose_param(
| ~~~~~~~~~~~~~
560 | get_param(params, vertex_centrality), dummy_property_map()),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
561 | choose_param(get_param(params, edge_centrality), dummy_property_map()),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
562 | choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
563 | get_param(params, edge_weight));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
bbc.cpp:67:33: required from here
67 | brandes_betweenness_centrality(g,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
68 | centrality_map(get(vertex_centrality, g)).
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
69 | edge_centrality_map(get(edge_centrality, g)).
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
70 | weight_map(get(edge_weight, g)));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/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<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >*, std::vector<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >, std::allocator<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > > > > > >]’
20 | ~usage_requirements() { ((Model*)0)->~Model(); }
| ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/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<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >*, std::vector<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >, std::allocator<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > > > > > > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:571:7: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >*, std::vector<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >, std::allocator<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > > > > > >’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >*, std::vector<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >, std::allocator<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > > > > > >’
597 | BOOST_concept(RandomAccessIterator,(TT))
| ^~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >*, std::vector<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >, std::allocator<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > > > > > >’
597 | BOOST_concept(RandomAccessIterator,(TT))
| ^~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >*, std::vector<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >, std::allocator<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > > > > > >]’
32 | inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
| ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_<void (*)(boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >*, std::vector<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >, std::allocator<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > > > > > >)>’
72 | struct requirement_<void(*)(Model)>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map<RAIter, ID, typename std::iterator_traits< <template-parameter-1-1> >::value_type, typename std::iterator_traits< <template-parameter-1-1> >::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = __gnu_cxx::__normal_iterator<std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<undirected_tag, long unsigned int> > >*, std::vector<std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<undirected_tag, long unsigned int> > >, std::allocator<std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<undirected_tag, long unsigned int> > > > > >; ID = vec_adj_list_vertex_id_map<property<vertex_index_t, int, property<vertex_centrality_t, double> >, long unsigned int>; typename std::iterator_traits< <template-parameter-1-1> >::value_type = std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<undirected_tag, long unsigned int> > >; typename std::iterator_traits< <template-parameter-1-1> >::reference = std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<undirected_tag, long unsigned int> > >&]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:469:43: required from ‘void boost::detail::graph::brandes_betweenness_centrality_dispatch2(const Graph&, CentralityMap, EdgeCentralityMap, WeightMap, VertexIndexMap) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >; CentralityMap = boost::vec_adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >, boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_centrality_t>; WeightMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_weight_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>]’
469 | make_iterator_property_map(incoming.begin(), vertex_index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:517:57: required from ‘static void boost::detail::graph::brandes_betweenness_centrality_dispatch1<WeightMap>::run(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap, WeightMap) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >; CentralityMap = boost::vec_adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >, boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>; WeightMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_weight_t>]’
517 | brandes_betweenness_centrality_dispatch2(g, centrality,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~
518 | edge_centrality_map, weight_map, vertex_index);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:558:71: required from ‘void boost::brandes_betweenness_centrality(const Graph&, const bgl_named_params<T, Tag, Base>&, typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >; Param = adj_list_edge_property_map<undirected_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_centrality_t, double> >, edge_weight_t>; Tag = edge_weight_t; Rest = bgl_named_params<adj_list_edge_property_map<undirected_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_centrality_t, double> >, edge_centrality_t>, edge_centrality_t, bgl_named_params<vec_adj_list_vertex_property_map<adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >, adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >*, double, double&, vertex_centrality_t>, vertex_centrality_t, no_property> >; typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits<Graph>::traversal_category = undir_adj_list_traversal_tag]’
558 | detail::graph::brandes_betweenness_centrality_dispatch1< ew >::run(g,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
559 | choose_param(
| ~~~~~~~~~~~~~
560 | get_param(params, vertex_centrality), dummy_property_map()),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
561 | choose_param(get_param(params, edge_centrality), dummy_property_map()),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
562 | choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
563 | get_param(params, edge_weight));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
bbc.cpp:67:33: required from here
67 | brandes_betweenness_centrality(g,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
68 | centrality_map(get(vertex_centrality, g)).
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
69 | edge_centrality_map(get(edge_centrality, g)).
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
70 | weight_map(get(edge_weight, g)));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/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<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >*, std::vector<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >, std::allocator<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > > > > > >]’
20 | ~usage_requirements() { ((Model*)0)->~Model(); }
| ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/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<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >*, std::vector<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >, std::allocator<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > > > > > > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:253:5: required from ‘struct boost::Comparable<__gnu_cxx::__normal_iterator<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >*, std::vector<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >, std::allocator<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > > > > > >’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >*, std::vector<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >, std::allocator<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > > > > > >’
597 | BOOST_concept(RandomAccessIterator,(TT))
| ^~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >*, std::vector<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >, std::allocator<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > > > > > >’
597 | BOOST_concept(RandomAccessIterator,(TT))
| ^~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >*, std::vector<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >, std::allocator<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > > > > > >]’
32 | inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
| ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_<void (*)(boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >*, std::vector<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >, std::allocator<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > > > > > >)>’
72 | struct requirement_<void(*)(Model)>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map<RAIter, ID, typename std::iterator_traits< <template-parameter-1-1> >::value_type, typename std::iterator_traits< <template-parameter-1-1> >::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = __gnu_cxx::__normal_iterator<std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<undirected_tag, long unsigned int> > >*, std::vector<std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<undirected_tag, long unsigned int> > >, std::allocator<std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<undirected_tag, long unsigned int> > > > > >; ID = vec_adj_list_vertex_id_map<property<vertex_index_t, int, property<vertex_centrality_t, double> >, long unsigned int>; typename std::iterator_traits< <template-parameter-1-1> >::value_type = std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<undirected_tag, long unsigned int> > >; typename std::iterator_traits< <template-parameter-1-1> >::reference = std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<undirected_tag, long unsigned int> > >&]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:469:43: required from ‘void boost::detail::graph::brandes_betweenness_centrality_dispatch2(const Graph&, CentralityMap, EdgeCentralityMap, WeightMap, VertexIndexMap) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >; CentralityMap = boost::vec_adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >, boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_centrality_t>; WeightMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_weight_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>]’
469 | make_iterator_property_map(incoming.begin(), vertex_index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:517:57: required from ‘static void boost::detail::graph::brandes_betweenness_centrality_dispatch1<WeightMap>::run(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap, WeightMap) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >; CentralityMap = boost::vec_adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >, boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>; WeightMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_weight_t>]’
517 | brandes_betweenness_centrality_dispatch2(g, centrality,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~
518 | edge_centrality_map, weight_map, vertex_index);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:558:71: required from ‘void boost::brandes_betweenness_centrality(const Graph&, const bgl_named_params<T, Tag, Base>&, typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >; Param = adj_list_edge_property_map<undirected_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_centrality_t, double> >, edge_weight_t>; Tag = edge_weight_t; Rest = bgl_named_params<adj_list_edge_property_map<undirected_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_centrality_t, double> >, edge_centrality_t>, edge_centrality_t, bgl_named_params<vec_adj_list_vertex_property_map<adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >, adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >*, double, double&, vertex_centrality_t>, vertex_centrality_t, no_property> >; typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits<Graph>::traversal_category = undir_adj_list_traversal_tag]’
558 | detail::graph::brandes_betweenness_centrality_dispatch1< ew >::run(g,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
559 | choose_param(
| ~~~~~~~~~~~~~
560 | get_param(params, vertex_centrality), dummy_property_map()),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
561 | choose_param(get_param(params, edge_centrality), dummy_property_map()),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
562 | choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
563 | get_param(params, edge_weight));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
bbc.cpp:67:33: required from here
67 | brandes_betweenness_centrality(g,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
68 | centrality_map(get(vertex_centrality, g)).
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
69 | edge_centrality_map(get(edge_centrality, g)).
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
70 | weight_map(get(edge_weight, g)));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/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<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >*, std::vector<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >, std::allocator<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > > > > > >]’
20 | ~usage_requirements() { ((Model*)0)->~Model(); }
| ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/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<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >*, std::vector<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >, std::allocator<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > > > > > > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:601:7: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >*, std::vector<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >, std::allocator<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > > > > > >’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >*, std::vector<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >, std::allocator<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > > > > > >’
597 | BOOST_concept(RandomAccessIterator,(TT))
| ^~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >*, std::vector<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >, std::allocator<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > > > > > >]’
32 | inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
| ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied<boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >*, std::vector<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >, std::allocator<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > > > > > > >::value’
44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied<boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >*, std::vector<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >, std::allocator<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > > > > > > >’
45 | typedef boost::integral_constant<bool, value> type;
| ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_<void (*)(boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >*, std::vector<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >, std::allocator<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > > > > > >)>’
72 | struct requirement_<void(*)(Model)>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map<RAIter, ID, typename std::iterator_traits< <template-parameter-1-1> >::value_type, typename std::iterator_traits< <template-parameter-1-1> >::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = __gnu_cxx::__normal_iterator<std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<undirected_tag, long unsigned int> > >*, std::vector<std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<undirected_tag, long unsigned int> > >, std::allocator<std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<undirected_tag, long unsigned int> > > > > >; ID = vec_adj_list_vertex_id_map<property<vertex_index_t, int, property<vertex_centrality_t, double> >, long unsigned int>; typename std::iterator_traits< <template-parameter-1-1> >::value_type = std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<undirected_tag, long unsigned int> > >; typename std::iterator_traits< <template-parameter-1-1> >::reference = std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<undirected_tag, long unsigned int> > >&]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:469:43: required from ‘void boost::detail::graph::brandes_betweenness_centrality_dispatch2(const Graph&, CentralityMap, EdgeCentralityMap, WeightMap, VertexIndexMap) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >; CentralityMap = boost::vec_adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >, boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_centrality_t>; WeightMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_weight_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>]’
469 | make_iterator_property_map(incoming.begin(), vertex_index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:517:57: required from ‘static void boost::detail::graph::brandes_betweenness_centrality_dispatch1<WeightMap>::run(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap, WeightMap) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >; CentralityMap = boost::vec_adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >, boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>; WeightMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_weight_t>]’
517 | brandes_betweenness_centrality_dispatch2(g, centrality,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~
518 | edge_centrality_map, weight_map, vertex_index);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:558:71: required from ‘void boost::brandes_betweenness_centrality(const Graph&, const bgl_named_params<T, Tag, Base>&, typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >; Param = adj_list_edge_property_map<undirected_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_centrality_t, double> >, edge_weight_t>; Tag = edge_weight_t; Rest = bgl_named_params<adj_list_edge_property_map<undirected_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_centrality_t, double> >, edge_centrality_t>, edge_centrality_t, bgl_named_params<vec_adj_list_vertex_property_map<adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >, adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >*, double, double&, vertex_centrality_t>, vertex_centrality_t, no_property> >; typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits<Graph>::traversal_category = undir_adj_list_traversal_tag]’
558 | detail::graph::brandes_betweenness_centrality_dispatch1< ew >::run(g,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
559 | choose_param(
| ~~~~~~~~~~~~~
560 | get_param(params, vertex_centrality), dummy_property_map()),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
561 | choose_param(get_param(params, edge_centrality), dummy_property_map()),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
562 | choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
563 | get_param(params, edge_weight));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
bbc.cpp:67:33: required from here
67 | brandes_betweenness_centrality(g,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
68 | centrality_map(get(vertex_centrality, g)).
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
69 | edge_centrality_map(get(edge_centrality, g)).
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
70 | weight_map(get(edge_weight, g)));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/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<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >*, std::vector<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >, std::allocator<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > > > > > >]’
20 | ~usage_requirements() { ((Model*)0)->~Model(); }
| ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/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<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >*, std::vector<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >, std::allocator<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > > > > > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map<RAIter, ID, typename std::iterator_traits< <template-parameter-1-1> >::value_type, typename std::iterator_traits< <template-parameter-1-1> >::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = __gnu_cxx::__normal_iterator<std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<undirected_tag, long unsigned int> > >*, std::vector<std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<undirected_tag, long unsigned int> > >, std::allocator<std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<undirected_tag, long unsigned int> > > > > >; ID = vec_adj_list_vertex_id_map<property<vertex_index_t, int, property<vertex_centrality_t, double> >, long unsigned int>; typename std::iterator_traits< <template-parameter-1-1> >::value_type = std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<undirected_tag, long unsigned int> > >; typename std::iterator_traits< <template-parameter-1-1> >::reference = std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<undirected_tag, long unsigned int> > >&]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:469:43: required from ‘void boost::detail::graph::brandes_betweenness_centrality_dispatch2(const Graph&, CentralityMap, EdgeCentralityMap, WeightMap, VertexIndexMap) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >; CentralityMap = boost::vec_adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >, boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_centrality_t>; WeightMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_weight_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>]’
469 | make_iterator_property_map(incoming.begin(), vertex_index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:517:57: required from ‘static void boost::detail::graph::brandes_betweenness_centrality_dispatch1<WeightMap>::run(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap, WeightMap) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >; CentralityMap = boost::vec_adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >, boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>; WeightMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_weight_t>]’
517 | brandes_betweenness_centrality_dispatch2(g, centrality,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~
518 | edge_centrality_map, weight_map, vertex_index);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:558:71: required from ‘void boost::brandes_betweenness_centrality(const Graph&, const bgl_named_params<T, Tag, Base>&, typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >; Param = adj_list_edge_property_map<undirected_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_centrality_t, double> >, edge_weight_t>; Tag = edge_weight_t; Rest = bgl_named_params<adj_list_edge_property_map<undirected_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_centrality_t, double> >, edge_centrality_t>, edge_centrality_t, bgl_named_params<vec_adj_list_vertex_property_map<adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >, adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >*, double, double&, vertex_centrality_t>, vertex_centrality_t, no_property> >; typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits<Graph>::traversal_category = undir_adj_list_traversal_tag]’
558 | detail::graph::brandes_betweenness_centrality_dispatch1< ew >::run(g,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
559 | choose_param(
| ~~~~~~~~~~~~~
560 | get_param(params, vertex_centrality), dummy_property_map()),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
561 | choose_param(get_param(params, edge_centrality), dummy_property_map()),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
562 | choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
563 | get_param(params, edge_weight));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
bbc.cpp:67:33: required from here
67 | brandes_betweenness_centrality(g,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
68 | centrality_map(get(vertex_centrality, g)).
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
69 | edge_centrality_map(get(edge_centrality, g)).
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
70 | weight_map(get(edge_weight, g)));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
In file included from /home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/preprocessor/repetition/enum_binary_params.hpp:15,
from /home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/utility/base_from_member.hpp:15,
from /home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/utility.hpp:15,
from RBGL.hpp:16:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:17: note: in a call to non-static member function ‘boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >*, std::vector<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >, std::allocator<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > > > > > >::~RandomAccessIteratorConcept()’
597 | BOOST_concept(RandomAccessIterator,(TT))
| ^~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/preprocessor/cat.hpp:29:34: note: in definition of macro ‘BOOST_PP_CAT_I’
29 | # define BOOST_PP_CAT_I(a, b) a ## b
| ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/concept_def.hpp:23:12: note: in expansion of macro ‘BOOST_PP_CAT’
23 | struct BOOST_PP_CAT(name,Concept) \
| ^~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3: note: in expansion of macro ‘BOOST_concept’
597 | BOOST_concept(RandomAccessIterator,(TT))
| ^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Assignable<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > > > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:145:5: required from ‘struct boost::Assignable<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > > >’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > > >’
502 | BOOST_concept(InputIterator,(TT))
| ^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:540:3: required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > > >’
540 | BOOST_concept(ForwardIterator,(TT))
| ^~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > > >’
568 | BOOST_concept(BidirectionalIterator,(TT))
| ^~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > > >’
597 | BOOST_concept(RandomAccessIterator,(TT))
| ^~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3: [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_<void (*)(boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > > >)>’
72 | struct requirement_<void(*)(Model)>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map<RAIter, ID, typename std::iterator_traits< <template-parameter-1-1> >::value_type, typename std::iterator_traits< <template-parameter-1-1> >::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = __gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > >; ID = vec_adj_list_vertex_id_map<property<vertex_index_t, int, property<vertex_centrality_t, double> >, long unsigned int>; typename std::iterator_traits< <template-parameter-1-1> >::value_type = double; typename std::iterator_traits< <template-parameter-1-1> >::reference = double&]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:470:43: required from ‘void boost::detail::graph::brandes_betweenness_centrality_dispatch2(const Graph&, CentralityMap, EdgeCentralityMap, WeightMap, VertexIndexMap) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >; CentralityMap = boost::vec_adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >, boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_centrality_t>; WeightMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_weight_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>]’
470 | make_iterator_property_map(distance.begin(), vertex_index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:517:57: required from ‘static void boost::detail::graph::brandes_betweenness_centrality_dispatch1<WeightMap>::run(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap, WeightMap) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >; CentralityMap = boost::vec_adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >, boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>; WeightMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_weight_t>]’
517 | brandes_betweenness_centrality_dispatch2(g, centrality,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~
518 | edge_centrality_map, weight_map, vertex_index);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:558:71: required from ‘void boost::brandes_betweenness_centrality(const Graph&, const bgl_named_params<T, Tag, Base>&, typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >; Param = adj_list_edge_property_map<undirected_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_centrality_t, double> >, edge_weight_t>; Tag = edge_weight_t; Rest = bgl_named_params<adj_list_edge_property_map<undirected_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_centrality_t, double> >, edge_centrality_t>, edge_centrality_t, bgl_named_params<vec_adj_list_vertex_property_map<adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >, adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >*, double, double&, vertex_centrality_t>, vertex_centrality_t, no_property> >; typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits<Graph>::traversal_category = undir_adj_list_traversal_tag]’
558 | detail::graph::brandes_betweenness_centrality_dispatch1< ew >::run(g,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
559 | choose_param(
| ~~~~~~~~~~~~~
560 | get_param(params, vertex_centrality), dummy_property_map()),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
561 | choose_param(get_param(params, edge_centrality), dummy_property_map()),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
562 | choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
563 | get_param(params, edge_weight));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
bbc.cpp:67:33: required from here
67 | brandes_betweenness_centrality(g,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
68 | centrality_map(get(vertex_centrality, g)).
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
69 | edge_centrality_map(get(edge_centrality, g)).
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
70 | weight_map(get(edge_weight, g)));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Assignable<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > > >]’
20 | ~usage_requirements() { ((Model*)0)->~Model(); }
| ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::EqualityComparable<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > > > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > > >’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > > >’
502 | BOOST_concept(InputIterator,(TT))
| ^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:540:3: required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > > >’
540 | BOOST_concept(ForwardIterator,(TT))
| ^~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > > >’
568 | BOOST_concept(BidirectionalIterator,(TT))
| ^~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > > >’
597 | BOOST_concept(RandomAccessIterator,(TT))
| ^~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3: [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_<void (*)(boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > > >)>’
72 | struct requirement_<void(*)(Model)>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map<RAIter, ID, typename std::iterator_traits< <template-parameter-1-1> >::value_type, typename std::iterator_traits< <template-parameter-1-1> >::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = __gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > >; ID = vec_adj_list_vertex_id_map<property<vertex_index_t, int, property<vertex_centrality_t, double> >, long unsigned int>; typename std::iterator_traits< <template-parameter-1-1> >::value_type = double; typename std::iterator_traits< <template-parameter-1-1> >::reference = double&]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:470:43: required from ‘void boost::detail::graph::brandes_betweenness_centrality_dispatch2(const Graph&, CentralityMap, EdgeCentralityMap, WeightMap, VertexIndexMap) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >; CentralityMap = boost::vec_adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >, boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_centrality_t>; WeightMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_weight_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>]’
470 | make_iterator_property_map(distance.begin(), vertex_index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:517:57: required from ‘static void boost::detail::graph::brandes_betweenness_centrality_dispatch1<WeightMap>::run(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap, WeightMap) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >; CentralityMap = boost::vec_adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >, boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>; WeightMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_weight_t>]’
517 | brandes_betweenness_centrality_dispatch2(g, centrality,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~
518 | edge_centrality_map, weight_map, vertex_index);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:558:71: required from ‘void boost::brandes_betweenness_centrality(const Graph&, const bgl_named_params<T, Tag, Base>&, typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >; Param = adj_list_edge_property_map<undirected_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_centrality_t, double> >, edge_weight_t>; Tag = edge_weight_t; Rest = bgl_named_params<adj_list_edge_property_map<undirected_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_centrality_t, double> >, edge_centrality_t>, edge_centrality_t, bgl_named_params<vec_adj_list_vertex_property_map<adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >, adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >*, double, double&, vertex_centrality_t>, vertex_centrality_t, no_property> >; typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits<Graph>::traversal_category = undir_adj_list_traversal_tag]’
558 | detail::graph::brandes_betweenness_centrality_dispatch1< ew >::run(g,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
559 | choose_param(
| ~~~~~~~~~~~~~
560 | get_param(params, vertex_centrality), dummy_property_map()),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
561 | choose_param(get_param(params, edge_centrality), dummy_property_map()),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
562 | choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
563 | get_param(params, edge_weight));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
bbc.cpp:67:33: required from here
67 | brandes_betweenness_centrality(g,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
68 | centrality_map(get(vertex_centrality, g)).
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
69 | edge_centrality_map(get(edge_centrality, g)).
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
70 | weight_map(get(edge_weight, g)));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::EqualityComparable<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > > >]’
20 | ~usage_requirements() { ((Model*)0)->~Model(); }
| ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::InputIterator<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > > > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:512:7: required from ‘struct boost::InputIterator<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > > >’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:540:3: required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > > >’
540 | BOOST_concept(ForwardIterator,(TT))
| ^~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > > >’
568 | BOOST_concept(BidirectionalIterator,(TT))
| ^~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > > >’
597 | BOOST_concept(RandomAccessIterator,(TT))
| ^~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > > >’
597 | BOOST_concept(RandomAccessIterator,(TT))
| ^~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_<void (*)(boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > > >)>’
72 | struct requirement_<void(*)(Model)>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map<RAIter, ID, typename std::iterator_traits< <template-parameter-1-1> >::value_type, typename std::iterator_traits< <template-parameter-1-1> >::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = __gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > >; ID = vec_adj_list_vertex_id_map<property<vertex_index_t, int, property<vertex_centrality_t, double> >, long unsigned int>; typename std::iterator_traits< <template-parameter-1-1> >::value_type = double; typename std::iterator_traits< <template-parameter-1-1> >::reference = double&]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:470:43: required from ‘void boost::detail::graph::brandes_betweenness_centrality_dispatch2(const Graph&, CentralityMap, EdgeCentralityMap, WeightMap, VertexIndexMap) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >; CentralityMap = boost::vec_adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >, boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_centrality_t>; WeightMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_weight_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>]’
470 | make_iterator_property_map(distance.begin(), vertex_index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:517:57: required from ‘static void boost::detail::graph::brandes_betweenness_centrality_dispatch1<WeightMap>::run(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap, WeightMap) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >; CentralityMap = boost::vec_adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >, boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>; WeightMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_weight_t>]’
517 | brandes_betweenness_centrality_dispatch2(g, centrality,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~
518 | edge_centrality_map, weight_map, vertex_index);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:558:71: required from ‘void boost::brandes_betweenness_centrality(const Graph&, const bgl_named_params<T, Tag, Base>&, typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >; Param = adj_list_edge_property_map<undirected_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_centrality_t, double> >, edge_weight_t>; Tag = edge_weight_t; Rest = bgl_named_params<adj_list_edge_property_map<undirected_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_centrality_t, double> >, edge_centrality_t>, edge_centrality_t, bgl_named_params<vec_adj_list_vertex_property_map<adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >, adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >*, double, double&, vertex_centrality_t>, vertex_centrality_t, no_property> >; typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits<Graph>::traversal_category = undir_adj_list_traversal_tag]’
558 | detail::graph::brandes_betweenness_centrality_dispatch1< ew >::run(g,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
559 | choose_param(
| ~~~~~~~~~~~~~
560 | get_param(params, vertex_centrality), dummy_property_map()),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
561 | choose_param(get_param(params, edge_centrality), dummy_property_map()),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
562 | choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
563 | get_param(params, edge_weight));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
bbc.cpp:67:33: required from here
67 | brandes_betweenness_centrality(g,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
68 | centrality_map(get(vertex_centrality, g)).
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
69 | edge_centrality_map(get(edge_centrality, g)).
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
70 | weight_map(get(edge_weight, g)));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::InputIterator<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > > >]’
20 | ~usage_requirements() { ((Model*)0)->~Model(); }
| ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::ForwardIterator<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > > > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:543:7: required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > > >’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > > >’
568 | BOOST_concept(BidirectionalIterator,(TT))
| ^~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > > >’
597 | BOOST_concept(RandomAccessIterator,(TT))
| ^~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > > >’
597 | BOOST_concept(RandomAccessIterator,(TT))
| ^~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > > >]’
32 | inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
| ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_<void (*)(boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > > >)>’
72 | struct requirement_<void(*)(Model)>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map<RAIter, ID, typename std::iterator_traits< <template-parameter-1-1> >::value_type, typename std::iterator_traits< <template-parameter-1-1> >::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = __gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > >; ID = vec_adj_list_vertex_id_map<property<vertex_index_t, int, property<vertex_centrality_t, double> >, long unsigned int>; typename std::iterator_traits< <template-parameter-1-1> >::value_type = double; typename std::iterator_traits< <template-parameter-1-1> >::reference = double&]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:470:43: required from ‘void boost::detail::graph::brandes_betweenness_centrality_dispatch2(const Graph&, CentralityMap, EdgeCentralityMap, WeightMap, VertexIndexMap) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >; CentralityMap = boost::vec_adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >, boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_centrality_t>; WeightMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_weight_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>]’
470 | make_iterator_property_map(distance.begin(), vertex_index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:517:57: required from ‘static void boost::detail::graph::brandes_betweenness_centrality_dispatch1<WeightMap>::run(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap, WeightMap) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >; CentralityMap = boost::vec_adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >, boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>; WeightMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_weight_t>]’
517 | brandes_betweenness_centrality_dispatch2(g, centrality,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~
518 | edge_centrality_map, weight_map, vertex_index);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:558:71: required from ‘void boost::brandes_betweenness_centrality(const Graph&, const bgl_named_params<T, Tag, Base>&, typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >; Param = adj_list_edge_property_map<undirected_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_centrality_t, double> >, edge_weight_t>; Tag = edge_weight_t; Rest = bgl_named_params<adj_list_edge_property_map<undirected_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_centrality_t, double> >, edge_centrality_t>, edge_centrality_t, bgl_named_params<vec_adj_list_vertex_property_map<adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >, adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >*, double, double&, vertex_centrality_t>, vertex_centrality_t, no_property> >; typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits<Graph>::traversal_category = undir_adj_list_traversal_tag]’
558 | detail::graph::brandes_betweenness_centrality_dispatch1< ew >::run(g,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
559 | choose_param(
| ~~~~~~~~~~~~~
560 | get_param(params, vertex_centrality), dummy_property_map()),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
561 | choose_param(get_param(params, edge_centrality), dummy_property_map()),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
562 | choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
563 | get_param(params, edge_weight));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
bbc.cpp:67:33: required from here
67 | brandes_betweenness_centrality(g,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
68 | centrality_map(get(vertex_centrality, g)).
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
69 | edge_centrality_map(get(edge_centrality, g)).
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
70 | weight_map(get(edge_weight, g)));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::ForwardIterator<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > > >]’
20 | ~usage_requirements() { ((Model*)0)->~Model(); }
| ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::BidirectionalIterator<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > > > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:571:7: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > > >’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > > >’
597 | BOOST_concept(RandomAccessIterator,(TT))
| ^~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > > >’
597 | BOOST_concept(RandomAccessIterator,(TT))
| ^~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > > >]’
32 | inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
| ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_<void (*)(boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > > >)>’
72 | struct requirement_<void(*)(Model)>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map<RAIter, ID, typename std::iterator_traits< <template-parameter-1-1> >::value_type, typename std::iterator_traits< <template-parameter-1-1> >::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = __gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > >; ID = vec_adj_list_vertex_id_map<property<vertex_index_t, int, property<vertex_centrality_t, double> >, long unsigned int>; typename std::iterator_traits< <template-parameter-1-1> >::value_type = double; typename std::iterator_traits< <template-parameter-1-1> >::reference = double&]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:470:43: required from ‘void boost::detail::graph::brandes_betweenness_centrality_dispatch2(const Graph&, CentralityMap, EdgeCentralityMap, WeightMap, VertexIndexMap) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >; CentralityMap = boost::vec_adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >, boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_centrality_t>; WeightMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_weight_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>]’
470 | make_iterator_property_map(distance.begin(), vertex_index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:517:57: required from ‘static void boost::detail::graph::brandes_betweenness_centrality_dispatch1<WeightMap>::run(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap, WeightMap) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >; CentralityMap = boost::vec_adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >, boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>; WeightMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_weight_t>]’
517 | brandes_betweenness_centrality_dispatch2(g, centrality,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~
518 | edge_centrality_map, weight_map, vertex_index);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:558:71: required from ‘void boost::brandes_betweenness_centrality(const Graph&, const bgl_named_params<T, Tag, Base>&, typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >; Param = adj_list_edge_property_map<undirected_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_centrality_t, double> >, edge_weight_t>; Tag = edge_weight_t; Rest = bgl_named_params<adj_list_edge_property_map<undirected_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_centrality_t, double> >, edge_centrality_t>, edge_centrality_t, bgl_named_params<vec_adj_list_vertex_property_map<adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >, adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >*, double, double&, vertex_centrality_t>, vertex_centrality_t, no_property> >; typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits<Graph>::traversal_category = undir_adj_list_traversal_tag]’
558 | detail::graph::brandes_betweenness_centrality_dispatch1< ew >::run(g,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
559 | choose_param(
| ~~~~~~~~~~~~~
560 | get_param(params, vertex_centrality), dummy_property_map()),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
561 | choose_param(get_param(params, edge_centrality), dummy_property_map()),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
562 | choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
563 | get_param(params, edge_weight));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
bbc.cpp:67:33: required from here
67 | brandes_betweenness_centrality(g,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
68 | centrality_map(get(vertex_centrality, g)).
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
69 | edge_centrality_map(get(edge_centrality, g)).
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
70 | weight_map(get(edge_weight, g)));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::BidirectionalIterator<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > > >]’
20 | ~usage_requirements() { ((Model*)0)->~Model(); }
| ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Comparable<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > > > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:253:5: required from ‘struct boost::Comparable<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > > >’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > > >’
597 | BOOST_concept(RandomAccessIterator,(TT))
| ^~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > > >’
597 | BOOST_concept(RandomAccessIterator,(TT))
| ^~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > > >]’
32 | inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
| ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_<void (*)(boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > > >)>’
72 | struct requirement_<void(*)(Model)>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map<RAIter, ID, typename std::iterator_traits< <template-parameter-1-1> >::value_type, typename std::iterator_traits< <template-parameter-1-1> >::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = __gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > >; ID = vec_adj_list_vertex_id_map<property<vertex_index_t, int, property<vertex_centrality_t, double> >, long unsigned int>; typename std::iterator_traits< <template-parameter-1-1> >::value_type = double; typename std::iterator_traits< <template-parameter-1-1> >::reference = double&]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:470:43: required from ‘void boost::detail::graph::brandes_betweenness_centrality_dispatch2(const Graph&, CentralityMap, EdgeCentralityMap, WeightMap, VertexIndexMap) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >; CentralityMap = boost::vec_adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >, boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_centrality_t>; WeightMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_weight_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>]’
470 | make_iterator_property_map(distance.begin(), vertex_index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:517:57: required from ‘static void boost::detail::graph::brandes_betweenness_centrality_dispatch1<WeightMap>::run(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap, WeightMap) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >; CentralityMap = boost::vec_adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >, boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>; WeightMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_weight_t>]’
517 | brandes_betweenness_centrality_dispatch2(g, centrality,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~
518 | edge_centrality_map, weight_map, vertex_index);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:558:71: required from ‘void boost::brandes_betweenness_centrality(const Graph&, const bgl_named_params<T, Tag, Base>&, typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >; Param = adj_list_edge_property_map<undirected_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_centrality_t, double> >, edge_weight_t>; Tag = edge_weight_t; Rest = bgl_named_params<adj_list_edge_property_map<undirected_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_centrality_t, double> >, edge_centrality_t>, edge_centrality_t, bgl_named_params<vec_adj_list_vertex_property_map<adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >, adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >*, double, double&, vertex_centrality_t>, vertex_centrality_t, no_property> >; typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits<Graph>::traversal_category = undir_adj_list_traversal_tag]’
558 | detail::graph::brandes_betweenness_centrality_dispatch1< ew >::run(g,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
559 | choose_param(
| ~~~~~~~~~~~~~
560 | get_param(params, vertex_centrality), dummy_property_map()),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
561 | choose_param(get_param(params, edge_centrality), dummy_property_map()),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
562 | choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
563 | get_param(params, edge_weight));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
bbc.cpp:67:33: required from here
67 | brandes_betweenness_centrality(g,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
68 | centrality_map(get(vertex_centrality, g)).
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
69 | edge_centrality_map(get(edge_centrality, g)).
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
70 | weight_map(get(edge_weight, g)));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Comparable<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > > >]’
20 | ~usage_requirements() { ((Model*)0)->~Model(); }
| ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::RandomAccessIterator<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > > > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:601:7: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > > >’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > > >’
597 | BOOST_concept(RandomAccessIterator,(TT))
| ^~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > > >]’
32 | inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
| ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied<boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > > > >::value’
44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied<boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > > > >’
45 | typedef boost::integral_constant<bool, value> type;
| ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_<void (*)(boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > > >)>’
72 | struct requirement_<void(*)(Model)>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map<RAIter, ID, typename std::iterator_traits< <template-parameter-1-1> >::value_type, typename std::iterator_traits< <template-parameter-1-1> >::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = __gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > >; ID = vec_adj_list_vertex_id_map<property<vertex_index_t, int, property<vertex_centrality_t, double> >, long unsigned int>; typename std::iterator_traits< <template-parameter-1-1> >::value_type = double; typename std::iterator_traits< <template-parameter-1-1> >::reference = double&]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:470:43: required from ‘void boost::detail::graph::brandes_betweenness_centrality_dispatch2(const Graph&, CentralityMap, EdgeCentralityMap, WeightMap, VertexIndexMap) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >; CentralityMap = boost::vec_adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >, boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_centrality_t>; WeightMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_weight_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>]’
470 | make_iterator_property_map(distance.begin(), vertex_index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:517:57: required from ‘static void boost::detail::graph::brandes_betweenness_centrality_dispatch1<WeightMap>::run(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap, WeightMap) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >; CentralityMap = boost::vec_adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >, boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>; WeightMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_weight_t>]’
517 | brandes_betweenness_centrality_dispatch2(g, centrality,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~
518 | edge_centrality_map, weight_map, vertex_index);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:558:71: required from ‘void boost::brandes_betweenness_centrality(const Graph&, const bgl_named_params<T, Tag, Base>&, typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >; Param = adj_list_edge_property_map<undirected_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_centrality_t, double> >, edge_weight_t>; Tag = edge_weight_t; Rest = bgl_named_params<adj_list_edge_property_map<undirected_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_centrality_t, double> >, edge_centrality_t>, edge_centrality_t, bgl_named_params<vec_adj_list_vertex_property_map<adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >, adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >*, double, double&, vertex_centrality_t>, vertex_centrality_t, no_property> >; typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits<Graph>::traversal_category = undir_adj_list_traversal_tag]’
558 | detail::graph::brandes_betweenness_centrality_dispatch1< ew >::run(g,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
559 | choose_param(
| ~~~~~~~~~~~~~
560 | get_param(params, vertex_centrality), dummy_property_map()),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
561 | choose_param(get_param(params, edge_centrality), dummy_property_map()),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
562 | choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
563 | get_param(params, edge_weight));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
bbc.cpp:67:33: required from here
67 | brandes_betweenness_centrality(g,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
68 | centrality_map(get(vertex_centrality, g)).
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
69 | edge_centrality_map(get(edge_centrality, g)).
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
70 | weight_map(get(edge_weight, g)));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::RandomAccessIterator<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > > >]’
20 | ~usage_requirements() { ((Model*)0)->~Model(); }
| ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map<RAIter, ID, typename std::iterator_traits< <template-parameter-1-1> >::value_type, typename std::iterator_traits< <template-parameter-1-1> >::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = __gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > >; ID = vec_adj_list_vertex_id_map<property<vertex_index_t, int, property<vertex_centrality_t, double> >, long unsigned int>; typename std::iterator_traits< <template-parameter-1-1> >::value_type = double; typename std::iterator_traits< <template-parameter-1-1> >::reference = double&]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:470:43: required from ‘void boost::detail::graph::brandes_betweenness_centrality_dispatch2(const Graph&, CentralityMap, EdgeCentralityMap, WeightMap, VertexIndexMap) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >; CentralityMap = boost::vec_adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >, boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_centrality_t>; WeightMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_weight_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>]’
470 | make_iterator_property_map(distance.begin(), vertex_index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:517:57: required from ‘static void boost::detail::graph::brandes_betweenness_centrality_dispatch1<WeightMap>::run(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap, WeightMap) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >; CentralityMap = boost::vec_adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >, boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>; WeightMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_weight_t>]’
517 | brandes_betweenness_centrality_dispatch2(g, centrality,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~
518 | edge_centrality_map, weight_map, vertex_index);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:558:71: required from ‘void boost::brandes_betweenness_centrality(const Graph&, const bgl_named_params<T, Tag, Base>&, typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >; Param = adj_list_edge_property_map<undirected_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_centrality_t, double> >, edge_weight_t>; Tag = edge_weight_t; Rest = bgl_named_params<adj_list_edge_property_map<undirected_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_centrality_t, double> >, edge_centrality_t>, edge_centrality_t, bgl_named_params<vec_adj_list_vertex_property_map<adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >, adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >*, double, double&, vertex_centrality_t>, vertex_centrality_t, no_property> >; typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits<Graph>::traversal_category = undir_adj_list_traversal_tag]’
558 | detail::graph::brandes_betweenness_centrality_dispatch1< ew >::run(g,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
559 | choose_param(
| ~~~~~~~~~~~~~
560 | get_param(params, vertex_centrality), dummy_property_map()),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
561 | choose_param(get_param(params, edge_centrality), dummy_property_map()),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
562 | choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
563 | get_param(params, edge_weight));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
bbc.cpp:67:33: required from here
67 | brandes_betweenness_centrality(g,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
68 | centrality_map(get(vertex_centrality, g)).
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
69 | edge_centrality_map(get(edge_centrality, g)).
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
70 | weight_map(get(edge_weight, g)));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:17: note: in a call to non-static member function ‘boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > > >::~RandomAccessIteratorConcept()’
597 | BOOST_concept(RandomAccessIterator,(TT))
| ^~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/preprocessor/cat.hpp:29:34: note: in definition of macro ‘BOOST_PP_CAT_I’
29 | # define BOOST_PP_CAT_I(a, b) a ## b
| ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/concept_def.hpp:23:12: note: in expansion of macro ‘BOOST_PP_CAT’
23 | struct BOOST_PP_CAT(name,Concept) \
| ^~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3: note: in expansion of macro ‘BOOST_concept’
597 | BOOST_concept(RandomAccessIterator,(TT))
| ^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Assignable<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > > > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:145:5: required from ‘struct boost::Assignable<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > > >’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > > >’
502 | BOOST_concept(InputIterator,(TT))
| ^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:540:3: required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > > >’
540 | BOOST_concept(ForwardIterator,(TT))
| ^~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > > >’
568 | BOOST_concept(BidirectionalIterator,(TT))
| ^~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > > >’
597 | BOOST_concept(RandomAccessIterator,(TT))
| ^~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3: [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_<void (*)(boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > > >)>’
72 | struct requirement_<void(*)(Model)>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map<RAIter, ID, typename std::iterator_traits< <template-parameter-1-1> >::value_type, typename std::iterator_traits< <template-parameter-1-1> >::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = __gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > >; ID = vec_adj_list_vertex_id_map<property<vertex_index_t, int, property<vertex_centrality_t, double> >, long unsigned int>; typename std::iterator_traits< <template-parameter-1-1> >::value_type = long unsigned int; typename std::iterator_traits< <template-parameter-1-1> >::reference = long unsigned int&]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:472:43: required from ‘void boost::detail::graph::brandes_betweenness_centrality_dispatch2(const Graph&, CentralityMap, EdgeCentralityMap, WeightMap, VertexIndexMap) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >; CentralityMap = boost::vec_adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >, boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_centrality_t>; WeightMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_weight_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>]’
472 | make_iterator_property_map(path_count.begin(), vertex_index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:517:57: required from ‘static void boost::detail::graph::brandes_betweenness_centrality_dispatch1<WeightMap>::run(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap, WeightMap) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >; CentralityMap = boost::vec_adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >, boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>; WeightMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_weight_t>]’
517 | brandes_betweenness_centrality_dispatch2(g, centrality,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~
518 | edge_centrality_map, weight_map, vertex_index);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:558:71: required from ‘void boost::brandes_betweenness_centrality(const Graph&, const bgl_named_params<T, Tag, Base>&, typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >; Param = adj_list_edge_property_map<undirected_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_centrality_t, double> >, edge_weight_t>; Tag = edge_weight_t; Rest = bgl_named_params<adj_list_edge_property_map<undirected_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_centrality_t, double> >, edge_centrality_t>, edge_centrality_t, bgl_named_params<vec_adj_list_vertex_property_map<adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >, adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >*, double, double&, vertex_centrality_t>, vertex_centrality_t, no_property> >; typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits<Graph>::traversal_category = undir_adj_list_traversal_tag]’
558 | detail::graph::brandes_betweenness_centrality_dispatch1< ew >::run(g,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
559 | choose_param(
| ~~~~~~~~~~~~~
560 | get_param(params, vertex_centrality), dummy_property_map()),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
561 | choose_param(get_param(params, edge_centrality), dummy_property_map()),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
562 | choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
563 | get_param(params, edge_weight));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
bbc.cpp:67:33: required from here
67 | brandes_betweenness_centrality(g,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
68 | centrality_map(get(vertex_centrality, g)).
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
69 | edge_centrality_map(get(edge_centrality, g)).
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
70 | weight_map(get(edge_weight, g)));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Assignable<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > > >]’
20 | ~usage_requirements() { ((Model*)0)->~Model(); }
| ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::EqualityComparable<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > > > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > > >’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > > >’
502 | BOOST_concept(InputIterator,(TT))
| ^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:540:3: required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > > >’
540 | BOOST_concept(ForwardIterator,(TT))
| ^~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > > >’
568 | BOOST_concept(BidirectionalIterator,(TT))
| ^~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > > >’
597 | BOOST_concept(RandomAccessIterator,(TT))
| ^~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3: [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_<void (*)(boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > > >)>’
72 | struct requirement_<void(*)(Model)>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map<RAIter, ID, typename std::iterator_traits< <template-parameter-1-1> >::value_type, typename std::iterator_traits< <template-parameter-1-1> >::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = __gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > >; ID = vec_adj_list_vertex_id_map<property<vertex_index_t, int, property<vertex_centrality_t, double> >, long unsigned int>; typename std::iterator_traits< <template-parameter-1-1> >::value_type = long unsigned int; typename std::iterator_traits< <template-parameter-1-1> >::reference = long unsigned int&]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:472:43: required from ‘void boost::detail::graph::brandes_betweenness_centrality_dispatch2(const Graph&, CentralityMap, EdgeCentralityMap, WeightMap, VertexIndexMap) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >; CentralityMap = boost::vec_adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >, boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_centrality_t>; WeightMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_weight_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>]’
472 | make_iterator_property_map(path_count.begin(), vertex_index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:517:57: required from ‘static void boost::detail::graph::brandes_betweenness_centrality_dispatch1<WeightMap>::run(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap, WeightMap) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >; CentralityMap = boost::vec_adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >, boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>; WeightMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_weight_t>]’
517 | brandes_betweenness_centrality_dispatch2(g, centrality,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~
518 | edge_centrality_map, weight_map, vertex_index);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:558:71: required from ‘void boost::brandes_betweenness_centrality(const Graph&, const bgl_named_params<T, Tag, Base>&, typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >; Param = adj_list_edge_property_map<undirected_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_centrality_t, double> >, edge_weight_t>; Tag = edge_weight_t; Rest = bgl_named_params<adj_list_edge_property_map<undirected_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_centrality_t, double> >, edge_centrality_t>, edge_centrality_t, bgl_named_params<vec_adj_list_vertex_property_map<adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >, adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >*, double, double&, vertex_centrality_t>, vertex_centrality_t, no_property> >; typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits<Graph>::traversal_category = undir_adj_list_traversal_tag]’
558 | detail::graph::brandes_betweenness_centrality_dispatch1< ew >::run(g,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
559 | choose_param(
| ~~~~~~~~~~~~~
560 | get_param(params, vertex_centrality), dummy_property_map()),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
561 | choose_param(get_param(params, edge_centrality), dummy_property_map()),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
562 | choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
563 | get_param(params, edge_weight));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
bbc.cpp:67:33: required from here
67 | brandes_betweenness_centrality(g,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
68 | centrality_map(get(vertex_centrality, g)).
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
69 | edge_centrality_map(get(edge_centrality, g)).
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
70 | weight_map(get(edge_weight, g)));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::EqualityComparable<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > > >]’
20 | ~usage_requirements() { ((Model*)0)->~Model(); }
| ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::InputIterator<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > > > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:512:7: required from ‘struct boost::InputIterator<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > > >’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:540:3: required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > > >’
540 | BOOST_concept(ForwardIterator,(TT))
| ^~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > > >’
568 | BOOST_concept(BidirectionalIterator,(TT))
| ^~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > > >’
597 | BOOST_concept(RandomAccessIterator,(TT))
| ^~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > > >’
597 | BOOST_concept(RandomAccessIterator,(TT))
| ^~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_<void (*)(boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > > >)>’
72 | struct requirement_<void(*)(Model)>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map<RAIter, ID, typename std::iterator_traits< <template-parameter-1-1> >::value_type, typename std::iterator_traits< <template-parameter-1-1> >::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = __gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > >; ID = vec_adj_list_vertex_id_map<property<vertex_index_t, int, property<vertex_centrality_t, double> >, long unsigned int>; typename std::iterator_traits< <template-parameter-1-1> >::value_type = long unsigned int; typename std::iterator_traits< <template-parameter-1-1> >::reference = long unsigned int&]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:472:43: required from ‘void boost::detail::graph::brandes_betweenness_centrality_dispatch2(const Graph&, CentralityMap, EdgeCentralityMap, WeightMap, VertexIndexMap) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >; CentralityMap = boost::vec_adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >, boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_centrality_t>; WeightMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_weight_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>]’
472 | make_iterator_property_map(path_count.begin(), vertex_index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:517:57: required from ‘static void boost::detail::graph::brandes_betweenness_centrality_dispatch1<WeightMap>::run(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap, WeightMap) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >; CentralityMap = boost::vec_adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >, boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>; WeightMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_weight_t>]’
517 | brandes_betweenness_centrality_dispatch2(g, centrality,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~
518 | edge_centrality_map, weight_map, vertex_index);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:558:71: required from ‘void boost::brandes_betweenness_centrality(const Graph&, const bgl_named_params<T, Tag, Base>&, typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >; Param = adj_list_edge_property_map<undirected_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_centrality_t, double> >, edge_weight_t>; Tag = edge_weight_t; Rest = bgl_named_params<adj_list_edge_property_map<undirected_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_centrality_t, double> >, edge_centrality_t>, edge_centrality_t, bgl_named_params<vec_adj_list_vertex_property_map<adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >, adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >*, double, double&, vertex_centrality_t>, vertex_centrality_t, no_property> >; typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits<Graph>::traversal_category = undir_adj_list_traversal_tag]’
558 | detail::graph::brandes_betweenness_centrality_dispatch1< ew >::run(g,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
559 | choose_param(
| ~~~~~~~~~~~~~
560 | get_param(params, vertex_centrality), dummy_property_map()),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
561 | choose_param(get_param(params, edge_centrality), dummy_property_map()),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
562 | choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
563 | get_param(params, edge_weight));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
bbc.cpp:67:33: required from here
67 | brandes_betweenness_centrality(g,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
68 | centrality_map(get(vertex_centrality, g)).
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
69 | edge_centrality_map(get(edge_centrality, g)).
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
70 | weight_map(get(edge_weight, g)));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::InputIterator<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > > >]’
20 | ~usage_requirements() { ((Model*)0)->~Model(); }
| ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::ForwardIterator<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > > > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:543:7: required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > > >’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > > >’
568 | BOOST_concept(BidirectionalIterator,(TT))
| ^~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > > >’
597 | BOOST_concept(RandomAccessIterator,(TT))
| ^~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > > >’
597 | BOOST_concept(RandomAccessIterator,(TT))
| ^~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > > >]’
32 | inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
| ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_<void (*)(boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > > >)>’
72 | struct requirement_<void(*)(Model)>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map<RAIter, ID, typename std::iterator_traits< <template-parameter-1-1> >::value_type, typename std::iterator_traits< <template-parameter-1-1> >::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = __gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > >; ID = vec_adj_list_vertex_id_map<property<vertex_index_t, int, property<vertex_centrality_t, double> >, long unsigned int>; typename std::iterator_traits< <template-parameter-1-1> >::value_type = long unsigned int; typename std::iterator_traits< <template-parameter-1-1> >::reference = long unsigned int&]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:472:43: required from ‘void boost::detail::graph::brandes_betweenness_centrality_dispatch2(const Graph&, CentralityMap, EdgeCentralityMap, WeightMap, VertexIndexMap) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >; CentralityMap = boost::vec_adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >, boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_centrality_t>; WeightMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_weight_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>]’
472 | make_iterator_property_map(path_count.begin(), vertex_index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:517:57: required from ‘static void boost::detail::graph::brandes_betweenness_centrality_dispatch1<WeightMap>::run(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap, WeightMap) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >; CentralityMap = boost::vec_adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >, boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>; WeightMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_weight_t>]’
517 | brandes_betweenness_centrality_dispatch2(g, centrality,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~
518 | edge_centrality_map, weight_map, vertex_index);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:558:71: required from ‘void boost::brandes_betweenness_centrality(const Graph&, const bgl_named_params<T, Tag, Base>&, typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >; Param = adj_list_edge_property_map<undirected_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_centrality_t, double> >, edge_weight_t>; Tag = edge_weight_t; Rest = bgl_named_params<adj_list_edge_property_map<undirected_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_centrality_t, double> >, edge_centrality_t>, edge_centrality_t, bgl_named_params<vec_adj_list_vertex_property_map<adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >, adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >*, double, double&, vertex_centrality_t>, vertex_centrality_t, no_property> >; typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits<Graph>::traversal_category = undir_adj_list_traversal_tag]’
558 | detail::graph::brandes_betweenness_centrality_dispatch1< ew >::run(g,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
559 | choose_param(
| ~~~~~~~~~~~~~
560 | get_param(params, vertex_centrality), dummy_property_map()),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
561 | choose_param(get_param(params, edge_centrality), dummy_property_map()),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
562 | choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
563 | get_param(params, edge_weight));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
bbc.cpp:67:33: required from here
67 | brandes_betweenness_centrality(g,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
68 | centrality_map(get(vertex_centrality, g)).
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
69 | edge_centrality_map(get(edge_centrality, g)).
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
70 | weight_map(get(edge_weight, g)));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::ForwardIterator<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > > >]’
20 | ~usage_requirements() { ((Model*)0)->~Model(); }
| ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::BidirectionalIterator<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > > > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:571:7: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > > >’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > > >’
597 | BOOST_concept(RandomAccessIterator,(TT))
| ^~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > > >’
597 | BOOST_concept(RandomAccessIterator,(TT))
| ^~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > > >]’
32 | inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
| ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_<void (*)(boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > > >)>’
72 | struct requirement_<void(*)(Model)>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map<RAIter, ID, typename std::iterator_traits< <template-parameter-1-1> >::value_type, typename std::iterator_traits< <template-parameter-1-1> >::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = __gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > >; ID = vec_adj_list_vertex_id_map<property<vertex_index_t, int, property<vertex_centrality_t, double> >, long unsigned int>; typename std::iterator_traits< <template-parameter-1-1> >::value_type = long unsigned int; typename std::iterator_traits< <template-parameter-1-1> >::reference = long unsigned int&]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:472:43: required from ‘void boost::detail::graph::brandes_betweenness_centrality_dispatch2(const Graph&, CentralityMap, EdgeCentralityMap, WeightMap, VertexIndexMap) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >; CentralityMap = boost::vec_adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >, boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_centrality_t>; WeightMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_weight_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>]’
472 | make_iterator_property_map(path_count.begin(), vertex_index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:517:57: required from ‘static void boost::detail::graph::brandes_betweenness_centrality_dispatch1<WeightMap>::run(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap, WeightMap) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >; CentralityMap = boost::vec_adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >, boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>; WeightMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_weight_t>]’
517 | brandes_betweenness_centrality_dispatch2(g, centrality,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~
518 | edge_centrality_map, weight_map, vertex_index);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:558:71: required from ‘void boost::brandes_betweenness_centrality(const Graph&, const bgl_named_params<T, Tag, Base>&, typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >; Param = adj_list_edge_property_map<undirected_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_centrality_t, double> >, edge_weight_t>; Tag = edge_weight_t; Rest = bgl_named_params<adj_list_edge_property_map<undirected_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_centrality_t, double> >, edge_centrality_t>, edge_centrality_t, bgl_named_params<vec_adj_list_vertex_property_map<adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >, adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >*, double, double&, vertex_centrality_t>, vertex_centrality_t, no_property> >; typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits<Graph>::traversal_category = undir_adj_list_traversal_tag]’
558 | detail::graph::brandes_betweenness_centrality_dispatch1< ew >::run(g,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
559 | choose_param(
| ~~~~~~~~~~~~~
560 | get_param(params, vertex_centrality), dummy_property_map()),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
561 | choose_param(get_param(params, edge_centrality), dummy_property_map()),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
562 | choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
563 | get_param(params, edge_weight));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
bbc.cpp:67:33: required from here
67 | brandes_betweenness_centrality(g,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
68 | centrality_map(get(vertex_centrality, g)).
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
69 | edge_centrality_map(get(edge_centrality, g)).
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
70 | weight_map(get(edge_weight, g)));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::BidirectionalIterator<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > > >]’
20 | ~usage_requirements() { ((Model*)0)->~Model(); }
| ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Comparable<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > > > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:253:5: required from ‘struct boost::Comparable<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > > >’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > > >’
597 | BOOST_concept(RandomAccessIterator,(TT))
| ^~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > > >’
597 | BOOST_concept(RandomAccessIterator,(TT))
| ^~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > > >]’
32 | inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
| ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_<void (*)(boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > > >)>’
72 | struct requirement_<void(*)(Model)>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map<RAIter, ID, typename std::iterator_traits< <template-parameter-1-1> >::value_type, typename std::iterator_traits< <template-parameter-1-1> >::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = __gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > >; ID = vec_adj_list_vertex_id_map<property<vertex_index_t, int, property<vertex_centrality_t, double> >, long unsigned int>; typename std::iterator_traits< <template-parameter-1-1> >::value_type = long unsigned int; typename std::iterator_traits< <template-parameter-1-1> >::reference = long unsigned int&]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:472:43: required from ‘void boost::detail::graph::brandes_betweenness_centrality_dispatch2(const Graph&, CentralityMap, EdgeCentralityMap, WeightMap, VertexIndexMap) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >; CentralityMap = boost::vec_adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >, boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_centrality_t>; WeightMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_weight_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>]’
472 | make_iterator_property_map(path_count.begin(), vertex_index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:517:57: required from ‘static void boost::detail::graph::brandes_betweenness_centrality_dispatch1<WeightMap>::run(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap, WeightMap) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >; CentralityMap = boost::vec_adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >, boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>; WeightMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_weight_t>]’
517 | brandes_betweenness_centrality_dispatch2(g, centrality,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~
518 | edge_centrality_map, weight_map, vertex_index);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:558:71: required from ‘void boost::brandes_betweenness_centrality(const Graph&, const bgl_named_params<T, Tag, Base>&, typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >; Param = adj_list_edge_property_map<undirected_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_centrality_t, double> >, edge_weight_t>; Tag = edge_weight_t; Rest = bgl_named_params<adj_list_edge_property_map<undirected_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_centrality_t, double> >, edge_centrality_t>, edge_centrality_t, bgl_named_params<vec_adj_list_vertex_property_map<adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >, adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >*, double, double&, vertex_centrality_t>, vertex_centrality_t, no_property> >; typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits<Graph>::traversal_category = undir_adj_list_traversal_tag]’
558 | detail::graph::brandes_betweenness_centrality_dispatch1< ew >::run(g,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
559 | choose_param(
| ~~~~~~~~~~~~~
560 | get_param(params, vertex_centrality), dummy_property_map()),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
561 | choose_param(get_param(params, edge_centrality), dummy_property_map()),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
562 | choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
563 | get_param(params, edge_weight));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
bbc.cpp:67:33: required from here
67 | brandes_betweenness_centrality(g,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
68 | centrality_map(get(vertex_centrality, g)).
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
69 | edge_centrality_map(get(edge_centrality, g)).
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
70 | weight_map(get(edge_weight, g)));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Comparable<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > > >]’
20 | ~usage_requirements() { ((Model*)0)->~Model(); }
| ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::RandomAccessIterator<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > > > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:601:7: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > > >’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > > >’
597 | BOOST_concept(RandomAccessIterator,(TT))
| ^~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > > >]’
32 | inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
| ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied<boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > > > >::value’
44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied<boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > > > >’
45 | typedef boost::integral_constant<bool, value> type;
| ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_<void (*)(boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > > >)>’
72 | struct requirement_<void(*)(Model)>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map<RAIter, ID, typename std::iterator_traits< <template-parameter-1-1> >::value_type, typename std::iterator_traits< <template-parameter-1-1> >::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = __gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > >; ID = vec_adj_list_vertex_id_map<property<vertex_index_t, int, property<vertex_centrality_t, double> >, long unsigned int>; typename std::iterator_traits< <template-parameter-1-1> >::value_type = long unsigned int; typename std::iterator_traits< <template-parameter-1-1> >::reference = long unsigned int&]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:472:43: required from ‘void boost::detail::graph::brandes_betweenness_centrality_dispatch2(const Graph&, CentralityMap, EdgeCentralityMap, WeightMap, VertexIndexMap) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >; CentralityMap = boost::vec_adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >, boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_centrality_t>; WeightMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_weight_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>]’
472 | make_iterator_property_map(path_count.begin(), vertex_index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:517:57: required from ‘static void boost::detail::graph::brandes_betweenness_centrality_dispatch1<WeightMap>::run(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap, WeightMap) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >; CentralityMap = boost::vec_adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >, boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>; WeightMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_weight_t>]’
517 | brandes_betweenness_centrality_dispatch2(g, centrality,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~
518 | edge_centrality_map, weight_map, vertex_index);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:558:71: required from ‘void boost::brandes_betweenness_centrality(const Graph&, const bgl_named_params<T, Tag, Base>&, typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >; Param = adj_list_edge_property_map<undirected_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_centrality_t, double> >, edge_weight_t>; Tag = edge_weight_t; Rest = bgl_named_params<adj_list_edge_property_map<undirected_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_centrality_t, double> >, edge_centrality_t>, edge_centrality_t, bgl_named_params<vec_adj_list_vertex_property_map<adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >, adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >*, double, double&, vertex_centrality_t>, vertex_centrality_t, no_property> >; typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits<Graph>::traversal_category = undir_adj_list_traversal_tag]’
558 | detail::graph::brandes_betweenness_centrality_dispatch1< ew >::run(g,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
559 | choose_param(
| ~~~~~~~~~~~~~
560 | get_param(params, vertex_centrality), dummy_property_map()),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
561 | choose_param(get_param(params, edge_centrality), dummy_property_map()),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
562 | choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
563 | get_param(params, edge_weight));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
bbc.cpp:67:33: required from here
67 | brandes_betweenness_centrality(g,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
68 | centrality_map(get(vertex_centrality, g)).
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
69 | edge_centrality_map(get(edge_centrality, g)).
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
70 | weight_map(get(edge_weight, g)));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::RandomAccessIterator<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > > >]’
20 | ~usage_requirements() { ((Model*)0)->~Model(); }
| ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map<RAIter, ID, typename std::iterator_traits< <template-parameter-1-1> >::value_type, typename std::iterator_traits< <template-parameter-1-1> >::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = __gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > >; ID = vec_adj_list_vertex_id_map<property<vertex_index_t, int, property<vertex_centrality_t, double> >, long unsigned int>; typename std::iterator_traits< <template-parameter-1-1> >::value_type = long unsigned int; typename std::iterator_traits< <template-parameter-1-1> >::reference = long unsigned int&]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:472:43: required from ‘void boost::detail::graph::brandes_betweenness_centrality_dispatch2(const Graph&, CentralityMap, EdgeCentralityMap, WeightMap, VertexIndexMap) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >; CentralityMap = boost::vec_adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >, boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_centrality_t>; WeightMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_weight_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>]’
472 | make_iterator_property_map(path_count.begin(), vertex_index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:517:57: required from ‘static void boost::detail::graph::brandes_betweenness_centrality_dispatch1<WeightMap>::run(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap, WeightMap) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >; CentralityMap = boost::vec_adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >, boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>; WeightMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_weight_t>]’
517 | brandes_betweenness_centrality_dispatch2(g, centrality,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~
518 | edge_centrality_map, weight_map, vertex_index);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:558:71: required from ‘void boost::brandes_betweenness_centrality(const Graph&, const bgl_named_params<T, Tag, Base>&, typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >; Param = adj_list_edge_property_map<undirected_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_centrality_t, double> >, edge_weight_t>; Tag = edge_weight_t; Rest = bgl_named_params<adj_list_edge_property_map<undirected_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_centrality_t, double> >, edge_centrality_t>, edge_centrality_t, bgl_named_params<vec_adj_list_vertex_property_map<adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >, adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >*, double, double&, vertex_centrality_t>, vertex_centrality_t, no_property> >; typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits<Graph>::traversal_category = undir_adj_list_traversal_tag]’
558 | detail::graph::brandes_betweenness_centrality_dispatch1< ew >::run(g,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
559 | choose_param(
| ~~~~~~~~~~~~~
560 | get_param(params, vertex_centrality), dummy_property_map()),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
561 | choose_param(get_param(params, edge_centrality), dummy_property_map()),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
562 | choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
563 | get_param(params, edge_weight));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
bbc.cpp:67:33: required from here
67 | brandes_betweenness_centrality(g,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
68 | centrality_map(get(vertex_centrality, g)).
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
69 | edge_centrality_map(get(edge_centrality, g)).
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
70 | weight_map(get(edge_weight, g)));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:17: note: in a call to non-static member function ‘boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > > >::~RandomAccessIteratorConcept()’
597 | BOOST_concept(RandomAccessIterator,(TT))
| ^~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/preprocessor/cat.hpp:29:34: note: in definition of macro ‘BOOST_PP_CAT_I’
29 | # define BOOST_PP_CAT_I(a, b) a ## b
| ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/concept_def.hpp:23:12: note: in expansion of macro ‘BOOST_PP_CAT’
23 | struct BOOST_PP_CAT(name,Concept) \
| ^~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3: note: in expansion of macro ‘BOOST_concept’
597 | BOOST_concept(RandomAccessIterator,(TT))
| ^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Assignable<__gnu_cxx::__normal_iterator<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >*, std::vector<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >, std::allocator<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > > > > > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/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<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >*, std::vector<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >, std::allocator<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > > > > > > >]’
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:145:5: required from ‘struct boost::Assignable<__gnu_cxx::__normal_iterator<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >*, std::vector<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >, std::allocator<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > > > > > >’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator<__gnu_cxx::__normal_iterator<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >*, std::vector<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >, std::allocator<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > > > > > >’
502 | BOOST_concept(InputIterator,(TT))
| ^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:540:3: required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >*, std::vector<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >, std::allocator<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > > > > > >’
540 | BOOST_concept(ForwardIterator,(TT))
| ^~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >*, std::vector<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >, std::allocator<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > > > > > >’
568 | BOOST_concept(BidirectionalIterator,(TT))
| ^~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3: [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_<void (*)(boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >*, std::vector<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >, std::allocator<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > > > > > >)>’
72 | struct requirement_<void(*)(Model)>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map<RAIter, ID, typename std::iterator_traits< <template-parameter-1-1> >::value_type, typename std::iterator_traits< <template-parameter-1-1> >::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = __gnu_cxx::__normal_iterator<std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<undirected_tag, long unsigned int> > >*, std::vector<std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<undirected_tag, long unsigned int> > >, std::allocator<std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<undirected_tag, long unsigned int> > > > > >; ID = vec_adj_list_vertex_id_map<property<vertex_index_t, int, property<vertex_centrality_t, double> >, long unsigned int>; typename std::iterator_traits< <template-parameter-1-1> >::value_type = std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<undirected_tag, long unsigned int> > >; typename std::iterator_traits< <template-parameter-1-1> >::reference = std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<undirected_tag, long unsigned int> > >&]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:469:43: required from ‘void boost::detail::graph::brandes_betweenness_centrality_dispatch2(const Graph&, CentralityMap, EdgeCentralityMap, WeightMap, VertexIndexMap) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >; CentralityMap = boost::vec_adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >, boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_centrality_t>; WeightMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_weight_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>]’
469 | make_iterator_property_map(incoming.begin(), vertex_index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:517:57: required from ‘static void boost::detail::graph::brandes_betweenness_centrality_dispatch1<WeightMap>::run(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap, WeightMap) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >; CentralityMap = boost::vec_adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >, boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>; WeightMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_weight_t>]’
517 | brandes_betweenness_centrality_dispatch2(g, centrality,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~
518 | edge_centrality_map, weight_map, vertex_index);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:558:71: required from ‘void boost::brandes_betweenness_centrality(const Graph&, const bgl_named_params<T, Tag, Base>&, typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >; Param = adj_list_edge_property_map<undirected_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_centrality_t, double> >, edge_weight_t>; Tag = edge_weight_t; Rest = bgl_named_params<adj_list_edge_property_map<undirected_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_centrality_t, double> >, edge_centrality_t>, edge_centrality_t, bgl_named_params<vec_adj_list_vertex_property_map<adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >, adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >*, double, double&, vertex_centrality_t>, vertex_centrality_t, no_property> >; typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits<Graph>::traversal_category = undir_adj_list_traversal_tag]’
558 | detail::graph::brandes_betweenness_centrality_dispatch1< ew >::run(g,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
559 | choose_param(
| ~~~~~~~~~~~~~
560 | get_param(params, vertex_centrality), dummy_property_map()),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
561 | choose_param(get_param(params, edge_centrality), dummy_property_map()),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
562 | choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
563 | get_param(params, edge_weight));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
bbc.cpp:67:33: required from here
67 | brandes_betweenness_centrality(g,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
68 | centrality_map(get(vertex_centrality, g)).
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
69 | edge_centrality_map(get(edge_centrality, g)).
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
70 | weight_map(get(edge_weight, g)));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
20 | ~usage_requirements() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/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<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >*, std::vector<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >, std::allocator<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > > > > >]’
37 | ~model()
| ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:145:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
145 | BOOST_CONCEPT_USAGE(Assignable) {
| ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::EqualityComparable<__gnu_cxx::__normal_iterator<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >*, std::vector<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >, std::allocator<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > > > > > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/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<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >*, std::vector<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >, std::allocator<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > > > > > > >]’
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable<__gnu_cxx::__normal_iterator<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >*, std::vector<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >, std::allocator<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > > > > > >’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator<__gnu_cxx::__normal_iterator<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >*, std::vector<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >, std::allocator<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > > > > > >’
502 | BOOST_concept(InputIterator,(TT))
| ^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:540:3: required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >*, std::vector<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >, std::allocator<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > > > > > >’
540 | BOOST_concept(ForwardIterator,(TT))
| ^~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >*, std::vector<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >, std::allocator<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > > > > > >’
568 | BOOST_concept(BidirectionalIterator,(TT))
| ^~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3: [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_<void (*)(boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >*, std::vector<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >, std::allocator<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > > > > > >)>’
72 | struct requirement_<void(*)(Model)>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map<RAIter, ID, typename std::iterator_traits< <template-parameter-1-1> >::value_type, typename std::iterator_traits< <template-parameter-1-1> >::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = __gnu_cxx::__normal_iterator<std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<undirected_tag, long unsigned int> > >*, std::vector<std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<undirected_tag, long unsigned int> > >, std::allocator<std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<undirected_tag, long unsigned int> > > > > >; ID = vec_adj_list_vertex_id_map<property<vertex_index_t, int, property<vertex_centrality_t, double> >, long unsigned int>; typename std::iterator_traits< <template-parameter-1-1> >::value_type = std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<undirected_tag, long unsigned int> > >; typename std::iterator_traits< <template-parameter-1-1> >::reference = std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<undirected_tag, long unsigned int> > >&]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:469:43: required from ‘void boost::detail::graph::brandes_betweenness_centrality_dispatch2(const Graph&, CentralityMap, EdgeCentralityMap, WeightMap, VertexIndexMap) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >; CentralityMap = boost::vec_adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >, boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_centrality_t>; WeightMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_weight_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>]’
469 | make_iterator_property_map(incoming.begin(), vertex_index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:517:57: required from ‘static void boost::detail::graph::brandes_betweenness_centrality_dispatch1<WeightMap>::run(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap, WeightMap) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >; CentralityMap = boost::vec_adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >, boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>; WeightMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_weight_t>]’
517 | brandes_betweenness_centrality_dispatch2(g, centrality,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~
518 | edge_centrality_map, weight_map, vertex_index);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:558:71: required from ‘void boost::brandes_betweenness_centrality(const Graph&, const bgl_named_params<T, Tag, Base>&, typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >; Param = adj_list_edge_property_map<undirected_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_centrality_t, double> >, edge_weight_t>; Tag = edge_weight_t; Rest = bgl_named_params<adj_list_edge_property_map<undirected_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_centrality_t, double> >, edge_centrality_t>, edge_centrality_t, bgl_named_params<vec_adj_list_vertex_property_map<adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >, adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >*, double, double&, vertex_centrality_t>, vertex_centrality_t, no_property> >; typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits<Graph>::traversal_category = undir_adj_list_traversal_tag]’
558 | detail::graph::brandes_betweenness_centrality_dispatch1< ew >::run(g,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
559 | choose_param(
| ~~~~~~~~~~~~~
560 | get_param(params, vertex_centrality), dummy_property_map()),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
561 | choose_param(get_param(params, edge_centrality), dummy_property_map()),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
562 | choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
563 | get_param(params, edge_weight));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
bbc.cpp:67:33: required from here
67 | brandes_betweenness_centrality(g,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
68 | centrality_map(get(vertex_centrality, g)).
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
69 | edge_centrality_map(get(edge_centrality, g)).
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
70 | weight_map(get(edge_weight, g)));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
20 | ~usage_requirements() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/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<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >*, std::vector<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >, std::allocator<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > > > > >]’
37 | ~model()
| ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:233:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
233 | BOOST_CONCEPT_USAGE(EqualityComparable) {
| ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::InputIterator<__gnu_cxx::__normal_iterator<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >*, std::vector<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >, std::allocator<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > > > > > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/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<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >*, std::vector<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >, std::allocator<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > > > > > > >]’
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:512:7: required from ‘struct boost::InputIterator<__gnu_cxx::__normal_iterator<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >*, std::vector<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >, std::allocator<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > > > > > >’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:540:3: required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >*, std::vector<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >, std::allocator<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > > > > > >’
540 | BOOST_concept(ForwardIterator,(TT))
| ^~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >*, std::vector<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >, std::allocator<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > > > > > >’
568 | BOOST_concept(BidirectionalIterator,(TT))
| ^~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >*, std::vector<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >, std::allocator<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > > > > > >’
597 | BOOST_concept(RandomAccessIterator,(TT))
| ^~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3: [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_<void (*)(boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >*, std::vector<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >, std::allocator<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > > > > > >)>’
72 | struct requirement_<void(*)(Model)>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map<RAIter, ID, typename std::iterator_traits< <template-parameter-1-1> >::value_type, typename std::iterator_traits< <template-parameter-1-1> >::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = __gnu_cxx::__normal_iterator<std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<undirected_tag, long unsigned int> > >*, std::vector<std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<undirected_tag, long unsigned int> > >, std::allocator<std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<undirected_tag, long unsigned int> > > > > >; ID = vec_adj_list_vertex_id_map<property<vertex_index_t, int, property<vertex_centrality_t, double> >, long unsigned int>; typename std::iterator_traits< <template-parameter-1-1> >::value_type = std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<undirected_tag, long unsigned int> > >; typename std::iterator_traits< <template-parameter-1-1> >::reference = std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<undirected_tag, long unsigned int> > >&]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:469:43: required from ‘void boost::detail::graph::brandes_betweenness_centrality_dispatch2(const Graph&, CentralityMap, EdgeCentralityMap, WeightMap, VertexIndexMap) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >; CentralityMap = boost::vec_adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >, boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_centrality_t>; WeightMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_weight_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>]’
469 | make_iterator_property_map(incoming.begin(), vertex_index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:517:57: required from ‘static void boost::detail::graph::brandes_betweenness_centrality_dispatch1<WeightMap>::run(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap, WeightMap) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >; CentralityMap = boost::vec_adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >, boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>; WeightMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_weight_t>]’
517 | brandes_betweenness_centrality_dispatch2(g, centrality,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~
518 | edge_centrality_map, weight_map, vertex_index);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:558:71: required from ‘void boost::brandes_betweenness_centrality(const Graph&, const bgl_named_params<T, Tag, Base>&, typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >; Param = adj_list_edge_property_map<undirected_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_centrality_t, double> >, edge_weight_t>; Tag = edge_weight_t; Rest = bgl_named_params<adj_list_edge_property_map<undirected_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_centrality_t, double> >, edge_centrality_t>, edge_centrality_t, bgl_named_params<vec_adj_list_vertex_property_map<adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >, adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >*, double, double&, vertex_centrality_t>, vertex_centrality_t, no_property> >; typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits<Graph>::traversal_category = undir_adj_list_traversal_tag]’
558 | detail::graph::brandes_betweenness_centrality_dispatch1< ew >::run(g,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
559 | choose_param(
| ~~~~~~~~~~~~~
560 | get_param(params, vertex_centrality), dummy_property_map()),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
561 | choose_param(get_param(params, edge_centrality), dummy_property_map()),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
562 | choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
563 | get_param(params, edge_weight));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
bbc.cpp:67:33: required from here
67 | brandes_betweenness_centrality(g,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
68 | centrality_map(get(vertex_centrality, g)).
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
69 | edge_centrality_map(get(edge_centrality, g)).
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
70 | weight_map(get(edge_weight, g)));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
20 | ~usage_requirements() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/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<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >*, std::vector<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >, std::allocator<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > > > > >]’
37 | ~model()
| ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:512:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
512 | BOOST_CONCEPT_USAGE(InputIterator)
| ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::ForwardIterator<__gnu_cxx::__normal_iterator<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >*, std::vector<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >, std::allocator<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > > > > > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/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<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >*, std::vector<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >, std::allocator<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > > > > > > >]’
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:543:7: required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >*, std::vector<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >, std::allocator<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > > > > > >’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >*, std::vector<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >, std::allocator<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > > > > > >’
568 | BOOST_concept(BidirectionalIterator,(TT))
| ^~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >*, std::vector<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >, std::allocator<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > > > > > >’
597 | BOOST_concept(RandomAccessIterator,(TT))
| ^~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >*, std::vector<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >, std::allocator<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > > > > > >’
597 | BOOST_concept(RandomAccessIterator,(TT))
| ^~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_<void (*)(boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >*, std::vector<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >, std::allocator<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > > > > > >)>’
72 | struct requirement_<void(*)(Model)>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map<RAIter, ID, typename std::iterator_traits< <template-parameter-1-1> >::value_type, typename std::iterator_traits< <template-parameter-1-1> >::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = __gnu_cxx::__normal_iterator<std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<undirected_tag, long unsigned int> > >*, std::vector<std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<undirected_tag, long unsigned int> > >, std::allocator<std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<undirected_tag, long unsigned int> > > > > >; ID = vec_adj_list_vertex_id_map<property<vertex_index_t, int, property<vertex_centrality_t, double> >, long unsigned int>; typename std::iterator_traits< <template-parameter-1-1> >::value_type = std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<undirected_tag, long unsigned int> > >; typename std::iterator_traits< <template-parameter-1-1> >::reference = std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<undirected_tag, long unsigned int> > >&]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:469:43: required from ‘void boost::detail::graph::brandes_betweenness_centrality_dispatch2(const Graph&, CentralityMap, EdgeCentralityMap, WeightMap, VertexIndexMap) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >; CentralityMap = boost::vec_adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >, boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_centrality_t>; WeightMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_weight_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>]’
469 | make_iterator_property_map(incoming.begin(), vertex_index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:517:57: required from ‘static void boost::detail::graph::brandes_betweenness_centrality_dispatch1<WeightMap>::run(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap, WeightMap) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >; CentralityMap = boost::vec_adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >, boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>; WeightMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_weight_t>]’
517 | brandes_betweenness_centrality_dispatch2(g, centrality,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~
518 | edge_centrality_map, weight_map, vertex_index);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:558:71: required from ‘void boost::brandes_betweenness_centrality(const Graph&, const bgl_named_params<T, Tag, Base>&, typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >; Param = adj_list_edge_property_map<undirected_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_centrality_t, double> >, edge_weight_t>; Tag = edge_weight_t; Rest = bgl_named_params<adj_list_edge_property_map<undirected_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_centrality_t, double> >, edge_centrality_t>, edge_centrality_t, bgl_named_params<vec_adj_list_vertex_property_map<adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >, adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >*, double, double&, vertex_centrality_t>, vertex_centrality_t, no_property> >; typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits<Graph>::traversal_category = undir_adj_list_traversal_tag]’
558 | detail::graph::brandes_betweenness_centrality_dispatch1< ew >::run(g,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
559 | choose_param(
| ~~~~~~~~~~~~~
560 | get_param(params, vertex_centrality), dummy_property_map()),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
561 | choose_param(get_param(params, edge_centrality), dummy_property_map()),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
562 | choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
563 | get_param(params, edge_weight));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
bbc.cpp:67:33: required from here
67 | brandes_betweenness_centrality(g,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
68 | centrality_map(get(vertex_centrality, g)).
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
69 | edge_centrality_map(get(edge_centrality, g)).
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
70 | weight_map(get(edge_weight, g)));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
20 | ~usage_requirements() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/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<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >*, std::vector<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >, std::allocator<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > > > > >]’
37 | ~model()
| ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:543:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
543 | BOOST_CONCEPT_USAGE(ForwardIterator)
| ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::BidirectionalIterator<__gnu_cxx::__normal_iterator<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >*, std::vector<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >, std::allocator<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > > > > > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/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<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >*, std::vector<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >, std::allocator<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > > > > > > >]’
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:571:7: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >*, std::vector<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >, std::allocator<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > > > > > >’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >*, std::vector<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >, std::allocator<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > > > > > >’
597 | BOOST_concept(RandomAccessIterator,(TT))
| ^~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >*, std::vector<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >, std::allocator<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > > > > > >’
597 | BOOST_concept(RandomAccessIterator,(TT))
| ^~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >*, std::vector<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >, std::allocator<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > > > > > >]’
32 | inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
| ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_<void (*)(boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >*, std::vector<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >, std::allocator<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > > > > > >)>’
72 | struct requirement_<void(*)(Model)>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map<RAIter, ID, typename std::iterator_traits< <template-parameter-1-1> >::value_type, typename std::iterator_traits< <template-parameter-1-1> >::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = __gnu_cxx::__normal_iterator<std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<undirected_tag, long unsigned int> > >*, std::vector<std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<undirected_tag, long unsigned int> > >, std::allocator<std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<undirected_tag, long unsigned int> > > > > >; ID = vec_adj_list_vertex_id_map<property<vertex_index_t, int, property<vertex_centrality_t, double> >, long unsigned int>; typename std::iterator_traits< <template-parameter-1-1> >::value_type = std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<undirected_tag, long unsigned int> > >; typename std::iterator_traits< <template-parameter-1-1> >::reference = std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<undirected_tag, long unsigned int> > >&]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:469:43: required from ‘void boost::detail::graph::brandes_betweenness_centrality_dispatch2(const Graph&, CentralityMap, EdgeCentralityMap, WeightMap, VertexIndexMap) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >; CentralityMap = boost::vec_adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >, boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_centrality_t>; WeightMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_weight_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>]’
469 | make_iterator_property_map(incoming.begin(), vertex_index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:517:57: required from ‘static void boost::detail::graph::brandes_betweenness_centrality_dispatch1<WeightMap>::run(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap, WeightMap) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >; CentralityMap = boost::vec_adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >, boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>; WeightMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_weight_t>]’
517 | brandes_betweenness_centrality_dispatch2(g, centrality,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~
518 | edge_centrality_map, weight_map, vertex_index);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:558:71: required from ‘void boost::brandes_betweenness_centrality(const Graph&, const bgl_named_params<T, Tag, Base>&, typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >; Param = adj_list_edge_property_map<undirected_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_centrality_t, double> >, edge_weight_t>; Tag = edge_weight_t; Rest = bgl_named_params<adj_list_edge_property_map<undirected_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_centrality_t, double> >, edge_centrality_t>, edge_centrality_t, bgl_named_params<vec_adj_list_vertex_property_map<adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >, adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >*, double, double&, vertex_centrality_t>, vertex_centrality_t, no_property> >; typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits<Graph>::traversal_category = undir_adj_list_traversal_tag]’
558 | detail::graph::brandes_betweenness_centrality_dispatch1< ew >::run(g,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
559 | choose_param(
| ~~~~~~~~~~~~~
560 | get_param(params, vertex_centrality), dummy_property_map()),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
561 | choose_param(get_param(params, edge_centrality), dummy_property_map()),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
562 | choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
563 | get_param(params, edge_weight));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
bbc.cpp:67:33: required from here
67 | brandes_betweenness_centrality(g,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
68 | centrality_map(get(vertex_centrality, g)).
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
69 | edge_centrality_map(get(edge_centrality, g)).
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
70 | weight_map(get(edge_weight, g)));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
20 | ~usage_requirements() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/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<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >*, std::vector<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >, std::allocator<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > > > > >]’
37 | ~model()
| ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:571:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
571 | BOOST_CONCEPT_USAGE(BidirectionalIterator)
| ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Comparable<__gnu_cxx::__normal_iterator<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >*, std::vector<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >, std::allocator<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > > > > > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/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<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >*, std::vector<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >, std::allocator<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > > > > > > >]’
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:253:5: required from ‘struct boost::Comparable<__gnu_cxx::__normal_iterator<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >*, std::vector<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >, std::allocator<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > > > > > >’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >*, std::vector<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >, std::allocator<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > > > > > >’
597 | BOOST_concept(RandomAccessIterator,(TT))
| ^~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >*, std::vector<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >, std::allocator<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > > > > > >’
597 | BOOST_concept(RandomAccessIterator,(TT))
| ^~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >*, std::vector<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >, std::allocator<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > > > > > >]’
32 | inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
| ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_<void (*)(boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >*, std::vector<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >, std::allocator<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > > > > > >)>’
72 | struct requirement_<void(*)(Model)>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map<RAIter, ID, typename std::iterator_traits< <template-parameter-1-1> >::value_type, typename std::iterator_traits< <template-parameter-1-1> >::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = __gnu_cxx::__normal_iterator<std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<undirected_tag, long unsigned int> > >*, std::vector<std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<undirected_tag, long unsigned int> > >, std::allocator<std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<undirected_tag, long unsigned int> > > > > >; ID = vec_adj_list_vertex_id_map<property<vertex_index_t, int, property<vertex_centrality_t, double> >, long unsigned int>; typename std::iterator_traits< <template-parameter-1-1> >::value_type = std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<undirected_tag, long unsigned int> > >; typename std::iterator_traits< <template-parameter-1-1> >::reference = std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<undirected_tag, long unsigned int> > >&]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:469:43: required from ‘void boost::detail::graph::brandes_betweenness_centrality_dispatch2(const Graph&, CentralityMap, EdgeCentralityMap, WeightMap, VertexIndexMap) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >; CentralityMap = boost::vec_adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >, boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_centrality_t>; WeightMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_weight_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>]’
469 | make_iterator_property_map(incoming.begin(), vertex_index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:517:57: required from ‘static void boost::detail::graph::brandes_betweenness_centrality_dispatch1<WeightMap>::run(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap, WeightMap) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >; CentralityMap = boost::vec_adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >, boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>; WeightMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_weight_t>]’
517 | brandes_betweenness_centrality_dispatch2(g, centrality,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~
518 | edge_centrality_map, weight_map, vertex_index);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:558:71: required from ‘void boost::brandes_betweenness_centrality(const Graph&, const bgl_named_params<T, Tag, Base>&, typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >; Param = adj_list_edge_property_map<undirected_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_centrality_t, double> >, edge_weight_t>; Tag = edge_weight_t; Rest = bgl_named_params<adj_list_edge_property_map<undirected_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_centrality_t, double> >, edge_centrality_t>, edge_centrality_t, bgl_named_params<vec_adj_list_vertex_property_map<adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >, adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >*, double, double&, vertex_centrality_t>, vertex_centrality_t, no_property> >; typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits<Graph>::traversal_category = undir_adj_list_traversal_tag]’
558 | detail::graph::brandes_betweenness_centrality_dispatch1< ew >::run(g,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
559 | choose_param(
| ~~~~~~~~~~~~~
560 | get_param(params, vertex_centrality), dummy_property_map()),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
561 | choose_param(get_param(params, edge_centrality), dummy_property_map()),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
562 | choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
563 | get_param(params, edge_weight));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
bbc.cpp:67:33: required from here
67 | brandes_betweenness_centrality(g,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
68 | centrality_map(get(vertex_centrality, g)).
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
69 | edge_centrality_map(get(edge_centrality, g)).
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
70 | weight_map(get(edge_weight, g)));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
20 | ~usage_requirements() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/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<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >*, std::vector<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >, std::allocator<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > > > > >]’
37 | ~model()
| ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:253:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
253 | BOOST_CONCEPT_USAGE(Comparable) {
| ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::RandomAccessIterator<__gnu_cxx::__normal_iterator<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >*, std::vector<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >, std::allocator<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > > > > > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/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<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >*, std::vector<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >, std::allocator<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > > > > > > >]’
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:601:7: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >*, std::vector<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >, std::allocator<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > > > > > >’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >*, std::vector<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >, std::allocator<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > > > > > >’
597 | BOOST_concept(RandomAccessIterator,(TT))
| ^~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >*, std::vector<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >, std::allocator<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > > > > > >]’
32 | inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
| ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_<void (*)(boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >*, std::vector<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >, std::allocator<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > > > > > >)>’
72 | struct requirement_<void(*)(Model)>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map<RAIter, ID, typename std::iterator_traits< <template-parameter-1-1> >::value_type, typename std::iterator_traits< <template-parameter-1-1> >::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = __gnu_cxx::__normal_iterator<std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<undirected_tag, long unsigned int> > >*, std::vector<std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<undirected_tag, long unsigned int> > >, std::allocator<std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<undirected_tag, long unsigned int> > > > > >; ID = vec_adj_list_vertex_id_map<property<vertex_index_t, int, property<vertex_centrality_t, double> >, long unsigned int>; typename std::iterator_traits< <template-parameter-1-1> >::value_type = std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<undirected_tag, long unsigned int> > >; typename std::iterator_traits< <template-parameter-1-1> >::reference = std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<undirected_tag, long unsigned int> > >&]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:469:43: required from ‘void boost::detail::graph::brandes_betweenness_centrality_dispatch2(const Graph&, CentralityMap, EdgeCentralityMap, WeightMap, VertexIndexMap) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >; CentralityMap = boost::vec_adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >, boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_centrality_t>; WeightMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_weight_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>]’
469 | make_iterator_property_map(incoming.begin(), vertex_index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:517:57: required from ‘static void boost::detail::graph::brandes_betweenness_centrality_dispatch1<WeightMap>::run(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap, WeightMap) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >; CentralityMap = boost::vec_adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >, boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>; WeightMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_weight_t>]’
517 | brandes_betweenness_centrality_dispatch2(g, centrality,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~
518 | edge_centrality_map, weight_map, vertex_index);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:558:71: required from ‘void boost::brandes_betweenness_centrality(const Graph&, const bgl_named_params<T, Tag, Base>&, typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >; Param = adj_list_edge_property_map<undirected_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_centrality_t, double> >, edge_weight_t>; Tag = edge_weight_t; Rest = bgl_named_params<adj_list_edge_property_map<undirected_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_centrality_t, double> >, edge_centrality_t>, edge_centrality_t, bgl_named_params<vec_adj_list_vertex_property_map<adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >, adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >*, double, double&, vertex_centrality_t>, vertex_centrality_t, no_property> >; typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits<Graph>::traversal_category = undir_adj_list_traversal_tag]’
558 | detail::graph::brandes_betweenness_centrality_dispatch1< ew >::run(g,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
559 | choose_param(
| ~~~~~~~~~~~~~
560 | get_param(params, vertex_centrality), dummy_property_map()),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
561 | choose_param(get_param(params, edge_centrality), dummy_property_map()),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
562 | choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
563 | get_param(params, edge_weight));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
bbc.cpp:67:33: required from here
67 | brandes_betweenness_centrality(g,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
68 | centrality_map(get(vertex_centrality, g)).
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
69 | edge_centrality_map(get(edge_centrality, g)).
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
70 | weight_map(get(edge_weight, g)));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
20 | ~usage_requirements() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/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<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >*, std::vector<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >, std::allocator<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > > > > >]’
37 | ~model()
| ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:601:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
601 | BOOST_CONCEPT_USAGE(RandomAccessIterator)
| ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Assignable<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Assignable<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > > > >]’
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:145:5: required from ‘struct boost::Assignable<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > > >’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > > >’
502 | BOOST_concept(InputIterator,(TT))
| ^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:540:3: required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > > >’
540 | BOOST_concept(ForwardIterator,(TT))
| ^~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > > >’
568 | BOOST_concept(BidirectionalIterator,(TT))
| ^~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3: [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_<void (*)(boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > > >)>’
72 | struct requirement_<void(*)(Model)>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map<RAIter, ID, typename std::iterator_traits< <template-parameter-1-1> >::value_type, typename std::iterator_traits< <template-parameter-1-1> >::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = __gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > >; ID = vec_adj_list_vertex_id_map<property<vertex_index_t, int, property<vertex_centrality_t, double> >, long unsigned int>; typename std::iterator_traits< <template-parameter-1-1> >::value_type = double; typename std::iterator_traits< <template-parameter-1-1> >::reference = double&]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:470:43: required from ‘void boost::detail::graph::brandes_betweenness_centrality_dispatch2(const Graph&, CentralityMap, EdgeCentralityMap, WeightMap, VertexIndexMap) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >; CentralityMap = boost::vec_adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >, boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_centrality_t>; WeightMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_weight_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>]’
470 | make_iterator_property_map(distance.begin(), vertex_index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:517:57: required from ‘static void boost::detail::graph::brandes_betweenness_centrality_dispatch1<WeightMap>::run(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap, WeightMap) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >; CentralityMap = boost::vec_adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >, boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>; WeightMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_weight_t>]’
517 | brandes_betweenness_centrality_dispatch2(g, centrality,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~
518 | edge_centrality_map, weight_map, vertex_index);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:558:71: required from ‘void boost::brandes_betweenness_centrality(const Graph&, const bgl_named_params<T, Tag, Base>&, typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >; Param = adj_list_edge_property_map<undirected_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_centrality_t, double> >, edge_weight_t>; Tag = edge_weight_t; Rest = bgl_named_params<adj_list_edge_property_map<undirected_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_centrality_t, double> >, edge_centrality_t>, edge_centrality_t, bgl_named_params<vec_adj_list_vertex_property_map<adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >, adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >*, double, double&, vertex_centrality_t>, vertex_centrality_t, no_property> >; typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits<Graph>::traversal_category = undir_adj_list_traversal_tag]’
558 | detail::graph::brandes_betweenness_centrality_dispatch1< ew >::run(g,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
559 | choose_param(
| ~~~~~~~~~~~~~
560 | get_param(params, vertex_centrality), dummy_property_map()),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
561 | choose_param(get_param(params, edge_centrality), dummy_property_map()),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
562 | choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
563 | get_param(params, edge_weight));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
bbc.cpp:67:33: required from here
67 | brandes_betweenness_centrality(g,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
68 | centrality_map(get(vertex_centrality, g)).
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
69 | edge_centrality_map(get(edge_centrality, g)).
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
70 | weight_map(get(edge_weight, g)));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
20 | ~usage_requirements() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Assignable<TT>::~Assignable() [with TT = __gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > >]’
37 | ~model()
| ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:145:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
145 | BOOST_CONCEPT_USAGE(Assignable) {
| ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::EqualityComparable<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::EqualityComparable<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > > > >]’
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > > >’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > > >’
502 | BOOST_concept(InputIterator,(TT))
| ^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:540:3: required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > > >’
540 | BOOST_concept(ForwardIterator,(TT))
| ^~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > > >’
568 | BOOST_concept(BidirectionalIterator,(TT))
| ^~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3: [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_<void (*)(boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > > >)>’
72 | struct requirement_<void(*)(Model)>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map<RAIter, ID, typename std::iterator_traits< <template-parameter-1-1> >::value_type, typename std::iterator_traits< <template-parameter-1-1> >::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = __gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > >; ID = vec_adj_list_vertex_id_map<property<vertex_index_t, int, property<vertex_centrality_t, double> >, long unsigned int>; typename std::iterator_traits< <template-parameter-1-1> >::value_type = double; typename std::iterator_traits< <template-parameter-1-1> >::reference = double&]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:470:43: required from ‘void boost::detail::graph::brandes_betweenness_centrality_dispatch2(const Graph&, CentralityMap, EdgeCentralityMap, WeightMap, VertexIndexMap) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >; CentralityMap = boost::vec_adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >, boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_centrality_t>; WeightMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_weight_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>]’
470 | make_iterator_property_map(distance.begin(), vertex_index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:517:57: required from ‘static void boost::detail::graph::brandes_betweenness_centrality_dispatch1<WeightMap>::run(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap, WeightMap) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >; CentralityMap = boost::vec_adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >, boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>; WeightMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_weight_t>]’
517 | brandes_betweenness_centrality_dispatch2(g, centrality,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~
518 | edge_centrality_map, weight_map, vertex_index);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:558:71: required from ‘void boost::brandes_betweenness_centrality(const Graph&, const bgl_named_params<T, Tag, Base>&, typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >; Param = adj_list_edge_property_map<undirected_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_centrality_t, double> >, edge_weight_t>; Tag = edge_weight_t; Rest = bgl_named_params<adj_list_edge_property_map<undirected_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_centrality_t, double> >, edge_centrality_t>, edge_centrality_t, bgl_named_params<vec_adj_list_vertex_property_map<adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >, adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >*, double, double&, vertex_centrality_t>, vertex_centrality_t, no_property> >; typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits<Graph>::traversal_category = undir_adj_list_traversal_tag]’
558 | detail::graph::brandes_betweenness_centrality_dispatch1< ew >::run(g,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
559 | choose_param(
| ~~~~~~~~~~~~~
560 | get_param(params, vertex_centrality), dummy_property_map()),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
561 | choose_param(get_param(params, edge_centrality), dummy_property_map()),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
562 | choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
563 | get_param(params, edge_weight));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
bbc.cpp:67:33: required from here
67 | brandes_betweenness_centrality(g,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
68 | centrality_map(get(vertex_centrality, g)).
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
69 | edge_centrality_map(get(edge_centrality, g)).
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
70 | weight_map(get(edge_weight, g)));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
20 | ~usage_requirements() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::EqualityComparable<TT>::~EqualityComparable() [with TT = __gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > >]’
37 | ~model()
| ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:233:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
233 | BOOST_CONCEPT_USAGE(EqualityComparable) {
| ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::InputIterator<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::InputIterator<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > > > >]’
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:512:7: required from ‘struct boost::InputIterator<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > > >’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:540:3: required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > > >’
540 | BOOST_concept(ForwardIterator,(TT))
| ^~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > > >’
568 | BOOST_concept(BidirectionalIterator,(TT))
| ^~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > > >’
597 | BOOST_concept(RandomAccessIterator,(TT))
| ^~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3: [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_<void (*)(boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > > >)>’
72 | struct requirement_<void(*)(Model)>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map<RAIter, ID, typename std::iterator_traits< <template-parameter-1-1> >::value_type, typename std::iterator_traits< <template-parameter-1-1> >::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = __gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > >; ID = vec_adj_list_vertex_id_map<property<vertex_index_t, int, property<vertex_centrality_t, double> >, long unsigned int>; typename std::iterator_traits< <template-parameter-1-1> >::value_type = double; typename std::iterator_traits< <template-parameter-1-1> >::reference = double&]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:470:43: required from ‘void boost::detail::graph::brandes_betweenness_centrality_dispatch2(const Graph&, CentralityMap, EdgeCentralityMap, WeightMap, VertexIndexMap) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >; CentralityMap = boost::vec_adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >, boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_centrality_t>; WeightMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_weight_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>]’
470 | make_iterator_property_map(distance.begin(), vertex_index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:517:57: required from ‘static void boost::detail::graph::brandes_betweenness_centrality_dispatch1<WeightMap>::run(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap, WeightMap) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >; CentralityMap = boost::vec_adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >, boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>; WeightMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_weight_t>]’
517 | brandes_betweenness_centrality_dispatch2(g, centrality,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~
518 | edge_centrality_map, weight_map, vertex_index);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:558:71: required from ‘void boost::brandes_betweenness_centrality(const Graph&, const bgl_named_params<T, Tag, Base>&, typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >; Param = adj_list_edge_property_map<undirected_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_centrality_t, double> >, edge_weight_t>; Tag = edge_weight_t; Rest = bgl_named_params<adj_list_edge_property_map<undirected_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_centrality_t, double> >, edge_centrality_t>, edge_centrality_t, bgl_named_params<vec_adj_list_vertex_property_map<adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >, adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >*, double, double&, vertex_centrality_t>, vertex_centrality_t, no_property> >; typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits<Graph>::traversal_category = undir_adj_list_traversal_tag]’
558 | detail::graph::brandes_betweenness_centrality_dispatch1< ew >::run(g,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
559 | choose_param(
| ~~~~~~~~~~~~~
560 | get_param(params, vertex_centrality), dummy_property_map()),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
561 | choose_param(get_param(params, edge_centrality), dummy_property_map()),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
562 | choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
563 | get_param(params, edge_weight));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
bbc.cpp:67:33: required from here
67 | brandes_betweenness_centrality(g,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
68 | centrality_map(get(vertex_centrality, g)).
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
69 | edge_centrality_map(get(edge_centrality, g)).
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
70 | weight_map(get(edge_weight, g)));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
20 | ~usage_requirements() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::InputIterator<TT>::~InputIterator() [with TT = __gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > >]’
37 | ~model()
| ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:512:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
512 | BOOST_CONCEPT_USAGE(InputIterator)
| ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::ForwardIterator<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::ForwardIterator<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > > > >]’
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:543:7: required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > > >’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > > >’
568 | BOOST_concept(BidirectionalIterator,(TT))
| ^~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > > >’
597 | BOOST_concept(RandomAccessIterator,(TT))
| ^~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > > >’
597 | BOOST_concept(RandomAccessIterator,(TT))
| ^~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_<void (*)(boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > > >)>’
72 | struct requirement_<void(*)(Model)>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map<RAIter, ID, typename std::iterator_traits< <template-parameter-1-1> >::value_type, typename std::iterator_traits< <template-parameter-1-1> >::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = __gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > >; ID = vec_adj_list_vertex_id_map<property<vertex_index_t, int, property<vertex_centrality_t, double> >, long unsigned int>; typename std::iterator_traits< <template-parameter-1-1> >::value_type = double; typename std::iterator_traits< <template-parameter-1-1> >::reference = double&]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:470:43: required from ‘void boost::detail::graph::brandes_betweenness_centrality_dispatch2(const Graph&, CentralityMap, EdgeCentralityMap, WeightMap, VertexIndexMap) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >; CentralityMap = boost::vec_adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >, boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_centrality_t>; WeightMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_weight_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>]’
470 | make_iterator_property_map(distance.begin(), vertex_index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:517:57: required from ‘static void boost::detail::graph::brandes_betweenness_centrality_dispatch1<WeightMap>::run(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap, WeightMap) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >; CentralityMap = boost::vec_adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >, boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>; WeightMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_weight_t>]’
517 | brandes_betweenness_centrality_dispatch2(g, centrality,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~
518 | edge_centrality_map, weight_map, vertex_index);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:558:71: required from ‘void boost::brandes_betweenness_centrality(const Graph&, const bgl_named_params<T, Tag, Base>&, typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >; Param = adj_list_edge_property_map<undirected_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_centrality_t, double> >, edge_weight_t>; Tag = edge_weight_t; Rest = bgl_named_params<adj_list_edge_property_map<undirected_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_centrality_t, double> >, edge_centrality_t>, edge_centrality_t, bgl_named_params<vec_adj_list_vertex_property_map<adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >, adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >*, double, double&, vertex_centrality_t>, vertex_centrality_t, no_property> >; typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits<Graph>::traversal_category = undir_adj_list_traversal_tag]’
558 | detail::graph::brandes_betweenness_centrality_dispatch1< ew >::run(g,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
559 | choose_param(
| ~~~~~~~~~~~~~
560 | get_param(params, vertex_centrality), dummy_property_map()),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
561 | choose_param(get_param(params, edge_centrality), dummy_property_map()),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
562 | choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
563 | get_param(params, edge_weight));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
bbc.cpp:67:33: required from here
67 | brandes_betweenness_centrality(g,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
68 | centrality_map(get(vertex_centrality, g)).
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
69 | edge_centrality_map(get(edge_centrality, g)).
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
70 | weight_map(get(edge_weight, g)));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
20 | ~usage_requirements() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::ForwardIterator<TT>::~ForwardIterator() [with TT = __gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > >]’
37 | ~model()
| ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:543:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
543 | BOOST_CONCEPT_USAGE(ForwardIterator)
| ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::BidirectionalIterator<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::BidirectionalIterator<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > > > >]’
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:571:7: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > > >’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > > >’
597 | BOOST_concept(RandomAccessIterator,(TT))
| ^~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > > >’
597 | BOOST_concept(RandomAccessIterator,(TT))
| ^~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > > >]’
32 | inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
| ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_<void (*)(boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > > >)>’
72 | struct requirement_<void(*)(Model)>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map<RAIter, ID, typename std::iterator_traits< <template-parameter-1-1> >::value_type, typename std::iterator_traits< <template-parameter-1-1> >::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = __gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > >; ID = vec_adj_list_vertex_id_map<property<vertex_index_t, int, property<vertex_centrality_t, double> >, long unsigned int>; typename std::iterator_traits< <template-parameter-1-1> >::value_type = double; typename std::iterator_traits< <template-parameter-1-1> >::reference = double&]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:470:43: required from ‘void boost::detail::graph::brandes_betweenness_centrality_dispatch2(const Graph&, CentralityMap, EdgeCentralityMap, WeightMap, VertexIndexMap) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >; CentralityMap = boost::vec_adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >, boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_centrality_t>; WeightMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_weight_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>]’
470 | make_iterator_property_map(distance.begin(), vertex_index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:517:57: required from ‘static void boost::detail::graph::brandes_betweenness_centrality_dispatch1<WeightMap>::run(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap, WeightMap) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >; CentralityMap = boost::vec_adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >, boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>; WeightMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_weight_t>]’
517 | brandes_betweenness_centrality_dispatch2(g, centrality,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~
518 | edge_centrality_map, weight_map, vertex_index);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:558:71: required from ‘void boost::brandes_betweenness_centrality(const Graph&, const bgl_named_params<T, Tag, Base>&, typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >; Param = adj_list_edge_property_map<undirected_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_centrality_t, double> >, edge_weight_t>; Tag = edge_weight_t; Rest = bgl_named_params<adj_list_edge_property_map<undirected_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_centrality_t, double> >, edge_centrality_t>, edge_centrality_t, bgl_named_params<vec_adj_list_vertex_property_map<adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >, adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >*, double, double&, vertex_centrality_t>, vertex_centrality_t, no_property> >; typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits<Graph>::traversal_category = undir_adj_list_traversal_tag]’
558 | detail::graph::brandes_betweenness_centrality_dispatch1< ew >::run(g,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
559 | choose_param(
| ~~~~~~~~~~~~~
560 | get_param(params, vertex_centrality), dummy_property_map()),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
561 | choose_param(get_param(params, edge_centrality), dummy_property_map()),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
562 | choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
563 | get_param(params, edge_weight));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
bbc.cpp:67:33: required from here
67 | brandes_betweenness_centrality(g,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
68 | centrality_map(get(vertex_centrality, g)).
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
69 | edge_centrality_map(get(edge_centrality, g)).
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
70 | weight_map(get(edge_weight, g)));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
20 | ~usage_requirements() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::BidirectionalIterator<TT>::~BidirectionalIterator() [with TT = __gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > >]’
37 | ~model()
| ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:571:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
571 | BOOST_CONCEPT_USAGE(BidirectionalIterator)
| ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Comparable<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Comparable<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > > > >]’
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:253:5: required from ‘struct boost::Comparable<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > > >’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > > >’
597 | BOOST_concept(RandomAccessIterator,(TT))
| ^~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > > >’
597 | BOOST_concept(RandomAccessIterator,(TT))
| ^~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > > >]’
32 | inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
| ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_<void (*)(boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > > >)>’
72 | struct requirement_<void(*)(Model)>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map<RAIter, ID, typename std::iterator_traits< <template-parameter-1-1> >::value_type, typename std::iterator_traits< <template-parameter-1-1> >::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = __gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > >; ID = vec_adj_list_vertex_id_map<property<vertex_index_t, int, property<vertex_centrality_t, double> >, long unsigned int>; typename std::iterator_traits< <template-parameter-1-1> >::value_type = double; typename std::iterator_traits< <template-parameter-1-1> >::reference = double&]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:470:43: required from ‘void boost::detail::graph::brandes_betweenness_centrality_dispatch2(const Graph&, CentralityMap, EdgeCentralityMap, WeightMap, VertexIndexMap) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >; CentralityMap = boost::vec_adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >, boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_centrality_t>; WeightMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_weight_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>]’
470 | make_iterator_property_map(distance.begin(), vertex_index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:517:57: required from ‘static void boost::detail::graph::brandes_betweenness_centrality_dispatch1<WeightMap>::run(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap, WeightMap) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >; CentralityMap = boost::vec_adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >, boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>; WeightMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_weight_t>]’
517 | brandes_betweenness_centrality_dispatch2(g, centrality,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~
518 | edge_centrality_map, weight_map, vertex_index);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:558:71: required from ‘void boost::brandes_betweenness_centrality(const Graph&, const bgl_named_params<T, Tag, Base>&, typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >; Param = adj_list_edge_property_map<undirected_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_centrality_t, double> >, edge_weight_t>; Tag = edge_weight_t; Rest = bgl_named_params<adj_list_edge_property_map<undirected_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_centrality_t, double> >, edge_centrality_t>, edge_centrality_t, bgl_named_params<vec_adj_list_vertex_property_map<adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >, adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >*, double, double&, vertex_centrality_t>, vertex_centrality_t, no_property> >; typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits<Graph>::traversal_category = undir_adj_list_traversal_tag]’
558 | detail::graph::brandes_betweenness_centrality_dispatch1< ew >::run(g,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
559 | choose_param(
| ~~~~~~~~~~~~~
560 | get_param(params, vertex_centrality), dummy_property_map()),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
561 | choose_param(get_param(params, edge_centrality), dummy_property_map()),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
562 | choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
563 | get_param(params, edge_weight));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
bbc.cpp:67:33: required from here
67 | brandes_betweenness_centrality(g,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
68 | centrality_map(get(vertex_centrality, g)).
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
69 | edge_centrality_map(get(edge_centrality, g)).
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
70 | weight_map(get(edge_weight, g)));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
20 | ~usage_requirements() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Comparable<TT>::~Comparable() [with TT = __gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > >]’
37 | ~model()
| ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:253:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
253 | BOOST_CONCEPT_USAGE(Comparable) {
| ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::RandomAccessIterator<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::RandomAccessIterator<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > > > >]’
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:601:7: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > > >’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > > >’
597 | BOOST_concept(RandomAccessIterator,(TT))
| ^~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > > >]’
32 | inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
| ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_<void (*)(boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > > >)>’
72 | struct requirement_<void(*)(Model)>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map<RAIter, ID, typename std::iterator_traits< <template-parameter-1-1> >::value_type, typename std::iterator_traits< <template-parameter-1-1> >::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = __gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > >; ID = vec_adj_list_vertex_id_map<property<vertex_index_t, int, property<vertex_centrality_t, double> >, long unsigned int>; typename std::iterator_traits< <template-parameter-1-1> >::value_type = double; typename std::iterator_traits< <template-parameter-1-1> >::reference = double&]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:470:43: required from ‘void boost::detail::graph::brandes_betweenness_centrality_dispatch2(const Graph&, CentralityMap, EdgeCentralityMap, WeightMap, VertexIndexMap) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >; CentralityMap = boost::vec_adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >, boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_centrality_t>; WeightMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_weight_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>]’
470 | make_iterator_property_map(distance.begin(), vertex_index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:517:57: required from ‘static void boost::detail::graph::brandes_betweenness_centrality_dispatch1<WeightMap>::run(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap, WeightMap) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >; CentralityMap = boost::vec_adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >, boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>; WeightMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_weight_t>]’
517 | brandes_betweenness_centrality_dispatch2(g, centrality,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~
518 | edge_centrality_map, weight_map, vertex_index);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:558:71: required from ‘void boost::brandes_betweenness_centrality(const Graph&, const bgl_named_params<T, Tag, Base>&, typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >; Param = adj_list_edge_property_map<undirected_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_centrality_t, double> >, edge_weight_t>; Tag = edge_weight_t; Rest = bgl_named_params<adj_list_edge_property_map<undirected_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_centrality_t, double> >, edge_centrality_t>, edge_centrality_t, bgl_named_params<vec_adj_list_vertex_property_map<adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >, adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >*, double, double&, vertex_centrality_t>, vertex_centrality_t, no_property> >; typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits<Graph>::traversal_category = undir_adj_list_traversal_tag]’
558 | detail::graph::brandes_betweenness_centrality_dispatch1< ew >::run(g,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
559 | choose_param(
| ~~~~~~~~~~~~~
560 | get_param(params, vertex_centrality), dummy_property_map()),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
561 | choose_param(get_param(params, edge_centrality), dummy_property_map()),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
562 | choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
563 | get_param(params, edge_weight));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
bbc.cpp:67:33: required from here
67 | brandes_betweenness_centrality(g,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
68 | centrality_map(get(vertex_centrality, g)).
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
69 | edge_centrality_map(get(edge_centrality, g)).
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
70 | weight_map(get(edge_weight, g)));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
20 | ~usage_requirements() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::RandomAccessIterator<TT>::~RandomAccessIterator() [with TT = __gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > >]’
37 | ~model()
| ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:601:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
601 | BOOST_CONCEPT_USAGE(RandomAccessIterator)
| ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Assignable<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Assignable<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > > > >]’
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:145:5: required from ‘struct boost::Assignable<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > > >’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > > >’
502 | BOOST_concept(InputIterator,(TT))
| ^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:540:3: required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > > >’
540 | BOOST_concept(ForwardIterator,(TT))
| ^~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > > >’
568 | BOOST_concept(BidirectionalIterator,(TT))
| ^~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3: [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_<void (*)(boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > > >)>’
72 | struct requirement_<void(*)(Model)>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map<RAIter, ID, typename std::iterator_traits< <template-parameter-1-1> >::value_type, typename std::iterator_traits< <template-parameter-1-1> >::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = __gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > >; ID = vec_adj_list_vertex_id_map<property<vertex_index_t, int, property<vertex_centrality_t, double> >, long unsigned int>; typename std::iterator_traits< <template-parameter-1-1> >::value_type = long unsigned int; typename std::iterator_traits< <template-parameter-1-1> >::reference = long unsigned int&]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:472:43: required from ‘void boost::detail::graph::brandes_betweenness_centrality_dispatch2(const Graph&, CentralityMap, EdgeCentralityMap, WeightMap, VertexIndexMap) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >; CentralityMap = boost::vec_adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >, boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_centrality_t>; WeightMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_weight_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>]’
472 | make_iterator_property_map(path_count.begin(), vertex_index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:517:57: required from ‘static void boost::detail::graph::brandes_betweenness_centrality_dispatch1<WeightMap>::run(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap, WeightMap) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >; CentralityMap = boost::vec_adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >, boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>; WeightMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_weight_t>]’
517 | brandes_betweenness_centrality_dispatch2(g, centrality,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~
518 | edge_centrality_map, weight_map, vertex_index);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:558:71: required from ‘void boost::brandes_betweenness_centrality(const Graph&, const bgl_named_params<T, Tag, Base>&, typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >; Param = adj_list_edge_property_map<undirected_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_centrality_t, double> >, edge_weight_t>; Tag = edge_weight_t; Rest = bgl_named_params<adj_list_edge_property_map<undirected_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_centrality_t, double> >, edge_centrality_t>, edge_centrality_t, bgl_named_params<vec_adj_list_vertex_property_map<adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >, adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >*, double, double&, vertex_centrality_t>, vertex_centrality_t, no_property> >; typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits<Graph>::traversal_category = undir_adj_list_traversal_tag]’
558 | detail::graph::brandes_betweenness_centrality_dispatch1< ew >::run(g,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
559 | choose_param(
| ~~~~~~~~~~~~~
560 | get_param(params, vertex_centrality), dummy_property_map()),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
561 | choose_param(get_param(params, edge_centrality), dummy_property_map()),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
562 | choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
563 | get_param(params, edge_weight));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
bbc.cpp:67:33: required from here
67 | brandes_betweenness_centrality(g,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
68 | centrality_map(get(vertex_centrality, g)).
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
69 | edge_centrality_map(get(edge_centrality, g)).
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
70 | weight_map(get(edge_weight, g)));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
20 | ~usage_requirements() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Assignable<TT>::~Assignable() [with TT = __gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > >]’
37 | ~model()
| ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:145:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
145 | BOOST_CONCEPT_USAGE(Assignable) {
| ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::EqualityComparable<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::EqualityComparable<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > > > >]’
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > > >’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > > >’
502 | BOOST_concept(InputIterator,(TT))
| ^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:540:3: required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > > >’
540 | BOOST_concept(ForwardIterator,(TT))
| ^~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > > >’
568 | BOOST_concept(BidirectionalIterator,(TT))
| ^~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3: [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_<void (*)(boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > > >)>’
72 | struct requirement_<void(*)(Model)>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map<RAIter, ID, typename std::iterator_traits< <template-parameter-1-1> >::value_type, typename std::iterator_traits< <template-parameter-1-1> >::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = __gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > >; ID = vec_adj_list_vertex_id_map<property<vertex_index_t, int, property<vertex_centrality_t, double> >, long unsigned int>; typename std::iterator_traits< <template-parameter-1-1> >::value_type = long unsigned int; typename std::iterator_traits< <template-parameter-1-1> >::reference = long unsigned int&]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:472:43: required from ‘void boost::detail::graph::brandes_betweenness_centrality_dispatch2(const Graph&, CentralityMap, EdgeCentralityMap, WeightMap, VertexIndexMap) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >; CentralityMap = boost::vec_adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >, boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_centrality_t>; WeightMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_weight_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>]’
472 | make_iterator_property_map(path_count.begin(), vertex_index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:517:57: required from ‘static void boost::detail::graph::brandes_betweenness_centrality_dispatch1<WeightMap>::run(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap, WeightMap) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >; CentralityMap = boost::vec_adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >, boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>; WeightMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_weight_t>]’
517 | brandes_betweenness_centrality_dispatch2(g, centrality,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~
518 | edge_centrality_map, weight_map, vertex_index);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:558:71: required from ‘void boost::brandes_betweenness_centrality(const Graph&, const bgl_named_params<T, Tag, Base>&, typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >; Param = adj_list_edge_property_map<undirected_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_centrality_t, double> >, edge_weight_t>; Tag = edge_weight_t; Rest = bgl_named_params<adj_list_edge_property_map<undirected_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_centrality_t, double> >, edge_centrality_t>, edge_centrality_t, bgl_named_params<vec_adj_list_vertex_property_map<adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >, adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >*, double, double&, vertex_centrality_t>, vertex_centrality_t, no_property> >; typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits<Graph>::traversal_category = undir_adj_list_traversal_tag]’
558 | detail::graph::brandes_betweenness_centrality_dispatch1< ew >::run(g,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
559 | choose_param(
| ~~~~~~~~~~~~~
560 | get_param(params, vertex_centrality), dummy_property_map()),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
561 | choose_param(get_param(params, edge_centrality), dummy_property_map()),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
562 | choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
563 | get_param(params, edge_weight));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
bbc.cpp:67:33: required from here
67 | brandes_betweenness_centrality(g,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
68 | centrality_map(get(vertex_centrality, g)).
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
69 | edge_centrality_map(get(edge_centrality, g)).
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
70 | weight_map(get(edge_weight, g)));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
20 | ~usage_requirements() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::EqualityComparable<TT>::~EqualityComparable() [with TT = __gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > >]’
37 | ~model()
| ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:233:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
233 | BOOST_CONCEPT_USAGE(EqualityComparable) {
| ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::InputIterator<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::InputIterator<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > > > >]’
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:512:7: required from ‘struct boost::InputIterator<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > > >’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:540:3: required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > > >’
540 | BOOST_concept(ForwardIterator,(TT))
| ^~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > > >’
568 | BOOST_concept(BidirectionalIterator,(TT))
| ^~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > > >’
597 | BOOST_concept(RandomAccessIterator,(TT))
| ^~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3: [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_<void (*)(boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > > >)>’
72 | struct requirement_<void(*)(Model)>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map<RAIter, ID, typename std::iterator_traits< <template-parameter-1-1> >::value_type, typename std::iterator_traits< <template-parameter-1-1> >::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = __gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > >; ID = vec_adj_list_vertex_id_map<property<vertex_index_t, int, property<vertex_centrality_t, double> >, long unsigned int>; typename std::iterator_traits< <template-parameter-1-1> >::value_type = long unsigned int; typename std::iterator_traits< <template-parameter-1-1> >::reference = long unsigned int&]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:472:43: required from ‘void boost::detail::graph::brandes_betweenness_centrality_dispatch2(const Graph&, CentralityMap, EdgeCentralityMap, WeightMap, VertexIndexMap) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >; CentralityMap = boost::vec_adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >, boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_centrality_t>; WeightMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_weight_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>]’
472 | make_iterator_property_map(path_count.begin(), vertex_index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:517:57: required from ‘static void boost::detail::graph::brandes_betweenness_centrality_dispatch1<WeightMap>::run(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap, WeightMap) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >; CentralityMap = boost::vec_adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >, boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>; WeightMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_weight_t>]’
517 | brandes_betweenness_centrality_dispatch2(g, centrality,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~
518 | edge_centrality_map, weight_map, vertex_index);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:558:71: required from ‘void boost::brandes_betweenness_centrality(const Graph&, const bgl_named_params<T, Tag, Base>&, typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >; Param = adj_list_edge_property_map<undirected_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_centrality_t, double> >, edge_weight_t>; Tag = edge_weight_t; Rest = bgl_named_params<adj_list_edge_property_map<undirected_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_centrality_t, double> >, edge_centrality_t>, edge_centrality_t, bgl_named_params<vec_adj_list_vertex_property_map<adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >, adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >*, double, double&, vertex_centrality_t>, vertex_centrality_t, no_property> >; typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits<Graph>::traversal_category = undir_adj_list_traversal_tag]’
558 | detail::graph::brandes_betweenness_centrality_dispatch1< ew >::run(g,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
559 | choose_param(
| ~~~~~~~~~~~~~
560 | get_param(params, vertex_centrality), dummy_property_map()),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
561 | choose_param(get_param(params, edge_centrality), dummy_property_map()),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
562 | choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
563 | get_param(params, edge_weight));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
bbc.cpp:67:33: required from here
67 | brandes_betweenness_centrality(g,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
68 | centrality_map(get(vertex_centrality, g)).
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
69 | edge_centrality_map(get(edge_centrality, g)).
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
70 | weight_map(get(edge_weight, g)));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
20 | ~usage_requirements() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::InputIterator<TT>::~InputIterator() [with TT = __gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > >]’
37 | ~model()
| ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:512:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
512 | BOOST_CONCEPT_USAGE(InputIterator)
| ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::ForwardIterator<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::ForwardIterator<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > > > >]’
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:543:7: required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > > >’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > > >’
568 | BOOST_concept(BidirectionalIterator,(TT))
| ^~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > > >’
597 | BOOST_concept(RandomAccessIterator,(TT))
| ^~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > > >’
597 | BOOST_concept(RandomAccessIterator,(TT))
| ^~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_<void (*)(boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > > >)>’
72 | struct requirement_<void(*)(Model)>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map<RAIter, ID, typename std::iterator_traits< <template-parameter-1-1> >::value_type, typename std::iterator_traits< <template-parameter-1-1> >::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = __gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > >; ID = vec_adj_list_vertex_id_map<property<vertex_index_t, int, property<vertex_centrality_t, double> >, long unsigned int>; typename std::iterator_traits< <template-parameter-1-1> >::value_type = long unsigned int; typename std::iterator_traits< <template-parameter-1-1> >::reference = long unsigned int&]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:472:43: required from ‘void boost::detail::graph::brandes_betweenness_centrality_dispatch2(const Graph&, CentralityMap, EdgeCentralityMap, WeightMap, VertexIndexMap) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >; CentralityMap = boost::vec_adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >, boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_centrality_t>; WeightMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_weight_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>]’
472 | make_iterator_property_map(path_count.begin(), vertex_index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:517:57: required from ‘static void boost::detail::graph::brandes_betweenness_centrality_dispatch1<WeightMap>::run(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap, WeightMap) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >; CentralityMap = boost::vec_adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >, boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>; WeightMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_weight_t>]’
517 | brandes_betweenness_centrality_dispatch2(g, centrality,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~
518 | edge_centrality_map, weight_map, vertex_index);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:558:71: required from ‘void boost::brandes_betweenness_centrality(const Graph&, const bgl_named_params<T, Tag, Base>&, typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >; Param = adj_list_edge_property_map<undirected_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_centrality_t, double> >, edge_weight_t>; Tag = edge_weight_t; Rest = bgl_named_params<adj_list_edge_property_map<undirected_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_centrality_t, double> >, edge_centrality_t>, edge_centrality_t, bgl_named_params<vec_adj_list_vertex_property_map<adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >, adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >*, double, double&, vertex_centrality_t>, vertex_centrality_t, no_property> >; typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits<Graph>::traversal_category = undir_adj_list_traversal_tag]’
558 | detail::graph::brandes_betweenness_centrality_dispatch1< ew >::run(g,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
559 | choose_param(
| ~~~~~~~~~~~~~
560 | get_param(params, vertex_centrality), dummy_property_map()),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
561 | choose_param(get_param(params, edge_centrality), dummy_property_map()),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
562 | choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
563 | get_param(params, edge_weight));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
bbc.cpp:67:33: required from here
67 | brandes_betweenness_centrality(g,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
68 | centrality_map(get(vertex_centrality, g)).
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
69 | edge_centrality_map(get(edge_centrality, g)).
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
70 | weight_map(get(edge_weight, g)));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
20 | ~usage_requirements() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::ForwardIterator<TT>::~ForwardIterator() [with TT = __gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > >]’
37 | ~model()
| ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:543:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
543 | BOOST_CONCEPT_USAGE(ForwardIterator)
| ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::BidirectionalIterator<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::BidirectionalIterator<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > > > >]’
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:571:7: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > > >’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > > >’
597 | BOOST_concept(RandomAccessIterator,(TT))
| ^~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > > >’
597 | BOOST_concept(RandomAccessIterator,(TT))
| ^~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > > >]’
32 | inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
| ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_<void (*)(boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > > >)>’
72 | struct requirement_<void(*)(Model)>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map<RAIter, ID, typename std::iterator_traits< <template-parameter-1-1> >::value_type, typename std::iterator_traits< <template-parameter-1-1> >::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = __gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > >; ID = vec_adj_list_vertex_id_map<property<vertex_index_t, int, property<vertex_centrality_t, double> >, long unsigned int>; typename std::iterator_traits< <template-parameter-1-1> >::value_type = long unsigned int; typename std::iterator_traits< <template-parameter-1-1> >::reference = long unsigned int&]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:472:43: required from ‘void boost::detail::graph::brandes_betweenness_centrality_dispatch2(const Graph&, CentralityMap, EdgeCentralityMap, WeightMap, VertexIndexMap) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >; CentralityMap = boost::vec_adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >, boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_centrality_t>; WeightMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_weight_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>]’
472 | make_iterator_property_map(path_count.begin(), vertex_index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:517:57: required from ‘static void boost::detail::graph::brandes_betweenness_centrality_dispatch1<WeightMap>::run(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap, WeightMap) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >; CentralityMap = boost::vec_adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >, boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>; WeightMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_weight_t>]’
517 | brandes_betweenness_centrality_dispatch2(g, centrality,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~
518 | edge_centrality_map, weight_map, vertex_index);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:558:71: required from ‘void boost::brandes_betweenness_centrality(const Graph&, const bgl_named_params<T, Tag, Base>&, typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >; Param = adj_list_edge_property_map<undirected_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_centrality_t, double> >, edge_weight_t>; Tag = edge_weight_t; Rest = bgl_named_params<adj_list_edge_property_map<undirected_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_centrality_t, double> >, edge_centrality_t>, edge_centrality_t, bgl_named_params<vec_adj_list_vertex_property_map<adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >, adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >*, double, double&, vertex_centrality_t>, vertex_centrality_t, no_property> >; typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits<Graph>::traversal_category = undir_adj_list_traversal_tag]’
558 | detail::graph::brandes_betweenness_centrality_dispatch1< ew >::run(g,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
559 | choose_param(
| ~~~~~~~~~~~~~
560 | get_param(params, vertex_centrality), dummy_property_map()),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
561 | choose_param(get_param(params, edge_centrality), dummy_property_map()),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
562 | choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
563 | get_param(params, edge_weight));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
bbc.cpp:67:33: required from here
67 | brandes_betweenness_centrality(g,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
68 | centrality_map(get(vertex_centrality, g)).
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
69 | edge_centrality_map(get(edge_centrality, g)).
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
70 | weight_map(get(edge_weight, g)));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
20 | ~usage_requirements() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::BidirectionalIterator<TT>::~BidirectionalIterator() [with TT = __gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > >]’
37 | ~model()
| ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:571:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
571 | BOOST_CONCEPT_USAGE(BidirectionalIterator)
| ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Comparable<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Comparable<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > > > >]’
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:253:5: required from ‘struct boost::Comparable<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > > >’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > > >’
597 | BOOST_concept(RandomAccessIterator,(TT))
| ^~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > > >’
597 | BOOST_concept(RandomAccessIterator,(TT))
| ^~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > > >]’
32 | inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
| ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_<void (*)(boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > > >)>’
72 | struct requirement_<void(*)(Model)>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map<RAIter, ID, typename std::iterator_traits< <template-parameter-1-1> >::value_type, typename std::iterator_traits< <template-parameter-1-1> >::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = __gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > >; ID = vec_adj_list_vertex_id_map<property<vertex_index_t, int, property<vertex_centrality_t, double> >, long unsigned int>; typename std::iterator_traits< <template-parameter-1-1> >::value_type = long unsigned int; typename std::iterator_traits< <template-parameter-1-1> >::reference = long unsigned int&]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:472:43: required from ‘void boost::detail::graph::brandes_betweenness_centrality_dispatch2(const Graph&, CentralityMap, EdgeCentralityMap, WeightMap, VertexIndexMap) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >; CentralityMap = boost::vec_adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >, boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_centrality_t>; WeightMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_weight_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>]’
472 | make_iterator_property_map(path_count.begin(), vertex_index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:517:57: required from ‘static void boost::detail::graph::brandes_betweenness_centrality_dispatch1<WeightMap>::run(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap, WeightMap) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >; CentralityMap = boost::vec_adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >, boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>; WeightMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_weight_t>]’
517 | brandes_betweenness_centrality_dispatch2(g, centrality,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~
518 | edge_centrality_map, weight_map, vertex_index);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:558:71: required from ‘void boost::brandes_betweenness_centrality(const Graph&, const bgl_named_params<T, Tag, Base>&, typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >; Param = adj_list_edge_property_map<undirected_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_centrality_t, double> >, edge_weight_t>; Tag = edge_weight_t; Rest = bgl_named_params<adj_list_edge_property_map<undirected_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_centrality_t, double> >, edge_centrality_t>, edge_centrality_t, bgl_named_params<vec_adj_list_vertex_property_map<adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >, adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >*, double, double&, vertex_centrality_t>, vertex_centrality_t, no_property> >; typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits<Graph>::traversal_category = undir_adj_list_traversal_tag]’
558 | detail::graph::brandes_betweenness_centrality_dispatch1< ew >::run(g,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
559 | choose_param(
| ~~~~~~~~~~~~~
560 | get_param(params, vertex_centrality), dummy_property_map()),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
561 | choose_param(get_param(params, edge_centrality), dummy_property_map()),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
562 | choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
563 | get_param(params, edge_weight));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
bbc.cpp:67:33: required from here
67 | brandes_betweenness_centrality(g,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
68 | centrality_map(get(vertex_centrality, g)).
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
69 | edge_centrality_map(get(edge_centrality, g)).
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
70 | weight_map(get(edge_weight, g)));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
20 | ~usage_requirements() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Comparable<TT>::~Comparable() [with TT = __gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > >]’
37 | ~model()
| ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:253:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
253 | BOOST_CONCEPT_USAGE(Comparable) {
| ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::RandomAccessIterator<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::RandomAccessIterator<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > > > >]’
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:601:7: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > > >’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > > >’
597 | BOOST_concept(RandomAccessIterator,(TT))
| ^~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > > >]’
32 | inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
| ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_<void (*)(boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > > >)>’
72 | struct requirement_<void(*)(Model)>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map<RAIter, ID, typename std::iterator_traits< <template-parameter-1-1> >::value_type, typename std::iterator_traits< <template-parameter-1-1> >::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = __gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > >; ID = vec_adj_list_vertex_id_map<property<vertex_index_t, int, property<vertex_centrality_t, double> >, long unsigned int>; typename std::iterator_traits< <template-parameter-1-1> >::value_type = long unsigned int; typename std::iterator_traits< <template-parameter-1-1> >::reference = long unsigned int&]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:472:43: required from ‘void boost::detail::graph::brandes_betweenness_centrality_dispatch2(const Graph&, CentralityMap, EdgeCentralityMap, WeightMap, VertexIndexMap) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >; CentralityMap = boost::vec_adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >, boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_centrality_t>; WeightMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_weight_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>]’
472 | make_iterator_property_map(path_count.begin(), vertex_index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:517:57: required from ‘static void boost::detail::graph::brandes_betweenness_centrality_dispatch1<WeightMap>::run(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap, WeightMap) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >; CentralityMap = boost::vec_adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >, boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>; WeightMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_weight_t>]’
517 | brandes_betweenness_centrality_dispatch2(g, centrality,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~
518 | edge_centrality_map, weight_map, vertex_index);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:558:71: required from ‘void boost::brandes_betweenness_centrality(const Graph&, const bgl_named_params<T, Tag, Base>&, typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >; Param = adj_list_edge_property_map<undirected_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_centrality_t, double> >, edge_weight_t>; Tag = edge_weight_t; Rest = bgl_named_params<adj_list_edge_property_map<undirected_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_centrality_t, double> >, edge_centrality_t>, edge_centrality_t, bgl_named_params<vec_adj_list_vertex_property_map<adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >, adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >*, double, double&, vertex_centrality_t>, vertex_centrality_t, no_property> >; typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits<Graph>::traversal_category = undir_adj_list_traversal_tag]’
558 | detail::graph::brandes_betweenness_centrality_dispatch1< ew >::run(g,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
559 | choose_param(
| ~~~~~~~~~~~~~
560 | get_param(params, vertex_centrality), dummy_property_map()),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
561 | choose_param(get_param(params, edge_centrality), dummy_property_map()),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
562 | choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
563 | get_param(params, edge_weight));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
bbc.cpp:67:33: required from here
67 | brandes_betweenness_centrality(g,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
68 | centrality_map(get(vertex_centrality, g)).
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
69 | edge_centrality_map(get(edge_centrality, g)).
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
70 | weight_map(get(edge_weight, g)));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
20 | ~usage_requirements() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::RandomAccessIterator<TT>::~RandomAccessIterator() [with TT = __gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > >]’
37 | ~model()
| ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:601:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
601 | BOOST_CONCEPT_USAGE(RandomAccessIterator)
| ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Convertible<std::random_access_iterator_tag, std::random_access_iterator_tag> >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/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> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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);
| ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/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) );
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/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;
| ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3: required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >*, std::vector<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >, std::allocator<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > > > > > >]’
597 | BOOST_concept(RandomAccessIterator,(TT))
| ^~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map<RAIter, ID, typename std::iterator_traits< <template-parameter-1-1> >::value_type, typename std::iterator_traits< <template-parameter-1-1> >::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = __gnu_cxx::__normal_iterator<std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<undirected_tag, long unsigned int> > >*, std::vector<std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<undirected_tag, long unsigned int> > >, std::allocator<std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<undirected_tag, long unsigned int> > > > > >; ID = vec_adj_list_vertex_id_map<property<vertex_index_t, int, property<vertex_centrality_t, double> >, long unsigned int>; typename std::iterator_traits< <template-parameter-1-1> >::value_type = std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<undirected_tag, long unsigned int> > >; typename std::iterator_traits< <template-parameter-1-1> >::reference = std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<undirected_tag, long unsigned int> > >&]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:469:43: required from ‘void boost::detail::graph::brandes_betweenness_centrality_dispatch2(const Graph&, CentralityMap, EdgeCentralityMap, WeightMap, VertexIndexMap) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >; CentralityMap = boost::vec_adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >, boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_centrality_t>; WeightMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_weight_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>]’
469 | make_iterator_property_map(incoming.begin(), vertex_index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:517:57: required from ‘static void boost::detail::graph::brandes_betweenness_centrality_dispatch1<WeightMap>::run(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap, WeightMap) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >; CentralityMap = boost::vec_adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >, boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>; WeightMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_weight_t>]’
517 | brandes_betweenness_centrality_dispatch2(g, centrality,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~
518 | edge_centrality_map, weight_map, vertex_index);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:558:71: required from ‘void boost::brandes_betweenness_centrality(const Graph&, const bgl_named_params<T, Tag, Base>&, typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >; Param = adj_list_edge_property_map<undirected_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_centrality_t, double> >, edge_weight_t>; Tag = edge_weight_t; Rest = bgl_named_params<adj_list_edge_property_map<undirected_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_centrality_t, double> >, edge_centrality_t>, edge_centrality_t, bgl_named_params<vec_adj_list_vertex_property_map<adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >, adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >*, double, double&, vertex_centrality_t>, vertex_centrality_t, no_property> >; typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits<Graph>::traversal_category = undir_adj_list_traversal_tag]’
558 | detail::graph::brandes_betweenness_centrality_dispatch1< ew >::run(g,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
559 | choose_param(
| ~~~~~~~~~~~~~
560 | get_param(params, vertex_centrality), dummy_property_map()),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
561 | choose_param(get_param(params, edge_centrality), dummy_property_map()),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
562 | choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
563 | get_param(params, edge_weight));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
bbc.cpp:67:33: required from here
67 | brandes_betweenness_centrality(g,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
68 | centrality_map(get(vertex_centrality, g)).
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
69 | edge_centrality_map(get(edge_centrality, g)).
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
70 | weight_map(get(edge_weight, g)));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Convertible<std::random_access_iterator_tag, std::random_access_iterator_tag>]’
20 | ~usage_requirements() { ((Model*)0)->~Model(); }
| ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::Convertible<std::random_access_iterator_tag, std::random_access_iterator_tag>]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:603:11: required from ‘boost::RandomAccessIterator<TT>::~RandomAccessIterator() [with TT = __gnu_cxx::__normal_iterator<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >*, std::vector<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >, std::allocator<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > > > > >]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3: required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >*, std::vector<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >, std::allocator<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > > > > > >]’
597 | BOOST_concept(RandomAccessIterator,(TT))
| ^~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map<RAIter, ID, typename std::iterator_traits< <template-parameter-1-1> >::value_type, typename std::iterator_traits< <template-parameter-1-1> >::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = __gnu_cxx::__normal_iterator<std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<undirected_tag, long unsigned int> > >*, std::vector<std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<undirected_tag, long unsigned int> > >, std::allocator<std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<undirected_tag, long unsigned int> > > > > >; ID = vec_adj_list_vertex_id_map<property<vertex_index_t, int, property<vertex_centrality_t, double> >, long unsigned int>; typename std::iterator_traits< <template-parameter-1-1> >::value_type = std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<undirected_tag, long unsigned int> > >; typename std::iterator_traits< <template-parameter-1-1> >::reference = std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<undirected_tag, long unsigned int> > >&]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:469:43: required from ‘void boost::detail::graph::brandes_betweenness_centrality_dispatch2(const Graph&, CentralityMap, EdgeCentralityMap, WeightMap, VertexIndexMap) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >; CentralityMap = boost::vec_adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >, boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_centrality_t>; WeightMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_weight_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>]’
469 | make_iterator_property_map(incoming.begin(), vertex_index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:517:57: required from ‘static void boost::detail::graph::brandes_betweenness_centrality_dispatch1<WeightMap>::run(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap, WeightMap) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >; CentralityMap = boost::vec_adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >, boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>; WeightMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_weight_t>]’
517 | brandes_betweenness_centrality_dispatch2(g, centrality,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~
518 | edge_centrality_map, weight_map, vertex_index);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:558:71: required from ‘void boost::brandes_betweenness_centrality(const Graph&, const bgl_named_params<T, Tag, Base>&, typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >; Param = adj_list_edge_property_map<undirected_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_centrality_t, double> >, edge_weight_t>; Tag = edge_weight_t; Rest = bgl_named_params<adj_list_edge_property_map<undirected_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_centrality_t, double> >, edge_centrality_t>, edge_centrality_t, bgl_named_params<vec_adj_list_vertex_property_map<adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >, adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >*, double, double&, vertex_centrality_t>, vertex_centrality_t, no_property> >; typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits<Graph>::traversal_category = undir_adj_list_traversal_tag]’
558 | detail::graph::brandes_betweenness_centrality_dispatch1< ew >::run(g,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
559 | choose_param(
| ~~~~~~~~~~~~~
560 | get_param(params, vertex_centrality), dummy_property_map()),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
561 | choose_param(get_param(params, edge_centrality), dummy_property_map()),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
562 | choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
563 | get_param(params, edge_weight));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
bbc.cpp:67:33: required from here
67 | brandes_betweenness_centrality(g,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
68 | centrality_map(get(vertex_centrality, g)).
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
69 | edge_centrality_map(get(edge_centrality, g)).
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
70 | weight_map(get(edge_weight, g)));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible<X, Y>::~Convertible() [with X = std::random_access_iterator_tag; Y = std::random_access_iterator_tag]’
37 | ~model()
| ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
208 | BOOST_CONCEPT_USAGE(Convertible) {
| ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::SignedInteger<long int>]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:514:9: required from ‘boost::InputIterator<TT>::~InputIterator() [with TT = __gnu_cxx::__normal_iterator<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >*, std::vector<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >, std::allocator<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > > > > >]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: required from ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::InputIterator<__gnu_cxx::__normal_iterator<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >*, std::vector<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >, std::allocator<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > > > > > >]’
20 | ~usage_requirements() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/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<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >*, std::vector<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >, std::allocator<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > > > > > > >]’
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:512:7: required from ‘struct boost::InputIterator<__gnu_cxx::__normal_iterator<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >*, std::vector<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >, std::allocator<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > > > > > >’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:540:3: required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >*, std::vector<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >, std::allocator<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > > > > > >’
540 | BOOST_concept(ForwardIterator,(TT))
| ^~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:568:3: [ skipping 6 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_<void (*)(boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >*, std::vector<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >, std::allocator<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > > > > > >)>’
72 | struct requirement_<void(*)(Model)>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map<RAIter, ID, typename std::iterator_traits< <template-parameter-1-1> >::value_type, typename std::iterator_traits< <template-parameter-1-1> >::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = __gnu_cxx::__normal_iterator<std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<undirected_tag, long unsigned int> > >*, std::vector<std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<undirected_tag, long unsigned int> > >, std::allocator<std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<undirected_tag, long unsigned int> > > > > >; ID = vec_adj_list_vertex_id_map<property<vertex_index_t, int, property<vertex_centrality_t, double> >, long unsigned int>; typename std::iterator_traits< <template-parameter-1-1> >::value_type = std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<undirected_tag, long unsigned int> > >; typename std::iterator_traits< <template-parameter-1-1> >::reference = std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<undirected_tag, long unsigned int> > >&]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:469:43: required from ‘void boost::detail::graph::brandes_betweenness_centrality_dispatch2(const Graph&, CentralityMap, EdgeCentralityMap, WeightMap, VertexIndexMap) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >; CentralityMap = boost::vec_adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >, boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_centrality_t>; WeightMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_weight_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>]’
469 | make_iterator_property_map(incoming.begin(), vertex_index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:517:57: required from ‘static void boost::detail::graph::brandes_betweenness_centrality_dispatch1<WeightMap>::run(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap, WeightMap) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >; CentralityMap = boost::vec_adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >, boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>; WeightMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_weight_t>]’
517 | brandes_betweenness_centrality_dispatch2(g, centrality,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~
518 | edge_centrality_map, weight_map, vertex_index);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:558:71: required from ‘void boost::brandes_betweenness_centrality(const Graph&, const bgl_named_params<T, Tag, Base>&, typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >; Param = adj_list_edge_property_map<undirected_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_centrality_t, double> >, edge_weight_t>; Tag = edge_weight_t; Rest = bgl_named_params<adj_list_edge_property_map<undirected_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_centrality_t, double> >, edge_centrality_t>, edge_centrality_t, bgl_named_params<vec_adj_list_vertex_property_map<adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >, adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >*, double, double&, vertex_centrality_t>, vertex_centrality_t, no_property> >; typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits<Graph>::traversal_category = undir_adj_list_traversal_tag]’
558 | detail::graph::brandes_betweenness_centrality_dispatch1< ew >::run(g,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
559 | choose_param(
| ~~~~~~~~~~~~~
560 | get_param(params, vertex_centrality), dummy_property_map()),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
561 | choose_param(get_param(params, edge_centrality), dummy_property_map()),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
562 | choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
563 | get_param(params, edge_weight));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
bbc.cpp:67:33: required from here
67 | brandes_betweenness_centrality(g,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
68 | centrality_map(get(vertex_centrality, g)).
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
69 | edge_centrality_map(get(edge_centrality, g)).
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
70 | weight_map(get(edge_weight, g)));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:107:22: note: in a call to non-static member function ‘boost::SignedInteger<long int>::~SignedInteger()’
107 | template <> struct SignedInteger<long> {};
| ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Convertible<std::random_access_iterator_tag, std::input_iterator_tag> >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/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> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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);
| ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/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) );
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/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;
| ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/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)>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:515:9: [ skipping 11 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_<void (*)(boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >*, std::vector<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >, std::allocator<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > > > > > >)>’
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map<RAIter, ID, typename std::iterator_traits< <template-parameter-1-1> >::value_type, typename std::iterator_traits< <template-parameter-1-1> >::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = __gnu_cxx::__normal_iterator<std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<undirected_tag, long unsigned int> > >*, std::vector<std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<undirected_tag, long unsigned int> > >, std::allocator<std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<undirected_tag, long unsigned int> > > > > >; ID = vec_adj_list_vertex_id_map<property<vertex_index_t, int, property<vertex_centrality_t, double> >, long unsigned int>; typename std::iterator_traits< <template-parameter-1-1> >::value_type = std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<undirected_tag, long unsigned int> > >; typename std::iterator_traits< <template-parameter-1-1> >::reference = std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<undirected_tag, long unsigned int> > >&]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:469:43: required from ‘void boost::detail::graph::brandes_betweenness_centrality_dispatch2(const Graph&, CentralityMap, EdgeCentralityMap, WeightMap, VertexIndexMap) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >; CentralityMap = boost::vec_adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >, boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_centrality_t>; WeightMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_weight_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>]’
469 | make_iterator_property_map(incoming.begin(), vertex_index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:517:57: required from ‘static void boost::detail::graph::brandes_betweenness_centrality_dispatch1<WeightMap>::run(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap, WeightMap) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >; CentralityMap = boost::vec_adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >, boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>; WeightMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_weight_t>]’
517 | brandes_betweenness_centrality_dispatch2(g, centrality,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~
518 | edge_centrality_map, weight_map, vertex_index);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:558:71: required from ‘void boost::brandes_betweenness_centrality(const Graph&, const bgl_named_params<T, Tag, Base>&, typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >; Param = adj_list_edge_property_map<undirected_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_centrality_t, double> >, edge_weight_t>; Tag = edge_weight_t; Rest = bgl_named_params<adj_list_edge_property_map<undirected_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_centrality_t, double> >, edge_centrality_t>, edge_centrality_t, bgl_named_params<vec_adj_list_vertex_property_map<adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >, adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >*, double, double&, vertex_centrality_t>, vertex_centrality_t, no_property> >; typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits<Graph>::traversal_category = undir_adj_list_traversal_tag]’
558 | detail::graph::brandes_betweenness_centrality_dispatch1< ew >::run(g,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
559 | choose_param(
| ~~~~~~~~~~~~~
560 | get_param(params, vertex_centrality), dummy_property_map()),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
561 | choose_param(get_param(params, edge_centrality), dummy_property_map()),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
562 | choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
563 | get_param(params, edge_weight));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
bbc.cpp:67:33: required from here
67 | brandes_betweenness_centrality(g,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
68 | centrality_map(get(vertex_centrality, g)).
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
69 | edge_centrality_map(get(edge_centrality, g)).
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
70 | weight_map(get(edge_weight, g)));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Convertible<std::random_access_iterator_tag, std::input_iterator_tag>]’
20 | ~usage_requirements() { ((Model*)0)->~Model(); }
| ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::Convertible<std::random_access_iterator_tag, std::input_iterator_tag>]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:515:9: required from ‘boost::InputIterator<TT>::~InputIterator() [with TT = __gnu_cxx::__normal_iterator<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >*, std::vector<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >, std::allocator<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > > > > >]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: required from ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::InputIterator<__gnu_cxx::__normal_iterator<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >*, std::vector<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >, std::allocator<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > > > > > >]’
20 | ~usage_requirements() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/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<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >*, std::vector<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >, std::allocator<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > > > > > > >]’
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:512:7: required from ‘struct boost::InputIterator<__gnu_cxx::__normal_iterator<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >*, std::vector<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >, std::allocator<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > > > > > >’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:540:3: required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >*, std::vector<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >, std::allocator<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > > > > > >’
540 | BOOST_concept(ForwardIterator,(TT))
| ^~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:568:3: [ skipping 6 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_<void (*)(boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >*, std::vector<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >, std::allocator<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > > > > > >)>’
72 | struct requirement_<void(*)(Model)>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map<RAIter, ID, typename std::iterator_traits< <template-parameter-1-1> >::value_type, typename std::iterator_traits< <template-parameter-1-1> >::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = __gnu_cxx::__normal_iterator<std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<undirected_tag, long unsigned int> > >*, std::vector<std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<undirected_tag, long unsigned int> > >, std::allocator<std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<undirected_tag, long unsigned int> > > > > >; ID = vec_adj_list_vertex_id_map<property<vertex_index_t, int, property<vertex_centrality_t, double> >, long unsigned int>; typename std::iterator_traits< <template-parameter-1-1> >::value_type = std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<undirected_tag, long unsigned int> > >; typename std::iterator_traits< <template-parameter-1-1> >::reference = std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<undirected_tag, long unsigned int> > >&]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:469:43: required from ‘void boost::detail::graph::brandes_betweenness_centrality_dispatch2(const Graph&, CentralityMap, EdgeCentralityMap, WeightMap, VertexIndexMap) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >; CentralityMap = boost::vec_adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >, boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_centrality_t>; WeightMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_weight_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>]’
469 | make_iterator_property_map(incoming.begin(), vertex_index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:517:57: required from ‘static void boost::detail::graph::brandes_betweenness_centrality_dispatch1<WeightMap>::run(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap, WeightMap) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >; CentralityMap = boost::vec_adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >, boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>; WeightMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_weight_t>]’
517 | brandes_betweenness_centrality_dispatch2(g, centrality,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~
518 | edge_centrality_map, weight_map, vertex_index);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:558:71: required from ‘void boost::brandes_betweenness_centrality(const Graph&, const bgl_named_params<T, Tag, Base>&, typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >; Param = adj_list_edge_property_map<undirected_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_centrality_t, double> >, edge_weight_t>; Tag = edge_weight_t; Rest = bgl_named_params<adj_list_edge_property_map<undirected_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_centrality_t, double> >, edge_centrality_t>, edge_centrality_t, bgl_named_params<vec_adj_list_vertex_property_map<adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >, adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >*, double, double&, vertex_centrality_t>, vertex_centrality_t, no_property> >; typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits<Graph>::traversal_category = undir_adj_list_traversal_tag]’
558 | detail::graph::brandes_betweenness_centrality_dispatch1< ew >::run(g,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
559 | choose_param(
| ~~~~~~~~~~~~~
560 | get_param(params, vertex_centrality), dummy_property_map()),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
561 | choose_param(get_param(params, edge_centrality), dummy_property_map()),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
562 | choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
563 | get_param(params, edge_weight));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
bbc.cpp:67:33: required from here
67 | brandes_betweenness_centrality(g,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
68 | centrality_map(get(vertex_centrality, g)).
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
69 | edge_centrality_map(get(edge_centrality, g)).
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
70 | weight_map(get(edge_weight, g)));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible<X, Y>::~Convertible() [with X = std::random_access_iterator_tag; Y = std::input_iterator_tag]’
37 | ~model()
| ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
208 | BOOST_CONCEPT_USAGE(Convertible) {
| ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Convertible<std::random_access_iterator_tag, std::forward_iterator_tag> >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/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> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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);
| ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/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) );
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/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;
| ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/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)>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:545:11: [ skipping 10 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_<void (*)(boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >*, std::vector<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >, std::allocator<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > > > > > >)>’
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map<RAIter, ID, typename std::iterator_traits< <template-parameter-1-1> >::value_type, typename std::iterator_traits< <template-parameter-1-1> >::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = __gnu_cxx::__normal_iterator<std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<undirected_tag, long unsigned int> > >*, std::vector<std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<undirected_tag, long unsigned int> > >, std::allocator<std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<undirected_tag, long unsigned int> > > > > >; ID = vec_adj_list_vertex_id_map<property<vertex_index_t, int, property<vertex_centrality_t, double> >, long unsigned int>; typename std::iterator_traits< <template-parameter-1-1> >::value_type = std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<undirected_tag, long unsigned int> > >; typename std::iterator_traits< <template-parameter-1-1> >::reference = std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<undirected_tag, long unsigned int> > >&]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:469:43: required from ‘void boost::detail::graph::brandes_betweenness_centrality_dispatch2(const Graph&, CentralityMap, EdgeCentralityMap, WeightMap, VertexIndexMap) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >; CentralityMap = boost::vec_adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >, boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_centrality_t>; WeightMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_weight_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>]’
469 | make_iterator_property_map(incoming.begin(), vertex_index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:517:57: required from ‘static void boost::detail::graph::brandes_betweenness_centrality_dispatch1<WeightMap>::run(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap, WeightMap) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >; CentralityMap = boost::vec_adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >, boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>; WeightMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_weight_t>]’
517 | brandes_betweenness_centrality_dispatch2(g, centrality,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~
518 | edge_centrality_map, weight_map, vertex_index);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:558:71: required from ‘void boost::brandes_betweenness_centrality(const Graph&, const bgl_named_params<T, Tag, Base>&, typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >; Param = adj_list_edge_property_map<undirected_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_centrality_t, double> >, edge_weight_t>; Tag = edge_weight_t; Rest = bgl_named_params<adj_list_edge_property_map<undirected_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_centrality_t, double> >, edge_centrality_t>, edge_centrality_t, bgl_named_params<vec_adj_list_vertex_property_map<adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >, adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >*, double, double&, vertex_centrality_t>, vertex_centrality_t, no_property> >; typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits<Graph>::traversal_category = undir_adj_list_traversal_tag]’
558 | detail::graph::brandes_betweenness_centrality_dispatch1< ew >::run(g,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
559 | choose_param(
| ~~~~~~~~~~~~~
560 | get_param(params, vertex_centrality), dummy_property_map()),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
561 | choose_param(get_param(params, edge_centrality), dummy_property_map()),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
562 | choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
563 | get_param(params, edge_weight));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
bbc.cpp:67:33: required from here
67 | brandes_betweenness_centrality(g,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
68 | centrality_map(get(vertex_centrality, g)).
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
69 | edge_centrality_map(get(edge_centrality, g)).
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
70 | weight_map(get(edge_weight, g)));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Convertible<std::random_access_iterator_tag, std::forward_iterator_tag>]’
20 | ~usage_requirements() { ((Model*)0)->~Model(); }
| ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::Convertible<std::random_access_iterator_tag, std::forward_iterator_tag>]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:545:11: required from ‘boost::ForwardIterator<TT>::~ForwardIterator() [with TT = __gnu_cxx::__normal_iterator<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >*, std::vector<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >, std::allocator<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > > > > >]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: required from ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::ForwardIterator<__gnu_cxx::__normal_iterator<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >*, std::vector<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >, std::allocator<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > > > > > >]’
20 | ~usage_requirements() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/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<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >*, std::vector<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >, std::allocator<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > > > > > > >]’
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:543:7: required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >*, std::vector<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >, std::allocator<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > > > > > >’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >*, std::vector<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >, std::allocator<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > > > > > >’
568 | BOOST_concept(BidirectionalIterator,(TT))
| ^~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3: [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_<void (*)(boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >*, std::vector<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >, std::allocator<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > > > > > >)>’
72 | struct requirement_<void(*)(Model)>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map<RAIter, ID, typename std::iterator_traits< <template-parameter-1-1> >::value_type, typename std::iterator_traits< <template-parameter-1-1> >::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = __gnu_cxx::__normal_iterator<std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<undirected_tag, long unsigned int> > >*, std::vector<std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<undirected_tag, long unsigned int> > >, std::allocator<std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<undirected_tag, long unsigned int> > > > > >; ID = vec_adj_list_vertex_id_map<property<vertex_index_t, int, property<vertex_centrality_t, double> >, long unsigned int>; typename std::iterator_traits< <template-parameter-1-1> >::value_type = std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<undirected_tag, long unsigned int> > >; typename std::iterator_traits< <template-parameter-1-1> >::reference = std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<undirected_tag, long unsigned int> > >&]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:469:43: required from ‘void boost::detail::graph::brandes_betweenness_centrality_dispatch2(const Graph&, CentralityMap, EdgeCentralityMap, WeightMap, VertexIndexMap) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >; CentralityMap = boost::vec_adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >, boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_centrality_t>; WeightMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_weight_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>]’
469 | make_iterator_property_map(incoming.begin(), vertex_index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:517:57: required from ‘static void boost::detail::graph::brandes_betweenness_centrality_dispatch1<WeightMap>::run(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap, WeightMap) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >; CentralityMap = boost::vec_adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >, boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>; WeightMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_weight_t>]’
517 | brandes_betweenness_centrality_dispatch2(g, centrality,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~
518 | edge_centrality_map, weight_map, vertex_index);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:558:71: required from ‘void boost::brandes_betweenness_centrality(const Graph&, const bgl_named_params<T, Tag, Base>&, typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >; Param = adj_list_edge_property_map<undirected_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_centrality_t, double> >, edge_weight_t>; Tag = edge_weight_t; Rest = bgl_named_params<adj_list_edge_property_map<undirected_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_centrality_t, double> >, edge_centrality_t>, edge_centrality_t, bgl_named_params<vec_adj_list_vertex_property_map<adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >, adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >*, double, double&, vertex_centrality_t>, vertex_centrality_t, no_property> >; typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits<Graph>::traversal_category = undir_adj_list_traversal_tag]’
558 | detail::graph::brandes_betweenness_centrality_dispatch1< ew >::run(g,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
559 | choose_param(
| ~~~~~~~~~~~~~
560 | get_param(params, vertex_centrality), dummy_property_map()),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
561 | choose_param(get_param(params, edge_centrality), dummy_property_map()),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
562 | choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
563 | get_param(params, edge_weight));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
bbc.cpp:67:33: required from here
67 | brandes_betweenness_centrality(g,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
68 | centrality_map(get(vertex_centrality, g)).
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
69 | edge_centrality_map(get(edge_centrality, g)).
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
70 | weight_map(get(edge_weight, g)));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible<X, Y>::~Convertible() [with X = std::random_access_iterator_tag; Y = std::forward_iterator_tag]’
37 | ~model()
| ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
208 | BOOST_CONCEPT_USAGE(Convertible) {
| ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Convertible<std::random_access_iterator_tag, std::bidirectional_iterator_tag> >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/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> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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);
| ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/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) );
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/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;
| ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/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)>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:573:11: [ skipping 9 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_<void (*)(boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >*, std::vector<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >, std::allocator<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > > > > > >)>’
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map<RAIter, ID, typename std::iterator_traits< <template-parameter-1-1> >::value_type, typename std::iterator_traits< <template-parameter-1-1> >::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = __gnu_cxx::__normal_iterator<std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<undirected_tag, long unsigned int> > >*, std::vector<std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<undirected_tag, long unsigned int> > >, std::allocator<std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<undirected_tag, long unsigned int> > > > > >; ID = vec_adj_list_vertex_id_map<property<vertex_index_t, int, property<vertex_centrality_t, double> >, long unsigned int>; typename std::iterator_traits< <template-parameter-1-1> >::value_type = std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<undirected_tag, long unsigned int> > >; typename std::iterator_traits< <template-parameter-1-1> >::reference = std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<undirected_tag, long unsigned int> > >&]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:469:43: required from ‘void boost::detail::graph::brandes_betweenness_centrality_dispatch2(const Graph&, CentralityMap, EdgeCentralityMap, WeightMap, VertexIndexMap) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >; CentralityMap = boost::vec_adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >, boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_centrality_t>; WeightMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_weight_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>]’
469 | make_iterator_property_map(incoming.begin(), vertex_index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:517:57: required from ‘static void boost::detail::graph::brandes_betweenness_centrality_dispatch1<WeightMap>::run(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap, WeightMap) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >; CentralityMap = boost::vec_adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >, boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>; WeightMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_weight_t>]’
517 | brandes_betweenness_centrality_dispatch2(g, centrality,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~
518 | edge_centrality_map, weight_map, vertex_index);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:558:71: required from ‘void boost::brandes_betweenness_centrality(const Graph&, const bgl_named_params<T, Tag, Base>&, typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >; Param = adj_list_edge_property_map<undirected_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_centrality_t, double> >, edge_weight_t>; Tag = edge_weight_t; Rest = bgl_named_params<adj_list_edge_property_map<undirected_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_centrality_t, double> >, edge_centrality_t>, edge_centrality_t, bgl_named_params<vec_adj_list_vertex_property_map<adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >, adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >*, double, double&, vertex_centrality_t>, vertex_centrality_t, no_property> >; typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits<Graph>::traversal_category = undir_adj_list_traversal_tag]’
558 | detail::graph::brandes_betweenness_centrality_dispatch1< ew >::run(g,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
559 | choose_param(
| ~~~~~~~~~~~~~
560 | get_param(params, vertex_centrality), dummy_property_map()),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
561 | choose_param(get_param(params, edge_centrality), dummy_property_map()),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
562 | choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
563 | get_param(params, edge_weight));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
bbc.cpp:67:33: required from here
67 | brandes_betweenness_centrality(g,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
68 | centrality_map(get(vertex_centrality, g)).
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
69 | edge_centrality_map(get(edge_centrality, g)).
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
70 | weight_map(get(edge_weight, g)));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Convertible<std::random_access_iterator_tag, std::bidirectional_iterator_tag>]’
20 | ~usage_requirements() { ((Model*)0)->~Model(); }
| ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::Convertible<std::random_access_iterator_tag, std::bidirectional_iterator_tag>]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:573:11: required from ‘boost::BidirectionalIterator<TT>::~BidirectionalIterator() [with TT = __gnu_cxx::__normal_iterator<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >*, std::vector<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >, std::allocator<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > > > > >]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: required from ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::BidirectionalIterator<__gnu_cxx::__normal_iterator<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >*, std::vector<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >, std::allocator<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > > > > > >]’
20 | ~usage_requirements() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/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<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >*, std::vector<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >, std::allocator<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > > > > > > >]’
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:571:7: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >*, std::vector<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >, std::allocator<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > > > > > >’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >*, std::vector<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >, std::allocator<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > > > > > >’
597 | BOOST_concept(RandomAccessIterator,(TT))
| ^~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3: [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_<void (*)(boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >*, std::vector<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >, std::allocator<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > > > > > >)>’
72 | struct requirement_<void(*)(Model)>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map<RAIter, ID, typename std::iterator_traits< <template-parameter-1-1> >::value_type, typename std::iterator_traits< <template-parameter-1-1> >::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = __gnu_cxx::__normal_iterator<std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<undirected_tag, long unsigned int> > >*, std::vector<std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<undirected_tag, long unsigned int> > >, std::allocator<std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<undirected_tag, long unsigned int> > > > > >; ID = vec_adj_list_vertex_id_map<property<vertex_index_t, int, property<vertex_centrality_t, double> >, long unsigned int>; typename std::iterator_traits< <template-parameter-1-1> >::value_type = std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<undirected_tag, long unsigned int> > >; typename std::iterator_traits< <template-parameter-1-1> >::reference = std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<undirected_tag, long unsigned int> > >&]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:469:43: required from ‘void boost::detail::graph::brandes_betweenness_centrality_dispatch2(const Graph&, CentralityMap, EdgeCentralityMap, WeightMap, VertexIndexMap) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >; CentralityMap = boost::vec_adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >, boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_centrality_t>; WeightMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_weight_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>]’
469 | make_iterator_property_map(incoming.begin(), vertex_index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:517:57: required from ‘static void boost::detail::graph::brandes_betweenness_centrality_dispatch1<WeightMap>::run(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap, WeightMap) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >; CentralityMap = boost::vec_adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >, boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>; WeightMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_weight_t>]’
517 | brandes_betweenness_centrality_dispatch2(g, centrality,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~
518 | edge_centrality_map, weight_map, vertex_index);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:558:71: required from ‘void boost::brandes_betweenness_centrality(const Graph&, const bgl_named_params<T, Tag, Base>&, typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >; Param = adj_list_edge_property_map<undirected_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_centrality_t, double> >, edge_weight_t>; Tag = edge_weight_t; Rest = bgl_named_params<adj_list_edge_property_map<undirected_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_centrality_t, double> >, edge_centrality_t>, edge_centrality_t, bgl_named_params<vec_adj_list_vertex_property_map<adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >, adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >*, double, double&, vertex_centrality_t>, vertex_centrality_t, no_property> >; typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits<Graph>::traversal_category = undir_adj_list_traversal_tag]’
558 | detail::graph::brandes_betweenness_centrality_dispatch1< ew >::run(g,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
559 | choose_param(
| ~~~~~~~~~~~~~
560 | get_param(params, vertex_centrality), dummy_property_map()),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
561 | choose_param(get_param(params, edge_centrality), dummy_property_map()),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
562 | choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
563 | get_param(params, edge_weight));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
bbc.cpp:67:33: required from here
67 | brandes_betweenness_centrality(g,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
68 | centrality_map(get(vertex_centrality, g)).
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
69 | edge_centrality_map(get(edge_centrality, g)).
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
70 | weight_map(get(edge_weight, g)));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible<X, Y>::~Convertible() [with X = std::random_access_iterator_tag; Y = std::bidirectional_iterator_tag]’
37 | ~model()
| ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
208 | BOOST_CONCEPT_USAGE(Convertible) {
| ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Convertible<std::random_access_iterator_tag, std::random_access_iterator_tag>]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/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(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/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> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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);
| ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/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) );
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/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;
| ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3: required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >*, std::vector<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >, std::allocator<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > > > > > >]’
597 | BOOST_concept(RandomAccessIterator,(TT))
| ^~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map<RAIter, ID, typename std::iterator_traits< <template-parameter-1-1> >::value_type, typename std::iterator_traits< <template-parameter-1-1> >::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = __gnu_cxx::__normal_iterator<std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<undirected_tag, long unsigned int> > >*, std::vector<std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<undirected_tag, long unsigned int> > >, std::allocator<std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<undirected_tag, long unsigned int> > > > > >; ID = vec_adj_list_vertex_id_map<property<vertex_index_t, int, property<vertex_centrality_t, double> >, long unsigned int>; typename std::iterator_traits< <template-parameter-1-1> >::value_type = std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<undirected_tag, long unsigned int> > >; typename std::iterator_traits< <template-parameter-1-1> >::reference = std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<undirected_tag, long unsigned int> > >&]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:469:43: required from ‘void boost::detail::graph::brandes_betweenness_centrality_dispatch2(const Graph&, CentralityMap, EdgeCentralityMap, WeightMap, VertexIndexMap) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >; CentralityMap = boost::vec_adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >, boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_centrality_t>; WeightMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_weight_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>]’
469 | make_iterator_property_map(incoming.begin(), vertex_index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:517:57: required from ‘static void boost::detail::graph::brandes_betweenness_centrality_dispatch1<WeightMap>::run(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap, WeightMap) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >; CentralityMap = boost::vec_adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >, boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>; WeightMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_weight_t>]’
517 | brandes_betweenness_centrality_dispatch2(g, centrality,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~
518 | edge_centrality_map, weight_map, vertex_index);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:558:71: required from ‘void boost::brandes_betweenness_centrality(const Graph&, const bgl_named_params<T, Tag, Base>&, typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >; Param = adj_list_edge_property_map<undirected_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_centrality_t, double> >, edge_weight_t>; Tag = edge_weight_t; Rest = bgl_named_params<adj_list_edge_property_map<undirected_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_centrality_t, double> >, edge_centrality_t>, edge_centrality_t, bgl_named_params<vec_adj_list_vertex_property_map<adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >, adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >*, double, double&, vertex_centrality_t>, vertex_centrality_t, no_property> >; typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits<Graph>::traversal_category = undir_adj_list_traversal_tag]’
558 | detail::graph::brandes_betweenness_centrality_dispatch1< ew >::run(g,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
559 | choose_param(
| ~~~~~~~~~~~~~
560 | get_param(params, vertex_centrality), dummy_property_map()),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
561 | choose_param(get_param(params, edge_centrality), dummy_property_map()),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
562 | choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
563 | get_param(params, edge_weight));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
bbc.cpp:67:33: required from here
67 | brandes_betweenness_centrality(g,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
68 | centrality_map(get(vertex_centrality, g)).
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
69 | edge_centrality_map(get(edge_centrality, g)).
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
70 | weight_map(get(edge_weight, g)));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
20 | ~usage_requirements() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible<X, Y>::~Convertible() [with X = std::random_access_iterator_tag; Y = std::random_access_iterator_tag]’
37 | ~model()
| ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
208 | BOOST_CONCEPT_USAGE(Convertible) {
| ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Convertible<std::random_access_iterator_tag, std::input_iterator_tag>]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/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(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/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> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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);
| ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/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) );
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/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;
| ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 12 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_<void (*)(boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >*, std::vector<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >, std::allocator<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > > > > > >)>’
72 | struct requirement_<void(*)(Model)>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map<RAIter, ID, typename std::iterator_traits< <template-parameter-1-1> >::value_type, typename std::iterator_traits< <template-parameter-1-1> >::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = __gnu_cxx::__normal_iterator<std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<undirected_tag, long unsigned int> > >*, std::vector<std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<undirected_tag, long unsigned int> > >, std::allocator<std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<undirected_tag, long unsigned int> > > > > >; ID = vec_adj_list_vertex_id_map<property<vertex_index_t, int, property<vertex_centrality_t, double> >, long unsigned int>; typename std::iterator_traits< <template-parameter-1-1> >::value_type = std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<undirected_tag, long unsigned int> > >; typename std::iterator_traits< <template-parameter-1-1> >::reference = std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<undirected_tag, long unsigned int> > >&]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:469:43: required from ‘void boost::detail::graph::brandes_betweenness_centrality_dispatch2(const Graph&, CentralityMap, EdgeCentralityMap, WeightMap, VertexIndexMap) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >; CentralityMap = boost::vec_adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >, boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_centrality_t>; WeightMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_weight_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>]’
469 | make_iterator_property_map(incoming.begin(), vertex_index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:517:57: required from ‘static void boost::detail::graph::brandes_betweenness_centrality_dispatch1<WeightMap>::run(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap, WeightMap) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >; CentralityMap = boost::vec_adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >, boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>; WeightMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_weight_t>]’
517 | brandes_betweenness_centrality_dispatch2(g, centrality,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~
518 | edge_centrality_map, weight_map, vertex_index);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:558:71: required from ‘void boost::brandes_betweenness_centrality(const Graph&, const bgl_named_params<T, Tag, Base>&, typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >; Param = adj_list_edge_property_map<undirected_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_centrality_t, double> >, edge_weight_t>; Tag = edge_weight_t; Rest = bgl_named_params<adj_list_edge_property_map<undirected_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_centrality_t, double> >, edge_centrality_t>, edge_centrality_t, bgl_named_params<vec_adj_list_vertex_property_map<adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >, adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >*, double, double&, vertex_centrality_t>, vertex_centrality_t, no_property> >; typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits<Graph>::traversal_category = undir_adj_list_traversal_tag]’
558 | detail::graph::brandes_betweenness_centrality_dispatch1< ew >::run(g,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
559 | choose_param(
| ~~~~~~~~~~~~~
560 | get_param(params, vertex_centrality), dummy_property_map()),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
561 | choose_param(get_param(params, edge_centrality), dummy_property_map()),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
562 | choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
563 | get_param(params, edge_weight));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
bbc.cpp:67:33: required from here
67 | brandes_betweenness_centrality(g,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
68 | centrality_map(get(vertex_centrality, g)).
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
69 | edge_centrality_map(get(edge_centrality, g)).
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
70 | weight_map(get(edge_weight, g)));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
20 | ~usage_requirements() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible<X, Y>::~Convertible() [with X = std::random_access_iterator_tag; Y = std::input_iterator_tag]’
37 | ~model()
| ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
208 | BOOST_CONCEPT_USAGE(Convertible) {
| ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Convertible<std::random_access_iterator_tag, std::forward_iterator_tag>]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/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(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/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> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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);
| ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/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) );
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/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;
| ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 11 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_<void (*)(boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >*, std::vector<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >, std::allocator<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > > > > > >)>’
72 | struct requirement_<void(*)(Model)>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map<RAIter, ID, typename std::iterator_traits< <template-parameter-1-1> >::value_type, typename std::iterator_traits< <template-parameter-1-1> >::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = __gnu_cxx::__normal_iterator<std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<undirected_tag, long unsigned int> > >*, std::vector<std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<undirected_tag, long unsigned int> > >, std::allocator<std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<undirected_tag, long unsigned int> > > > > >; ID = vec_adj_list_vertex_id_map<property<vertex_index_t, int, property<vertex_centrality_t, double> >, long unsigned int>; typename std::iterator_traits< <template-parameter-1-1> >::value_type = std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<undirected_tag, long unsigned int> > >; typename std::iterator_traits< <template-parameter-1-1> >::reference = std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<undirected_tag, long unsigned int> > >&]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:469:43: required from ‘void boost::detail::graph::brandes_betweenness_centrality_dispatch2(const Graph&, CentralityMap, EdgeCentralityMap, WeightMap, VertexIndexMap) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >; CentralityMap = boost::vec_adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >, boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_centrality_t>; WeightMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_weight_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>]’
469 | make_iterator_property_map(incoming.begin(), vertex_index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:517:57: required from ‘static void boost::detail::graph::brandes_betweenness_centrality_dispatch1<WeightMap>::run(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap, WeightMap) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >; CentralityMap = boost::vec_adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >, boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>; WeightMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_weight_t>]’
517 | brandes_betweenness_centrality_dispatch2(g, centrality,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~
518 | edge_centrality_map, weight_map, vertex_index);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:558:71: required from ‘void boost::brandes_betweenness_centrality(const Graph&, const bgl_named_params<T, Tag, Base>&, typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >; Param = adj_list_edge_property_map<undirected_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_centrality_t, double> >, edge_weight_t>; Tag = edge_weight_t; Rest = bgl_named_params<adj_list_edge_property_map<undirected_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_centrality_t, double> >, edge_centrality_t>, edge_centrality_t, bgl_named_params<vec_adj_list_vertex_property_map<adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >, adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >*, double, double&, vertex_centrality_t>, vertex_centrality_t, no_property> >; typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits<Graph>::traversal_category = undir_adj_list_traversal_tag]’
558 | detail::graph::brandes_betweenness_centrality_dispatch1< ew >::run(g,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
559 | choose_param(
| ~~~~~~~~~~~~~
560 | get_param(params, vertex_centrality), dummy_property_map()),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
561 | choose_param(get_param(params, edge_centrality), dummy_property_map()),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
562 | choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
563 | get_param(params, edge_weight));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
bbc.cpp:67:33: required from here
67 | brandes_betweenness_centrality(g,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
68 | centrality_map(get(vertex_centrality, g)).
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
69 | edge_centrality_map(get(edge_centrality, g)).
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
70 | weight_map(get(edge_weight, g)));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
20 | ~usage_requirements() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible<X, Y>::~Convertible() [with X = std::random_access_iterator_tag; Y = std::forward_iterator_tag]’
37 | ~model()
| ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
208 | BOOST_CONCEPT_USAGE(Convertible) {
| ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Convertible<std::random_access_iterator_tag, std::bidirectional_iterator_tag>]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/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(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/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> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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);
| ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/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) );
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/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;
| ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 10 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_<void (*)(boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >*, std::vector<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >, std::allocator<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > > > > > >)>’
72 | struct requirement_<void(*)(Model)>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map<RAIter, ID, typename std::iterator_traits< <template-parameter-1-1> >::value_type, typename std::iterator_traits< <template-parameter-1-1> >::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = __gnu_cxx::__normal_iterator<std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<undirected_tag, long unsigned int> > >*, std::vector<std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<undirected_tag, long unsigned int> > >, std::allocator<std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<undirected_tag, long unsigned int> > > > > >; ID = vec_adj_list_vertex_id_map<property<vertex_index_t, int, property<vertex_centrality_t, double> >, long unsigned int>; typename std::iterator_traits< <template-parameter-1-1> >::value_type = std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<undirected_tag, long unsigned int> > >; typename std::iterator_traits< <template-parameter-1-1> >::reference = std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<undirected_tag, long unsigned int> > >&]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:469:43: required from ‘void boost::detail::graph::brandes_betweenness_centrality_dispatch2(const Graph&, CentralityMap, EdgeCentralityMap, WeightMap, VertexIndexMap) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >; CentralityMap = boost::vec_adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >, boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_centrality_t>; WeightMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_weight_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>]’
469 | make_iterator_property_map(incoming.begin(), vertex_index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:517:57: required from ‘static void boost::detail::graph::brandes_betweenness_centrality_dispatch1<WeightMap>::run(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap, WeightMap) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >; CentralityMap = boost::vec_adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >, boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>; WeightMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_weight_t>]’
517 | brandes_betweenness_centrality_dispatch2(g, centrality,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~
518 | edge_centrality_map, weight_map, vertex_index);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:558:71: required from ‘void boost::brandes_betweenness_centrality(const Graph&, const bgl_named_params<T, Tag, Base>&, typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >; Param = adj_list_edge_property_map<undirected_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_centrality_t, double> >, edge_weight_t>; Tag = edge_weight_t; Rest = bgl_named_params<adj_list_edge_property_map<undirected_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_centrality_t, double> >, edge_centrality_t>, edge_centrality_t, bgl_named_params<vec_adj_list_vertex_property_map<adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >, adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >*, double, double&, vertex_centrality_t>, vertex_centrality_t, no_property> >; typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits<Graph>::traversal_category = undir_adj_list_traversal_tag]’
558 | detail::graph::brandes_betweenness_centrality_dispatch1< ew >::run(g,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
559 | choose_param(
| ~~~~~~~~~~~~~
560 | get_param(params, vertex_centrality), dummy_property_map()),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
561 | choose_param(get_param(params, edge_centrality), dummy_property_map()),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
562 | choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
563 | get_param(params, edge_weight));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
bbc.cpp:67:33: required from here
67 | brandes_betweenness_centrality(g,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
68 | centrality_map(get(vertex_centrality, g)).
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
69 | edge_centrality_map(get(edge_centrality, g)).
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
70 | weight_map(get(edge_weight, g)));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
20 | ~usage_requirements() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible<X, Y>::~Convertible() [with X = std::random_access_iterator_tag; Y = std::bidirectional_iterator_tag]’
37 | ~model()
| ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
208 | BOOST_CONCEPT_USAGE(Convertible) {
| ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/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<boost::default_color_type*, std::vector<boost::default_color_type> > > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:145:5: required from ‘struct boost::Assignable<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> > >’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> > >’
502 | BOOST_concept(InputIterator,(TT))
| ^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:540:3: required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> > >’
540 | BOOST_concept(ForwardIterator,(TT))
| ^~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> > >’
568 | BOOST_concept(BidirectionalIterator,(TT))
| ^~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> > >’
597 | BOOST_concept(RandomAccessIterator,(TT))
| ^~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3: [ skipping 9 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:500:43: required from ‘void boost::detail::graph::brandes_betweenness_centrality_dispatch2(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >; CentralityMap = boost::dummy_property_map; EdgeCentralityMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>]’
500 | brandes_betweenness_centrality(g, centrality, edge_centrality_map,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
501 | make_iterator_property_map(incoming.begin(), vertex_index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
502 | make_iterator_property_map(distance.begin(), vertex_index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
503 | make_iterator_property_map(dependency.begin(), vertex_index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
504 | make_iterator_property_map(path_count.begin(), vertex_index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
505 | vertex_index);
| ~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:531:57: required from ‘static void boost::detail::graph::brandes_betweenness_centrality_dispatch1<boost::param_not_found>::run(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap, boost::param_not_found) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >; CentralityMap = boost::dummy_property_map; EdgeCentralityMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>]’
531 | brandes_betweenness_centrality_dispatch2(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
532 | g, centrality, edge_centrality_map, vertex_index);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:558:71: required from ‘void boost::brandes_betweenness_centrality(const Graph&, const bgl_named_params<T, Tag, Base>&, typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >; Param = vec_adj_list_vertex_id_map<property<vertex_index_t, int, property<vertex_centrality_t, double> >, long unsigned int>; Tag = vertex_index_t; Rest = bgl_named_params<adj_list_edge_property_map<undirected_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_centrality_t, double> >, edge_centrality_t>, edge_centrality_t, no_property>; typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits<Graph>::traversal_category = undir_adj_list_traversal_tag]’
558 | detail::graph::brandes_betweenness_centrality_dispatch1< ew >::run(g,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
559 | choose_param(
| ~~~~~~~~~~~~~
560 | get_param(params, vertex_centrality), dummy_property_map()),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
561 | choose_param(get_param(params, edge_centrality), dummy_property_map()),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
562 | choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
563 | get_param(params, edge_weight));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/bc_clustering.hpp:131:39: required from ‘void boost::betweenness_centrality_clustering(MutableGraph&, Done, EdgeCentralityMap, VertexIndexMap) [with MutableGraph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >; Done = clustering_threshold; EdgeCentralityMap = adj_list_edge_property_map<undirected_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_centrality_t, double> >, edge_centrality_t>; VertexIndexMap = vec_adj_list_vertex_id_map<property<vertex_index_t, int, property<vertex_centrality_t, double> >, long unsigned int>]’
131 | brandes_betweenness_centrality(g,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
132 | edge_centrality_map(edge_centrality)
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
133 | .vertex_index_map(vertex_index));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/bc_clustering.hpp:150:38: required from ‘void boost::betweenness_centrality_clustering(MutableGraph&, Done, EdgeCentralityMap) [with MutableGraph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >; Done = clustering_threshold; EdgeCentralityMap = adj_list_edge_property_map<undirected_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_centrality_t, double> >, edge_centrality_t>]’
150 | betweenness_centrality_clustering(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
151 | g, done, edge_centrality, get(vertex_index, g));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
bbc.cpp:149:36: required from here
149 | betweenness_centrality_clustering(g,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
150 | clustering_threshold(threshold, g, normalize),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
151 | get(edge_centrality, g));
| ~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/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<boost::default_color_type*, std::vector<boost::default_color_type> > >]’
20 | ~usage_requirements() { ((Model*)0)->~Model(); }
| ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/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<boost::default_color_type*, std::vector<boost::default_color_type> > > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> > >’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> > >’
502 | BOOST_concept(InputIterator,(TT))
| ^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:540:3: required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> > >’
540 | BOOST_concept(ForwardIterator,(TT))
| ^~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> > >’
568 | BOOST_concept(BidirectionalIterator,(TT))
| ^~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> > >’
597 | BOOST_concept(RandomAccessIterator,(TT))
| ^~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3: [ skipping 9 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:500:43: required from ‘void boost::detail::graph::brandes_betweenness_centrality_dispatch2(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >; CentralityMap = boost::dummy_property_map; EdgeCentralityMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>]’
500 | brandes_betweenness_centrality(g, centrality, edge_centrality_map,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
501 | make_iterator_property_map(incoming.begin(), vertex_index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
502 | make_iterator_property_map(distance.begin(), vertex_index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
503 | make_iterator_property_map(dependency.begin(), vertex_index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
504 | make_iterator_property_map(path_count.begin(), vertex_index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
505 | vertex_index);
| ~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:531:57: required from ‘static void boost::detail::graph::brandes_betweenness_centrality_dispatch1<boost::param_not_found>::run(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap, boost::param_not_found) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >; CentralityMap = boost::dummy_property_map; EdgeCentralityMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>]’
531 | brandes_betweenness_centrality_dispatch2(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
532 | g, centrality, edge_centrality_map, vertex_index);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:558:71: required from ‘void boost::brandes_betweenness_centrality(const Graph&, const bgl_named_params<T, Tag, Base>&, typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >; Param = vec_adj_list_vertex_id_map<property<vertex_index_t, int, property<vertex_centrality_t, double> >, long unsigned int>; Tag = vertex_index_t; Rest = bgl_named_params<adj_list_edge_property_map<undirected_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_centrality_t, double> >, edge_centrality_t>, edge_centrality_t, no_property>; typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits<Graph>::traversal_category = undir_adj_list_traversal_tag]’
558 | detail::graph::brandes_betweenness_centrality_dispatch1< ew >::run(g,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
559 | choose_param(
| ~~~~~~~~~~~~~
560 | get_param(params, vertex_centrality), dummy_property_map()),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
561 | choose_param(get_param(params, edge_centrality), dummy_property_map()),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
562 | choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
563 | get_param(params, edge_weight));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/bc_clustering.hpp:131:39: required from ‘void boost::betweenness_centrality_clustering(MutableGraph&, Done, EdgeCentralityMap, VertexIndexMap) [with MutableGraph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >; Done = clustering_threshold; EdgeCentralityMap = adj_list_edge_property_map<undirected_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_centrality_t, double> >, edge_centrality_t>; VertexIndexMap = vec_adj_list_vertex_id_map<property<vertex_index_t, int, property<vertex_centrality_t, double> >, long unsigned int>]’
131 | brandes_betweenness_centrality(g,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
132 | edge_centrality_map(edge_centrality)
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
133 | .vertex_index_map(vertex_index));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/bc_clustering.hpp:150:38: required from ‘void boost::betweenness_centrality_clustering(MutableGraph&, Done, EdgeCentralityMap) [with MutableGraph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >; Done = clustering_threshold; EdgeCentralityMap = adj_list_edge_property_map<undirected_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_centrality_t, double> >, edge_centrality_t>]’
150 | betweenness_centrality_clustering(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
151 | g, done, edge_centrality, get(vertex_index, g));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
bbc.cpp:149:36: required from here
149 | betweenness_centrality_clustering(g,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
150 | clustering_threshold(threshold, g, normalize),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
151 | get(edge_centrality, g));
| ~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/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<boost::default_color_type*, std::vector<boost::default_color_type> > >]’
20 | ~usage_requirements() { ((Model*)0)->~Model(); }
| ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/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<boost::default_color_type*, std::vector<boost::default_color_type> > > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:512:7: required from ‘struct boost::InputIterator<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> > >’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:540:3: required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> > >’
540 | BOOST_concept(ForwardIterator,(TT))
| ^~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> > >’
568 | BOOST_concept(BidirectionalIterator,(TT))
| ^~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> > >’
597 | BOOST_concept(RandomAccessIterator,(TT))
| ^~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> > >’
597 | BOOST_concept(RandomAccessIterator,(TT))
| ^~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: [ skipping 8 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:500:43: required from ‘void boost::detail::graph::brandes_betweenness_centrality_dispatch2(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >; CentralityMap = boost::dummy_property_map; EdgeCentralityMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>]’
500 | brandes_betweenness_centrality(g, centrality, edge_centrality_map,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
501 | make_iterator_property_map(incoming.begin(), vertex_index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
502 | make_iterator_property_map(distance.begin(), vertex_index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
503 | make_iterator_property_map(dependency.begin(), vertex_index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
504 | make_iterator_property_map(path_count.begin(), vertex_index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
505 | vertex_index);
| ~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:531:57: required from ‘static void boost::detail::graph::brandes_betweenness_centrality_dispatch1<boost::param_not_found>::run(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap, boost::param_not_found) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >; CentralityMap = boost::dummy_property_map; EdgeCentralityMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>]’
531 | brandes_betweenness_centrality_dispatch2(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
532 | g, centrality, edge_centrality_map, vertex_index);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:558:71: required from ‘void boost::brandes_betweenness_centrality(const Graph&, const bgl_named_params<T, Tag, Base>&, typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >; Param = vec_adj_list_vertex_id_map<property<vertex_index_t, int, property<vertex_centrality_t, double> >, long unsigned int>; Tag = vertex_index_t; Rest = bgl_named_params<adj_list_edge_property_map<undirected_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_centrality_t, double> >, edge_centrality_t>, edge_centrality_t, no_property>; typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits<Graph>::traversal_category = undir_adj_list_traversal_tag]’
558 | detail::graph::brandes_betweenness_centrality_dispatch1< ew >::run(g,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
559 | choose_param(
| ~~~~~~~~~~~~~
560 | get_param(params, vertex_centrality), dummy_property_map()),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
561 | choose_param(get_param(params, edge_centrality), dummy_property_map()),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
562 | choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
563 | get_param(params, edge_weight));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/bc_clustering.hpp:131:39: required from ‘void boost::betweenness_centrality_clustering(MutableGraph&, Done, EdgeCentralityMap, VertexIndexMap) [with MutableGraph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >; Done = clustering_threshold; EdgeCentralityMap = adj_list_edge_property_map<undirected_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_centrality_t, double> >, edge_centrality_t>; VertexIndexMap = vec_adj_list_vertex_id_map<property<vertex_index_t, int, property<vertex_centrality_t, double> >, long unsigned int>]’
131 | brandes_betweenness_centrality(g,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
132 | edge_centrality_map(edge_centrality)
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
133 | .vertex_index_map(vertex_index));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/bc_clustering.hpp:150:38: required from ‘void boost::betweenness_centrality_clustering(MutableGraph&, Done, EdgeCentralityMap) [with MutableGraph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >; Done = clustering_threshold; EdgeCentralityMap = adj_list_edge_property_map<undirected_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_centrality_t, double> >, edge_centrality_t>]’
150 | betweenness_centrality_clustering(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
151 | g, done, edge_centrality, get(vertex_index, g));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
bbc.cpp:149:36: required from here
149 | betweenness_centrality_clustering(g,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
150 | clustering_threshold(threshold, g, normalize),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
151 | get(edge_centrality, g));
| ~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/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<boost::default_color_type*, std::vector<boost::default_color_type> > >]’
20 | ~usage_requirements() { ((Model*)0)->~Model(); }
| ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/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<boost::default_color_type*, std::vector<boost::default_color_type> > > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:543:7: required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> > >’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> > >’
568 | BOOST_concept(BidirectionalIterator,(TT))
| ^~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> > >’
597 | BOOST_concept(RandomAccessIterator,(TT))
| ^~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> > >’
597 | BOOST_concept(RandomAccessIterator,(TT))
| ^~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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<boost::default_color_type*, std::vector<boost::default_color_type> > >]’
32 | inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
| ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5: [ skipping 7 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:500:43: required from ‘void boost::detail::graph::brandes_betweenness_centrality_dispatch2(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >; CentralityMap = boost::dummy_property_map; EdgeCentralityMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>]’
500 | brandes_betweenness_centrality(g, centrality, edge_centrality_map,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
501 | make_iterator_property_map(incoming.begin(), vertex_index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
502 | make_iterator_property_map(distance.begin(), vertex_index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
503 | make_iterator_property_map(dependency.begin(), vertex_index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
504 | make_iterator_property_map(path_count.begin(), vertex_index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
505 | vertex_index);
| ~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:531:57: required from ‘static void boost::detail::graph::brandes_betweenness_centrality_dispatch1<boost::param_not_found>::run(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap, boost::param_not_found) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >; CentralityMap = boost::dummy_property_map; EdgeCentralityMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>]’
531 | brandes_betweenness_centrality_dispatch2(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
532 | g, centrality, edge_centrality_map, vertex_index);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:558:71: required from ‘void boost::brandes_betweenness_centrality(const Graph&, const bgl_named_params<T, Tag, Base>&, typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >; Param = vec_adj_list_vertex_id_map<property<vertex_index_t, int, property<vertex_centrality_t, double> >, long unsigned int>; Tag = vertex_index_t; Rest = bgl_named_params<adj_list_edge_property_map<undirected_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_centrality_t, double> >, edge_centrality_t>, edge_centrality_t, no_property>; typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits<Graph>::traversal_category = undir_adj_list_traversal_tag]’
558 | detail::graph::brandes_betweenness_centrality_dispatch1< ew >::run(g,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
559 | choose_param(
| ~~~~~~~~~~~~~
560 | get_param(params, vertex_centrality), dummy_property_map()),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
561 | choose_param(get_param(params, edge_centrality), dummy_property_map()),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
562 | choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
563 | get_param(params, edge_weight));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/bc_clustering.hpp:131:39: required from ‘void boost::betweenness_centrality_clustering(MutableGraph&, Done, EdgeCentralityMap, VertexIndexMap) [with MutableGraph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >; Done = clustering_threshold; EdgeCentralityMap = adj_list_edge_property_map<undirected_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_centrality_t, double> >, edge_centrality_t>; VertexIndexMap = vec_adj_list_vertex_id_map<property<vertex_index_t, int, property<vertex_centrality_t, double> >, long unsigned int>]’
131 | brandes_betweenness_centrality(g,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
132 | edge_centrality_map(edge_centrality)
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
133 | .vertex_index_map(vertex_index));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/bc_clustering.hpp:150:38: required from ‘void boost::betweenness_centrality_clustering(MutableGraph&, Done, EdgeCentralityMap) [with MutableGraph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >; Done = clustering_threshold; EdgeCentralityMap = adj_list_edge_property_map<undirected_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_centrality_t, double> >, edge_centrality_t>]’
150 | betweenness_centrality_clustering(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
151 | g, done, edge_centrality, get(vertex_index, g));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
bbc.cpp:149:36: required from here
149 | betweenness_centrality_clustering(g,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
150 | clustering_threshold(threshold, g, normalize),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
151 | get(edge_centrality, g));
| ~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/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<boost::default_color_type*, std::vector<boost::default_color_type> > >]’
20 | ~usage_requirements() { ((Model*)0)->~Model(); }
| ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/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<boost::default_color_type*, std::vector<boost::default_color_type> > > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:571:7: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> > >’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> > >’
597 | BOOST_concept(RandomAccessIterator,(TT))
| ^~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> > >’
597 | BOOST_concept(RandomAccessIterator,(TT))
| ^~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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<boost::default_color_type*, std::vector<boost::default_color_type> > >]’
32 | inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
| ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied<boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> > > >::value’
44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 6 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:500:43: required from ‘void boost::detail::graph::brandes_betweenness_centrality_dispatch2(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >; CentralityMap = boost::dummy_property_map; EdgeCentralityMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>]’
500 | brandes_betweenness_centrality(g, centrality, edge_centrality_map,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
501 | make_iterator_property_map(incoming.begin(), vertex_index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
502 | make_iterator_property_map(distance.begin(), vertex_index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
503 | make_iterator_property_map(dependency.begin(), vertex_index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
504 | make_iterator_property_map(path_count.begin(), vertex_index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
505 | vertex_index);
| ~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:531:57: required from ‘static void boost::detail::graph::brandes_betweenness_centrality_dispatch1<boost::param_not_found>::run(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap, boost::param_not_found) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >; CentralityMap = boost::dummy_property_map; EdgeCentralityMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>]’
531 | brandes_betweenness_centrality_dispatch2(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
532 | g, centrality, edge_centrality_map, vertex_index);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:558:71: required from ‘void boost::brandes_betweenness_centrality(const Graph&, const bgl_named_params<T, Tag, Base>&, typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >; Param = vec_adj_list_vertex_id_map<property<vertex_index_t, int, property<vertex_centrality_t, double> >, long unsigned int>; Tag = vertex_index_t; Rest = bgl_named_params<adj_list_edge_property_map<undirected_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_centrality_t, double> >, edge_centrality_t>, edge_centrality_t, no_property>; typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits<Graph>::traversal_category = undir_adj_list_traversal_tag]’
558 | detail::graph::brandes_betweenness_centrality_dispatch1< ew >::run(g,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
559 | choose_param(
| ~~~~~~~~~~~~~
560 | get_param(params, vertex_centrality), dummy_property_map()),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
561 | choose_param(get_param(params, edge_centrality), dummy_property_map()),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
562 | choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
563 | get_param(params, edge_weight));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/bc_clustering.hpp:131:39: required from ‘void boost::betweenness_centrality_clustering(MutableGraph&, Done, EdgeCentralityMap, VertexIndexMap) [with MutableGraph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >; Done = clustering_threshold; EdgeCentralityMap = adj_list_edge_property_map<undirected_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_centrality_t, double> >, edge_centrality_t>; VertexIndexMap = vec_adj_list_vertex_id_map<property<vertex_index_t, int, property<vertex_centrality_t, double> >, long unsigned int>]’
131 | brandes_betweenness_centrality(g,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
132 | edge_centrality_map(edge_centrality)
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
133 | .vertex_index_map(vertex_index));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/bc_clustering.hpp:150:38: required from ‘void boost::betweenness_centrality_clustering(MutableGraph&, Done, EdgeCentralityMap) [with MutableGraph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >; Done = clustering_threshold; EdgeCentralityMap = adj_list_edge_property_map<undirected_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_centrality_t, double> >, edge_centrality_t>]’
150 | betweenness_centrality_clustering(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
151 | g, done, edge_centrality, get(vertex_index, g));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
bbc.cpp:149:36: required from here
149 | betweenness_centrality_clustering(g,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
150 | clustering_threshold(threshold, g, normalize),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
151 | get(edge_centrality, g));
| ~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/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<boost::default_color_type*, std::vector<boost::default_color_type> > >]’
20 | ~usage_requirements() { ((Model*)0)->~Model(); }
| ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/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<boost::default_color_type*, std::vector<boost::default_color_type> > > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:253:5: required from ‘struct boost::Comparable<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> > >’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> > >’
597 | BOOST_concept(RandomAccessIterator,(TT))
| ^~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> > >’
597 | BOOST_concept(RandomAccessIterator,(TT))
| ^~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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<boost::default_color_type*, std::vector<boost::default_color_type> > >]’
32 | inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
| ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied<boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> > > >::value’
44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 6 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:500:43: required from ‘void boost::detail::graph::brandes_betweenness_centrality_dispatch2(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >; CentralityMap = boost::dummy_property_map; EdgeCentralityMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>]’
500 | brandes_betweenness_centrality(g, centrality, edge_centrality_map,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
501 | make_iterator_property_map(incoming.begin(), vertex_index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
502 | make_iterator_property_map(distance.begin(), vertex_index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
503 | make_iterator_property_map(dependency.begin(), vertex_index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
504 | make_iterator_property_map(path_count.begin(), vertex_index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
505 | vertex_index);
| ~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:531:57: required from ‘static void boost::detail::graph::brandes_betweenness_centrality_dispatch1<boost::param_not_found>::run(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap, boost::param_not_found) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >; CentralityMap = boost::dummy_property_map; EdgeCentralityMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>]’
531 | brandes_betweenness_centrality_dispatch2(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
532 | g, centrality, edge_centrality_map, vertex_index);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:558:71: required from ‘void boost::brandes_betweenness_centrality(const Graph&, const bgl_named_params<T, Tag, Base>&, typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >; Param = vec_adj_list_vertex_id_map<property<vertex_index_t, int, property<vertex_centrality_t, double> >, long unsigned int>; Tag = vertex_index_t; Rest = bgl_named_params<adj_list_edge_property_map<undirected_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_centrality_t, double> >, edge_centrality_t>, edge_centrality_t, no_property>; typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits<Graph>::traversal_category = undir_adj_list_traversal_tag]’
558 | detail::graph::brandes_betweenness_centrality_dispatch1< ew >::run(g,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
559 | choose_param(
| ~~~~~~~~~~~~~
560 | get_param(params, vertex_centrality), dummy_property_map()),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
561 | choose_param(get_param(params, edge_centrality), dummy_property_map()),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
562 | choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
563 | get_param(params, edge_weight));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/bc_clustering.hpp:131:39: required from ‘void boost::betweenness_centrality_clustering(MutableGraph&, Done, EdgeCentralityMap, VertexIndexMap) [with MutableGraph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >; Done = clustering_threshold; EdgeCentralityMap = adj_list_edge_property_map<undirected_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_centrality_t, double> >, edge_centrality_t>; VertexIndexMap = vec_adj_list_vertex_id_map<property<vertex_index_t, int, property<vertex_centrality_t, double> >, long unsigned int>]’
131 | brandes_betweenness_centrality(g,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
132 | edge_centrality_map(edge_centrality)
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
133 | .vertex_index_map(vertex_index));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/bc_clustering.hpp:150:38: required from ‘void boost::betweenness_centrality_clustering(MutableGraph&, Done, EdgeCentralityMap) [with MutableGraph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >; Done = clustering_threshold; EdgeCentralityMap = adj_list_edge_property_map<undirected_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_centrality_t, double> >, edge_centrality_t>]’
150 | betweenness_centrality_clustering(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
151 | g, done, edge_centrality, get(vertex_index, g));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
bbc.cpp:149:36: required from here
149 | betweenness_centrality_clustering(g,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
150 | clustering_threshold(threshold, g, normalize),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
151 | get(edge_centrality, g));
| ~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/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<boost::default_color_type*, std::vector<boost::default_color_type> > >]’
20 | ~usage_requirements() { ((Model*)0)->~Model(); }
| ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/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<boost::default_color_type*, std::vector<boost::default_color_type> > > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:601:7: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> > >’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> > >’
597 | BOOST_concept(RandomAccessIterator,(TT))
| ^~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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<boost::default_color_type*, std::vector<boost::default_color_type> > >]’
32 | inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
| ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied<boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> > > >::value’
44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied<boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> > > >’
45 | typedef boost::integral_constant<bool, value> type;
| ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:500:43: required from ‘void boost::detail::graph::brandes_betweenness_centrality_dispatch2(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >; CentralityMap = boost::dummy_property_map; EdgeCentralityMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>]’
500 | brandes_betweenness_centrality(g, centrality, edge_centrality_map,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
501 | make_iterator_property_map(incoming.begin(), vertex_index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
502 | make_iterator_property_map(distance.begin(), vertex_index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
503 | make_iterator_property_map(dependency.begin(), vertex_index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
504 | make_iterator_property_map(path_count.begin(), vertex_index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
505 | vertex_index);
| ~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:531:57: required from ‘static void boost::detail::graph::brandes_betweenness_centrality_dispatch1<boost::param_not_found>::run(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap, boost::param_not_found) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >; CentralityMap = boost::dummy_property_map; EdgeCentralityMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>]’
531 | brandes_betweenness_centrality_dispatch2(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
532 | g, centrality, edge_centrality_map, vertex_index);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:558:71: required from ‘void boost::brandes_betweenness_centrality(const Graph&, const bgl_named_params<T, Tag, Base>&, typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >; Param = vec_adj_list_vertex_id_map<property<vertex_index_t, int, property<vertex_centrality_t, double> >, long unsigned int>; Tag = vertex_index_t; Rest = bgl_named_params<adj_list_edge_property_map<undirected_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_centrality_t, double> >, edge_centrality_t>, edge_centrality_t, no_property>; typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits<Graph>::traversal_category = undir_adj_list_traversal_tag]’
558 | detail::graph::brandes_betweenness_centrality_dispatch1< ew >::run(g,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
559 | choose_param(
| ~~~~~~~~~~~~~
560 | get_param(params, vertex_centrality), dummy_property_map()),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
561 | choose_param(get_param(params, edge_centrality), dummy_property_map()),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
562 | choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
563 | get_param(params, edge_weight));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/bc_clustering.hpp:131:39: required from ‘void boost::betweenness_centrality_clustering(MutableGraph&, Done, EdgeCentralityMap, VertexIndexMap) [with MutableGraph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >; Done = clustering_threshold; EdgeCentralityMap = adj_list_edge_property_map<undirected_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_centrality_t, double> >, edge_centrality_t>; VertexIndexMap = vec_adj_list_vertex_id_map<property<vertex_index_t, int, property<vertex_centrality_t, double> >, long unsigned int>]’
131 | brandes_betweenness_centrality(g,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
132 | edge_centrality_map(edge_centrality)
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
133 | .vertex_index_map(vertex_index));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/bc_clustering.hpp:150:38: required from ‘void boost::betweenness_centrality_clustering(MutableGraph&, Done, EdgeCentralityMap) [with MutableGraph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >; Done = clustering_threshold; EdgeCentralityMap = adj_list_edge_property_map<undirected_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_centrality_t, double> >, edge_centrality_t>]’
150 | betweenness_centrality_clustering(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
151 | g, done, edge_centrality, get(vertex_index, g));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
bbc.cpp:149:36: required from here
149 | betweenness_centrality_clustering(g,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
150 | clustering_threshold(threshold, g, normalize),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
151 | get(edge_centrality, g));
| ~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/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<boost::default_color_type*, std::vector<boost::default_color_type> > >]’
20 | ~usage_requirements() { ((Model*)0)->~Model(); }
| ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/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<boost::default_color_type*, std::vector<boost::default_color_type> > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map<RAIter, ID, typename std::iterator_traits< <template-parameter-1-1> >::value_type, typename std::iterator_traits< <template-parameter-1-1> >::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = __gnu_cxx::__normal_iterator<default_color_type*, std::vector<default_color_type> >; ID = vec_adj_list_vertex_id_map<property<vertex_index_t, int, property<vertex_centrality_t, double> >, long unsigned int>; typename std::iterator_traits< <template-parameter-1-1> >::value_type = default_color_type; typename std::iterator_traits< <template-parameter-1-1> >::reference = default_color_type&]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:249:47: required from ‘void boost::detail::graph::brandes_unweighted_shortest_paths::operator()(Graph&, typename boost::graph_traits<Graph>::vertex_descriptor, std::stack<typename boost::graph_traits<Graph>::vertex_descriptor>&, IncomingMap, DistanceMap, PathCountMap, VertexIndexMap) [with Graph = const boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >; IncomingMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >*, std::vector<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >, std::allocator<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > > > > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>, std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >, std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >&>; DistanceMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>, double, double&>; PathCountMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’
249 | make_iterator_property_map(colors.begin(), vertex_index));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:349:31: required from ‘void boost::detail::graph::brandes_betweenness_centrality_impl(const Graph&, CentralityMap, EdgeCentralityMap, IncomingMap, DistanceMap, DependencyMap, PathCountMap, VertexIndexMap, ShortestPaths) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >; CentralityMap = boost::dummy_property_map; EdgeCentralityMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_centrality_t>; IncomingMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >*, std::vector<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >, std::allocator<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > > > > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>, std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >, std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >&>; DistanceMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>, double, double&>; DependencyMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>, double, double&>; PathCountMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>; ShortestPaths = brandes_unweighted_shortest_paths]’
349 | shortest_paths(g, *s, ordered_vertices, incoming, distance,
| ~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
350 | path_count, vertex_index);
| ~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:412:55: required from ‘void boost::brandes_betweenness_centrality(const Graph&, CentralityMap, EdgeCentralityMap, IncomingMap, DistanceMap, DependencyMap, PathCountMap, VertexIndexMap, typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >; CentralityMap = dummy_property_map; EdgeCentralityMap = adj_list_edge_property_map<undirected_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_centrality_t, double> >, edge_centrality_t>; IncomingMap = iterator_property_map<__gnu_cxx::__normal_iterator<std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<undirected_tag, long unsigned int> > >*, std::vector<std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<undirected_tag, long unsigned int> > >, std::allocator<std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<undirected_tag, long unsigned int> > > > > >, vec_adj_list_vertex_id_map<property<vertex_index_t, int, property<vertex_centrality_t, double> >, long unsigned int>, std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<undirected_tag, long unsigned int> > >, std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<undirected_tag, long unsigned int> > >&>; DistanceMap = iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > >, vec_adj_list_vertex_id_map<property<vertex_index_t, int, property<vertex_centrality_t, double> >, long unsigned int>, double, double&>; DependencyMap = iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > >, vec_adj_list_vertex_id_map<property<vertex_index_t, int, property<vertex_centrality_t, double> >, long unsigned int>, double, double&>; PathCountMap = iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > >, vec_adj_list_vertex_id_map<property<vertex_index_t, int, property<vertex_centrality_t, double> >, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = vec_adj_list_vertex_id_map<property<vertex_index_t, int, property<vertex_centrality_t, double> >, long unsigned int>; typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits<Graph>::traversal_category = undir_adj_list_traversal_tag]’
412 | detail::graph::brandes_betweenness_centrality_impl(g, centrality,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~
413 | edge_centrality_map, incoming, distance, dependency, path_count,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
414 | vertex_index, shortest_paths);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:500:43: required from ‘void boost::detail::graph::brandes_betweenness_centrality_dispatch2(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >; CentralityMap = boost::dummy_property_map; EdgeCentralityMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>]’
500 | brandes_betweenness_centrality(g, centrality, edge_centrality_map,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
501 | make_iterator_property_map(incoming.begin(), vertex_index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
502 | make_iterator_property_map(distance.begin(), vertex_index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
503 | make_iterator_property_map(dependency.begin(), vertex_index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
504 | make_iterator_property_map(path_count.begin(), vertex_index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
505 | vertex_index);
| ~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:531:57: required from ‘static void boost::detail::graph::brandes_betweenness_centrality_dispatch1<boost::param_not_found>::run(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap, boost::param_not_found) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >; CentralityMap = boost::dummy_property_map; EdgeCentralityMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>]’
531 | brandes_betweenness_centrality_dispatch2(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
532 | g, centrality, edge_centrality_map, vertex_index);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:558:71: required from ‘void boost::brandes_betweenness_centrality(const Graph&, const bgl_named_params<T, Tag, Base>&, typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >; Param = vec_adj_list_vertex_id_map<property<vertex_index_t, int, property<vertex_centrality_t, double> >, long unsigned int>; Tag = vertex_index_t; Rest = bgl_named_params<adj_list_edge_property_map<undirected_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_centrality_t, double> >, edge_centrality_t>, edge_centrality_t, no_property>; typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits<Graph>::traversal_category = undir_adj_list_traversal_tag]’
558 | detail::graph::brandes_betweenness_centrality_dispatch1< ew >::run(g,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
559 | choose_param(
| ~~~~~~~~~~~~~
560 | get_param(params, vertex_centrality), dummy_property_map()),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
561 | choose_param(get_param(params, edge_centrality), dummy_property_map()),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
562 | choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
563 | get_param(params, edge_weight));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/bc_clustering.hpp:131:39: required from ‘void boost::betweenness_centrality_clustering(MutableGraph&, Done, EdgeCentralityMap, VertexIndexMap) [with MutableGraph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >; Done = clustering_threshold; EdgeCentralityMap = adj_list_edge_property_map<undirected_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_centrality_t, double> >, edge_centrality_t>; VertexIndexMap = vec_adj_list_vertex_id_map<property<vertex_index_t, int, property<vertex_centrality_t, double> >, long unsigned int>]’
131 | brandes_betweenness_centrality(g,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
132 | edge_centrality_map(edge_centrality)
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
133 | .vertex_index_map(vertex_index));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/bc_clustering.hpp:150:38: required from ‘void boost::betweenness_centrality_clustering(MutableGraph&, Done, EdgeCentralityMap) [with MutableGraph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >; Done = clustering_threshold; EdgeCentralityMap = adj_list_edge_property_map<undirected_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_centrality_t, double> >, edge_centrality_t>]’
150 | betweenness_centrality_clustering(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
151 | g, done, edge_centrality, get(vertex_index, g));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
bbc.cpp:149:36: required from here
149 | betweenness_centrality_clustering(g,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
150 | clustering_threshold(threshold, g, normalize),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
151 | get(edge_centrality, g));
| ~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:17: note: in a call to non-static member function ‘boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> > >::~RandomAccessIteratorConcept()’
597 | BOOST_concept(RandomAccessIterator,(TT))
| ^~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/preprocessor/cat.hpp:29:34: note: in definition of macro ‘BOOST_PP_CAT_I’
29 | # define BOOST_PP_CAT_I(a, b) a ## b
| ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/concept_def.hpp:23:12: note: in expansion of macro ‘BOOST_PP_CAT’
23 | struct BOOST_PP_CAT(name,Concept) \
| ^~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3: note: in expansion of macro ‘BOOST_concept’
597 | BOOST_concept(RandomAccessIterator,(TT))
| ^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Assignable<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/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<boost::default_color_type*, std::vector<boost::default_color_type> > > >]’
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:145:5: required from ‘struct boost::Assignable<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> > >’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> > >’
502 | BOOST_concept(InputIterator,(TT))
| ^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:540:3: required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> > >’
540 | BOOST_concept(ForwardIterator,(TT))
| ^~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> > >’
568 | BOOST_concept(BidirectionalIterator,(TT))
| ^~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3: [ skipping 10 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:500:43: required from ‘void boost::detail::graph::brandes_betweenness_centrality_dispatch2(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >; CentralityMap = boost::dummy_property_map; EdgeCentralityMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>]’
500 | brandes_betweenness_centrality(g, centrality, edge_centrality_map,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
501 | make_iterator_property_map(incoming.begin(), vertex_index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
502 | make_iterator_property_map(distance.begin(), vertex_index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
503 | make_iterator_property_map(dependency.begin(), vertex_index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
504 | make_iterator_property_map(path_count.begin(), vertex_index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
505 | vertex_index);
| ~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:531:57: required from ‘static void boost::detail::graph::brandes_betweenness_centrality_dispatch1<boost::param_not_found>::run(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap, boost::param_not_found) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >; CentralityMap = boost::dummy_property_map; EdgeCentralityMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>]’
531 | brandes_betweenness_centrality_dispatch2(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
532 | g, centrality, edge_centrality_map, vertex_index);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:558:71: required from ‘void boost::brandes_betweenness_centrality(const Graph&, const bgl_named_params<T, Tag, Base>&, typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >; Param = vec_adj_list_vertex_id_map<property<vertex_index_t, int, property<vertex_centrality_t, double> >, long unsigned int>; Tag = vertex_index_t; Rest = bgl_named_params<adj_list_edge_property_map<undirected_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_centrality_t, double> >, edge_centrality_t>, edge_centrality_t, no_property>; typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits<Graph>::traversal_category = undir_adj_list_traversal_tag]’
558 | detail::graph::brandes_betweenness_centrality_dispatch1< ew >::run(g,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
559 | choose_param(
| ~~~~~~~~~~~~~
560 | get_param(params, vertex_centrality), dummy_property_map()),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
561 | choose_param(get_param(params, edge_centrality), dummy_property_map()),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
562 | choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
563 | get_param(params, edge_weight));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/bc_clustering.hpp:131:39: required from ‘void boost::betweenness_centrality_clustering(MutableGraph&, Done, EdgeCentralityMap, VertexIndexMap) [with MutableGraph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >; Done = clustering_threshold; EdgeCentralityMap = adj_list_edge_property_map<undirected_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_centrality_t, double> >, edge_centrality_t>; VertexIndexMap = vec_adj_list_vertex_id_map<property<vertex_index_t, int, property<vertex_centrality_t, double> >, long unsigned int>]’
131 | brandes_betweenness_centrality(g,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
132 | edge_centrality_map(edge_centrality)
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
133 | .vertex_index_map(vertex_index));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/bc_clustering.hpp:150:38: required from ‘void boost::betweenness_centrality_clustering(MutableGraph&, Done, EdgeCentralityMap) [with MutableGraph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >; Done = clustering_threshold; EdgeCentralityMap = adj_list_edge_property_map<undirected_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_centrality_t, double> >, edge_centrality_t>]’
150 | betweenness_centrality_clustering(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
151 | g, done, edge_centrality, get(vertex_index, g));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
bbc.cpp:149:36: required from here
149 | betweenness_centrality_clustering(g,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
150 | clustering_threshold(threshold, g, normalize),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
151 | get(edge_centrality, g));
| ~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
20 | ~usage_requirements() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/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<boost::default_color_type*, std::vector<boost::default_color_type> >]’
37 | ~model()
| ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:145:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
145 | BOOST_CONCEPT_USAGE(Assignable) {
| ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::EqualityComparable<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/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<boost::default_color_type*, std::vector<boost::default_color_type> > > >]’
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> > >’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> > >’
502 | BOOST_concept(InputIterator,(TT))
| ^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:540:3: required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> > >’
540 | BOOST_concept(ForwardIterator,(TT))
| ^~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> > >’
568 | BOOST_concept(BidirectionalIterator,(TT))
| ^~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3: [ skipping 10 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:500:43: required from ‘void boost::detail::graph::brandes_betweenness_centrality_dispatch2(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >; CentralityMap = boost::dummy_property_map; EdgeCentralityMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>]’
500 | brandes_betweenness_centrality(g, centrality, edge_centrality_map,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
501 | make_iterator_property_map(incoming.begin(), vertex_index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
502 | make_iterator_property_map(distance.begin(), vertex_index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
503 | make_iterator_property_map(dependency.begin(), vertex_index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
504 | make_iterator_property_map(path_count.begin(), vertex_index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
505 | vertex_index);
| ~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:531:57: required from ‘static void boost::detail::graph::brandes_betweenness_centrality_dispatch1<boost::param_not_found>::run(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap, boost::param_not_found) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >; CentralityMap = boost::dummy_property_map; EdgeCentralityMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>]’
531 | brandes_betweenness_centrality_dispatch2(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
532 | g, centrality, edge_centrality_map, vertex_index);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:558:71: required from ‘void boost::brandes_betweenness_centrality(const Graph&, const bgl_named_params<T, Tag, Base>&, typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >; Param = vec_adj_list_vertex_id_map<property<vertex_index_t, int, property<vertex_centrality_t, double> >, long unsigned int>; Tag = vertex_index_t; Rest = bgl_named_params<adj_list_edge_property_map<undirected_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_centrality_t, double> >, edge_centrality_t>, edge_centrality_t, no_property>; typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits<Graph>::traversal_category = undir_adj_list_traversal_tag]’
558 | detail::graph::brandes_betweenness_centrality_dispatch1< ew >::run(g,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
559 | choose_param(
| ~~~~~~~~~~~~~
560 | get_param(params, vertex_centrality), dummy_property_map()),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
561 | choose_param(get_param(params, edge_centrality), dummy_property_map()),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
562 | choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
563 | get_param(params, edge_weight));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/bc_clustering.hpp:131:39: required from ‘void boost::betweenness_centrality_clustering(MutableGraph&, Done, EdgeCentralityMap, VertexIndexMap) [with MutableGraph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >; Done = clustering_threshold; EdgeCentralityMap = adj_list_edge_property_map<undirected_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_centrality_t, double> >, edge_centrality_t>; VertexIndexMap = vec_adj_list_vertex_id_map<property<vertex_index_t, int, property<vertex_centrality_t, double> >, long unsigned int>]’
131 | brandes_betweenness_centrality(g,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
132 | edge_centrality_map(edge_centrality)
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
133 | .vertex_index_map(vertex_index));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/bc_clustering.hpp:150:38: required from ‘void boost::betweenness_centrality_clustering(MutableGraph&, Done, EdgeCentralityMap) [with MutableGraph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >; Done = clustering_threshold; EdgeCentralityMap = adj_list_edge_property_map<undirected_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_centrality_t, double> >, edge_centrality_t>]’
150 | betweenness_centrality_clustering(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
151 | g, done, edge_centrality, get(vertex_index, g));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
bbc.cpp:149:36: required from here
149 | betweenness_centrality_clustering(g,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
150 | clustering_threshold(threshold, g, normalize),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
151 | get(edge_centrality, g));
| ~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
20 | ~usage_requirements() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/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<boost::default_color_type*, std::vector<boost::default_color_type> >]’
37 | ~model()
| ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:233:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
233 | BOOST_CONCEPT_USAGE(EqualityComparable) {
| ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::InputIterator<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/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<boost::default_color_type*, std::vector<boost::default_color_type> > > >]’
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:512:7: required from ‘struct boost::InputIterator<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> > >’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:540:3: required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> > >’
540 | BOOST_concept(ForwardIterator,(TT))
| ^~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> > >’
568 | BOOST_concept(BidirectionalIterator,(TT))
| ^~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> > >’
597 | BOOST_concept(RandomAccessIterator,(TT))
| ^~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3: [ skipping 9 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:500:43: required from ‘void boost::detail::graph::brandes_betweenness_centrality_dispatch2(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >; CentralityMap = boost::dummy_property_map; EdgeCentralityMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>]’
500 | brandes_betweenness_centrality(g, centrality, edge_centrality_map,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
501 | make_iterator_property_map(incoming.begin(), vertex_index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
502 | make_iterator_property_map(distance.begin(), vertex_index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
503 | make_iterator_property_map(dependency.begin(), vertex_index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
504 | make_iterator_property_map(path_count.begin(), vertex_index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
505 | vertex_index);
| ~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:531:57: required from ‘static void boost::detail::graph::brandes_betweenness_centrality_dispatch1<boost::param_not_found>::run(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap, boost::param_not_found) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >; CentralityMap = boost::dummy_property_map; EdgeCentralityMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>]’
531 | brandes_betweenness_centrality_dispatch2(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
532 | g, centrality, edge_centrality_map, vertex_index);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:558:71: required from ‘void boost::brandes_betweenness_centrality(const Graph&, const bgl_named_params<T, Tag, Base>&, typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >; Param = vec_adj_list_vertex_id_map<property<vertex_index_t, int, property<vertex_centrality_t, double> >, long unsigned int>; Tag = vertex_index_t; Rest = bgl_named_params<adj_list_edge_property_map<undirected_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_centrality_t, double> >, edge_centrality_t>, edge_centrality_t, no_property>; typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits<Graph>::traversal_category = undir_adj_list_traversal_tag]’
558 | detail::graph::brandes_betweenness_centrality_dispatch1< ew >::run(g,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
559 | choose_param(
| ~~~~~~~~~~~~~
560 | get_param(params, vertex_centrality), dummy_property_map()),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
561 | choose_param(get_param(params, edge_centrality), dummy_property_map()),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
562 | choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
563 | get_param(params, edge_weight));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/bc_clustering.hpp:131:39: required from ‘void boost::betweenness_centrality_clustering(MutableGraph&, Done, EdgeCentralityMap, VertexIndexMap) [with MutableGraph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >; Done = clustering_threshold; EdgeCentralityMap = adj_list_edge_property_map<undirected_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_centrality_t, double> >, edge_centrality_t>; VertexIndexMap = vec_adj_list_vertex_id_map<property<vertex_index_t, int, property<vertex_centrality_t, double> >, long unsigned int>]’
131 | brandes_betweenness_centrality(g,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
132 | edge_centrality_map(edge_centrality)
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
133 | .vertex_index_map(vertex_index));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/bc_clustering.hpp:150:38: required from ‘void boost::betweenness_centrality_clustering(MutableGraph&, Done, EdgeCentralityMap) [with MutableGraph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >; Done = clustering_threshold; EdgeCentralityMap = adj_list_edge_property_map<undirected_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_centrality_t, double> >, edge_centrality_t>]’
150 | betweenness_centrality_clustering(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
151 | g, done, edge_centrality, get(vertex_index, g));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
bbc.cpp:149:36: required from here
149 | betweenness_centrality_clustering(g,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
150 | clustering_threshold(threshold, g, normalize),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
151 | get(edge_centrality, g));
| ~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
20 | ~usage_requirements() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/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<boost::default_color_type*, std::vector<boost::default_color_type> >]’
37 | ~model()
| ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:512:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
512 | BOOST_CONCEPT_USAGE(InputIterator)
| ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::ForwardIterator<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/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<boost::default_color_type*, std::vector<boost::default_color_type> > > >]’
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:543:7: required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> > >’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> > >’
568 | BOOST_concept(BidirectionalIterator,(TT))
| ^~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> > >’
597 | BOOST_concept(RandomAccessIterator,(TT))
| ^~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> > >’
597 | BOOST_concept(RandomAccessIterator,(TT))
| ^~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: [ skipping 8 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:500:43: required from ‘void boost::detail::graph::brandes_betweenness_centrality_dispatch2(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >; CentralityMap = boost::dummy_property_map; EdgeCentralityMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>]’
500 | brandes_betweenness_centrality(g, centrality, edge_centrality_map,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
501 | make_iterator_property_map(incoming.begin(), vertex_index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
502 | make_iterator_property_map(distance.begin(), vertex_index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
503 | make_iterator_property_map(dependency.begin(), vertex_index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
504 | make_iterator_property_map(path_count.begin(), vertex_index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
505 | vertex_index);
| ~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:531:57: required from ‘static void boost::detail::graph::brandes_betweenness_centrality_dispatch1<boost::param_not_found>::run(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap, boost::param_not_found) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >; CentralityMap = boost::dummy_property_map; EdgeCentralityMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>]’
531 | brandes_betweenness_centrality_dispatch2(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
532 | g, centrality, edge_centrality_map, vertex_index);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:558:71: required from ‘void boost::brandes_betweenness_centrality(const Graph&, const bgl_named_params<T, Tag, Base>&, typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >; Param = vec_adj_list_vertex_id_map<property<vertex_index_t, int, property<vertex_centrality_t, double> >, long unsigned int>; Tag = vertex_index_t; Rest = bgl_named_params<adj_list_edge_property_map<undirected_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_centrality_t, double> >, edge_centrality_t>, edge_centrality_t, no_property>; typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits<Graph>::traversal_category = undir_adj_list_traversal_tag]’
558 | detail::graph::brandes_betweenness_centrality_dispatch1< ew >::run(g,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
559 | choose_param(
| ~~~~~~~~~~~~~
560 | get_param(params, vertex_centrality), dummy_property_map()),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
561 | choose_param(get_param(params, edge_centrality), dummy_property_map()),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
562 | choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
563 | get_param(params, edge_weight));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/bc_clustering.hpp:131:39: required from ‘void boost::betweenness_centrality_clustering(MutableGraph&, Done, EdgeCentralityMap, VertexIndexMap) [with MutableGraph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >; Done = clustering_threshold; EdgeCentralityMap = adj_list_edge_property_map<undirected_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_centrality_t, double> >, edge_centrality_t>; VertexIndexMap = vec_adj_list_vertex_id_map<property<vertex_index_t, int, property<vertex_centrality_t, double> >, long unsigned int>]’
131 | brandes_betweenness_centrality(g,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
132 | edge_centrality_map(edge_centrality)
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
133 | .vertex_index_map(vertex_index));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/bc_clustering.hpp:150:38: required from ‘void boost::betweenness_centrality_clustering(MutableGraph&, Done, EdgeCentralityMap) [with MutableGraph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >; Done = clustering_threshold; EdgeCentralityMap = adj_list_edge_property_map<undirected_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_centrality_t, double> >, edge_centrality_t>]’
150 | betweenness_centrality_clustering(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
151 | g, done, edge_centrality, get(vertex_index, g));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
bbc.cpp:149:36: required from here
149 | betweenness_centrality_clustering(g,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
150 | clustering_threshold(threshold, g, normalize),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
151 | get(edge_centrality, g));
| ~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
20 | ~usage_requirements() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/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<boost::default_color_type*, std::vector<boost::default_color_type> >]’
37 | ~model()
| ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:543:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
543 | BOOST_CONCEPT_USAGE(ForwardIterator)
| ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::BidirectionalIterator<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/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<boost::default_color_type*, std::vector<boost::default_color_type> > > >]’
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:571:7: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> > >’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> > >’
597 | BOOST_concept(RandomAccessIterator,(TT))
| ^~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> > >’
597 | BOOST_concept(RandomAccessIterator,(TT))
| ^~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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<boost::default_color_type*, std::vector<boost::default_color_type> > >]’
32 | inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
| ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5: [ skipping 7 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:500:43: required from ‘void boost::detail::graph::brandes_betweenness_centrality_dispatch2(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >; CentralityMap = boost::dummy_property_map; EdgeCentralityMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>]’
500 | brandes_betweenness_centrality(g, centrality, edge_centrality_map,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
501 | make_iterator_property_map(incoming.begin(), vertex_index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
502 | make_iterator_property_map(distance.begin(), vertex_index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
503 | make_iterator_property_map(dependency.begin(), vertex_index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
504 | make_iterator_property_map(path_count.begin(), vertex_index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
505 | vertex_index);
| ~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:531:57: required from ‘static void boost::detail::graph::brandes_betweenness_centrality_dispatch1<boost::param_not_found>::run(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap, boost::param_not_found) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >; CentralityMap = boost::dummy_property_map; EdgeCentralityMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>]’
531 | brandes_betweenness_centrality_dispatch2(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
532 | g, centrality, edge_centrality_map, vertex_index);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:558:71: required from ‘void boost::brandes_betweenness_centrality(const Graph&, const bgl_named_params<T, Tag, Base>&, typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >; Param = vec_adj_list_vertex_id_map<property<vertex_index_t, int, property<vertex_centrality_t, double> >, long unsigned int>; Tag = vertex_index_t; Rest = bgl_named_params<adj_list_edge_property_map<undirected_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_centrality_t, double> >, edge_centrality_t>, edge_centrality_t, no_property>; typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits<Graph>::traversal_category = undir_adj_list_traversal_tag]’
558 | detail::graph::brandes_betweenness_centrality_dispatch1< ew >::run(g,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
559 | choose_param(
| ~~~~~~~~~~~~~
560 | get_param(params, vertex_centrality), dummy_property_map()),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
561 | choose_param(get_param(params, edge_centrality), dummy_property_map()),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
562 | choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
563 | get_param(params, edge_weight));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/bc_clustering.hpp:131:39: required from ‘void boost::betweenness_centrality_clustering(MutableGraph&, Done, EdgeCentralityMap, VertexIndexMap) [with MutableGraph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >; Done = clustering_threshold; EdgeCentralityMap = adj_list_edge_property_map<undirected_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_centrality_t, double> >, edge_centrality_t>; VertexIndexMap = vec_adj_list_vertex_id_map<property<vertex_index_t, int, property<vertex_centrality_t, double> >, long unsigned int>]’
131 | brandes_betweenness_centrality(g,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
132 | edge_centrality_map(edge_centrality)
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
133 | .vertex_index_map(vertex_index));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/bc_clustering.hpp:150:38: required from ‘void boost::betweenness_centrality_clustering(MutableGraph&, Done, EdgeCentralityMap) [with MutableGraph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >; Done = clustering_threshold; EdgeCentralityMap = adj_list_edge_property_map<undirected_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_centrality_t, double> >, edge_centrality_t>]’
150 | betweenness_centrality_clustering(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
151 | g, done, edge_centrality, get(vertex_index, g));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
bbc.cpp:149:36: required from here
149 | betweenness_centrality_clustering(g,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
150 | clustering_threshold(threshold, g, normalize),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
151 | get(edge_centrality, g));
| ~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
20 | ~usage_requirements() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/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<boost::default_color_type*, std::vector<boost::default_color_type> >]’
37 | ~model()
| ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:571:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
571 | BOOST_CONCEPT_USAGE(BidirectionalIterator)
| ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Comparable<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/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<boost::default_color_type*, std::vector<boost::default_color_type> > > >]’
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:253:5: required from ‘struct boost::Comparable<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> > >’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> > >’
597 | BOOST_concept(RandomAccessIterator,(TT))
| ^~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> > >’
597 | BOOST_concept(RandomAccessIterator,(TT))
| ^~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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<boost::default_color_type*, std::vector<boost::default_color_type> > >]’
32 | inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
| ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5: [ skipping 7 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:500:43: required from ‘void boost::detail::graph::brandes_betweenness_centrality_dispatch2(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >; CentralityMap = boost::dummy_property_map; EdgeCentralityMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>]’
500 | brandes_betweenness_centrality(g, centrality, edge_centrality_map,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
501 | make_iterator_property_map(incoming.begin(), vertex_index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
502 | make_iterator_property_map(distance.begin(), vertex_index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
503 | make_iterator_property_map(dependency.begin(), vertex_index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
504 | make_iterator_property_map(path_count.begin(), vertex_index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
505 | vertex_index);
| ~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:531:57: required from ‘static void boost::detail::graph::brandes_betweenness_centrality_dispatch1<boost::param_not_found>::run(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap, boost::param_not_found) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >; CentralityMap = boost::dummy_property_map; EdgeCentralityMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>]’
531 | brandes_betweenness_centrality_dispatch2(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
532 | g, centrality, edge_centrality_map, vertex_index);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:558:71: required from ‘void boost::brandes_betweenness_centrality(const Graph&, const bgl_named_params<T, Tag, Base>&, typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >; Param = vec_adj_list_vertex_id_map<property<vertex_index_t, int, property<vertex_centrality_t, double> >, long unsigned int>; Tag = vertex_index_t; Rest = bgl_named_params<adj_list_edge_property_map<undirected_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_centrality_t, double> >, edge_centrality_t>, edge_centrality_t, no_property>; typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits<Graph>::traversal_category = undir_adj_list_traversal_tag]’
558 | detail::graph::brandes_betweenness_centrality_dispatch1< ew >::run(g,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
559 | choose_param(
| ~~~~~~~~~~~~~
560 | get_param(params, vertex_centrality), dummy_property_map()),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
561 | choose_param(get_param(params, edge_centrality), dummy_property_map()),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
562 | choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
563 | get_param(params, edge_weight));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/bc_clustering.hpp:131:39: required from ‘void boost::betweenness_centrality_clustering(MutableGraph&, Done, EdgeCentralityMap, VertexIndexMap) [with MutableGraph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >; Done = clustering_threshold; EdgeCentralityMap = adj_list_edge_property_map<undirected_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_centrality_t, double> >, edge_centrality_t>; VertexIndexMap = vec_adj_list_vertex_id_map<property<vertex_index_t, int, property<vertex_centrality_t, double> >, long unsigned int>]’
131 | brandes_betweenness_centrality(g,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
132 | edge_centrality_map(edge_centrality)
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
133 | .vertex_index_map(vertex_index));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/bc_clustering.hpp:150:38: required from ‘void boost::betweenness_centrality_clustering(MutableGraph&, Done, EdgeCentralityMap) [with MutableGraph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >; Done = clustering_threshold; EdgeCentralityMap = adj_list_edge_property_map<undirected_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_centrality_t, double> >, edge_centrality_t>]’
150 | betweenness_centrality_clustering(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
151 | g, done, edge_centrality, get(vertex_index, g));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
bbc.cpp:149:36: required from here
149 | betweenness_centrality_clustering(g,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
150 | clustering_threshold(threshold, g, normalize),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
151 | get(edge_centrality, g));
| ~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
20 | ~usage_requirements() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/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<boost::default_color_type*, std::vector<boost::default_color_type> >]’
37 | ~model()
| ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:253:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
253 | BOOST_CONCEPT_USAGE(Comparable) {
| ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::RandomAccessIterator<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/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<boost::default_color_type*, std::vector<boost::default_color_type> > > >]’
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:601:7: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> > >’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> > >’
597 | BOOST_concept(RandomAccessIterator,(TT))
| ^~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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<boost::default_color_type*, std::vector<boost::default_color_type> > >]’
32 | inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
| ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied<boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> > > >::value’
44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 6 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:500:43: required from ‘void boost::detail::graph::brandes_betweenness_centrality_dispatch2(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >; CentralityMap = boost::dummy_property_map; EdgeCentralityMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>]’
500 | brandes_betweenness_centrality(g, centrality, edge_centrality_map,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
501 | make_iterator_property_map(incoming.begin(), vertex_index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
502 | make_iterator_property_map(distance.begin(), vertex_index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
503 | make_iterator_property_map(dependency.begin(), vertex_index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
504 | make_iterator_property_map(path_count.begin(), vertex_index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
505 | vertex_index);
| ~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:531:57: required from ‘static void boost::detail::graph::brandes_betweenness_centrality_dispatch1<boost::param_not_found>::run(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap, boost::param_not_found) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >; CentralityMap = boost::dummy_property_map; EdgeCentralityMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>]’
531 | brandes_betweenness_centrality_dispatch2(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
532 | g, centrality, edge_centrality_map, vertex_index);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:558:71: required from ‘void boost::brandes_betweenness_centrality(const Graph&, const bgl_named_params<T, Tag, Base>&, typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >; Param = vec_adj_list_vertex_id_map<property<vertex_index_t, int, property<vertex_centrality_t, double> >, long unsigned int>; Tag = vertex_index_t; Rest = bgl_named_params<adj_list_edge_property_map<undirected_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_centrality_t, double> >, edge_centrality_t>, edge_centrality_t, no_property>; typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits<Graph>::traversal_category = undir_adj_list_traversal_tag]’
558 | detail::graph::brandes_betweenness_centrality_dispatch1< ew >::run(g,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
559 | choose_param(
| ~~~~~~~~~~~~~
560 | get_param(params, vertex_centrality), dummy_property_map()),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
561 | choose_param(get_param(params, edge_centrality), dummy_property_map()),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
562 | choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
563 | get_param(params, edge_weight));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/bc_clustering.hpp:131:39: required from ‘void boost::betweenness_centrality_clustering(MutableGraph&, Done, EdgeCentralityMap, VertexIndexMap) [with MutableGraph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >; Done = clustering_threshold; EdgeCentralityMap = adj_list_edge_property_map<undirected_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_centrality_t, double> >, edge_centrality_t>; VertexIndexMap = vec_adj_list_vertex_id_map<property<vertex_index_t, int, property<vertex_centrality_t, double> >, long unsigned int>]’
131 | brandes_betweenness_centrality(g,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
132 | edge_centrality_map(edge_centrality)
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
133 | .vertex_index_map(vertex_index));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/bc_clustering.hpp:150:38: required from ‘void boost::betweenness_centrality_clustering(MutableGraph&, Done, EdgeCentralityMap) [with MutableGraph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >; Done = clustering_threshold; EdgeCentralityMap = adj_list_edge_property_map<undirected_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_centrality_t, double> >, edge_centrality_t>]’
150 | betweenness_centrality_clustering(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
151 | g, done, edge_centrality, get(vertex_index, g));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
bbc.cpp:149:36: required from here
149 | betweenness_centrality_clustering(g,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
150 | clustering_threshold(threshold, g, normalize),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
151 | get(edge_centrality, g));
| ~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
20 | ~usage_requirements() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/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<boost::default_color_type*, std::vector<boost::default_color_type> >]’
37 | ~model()
| ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:601:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
601 | BOOST_CONCEPT_USAGE(RandomAccessIterator)
| ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::concepts::Graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > > > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:66:5: required from ‘struct boost::concepts::Graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > > >’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:75:1: required from ‘struct boost::concepts::IncidenceGraph<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > > >’
75 | BOOST_concept(IncidenceGraph, (G)) : Graph< G >
| ^~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:75:1: required from ‘struct boost::concepts::IncidenceGraphConcept<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > > >’
75 | BOOST_concept(IncidenceGraph, (G)) : Graph< G >
| ^~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::concepts::IncidenceGraphConcept<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > > >]’
32 | inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
| ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied<boost::concepts::IncidenceGraphConcept<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > > > >::value’
44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 7 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:500:43: required from ‘void boost::detail::graph::brandes_betweenness_centrality_dispatch2(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >; CentralityMap = boost::dummy_property_map; EdgeCentralityMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>]’
500 | brandes_betweenness_centrality(g, centrality, edge_centrality_map,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
501 | make_iterator_property_map(incoming.begin(), vertex_index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
502 | make_iterator_property_map(distance.begin(), vertex_index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
503 | make_iterator_property_map(dependency.begin(), vertex_index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
504 | make_iterator_property_map(path_count.begin(), vertex_index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
505 | vertex_index);
| ~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:531:57: required from ‘static void boost::detail::graph::brandes_betweenness_centrality_dispatch1<boost::param_not_found>::run(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap, boost::param_not_found) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >; CentralityMap = boost::dummy_property_map; EdgeCentralityMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>]’
531 | brandes_betweenness_centrality_dispatch2(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
532 | g, centrality, edge_centrality_map, vertex_index);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:558:71: required from ‘void boost::brandes_betweenness_centrality(const Graph&, const bgl_named_params<T, Tag, Base>&, typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >; Param = vec_adj_list_vertex_id_map<property<vertex_index_t, int, property<vertex_centrality_t, double> >, long unsigned int>; Tag = vertex_index_t; Rest = bgl_named_params<adj_list_edge_property_map<undirected_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_centrality_t, double> >, edge_centrality_t>, edge_centrality_t, no_property>; typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits<Graph>::traversal_category = undir_adj_list_traversal_tag]’
558 | detail::graph::brandes_betweenness_centrality_dispatch1< ew >::run(g,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
559 | choose_param(
| ~~~~~~~~~~~~~
560 | get_param(params, vertex_centrality), dummy_property_map()),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
561 | choose_param(get_param(params, edge_centrality), dummy_property_map()),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
562 | choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
563 | get_param(params, edge_weight));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/bc_clustering.hpp:131:39: required from ‘void boost::betweenness_centrality_clustering(MutableGraph&, Done, EdgeCentralityMap, VertexIndexMap) [with MutableGraph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >; Done = clustering_threshold; EdgeCentralityMap = adj_list_edge_property_map<undirected_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_centrality_t, double> >, edge_centrality_t>; VertexIndexMap = vec_adj_list_vertex_id_map<property<vertex_index_t, int, property<vertex_centrality_t, double> >, long unsigned int>]’
131 | brandes_betweenness_centrality(g,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
132 | edge_centrality_map(edge_centrality)
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
133 | .vertex_index_map(vertex_index));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/bc_clustering.hpp:150:38: required from ‘void boost::betweenness_centrality_clustering(MutableGraph&, Done, EdgeCentralityMap) [with MutableGraph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >; Done = clustering_threshold; EdgeCentralityMap = adj_list_edge_property_map<undirected_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_centrality_t, double> >, edge_centrality_t>]’
150 | betweenness_centrality_clustering(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
151 | g, done, edge_centrality, get(vertex_index, g));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
bbc.cpp:149:36: required from here
149 | betweenness_centrality_clustering(g,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
150 | clustering_threshold(threshold, g, normalize),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
151 | get(edge_centrality, g));
| ~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::concepts::Graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > > >]’
20 | ~usage_requirements() { ((Model*)0)->~Model(); }
| ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::concepts::IncidenceGraph<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > > > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:87:5: required from ‘struct boost::concepts::IncidenceGraph<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > > >’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:75:1: required from ‘struct boost::concepts::IncidenceGraphConcept<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > > >’
75 | BOOST_concept(IncidenceGraph, (G)) : Graph< G >
| ^~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::concepts::IncidenceGraphConcept<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > > >]’
32 | inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
| ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied<boost::concepts::IncidenceGraphConcept<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > > > >::value’
44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied<boost::concepts::IncidenceGraphConcept<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > > > >’
45 | typedef boost::integral_constant<bool, value> type;
| ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 6 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:500:43: required from ‘void boost::detail::graph::brandes_betweenness_centrality_dispatch2(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >; CentralityMap = boost::dummy_property_map; EdgeCentralityMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>]’
500 | brandes_betweenness_centrality(g, centrality, edge_centrality_map,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
501 | make_iterator_property_map(incoming.begin(), vertex_index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
502 | make_iterator_property_map(distance.begin(), vertex_index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
503 | make_iterator_property_map(dependency.begin(), vertex_index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
504 | make_iterator_property_map(path_count.begin(), vertex_index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
505 | vertex_index);
| ~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:531:57: required from ‘static void boost::detail::graph::brandes_betweenness_centrality_dispatch1<boost::param_not_found>::run(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap, boost::param_not_found) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >; CentralityMap = boost::dummy_property_map; EdgeCentralityMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>]’
531 | brandes_betweenness_centrality_dispatch2(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
532 | g, centrality, edge_centrality_map, vertex_index);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:558:71: required from ‘void boost::brandes_betweenness_centrality(const Graph&, const bgl_named_params<T, Tag, Base>&, typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >; Param = vec_adj_list_vertex_id_map<property<vertex_index_t, int, property<vertex_centrality_t, double> >, long unsigned int>; Tag = vertex_index_t; Rest = bgl_named_params<adj_list_edge_property_map<undirected_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_centrality_t, double> >, edge_centrality_t>, edge_centrality_t, no_property>; typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits<Graph>::traversal_category = undir_adj_list_traversal_tag]’
558 | detail::graph::brandes_betweenness_centrality_dispatch1< ew >::run(g,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
559 | choose_param(
| ~~~~~~~~~~~~~
560 | get_param(params, vertex_centrality), dummy_property_map()),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
561 | choose_param(get_param(params, edge_centrality), dummy_property_map()),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
562 | choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
563 | get_param(params, edge_weight));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/bc_clustering.hpp:131:39: required from ‘void boost::betweenness_centrality_clustering(MutableGraph&, Done, EdgeCentralityMap, VertexIndexMap) [with MutableGraph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >; Done = clustering_threshold; EdgeCentralityMap = adj_list_edge_property_map<undirected_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_centrality_t, double> >, edge_centrality_t>; VertexIndexMap = vec_adj_list_vertex_id_map<property<vertex_index_t, int, property<vertex_centrality_t, double> >, long unsigned int>]’
131 | brandes_betweenness_centrality(g,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
132 | edge_centrality_map(edge_centrality)
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
133 | .vertex_index_map(vertex_index));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/bc_clustering.hpp:150:38: required from ‘void boost::betweenness_centrality_clustering(MutableGraph&, Done, EdgeCentralityMap) [with MutableGraph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >; Done = clustering_threshold; EdgeCentralityMap = adj_list_edge_property_map<undirected_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_centrality_t, double> >, edge_centrality_t>]’
150 | betweenness_centrality_clustering(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
151 | g, done, edge_centrality, get(vertex_index, g));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
bbc.cpp:149:36: required from here
149 | betweenness_centrality_clustering(g,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
150 | clustering_threshold(threshold, g, normalize),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
151 | get(edge_centrality, g));
| ~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::concepts::IncidenceGraph<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > > >]’
20 | ~usage_requirements() { ((Model*)0)->~Model(); }
| ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::IncidenceGraphConcept<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:129:9: required from ‘void boost::breadth_first_visit(const IncidenceGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with IncidenceGraph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >; Buffer = queue<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > >; BFSVisitor = detail::graph::brandes_unweighted_shortest_paths::visitor_type<const adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >, iterator_property_map<__gnu_cxx::__normal_iterator<std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<undirected_tag, long unsigned int> > >*, std::vector<std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<undirected_tag, long unsigned int> > >, std::allocator<std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<undirected_tag, long unsigned int> > > > > >, vec_adj_list_vertex_id_map<property<vertex_index_t, int, property<vertex_centrality_t, double> >, long unsigned int>, std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<undirected_tag, long unsigned int> > >, std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<undirected_tag, long unsigned int> > >&>, iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > >, vec_adj_list_vertex_id_map<property<vertex_index_t, int, property<vertex_centrality_t, double> >, long unsigned int>, double, double&>, iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > >, vec_adj_list_vertex_id_map<property<vertex_index_t, int, property<vertex_centrality_t, double> >, long unsigned int>, long unsigned int, long unsigned int&> >; ColorMap = iterator_property_map<__gnu_cxx::__normal_iterator<default_color_type*, std::vector<default_color_type> >, vec_adj_list_vertex_id_map<property<vertex_index_t, int, property<vertex_centrality_t, double> >, long unsigned int>, default_color_type, default_color_type&>; SourceIterator = long unsigned int*]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:118:24: required from ‘void boost::breadth_first_visit(const IncidenceGraph&, typename graph_traits<Graph>::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with IncidenceGraph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >; Buffer = queue<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > >; BFSVisitor = detail::graph::brandes_unweighted_shortest_paths::visitor_type<const adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >, iterator_property_map<__gnu_cxx::__normal_iterator<std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<undirected_tag, long unsigned int> > >*, std::vector<std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<undirected_tag, long unsigned int> > >, std::allocator<std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<undirected_tag, long unsigned int> > > > > >, vec_adj_list_vertex_id_map<property<vertex_index_t, int, property<vertex_centrality_t, double> >, long unsigned int>, std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<undirected_tag, long unsigned int> > >, std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<undirected_tag, long unsigned int> > >&>, iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > >, vec_adj_list_vertex_id_map<property<vertex_index_t, int, property<vertex_centrality_t, double> >, long unsigned int>, double, double&>, iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > >, vec_adj_list_vertex_id_map<property<vertex_index_t, int, property<vertex_centrality_t, double> >, long unsigned int>, long unsigned int, long unsigned int&> >; ColorMap = iterator_property_map<__gnu_cxx::__normal_iterator<default_color_type*, std::vector<default_color_type> >, vec_adj_list_vertex_id_map<property<vertex_index_t, int, property<vertex_centrality_t, double> >, long unsigned int>, default_color_type, default_color_type&>; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
118 | breadth_first_visit(g, sources, sources + 1, Q, vis, color);
| ~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:248:36: required from ‘void boost::detail::graph::brandes_unweighted_shortest_paths::operator()(Graph&, typename boost::graph_traits<Graph>::vertex_descriptor, std::stack<typename boost::graph_traits<Graph>::vertex_descriptor>&, IncomingMap, DistanceMap, PathCountMap, VertexIndexMap) [with Graph = const boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >; IncomingMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >*, std::vector<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >, std::allocator<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > > > > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>, std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >, std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >&>; DistanceMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>, double, double&>; PathCountMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’
248 | breadth_first_visit(g, s, Q, visitor,
| ~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~
249 | make_iterator_property_map(colors.begin(), vertex_index));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:349:31: required from ‘void boost::detail::graph::brandes_betweenness_centrality_impl(const Graph&, CentralityMap, EdgeCentralityMap, IncomingMap, DistanceMap, DependencyMap, PathCountMap, VertexIndexMap, ShortestPaths) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >; CentralityMap = boost::dummy_property_map; EdgeCentralityMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_centrality_t>; IncomingMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >*, std::vector<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >, std::allocator<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > > > > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>, std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >, std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >&>; DistanceMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>, double, double&>; DependencyMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>, double, double&>; PathCountMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>; ShortestPaths = brandes_unweighted_shortest_paths]’
349 | shortest_paths(g, *s, ordered_vertices, incoming, distance,
| ~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
350 | path_count, vertex_index);
| ~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:412:55: required from ‘void boost::brandes_betweenness_centrality(const Graph&, CentralityMap, EdgeCentralityMap, IncomingMap, DistanceMap, DependencyMap, PathCountMap, VertexIndexMap, typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >; CentralityMap = dummy_property_map; EdgeCentralityMap = adj_list_edge_property_map<undirected_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_centrality_t, double> >, edge_centrality_t>; IncomingMap = iterator_property_map<__gnu_cxx::__normal_iterator<std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<undirected_tag, long unsigned int> > >*, std::vector<std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<undirected_tag, long unsigned int> > >, std::allocator<std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<undirected_tag, long unsigned int> > > > > >, vec_adj_list_vertex_id_map<property<vertex_index_t, int, property<vertex_centrality_t, double> >, long unsigned int>, std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<undirected_tag, long unsigned int> > >, std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<undirected_tag, long unsigned int> > >&>; DistanceMap = iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > >, vec_adj_list_vertex_id_map<property<vertex_index_t, int, property<vertex_centrality_t, double> >, long unsigned int>, double, double&>; DependencyMap = iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > >, vec_adj_list_vertex_id_map<property<vertex_index_t, int, property<vertex_centrality_t, double> >, long unsigned int>, double, double&>; PathCountMap = iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > >, vec_adj_list_vertex_id_map<property<vertex_index_t, int, property<vertex_centrality_t, double> >, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = vec_adj_list_vertex_id_map<property<vertex_index_t, int, property<vertex_centrality_t, double> >, long unsigned int>; typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits<Graph>::traversal_category = undir_adj_list_traversal_tag]’
412 | detail::graph::brandes_betweenness_centrality_impl(g, centrality,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~
413 | edge_centrality_map, incoming, distance, dependency, path_count,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
414 | vertex_index, shortest_paths);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:500:43: required from ‘void boost::detail::graph::brandes_betweenness_centrality_dispatch2(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >; CentralityMap = boost::dummy_property_map; EdgeCentralityMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>]’
500 | brandes_betweenness_centrality(g, centrality, edge_centrality_map,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
501 | make_iterator_property_map(incoming.begin(), vertex_index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
502 | make_iterator_property_map(distance.begin(), vertex_index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
503 | make_iterator_property_map(dependency.begin(), vertex_index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
504 | make_iterator_property_map(path_count.begin(), vertex_index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
505 | vertex_index);
| ~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:531:57: required from ‘static void boost::detail::graph::brandes_betweenness_centrality_dispatch1<boost::param_not_found>::run(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap, boost::param_not_found) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >; CentralityMap = boost::dummy_property_map; EdgeCentralityMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>]’
531 | brandes_betweenness_centrality_dispatch2(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
532 | g, centrality, edge_centrality_map, vertex_index);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:558:71: required from ‘void boost::brandes_betweenness_centrality(const Graph&, const bgl_named_params<T, Tag, Base>&, typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >; Param = vec_adj_list_vertex_id_map<property<vertex_index_t, int, property<vertex_centrality_t, double> >, long unsigned int>; Tag = vertex_index_t; Rest = bgl_named_params<adj_list_edge_property_map<undirected_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_centrality_t, double> >, edge_centrality_t>, edge_centrality_t, no_property>; typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits<Graph>::traversal_category = undir_adj_list_traversal_tag]’
558 | detail::graph::brandes_betweenness_centrality_dispatch1< ew >::run(g,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
559 | choose_param(
| ~~~~~~~~~~~~~
560 | get_param(params, vertex_centrality), dummy_property_map()),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
561 | choose_param(get_param(params, edge_centrality), dummy_property_map()),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
562 | choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
563 | get_param(params, edge_weight));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/bc_clustering.hpp:131:39: required from ‘void boost::betweenness_centrality_clustering(MutableGraph&, Done, EdgeCentralityMap, VertexIndexMap) [with MutableGraph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >; Done = clustering_threshold; EdgeCentralityMap = adj_list_edge_property_map<undirected_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_centrality_t, double> >, edge_centrality_t>; VertexIndexMap = vec_adj_list_vertex_id_map<property<vertex_index_t, int, property<vertex_centrality_t, double> >, long unsigned int>]’
131 | brandes_betweenness_centrality(g,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
132 | edge_centrality_map(edge_centrality)
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
133 | .vertex_index_map(vertex_index));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/bc_clustering.hpp:150:38: required from ‘void boost::betweenness_centrality_clustering(MutableGraph&, Done, EdgeCentralityMap) [with MutableGraph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >; Done = clustering_threshold; EdgeCentralityMap = adj_list_edge_property_map<undirected_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_centrality_t, double> >, edge_centrality_t>]’
150 | betweenness_centrality_clustering(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
151 | g, done, edge_centrality, get(vertex_index, g));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
bbc.cpp:149:36: required from here
149 | betweenness_centrality_clustering(g,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
150 | clustering_threshold(threshold, g, normalize),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
151 | get(edge_centrality, g));
| ~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:75:15: note: in a call to non-static member function ‘boost::concepts::IncidenceGraphConcept<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > > >::~IncidenceGraphConcept()’
75 | BOOST_concept(IncidenceGraph, (G)) : Graph< G >
| ^~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/preprocessor/cat.hpp:29:34: note: in definition of macro ‘BOOST_PP_CAT_I’
29 | # define BOOST_PP_CAT_I(a, b) a ## b
| ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/concept_def.hpp:23:12: note: in expansion of macro ‘BOOST_PP_CAT’
23 | struct BOOST_PP_CAT(name,Concept) \
| ^~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:75:1: note: in expansion of macro ‘BOOST_concept’
75 | BOOST_concept(IncidenceGraph, (G)) : Graph< G >
| ^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::constraint<Model>::failed() [with Model = boost::BFSVisitorConcept<boost::detail::graph::brandes_unweighted_shortest_paths::visitor_type<const boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >, boost::iterator_property_map<__gnu_cxx::__normal_iterator<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >*, std::vector<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >, std::allocator<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > > > > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>, std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >, std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>, double, double&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>, long unsigned int, long unsigned int&> >, boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:65:5: required from ‘void boost::breadth_first_visit(const IncidenceGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with IncidenceGraph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >; Buffer = queue<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > >; BFSVisitor = detail::graph::brandes_unweighted_shortest_paths::visitor_type<const adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >, iterator_property_map<__gnu_cxx::__normal_iterator<std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<undirected_tag, long unsigned int> > >*, std::vector<std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<undirected_tag, long unsigned int> > >, std::allocator<std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<undirected_tag, long unsigned int> > > > > >, vec_adj_list_vertex_id_map<property<vertex_index_t, int, property<vertex_centrality_t, double> >, long unsigned int>, std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<undirected_tag, long unsigned int> > >, std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<undirected_tag, long unsigned int> > >&>, iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > >, vec_adj_list_vertex_id_map<property<vertex_index_t, int, property<vertex_centrality_t, double> >, long unsigned int>, double, double&>, iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > >, vec_adj_list_vertex_id_map<property<vertex_index_t, int, property<vertex_centrality_t, double> >, long unsigned int>, long unsigned int, long unsigned int&> >; ColorMap = iterator_property_map<__gnu_cxx::__normal_iterator<default_color_type*, std::vector<default_color_type> >, vec_adj_list_vertex_id_map<property<vertex_index_t, int, property<vertex_centrality_t, double> >, long unsigned int>, default_color_type, default_color_type&>; SourceIterator = long unsigned int*]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:118:24: required from ‘void boost::breadth_first_visit(const IncidenceGraph&, typename graph_traits<Graph>::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with IncidenceGraph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >; Buffer = queue<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > >; BFSVisitor = detail::graph::brandes_unweighted_shortest_paths::visitor_type<const adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >, iterator_property_map<__gnu_cxx::__normal_iterator<std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<undirected_tag, long unsigned int> > >*, std::vector<std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<undirected_tag, long unsigned int> > >, std::allocator<std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<undirected_tag, long unsigned int> > > > > >, vec_adj_list_vertex_id_map<property<vertex_index_t, int, property<vertex_centrality_t, double> >, long unsigned int>, std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<undirected_tag, long unsigned int> > >, std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<undirected_tag, long unsigned int> > >&>, iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > >, vec_adj_list_vertex_id_map<property<vertex_index_t, int, property<vertex_centrality_t, double> >, long unsigned int>, double, double&>, iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > >, vec_adj_list_vertex_id_map<property<vertex_index_t, int, property<vertex_centrality_t, double> >, long unsigned int>, long unsigned int, long unsigned int&> >; ColorMap = iterator_property_map<__gnu_cxx::__normal_iterator<default_color_type*, std::vector<default_color_type> >, vec_adj_list_vertex_id_map<property<vertex_index_t, int, property<vertex_centrality_t, double> >, long unsigned int>, default_color_type, default_color_type&>; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
118 | breadth_first_visit(g, sources, sources + 1, Q, vis, color);
| ~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:248:36: required from ‘void boost::detail::graph::brandes_unweighted_shortest_paths::operator()(Graph&, typename boost::graph_traits<Graph>::vertex_descriptor, std::stack<typename boost::graph_traits<Graph>::vertex_descriptor>&, IncomingMap, DistanceMap, PathCountMap, VertexIndexMap) [with Graph = const boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >; IncomingMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >*, std::vector<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >, std::allocator<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > > > > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>, std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >, std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >&>; DistanceMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>, double, double&>; PathCountMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’
248 | breadth_first_visit(g, s, Q, visitor,
| ~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~
249 | make_iterator_property_map(colors.begin(), vertex_index));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:349:31: required from ‘void boost::detail::graph::brandes_betweenness_centrality_impl(const Graph&, CentralityMap, EdgeCentralityMap, IncomingMap, DistanceMap, DependencyMap, PathCountMap, VertexIndexMap, ShortestPaths) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >; CentralityMap = boost::dummy_property_map; EdgeCentralityMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_centrality_t>; IncomingMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >*, std::vector<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >, std::allocator<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > > > > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>, std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >, std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >&>; DistanceMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>, double, double&>; DependencyMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>, double, double&>; PathCountMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>; ShortestPaths = brandes_unweighted_shortest_paths]’
349 | shortest_paths(g, *s, ordered_vertices, incoming, distance,
| ~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
350 | path_count, vertex_index);
| ~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:412:55: required from ‘void boost::brandes_betweenness_centrality(const Graph&, CentralityMap, EdgeCentralityMap, IncomingMap, DistanceMap, DependencyMap, PathCountMap, VertexIndexMap, typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >; CentralityMap = dummy_property_map; EdgeCentralityMap = adj_list_edge_property_map<undirected_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_centrality_t, double> >, edge_centrality_t>; IncomingMap = iterator_property_map<__gnu_cxx::__normal_iterator<std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<undirected_tag, long unsigned int> > >*, std::vector<std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<undirected_tag, long unsigned int> > >, std::allocator<std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<undirected_tag, long unsigned int> > > > > >, vec_adj_list_vertex_id_map<property<vertex_index_t, int, property<vertex_centrality_t, double> >, long unsigned int>, std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<undirected_tag, long unsigned int> > >, std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<undirected_tag, long unsigned int> > >&>; DistanceMap = iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > >, vec_adj_list_vertex_id_map<property<vertex_index_t, int, property<vertex_centrality_t, double> >, long unsigned int>, double, double&>; DependencyMap = iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > >, vec_adj_list_vertex_id_map<property<vertex_index_t, int, property<vertex_centrality_t, double> >, long unsigned int>, double, double&>; PathCountMap = iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > >, vec_adj_list_vertex_id_map<property<vertex_index_t, int, property<vertex_centrality_t, double> >, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = vec_adj_list_vertex_id_map<property<vertex_index_t, int, property<vertex_centrality_t, double> >, long unsigned int>; typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits<Graph>::traversal_category = undir_adj_list_traversal_tag]’
412 | detail::graph::brandes_betweenness_centrality_impl(g, centrality,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~
413 | edge_centrality_map, incoming, distance, dependency, path_count,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
414 | vertex_index, shortest_paths);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:500:43: required from ‘void boost::detail::graph::brandes_betweenness_centrality_dispatch2(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >; CentralityMap = boost::dummy_property_map; EdgeCentralityMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>]’
500 | brandes_betweenness_centrality(g, centrality, edge_centrality_map,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
501 | make_iterator_property_map(incoming.begin(), vertex_index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
502 | make_iterator_property_map(distance.begin(), vertex_index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
503 | make_iterator_property_map(dependency.begin(), vertex_index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
504 | make_iterator_property_map(path_count.begin(), vertex_index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
505 | vertex_index);
| ~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:531:57: required from ‘static void boost::detail::graph::brandes_betweenness_centrality_dispatch1<boost::param_not_found>::run(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap, boost::param_not_found) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >; CentralityMap = boost::dummy_property_map; EdgeCentralityMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>]’
531 | brandes_betweenness_centrality_dispatch2(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
532 | g, centrality, edge_centrality_map, vertex_index);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:558:71: required from ‘void boost::brandes_betweenness_centrality(const Graph&, const bgl_named_params<T, Tag, Base>&, typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >; Param = vec_adj_list_vertex_id_map<property<vertex_index_t, int, property<vertex_centrality_t, double> >, long unsigned int>; Tag = vertex_index_t; Rest = bgl_named_params<adj_list_edge_property_map<undirected_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_centrality_t, double> >, edge_centrality_t>, edge_centrality_t, no_property>; typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits<Graph>::traversal_category = undir_adj_list_traversal_tag]’
558 | detail::graph::brandes_betweenness_centrality_dispatch1< ew >::run(g,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
559 | choose_param(
| ~~~~~~~~~~~~~
560 | get_param(params, vertex_centrality), dummy_property_map()),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
561 | choose_param(get_param(params, edge_centrality), dummy_property_map()),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
562 | choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
563 | get_param(params, edge_weight));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/bc_clustering.hpp:131:39: required from ‘void boost::betweenness_centrality_clustering(MutableGraph&, Done, EdgeCentralityMap, VertexIndexMap) [with MutableGraph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >; Done = clustering_threshold; EdgeCentralityMap = adj_list_edge_property_map<undirected_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_centrality_t, double> >, edge_centrality_t>; VertexIndexMap = vec_adj_list_vertex_id_map<property<vertex_index_t, int, property<vertex_centrality_t, double> >, long unsigned int>]’
131 | brandes_betweenness_centrality(g,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
132 | edge_centrality_map(edge_centrality)
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
133 | .vertex_index_map(vertex_index));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/bc_clustering.hpp:150:38: required from ‘void boost::betweenness_centrality_clustering(MutableGraph&, Done, EdgeCentralityMap) [with MutableGraph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >; Done = clustering_threshold; EdgeCentralityMap = adj_list_edge_property_map<undirected_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_centrality_t, double> >, edge_centrality_t>]’
150 | betweenness_centrality_clustering(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
151 | g, done, edge_centrality, get(vertex_index, g));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
bbc.cpp:149:36: required from here
149 | betweenness_centrality_clustering(g,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
150 | clustering_threshold(threshold, g, normalize),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
151 | get(edge_centrality, g));
| ~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:65:52: warning: ‘this’ pointer is null [-Wnonnull]
65 | static void failed() { ((Model*)0)->constraints(); }
| ~~~~~~~~~~~~~~~~~~~~~~~~^~
In file included from /home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dijkstra_shortest_paths.hpp:21,
from /home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:15,
from /home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/bc_clustering.hpp:13,
from bbc.cpp:37:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:37:10: note: in a call to non-static member function ‘void boost::BFSVisitorConcept<Visitor, Graph>::constraints() [with Visitor = boost::detail::graph::brandes_unweighted_shortest_paths::visitor_type<const boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >, boost::iterator_property_map<__gnu_cxx::__normal_iterator<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >*, std::vector<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >, std::allocator<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > > > > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>, std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >, std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>, double, double&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>, long unsigned int, long unsigned int&> >; Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >]’
37 | void constraints()
| ^~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::constraint<Model>::failed() [with Model = boost::ReadWritePropertyMapConcept<boost::iterator_property_map<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>, boost::default_color_type, boost::default_color_type&>, long unsigned int>]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:66:5: required from ‘void boost::breadth_first_visit(const IncidenceGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with IncidenceGraph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >; Buffer = queue<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > >; BFSVisitor = detail::graph::brandes_unweighted_shortest_paths::visitor_type<const adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >, iterator_property_map<__gnu_cxx::__normal_iterator<std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<undirected_tag, long unsigned int> > >*, std::vector<std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<undirected_tag, long unsigned int> > >, std::allocator<std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<undirected_tag, long unsigned int> > > > > >, vec_adj_list_vertex_id_map<property<vertex_index_t, int, property<vertex_centrality_t, double> >, long unsigned int>, std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<undirected_tag, long unsigned int> > >, std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<undirected_tag, long unsigned int> > >&>, iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > >, vec_adj_list_vertex_id_map<property<vertex_index_t, int, property<vertex_centrality_t, double> >, long unsigned int>, double, double&>, iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > >, vec_adj_list_vertex_id_map<property<vertex_index_t, int, property<vertex_centrality_t, double> >, long unsigned int>, long unsigned int, long unsigned int&> >; ColorMap = iterator_property_map<__gnu_cxx::__normal_iterator<default_color_type*, std::vector<default_color_type> >, vec_adj_list_vertex_id_map<property<vertex_index_t, int, property<vertex_centrality_t, double> >, long unsigned int>, default_color_type, default_color_type&>; SourceIterator = long unsigned int*]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:118:24: required from ‘void boost::breadth_first_visit(const IncidenceGraph&, typename graph_traits<Graph>::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with IncidenceGraph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >; Buffer = queue<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > >; BFSVisitor = detail::graph::brandes_unweighted_shortest_paths::visitor_type<const adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >, iterator_property_map<__gnu_cxx::__normal_iterator<std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<undirected_tag, long unsigned int> > >*, std::vector<std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<undirected_tag, long unsigned int> > >, std::allocator<std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<undirected_tag, long unsigned int> > > > > >, vec_adj_list_vertex_id_map<property<vertex_index_t, int, property<vertex_centrality_t, double> >, long unsigned int>, std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<undirected_tag, long unsigned int> > >, std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<undirected_tag, long unsigned int> > >&>, iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > >, vec_adj_list_vertex_id_map<property<vertex_index_t, int, property<vertex_centrality_t, double> >, long unsigned int>, double, double&>, iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > >, vec_adj_list_vertex_id_map<property<vertex_index_t, int, property<vertex_centrality_t, double> >, long unsigned int>, long unsigned int, long unsigned int&> >; ColorMap = iterator_property_map<__gnu_cxx::__normal_iterator<default_color_type*, std::vector<default_color_type> >, vec_adj_list_vertex_id_map<property<vertex_index_t, int, property<vertex_centrality_t, double> >, long unsigned int>, default_color_type, default_color_type&>; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
118 | breadth_first_visit(g, sources, sources + 1, Q, vis, color);
| ~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:248:36: required from ‘void boost::detail::graph::brandes_unweighted_shortest_paths::operator()(Graph&, typename boost::graph_traits<Graph>::vertex_descriptor, std::stack<typename boost::graph_traits<Graph>::vertex_descriptor>&, IncomingMap, DistanceMap, PathCountMap, VertexIndexMap) [with Graph = const boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >; IncomingMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >*, std::vector<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >, std::allocator<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > > > > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>, std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >, std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >&>; DistanceMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>, double, double&>; PathCountMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’
248 | breadth_first_visit(g, s, Q, visitor,
| ~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~
249 | make_iterator_property_map(colors.begin(), vertex_index));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:349:31: required from ‘void boost::detail::graph::brandes_betweenness_centrality_impl(const Graph&, CentralityMap, EdgeCentralityMap, IncomingMap, DistanceMap, DependencyMap, PathCountMap, VertexIndexMap, ShortestPaths) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >; CentralityMap = boost::dummy_property_map; EdgeCentralityMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_centrality_t>; IncomingMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >*, std::vector<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >, std::allocator<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > > > > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>, std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >, std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >&>; DistanceMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>, double, double&>; DependencyMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>, double, double&>; PathCountMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>; ShortestPaths = brandes_unweighted_shortest_paths]’
349 | shortest_paths(g, *s, ordered_vertices, incoming, distance,
| ~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
350 | path_count, vertex_index);
| ~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:412:55: required from ‘void boost::brandes_betweenness_centrality(const Graph&, CentralityMap, EdgeCentralityMap, IncomingMap, DistanceMap, DependencyMap, PathCountMap, VertexIndexMap, typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >; CentralityMap = dummy_property_map; EdgeCentralityMap = adj_list_edge_property_map<undirected_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_centrality_t, double> >, edge_centrality_t>; IncomingMap = iterator_property_map<__gnu_cxx::__normal_iterator<std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<undirected_tag, long unsigned int> > >*, std::vector<std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<undirected_tag, long unsigned int> > >, std::allocator<std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<undirected_tag, long unsigned int> > > > > >, vec_adj_list_vertex_id_map<property<vertex_index_t, int, property<vertex_centrality_t, double> >, long unsigned int>, std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<undirected_tag, long unsigned int> > >, std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<undirected_tag, long unsigned int> > >&>; DistanceMap = iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > >, vec_adj_list_vertex_id_map<property<vertex_index_t, int, property<vertex_centrality_t, double> >, long unsigned int>, double, double&>; DependencyMap = iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > >, vec_adj_list_vertex_id_map<property<vertex_index_t, int, property<vertex_centrality_t, double> >, long unsigned int>, double, double&>; PathCountMap = iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > >, vec_adj_list_vertex_id_map<property<vertex_index_t, int, property<vertex_centrality_t, double> >, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = vec_adj_list_vertex_id_map<property<vertex_index_t, int, property<vertex_centrality_t, double> >, long unsigned int>; typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits<Graph>::traversal_category = undir_adj_list_traversal_tag]’
412 | detail::graph::brandes_betweenness_centrality_impl(g, centrality,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~
413 | edge_centrality_map, incoming, distance, dependency, path_count,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
414 | vertex_index, shortest_paths);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:500:43: required from ‘void boost::detail::graph::brandes_betweenness_centrality_dispatch2(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >; CentralityMap = boost::dummy_property_map; EdgeCentralityMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>]’
500 | brandes_betweenness_centrality(g, centrality, edge_centrality_map,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
501 | make_iterator_property_map(incoming.begin(), vertex_index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
502 | make_iterator_property_map(distance.begin(), vertex_index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
503 | make_iterator_property_map(dependency.begin(), vertex_index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
504 | make_iterator_property_map(path_count.begin(), vertex_index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
505 | vertex_index);
| ~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:531:57: required from ‘static void boost::detail::graph::brandes_betweenness_centrality_dispatch1<boost::param_not_found>::run(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap, boost::param_not_found) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >; CentralityMap = boost::dummy_property_map; EdgeCentralityMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>]’
531 | brandes_betweenness_centrality_dispatch2(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
532 | g, centrality, edge_centrality_map, vertex_index);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:558:71: required from ‘void boost::brandes_betweenness_centrality(const Graph&, const bgl_named_params<T, Tag, Base>&, typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >; Param = vec_adj_list_vertex_id_map<property<vertex_index_t, int, property<vertex_centrality_t, double> >, long unsigned int>; Tag = vertex_index_t; Rest = bgl_named_params<adj_list_edge_property_map<undirected_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_centrality_t, double> >, edge_centrality_t>, edge_centrality_t, no_property>; typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits<Graph>::traversal_category = undir_adj_list_traversal_tag]’
558 | detail::graph::brandes_betweenness_centrality_dispatch1< ew >::run(g,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
559 | choose_param(
| ~~~~~~~~~~~~~
560 | get_param(params, vertex_centrality), dummy_property_map()),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
561 | choose_param(get_param(params, edge_centrality), dummy_property_map()),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
562 | choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
563 | get_param(params, edge_weight));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/bc_clustering.hpp:131:39: required from ‘void boost::betweenness_centrality_clustering(MutableGraph&, Done, EdgeCentralityMap, VertexIndexMap) [with MutableGraph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >; Done = clustering_threshold; EdgeCentralityMap = adj_list_edge_property_map<undirected_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_centrality_t, double> >, edge_centrality_t>; VertexIndexMap = vec_adj_list_vertex_id_map<property<vertex_index_t, int, property<vertex_centrality_t, double> >, long unsigned int>]’
131 | brandes_betweenness_centrality(g,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
132 | edge_centrality_map(edge_centrality)
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
133 | .vertex_index_map(vertex_index));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/bc_clustering.hpp:150:38: required from ‘void boost::betweenness_centrality_clustering(MutableGraph&, Done, EdgeCentralityMap) [with MutableGraph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >; Done = clustering_threshold; EdgeCentralityMap = adj_list_edge_property_map<undirected_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_centrality_t, double> >, edge_centrality_t>]’
150 | betweenness_centrality_clustering(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
151 | g, done, edge_centrality, get(vertex_index, g));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
bbc.cpp:149:36: required from here
149 | betweenness_centrality_clustering(g,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
150 | clustering_threshold(threshold, g, normalize),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
151 | get(edge_centrality, g));
| ~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:65:52: warning: ‘this’ pointer is null [-Wnonnull]
65 | static void failed() { ((Model*)0)->constraints(); }
| ~~~~~~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:205:10: note: in a call to non-static member function ‘void boost::ReadWritePropertyMapConcept<PMap, Key>::constraints() [with PMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>, boost::default_color_type, boost::default_color_type&>; Key = long unsigned int]’
205 | void constraints() {
| ^~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::concepts::Graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::concepts::Graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > > > >]’
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:66:5: required from ‘struct boost::concepts::Graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > > >’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:75:1: required from ‘struct boost::concepts::IncidenceGraph<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > > >’
75 | BOOST_concept(IncidenceGraph, (G)) : Graph< G >
| ^~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:75:1: required from ‘struct boost::concepts::IncidenceGraphConcept<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > > >’
75 | BOOST_concept(IncidenceGraph, (G)) : Graph< G >
| ^~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::concepts::IncidenceGraphConcept<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > > >]’
32 | inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
| ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5: [ skipping 8 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:500:43: required from ‘void boost::detail::graph::brandes_betweenness_centrality_dispatch2(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >; CentralityMap = boost::dummy_property_map; EdgeCentralityMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>]’
500 | brandes_betweenness_centrality(g, centrality, edge_centrality_map,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
501 | make_iterator_property_map(incoming.begin(), vertex_index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
502 | make_iterator_property_map(distance.begin(), vertex_index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
503 | make_iterator_property_map(dependency.begin(), vertex_index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
504 | make_iterator_property_map(path_count.begin(), vertex_index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
505 | vertex_index);
| ~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:531:57: required from ‘static void boost::detail::graph::brandes_betweenness_centrality_dispatch1<boost::param_not_found>::run(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap, boost::param_not_found) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >; CentralityMap = boost::dummy_property_map; EdgeCentralityMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>]’
531 | brandes_betweenness_centrality_dispatch2(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
532 | g, centrality, edge_centrality_map, vertex_index);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:558:71: required from ‘void boost::brandes_betweenness_centrality(const Graph&, const bgl_named_params<T, Tag, Base>&, typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >; Param = vec_adj_list_vertex_id_map<property<vertex_index_t, int, property<vertex_centrality_t, double> >, long unsigned int>; Tag = vertex_index_t; Rest = bgl_named_params<adj_list_edge_property_map<undirected_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_centrality_t, double> >, edge_centrality_t>, edge_centrality_t, no_property>; typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits<Graph>::traversal_category = undir_adj_list_traversal_tag]’
558 | detail::graph::brandes_betweenness_centrality_dispatch1< ew >::run(g,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
559 | choose_param(
| ~~~~~~~~~~~~~
560 | get_param(params, vertex_centrality), dummy_property_map()),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
561 | choose_param(get_param(params, edge_centrality), dummy_property_map()),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
562 | choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
563 | get_param(params, edge_weight));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/bc_clustering.hpp:131:39: required from ‘void boost::betweenness_centrality_clustering(MutableGraph&, Done, EdgeCentralityMap, VertexIndexMap) [with MutableGraph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >; Done = clustering_threshold; EdgeCentralityMap = adj_list_edge_property_map<undirected_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_centrality_t, double> >, edge_centrality_t>; VertexIndexMap = vec_adj_list_vertex_id_map<property<vertex_index_t, int, property<vertex_centrality_t, double> >, long unsigned int>]’
131 | brandes_betweenness_centrality(g,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
132 | edge_centrality_map(edge_centrality)
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
133 | .vertex_index_map(vertex_index));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/bc_clustering.hpp:150:38: required from ‘void boost::betweenness_centrality_clustering(MutableGraph&, Done, EdgeCentralityMap) [with MutableGraph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >; Done = clustering_threshold; EdgeCentralityMap = adj_list_edge_property_map<undirected_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_centrality_t, double> >, edge_centrality_t>]’
150 | betweenness_centrality_clustering(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
151 | g, done, edge_centrality, get(vertex_index, g));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
bbc.cpp:149:36: required from here
149 | betweenness_centrality_clustering(g,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
150 | clustering_threshold(threshold, g, normalize),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
151 | get(edge_centrality, g));
| ~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
20 | ~usage_requirements() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::concepts::Graph<G>::~Graph() [with G = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >]’
37 | ~model()
| ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:66:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
66 | BOOST_CONCEPT_USAGE(Graph)
| ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::concepts::IncidenceGraph<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::concepts::IncidenceGraph<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > > > >]’
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:87:5: required from ‘struct boost::concepts::IncidenceGraph<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > > >’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:75:1: required from ‘struct boost::concepts::IncidenceGraphConcept<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > > >’
75 | BOOST_concept(IncidenceGraph, (G)) : Graph< G >
| ^~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::concepts::IncidenceGraphConcept<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > > >]’
32 | inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
| ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied<boost::concepts::IncidenceGraphConcept<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > > > >::value’
44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 7 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:500:43: required from ‘void boost::detail::graph::brandes_betweenness_centrality_dispatch2(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >; CentralityMap = boost::dummy_property_map; EdgeCentralityMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>]’
500 | brandes_betweenness_centrality(g, centrality, edge_centrality_map,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
501 | make_iterator_property_map(incoming.begin(), vertex_index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
502 | make_iterator_property_map(distance.begin(), vertex_index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
503 | make_iterator_property_map(dependency.begin(), vertex_index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
504 | make_iterator_property_map(path_count.begin(), vertex_index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
505 | vertex_index);
| ~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:531:57: required from ‘static void boost::detail::graph::brandes_betweenness_centrality_dispatch1<boost::param_not_found>::run(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap, boost::param_not_found) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >; CentralityMap = boost::dummy_property_map; EdgeCentralityMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>]’
531 | brandes_betweenness_centrality_dispatch2(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
532 | g, centrality, edge_centrality_map, vertex_index);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:558:71: required from ‘void boost::brandes_betweenness_centrality(const Graph&, const bgl_named_params<T, Tag, Base>&, typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >; Param = vec_adj_list_vertex_id_map<property<vertex_index_t, int, property<vertex_centrality_t, double> >, long unsigned int>; Tag = vertex_index_t; Rest = bgl_named_params<adj_list_edge_property_map<undirected_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_centrality_t, double> >, edge_centrality_t>, edge_centrality_t, no_property>; typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits<Graph>::traversal_category = undir_adj_list_traversal_tag]’
558 | detail::graph::brandes_betweenness_centrality_dispatch1< ew >::run(g,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
559 | choose_param(
| ~~~~~~~~~~~~~
560 | get_param(params, vertex_centrality), dummy_property_map()),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
561 | choose_param(get_param(params, edge_centrality), dummy_property_map()),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
562 | choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
563 | get_param(params, edge_weight));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/bc_clustering.hpp:131:39: required from ‘void boost::betweenness_centrality_clustering(MutableGraph&, Done, EdgeCentralityMap, VertexIndexMap) [with MutableGraph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >; Done = clustering_threshold; EdgeCentralityMap = adj_list_edge_property_map<undirected_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_centrality_t, double> >, edge_centrality_t>; VertexIndexMap = vec_adj_list_vertex_id_map<property<vertex_index_t, int, property<vertex_centrality_t, double> >, long unsigned int>]’
131 | brandes_betweenness_centrality(g,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
132 | edge_centrality_map(edge_centrality)
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
133 | .vertex_index_map(vertex_index));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/bc_clustering.hpp:150:38: required from ‘void boost::betweenness_centrality_clustering(MutableGraph&, Done, EdgeCentralityMap) [with MutableGraph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >; Done = clustering_threshold; EdgeCentralityMap = adj_list_edge_property_map<undirected_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_centrality_t, double> >, edge_centrality_t>]’
150 | betweenness_centrality_clustering(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
151 | g, done, edge_centrality, get(vertex_index, g));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
bbc.cpp:149:36: required from here
149 | betweenness_centrality_clustering(g,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
150 | clustering_threshold(threshold, g, normalize),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
151 | get(edge_centrality, g));
| ~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
20 | ~usage_requirements() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::concepts::IncidenceGraph<G>::~IncidenceGraph() [with G = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >]’
37 | ~model()
| ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:87:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
87 | BOOST_CONCEPT_USAGE(IncidenceGraph)
| ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/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::graph::brandes_unweighted_shortest_paths::visitor_type<const boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >, boost::iterator_property_map<__gnu_cxx::__normal_iterator<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >*, std::vector<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >, std::allocator<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > > > > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>, std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >, std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>, double, double&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>, long unsigned int, long unsigned int&> > > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:167:5: required from ‘struct boost::CopyConstructible<boost::detail::graph::brandes_unweighted_shortest_paths::visitor_type<const boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >, boost::iterator_property_map<__gnu_cxx::__normal_iterator<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >*, std::vector<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >, std::allocator<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > > > > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>, std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >, std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>, double, double&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>, long unsigned int, long unsigned int&> > >’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:165:3: required from ‘struct boost::CopyConstructibleConcept<boost::detail::graph::brandes_unweighted_shortest_paths::visitor_type<const boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >, boost::iterator_property_map<__gnu_cxx::__normal_iterator<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >*, std::vector<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >, std::allocator<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > > > > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>, std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >, std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>, double, double&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>, long unsigned int, long unsigned int&> > >’
165 | BOOST_concept(CopyConstructible,(TT))
| ^~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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::graph::brandes_unweighted_shortest_paths::visitor_type<const boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >, boost::iterator_property_map<__gnu_cxx::__normal_iterator<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >*, std::vector<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >, std::allocator<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > > > > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>, std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >, std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>, double, double&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>, long unsigned int, long unsigned int&> > >]’
32 | inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
| ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied<boost::CopyConstructibleConcept<boost::detail::graph::brandes_unweighted_shortest_paths::visitor_type<const boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >, boost::iterator_property_map<__gnu_cxx::__normal_iterator<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >*, std::vector<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >, std::allocator<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > > > > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>, std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >, std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>, double, double&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>, long unsigned int, long unsigned int&> > > >::value’
44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied<boost::CopyConstructibleConcept<boost::detail::graph::brandes_unweighted_shortest_paths::visitor_type<const boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >, boost::iterator_property_map<__gnu_cxx::__normal_iterator<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >*, std::vector<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >, std::allocator<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > > > > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>, std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >, std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>, double, double&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>, long unsigned int, long unsigned int&> > > >’
45 | typedef boost::integral_constant<bool, value> type;
| ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 11 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:500:43: required from ‘void boost::detail::graph::brandes_betweenness_centrality_dispatch2(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >; CentralityMap = boost::dummy_property_map; EdgeCentralityMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>]’
500 | brandes_betweenness_centrality(g, centrality, edge_centrality_map,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
501 | make_iterator_property_map(incoming.begin(), vertex_index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
502 | make_iterator_property_map(distance.begin(), vertex_index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
503 | make_iterator_property_map(dependency.begin(), vertex_index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
504 | make_iterator_property_map(path_count.begin(), vertex_index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
505 | vertex_index);
| ~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:531:57: required from ‘static void boost::detail::graph::brandes_betweenness_centrality_dispatch1<boost::param_not_found>::run(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap, boost::param_not_found) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >; CentralityMap = boost::dummy_property_map; EdgeCentralityMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>]’
531 | brandes_betweenness_centrality_dispatch2(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
532 | g, centrality, edge_centrality_map, vertex_index);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:558:71: required from ‘void boost::brandes_betweenness_centrality(const Graph&, const bgl_named_params<T, Tag, Base>&, typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >; Param = vec_adj_list_vertex_id_map<property<vertex_index_t, int, property<vertex_centrality_t, double> >, long unsigned int>; Tag = vertex_index_t; Rest = bgl_named_params<adj_list_edge_property_map<undirected_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_centrality_t, double> >, edge_centrality_t>, edge_centrality_t, no_property>; typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits<Graph>::traversal_category = undir_adj_list_traversal_tag]’
558 | detail::graph::brandes_betweenness_centrality_dispatch1< ew >::run(g,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
559 | choose_param(
| ~~~~~~~~~~~~~
560 | get_param(params, vertex_centrality), dummy_property_map()),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
561 | choose_param(get_param(params, edge_centrality), dummy_property_map()),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
562 | choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
563 | get_param(params, edge_weight));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/bc_clustering.hpp:131:39: required from ‘void boost::betweenness_centrality_clustering(MutableGraph&, Done, EdgeCentralityMap, VertexIndexMap) [with MutableGraph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >; Done = clustering_threshold; EdgeCentralityMap = adj_list_edge_property_map<undirected_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_centrality_t, double> >, edge_centrality_t>; VertexIndexMap = vec_adj_list_vertex_id_map<property<vertex_index_t, int, property<vertex_centrality_t, double> >, long unsigned int>]’
131 | brandes_betweenness_centrality(g,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
132 | edge_centrality_map(edge_centrality)
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
133 | .vertex_index_map(vertex_index));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/bc_clustering.hpp:150:38: required from ‘void boost::betweenness_centrality_clustering(MutableGraph&, Done, EdgeCentralityMap) [with MutableGraph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >; Done = clustering_threshold; EdgeCentralityMap = adj_list_edge_property_map<undirected_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_centrality_t, double> >, edge_centrality_t>]’
150 | betweenness_centrality_clustering(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
151 | g, done, edge_centrality, get(vertex_index, g));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
bbc.cpp:149:36: required from here
149 | betweenness_centrality_clustering(g,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
150 | clustering_threshold(threshold, g, normalize),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
151 | get(edge_centrality, g));
| ~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/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::graph::brandes_unweighted_shortest_paths::visitor_type<const boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >, boost::iterator_property_map<__gnu_cxx::__normal_iterator<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >*, std::vector<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >, std::allocator<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > > > > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>, std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >, std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>, double, double&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>, long unsigned int, long unsigned int&> > >]’
20 | ~usage_requirements() { ((Model*)0)->~Model(); }
| ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/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::graph::brandes_unweighted_shortest_paths::visitor_type<const boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >, boost::iterator_property_map<__gnu_cxx::__normal_iterator<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >*, std::vector<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >, std::allocator<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > > > > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>, std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >, std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>, double, double&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>, long unsigned int, long unsigned int&> > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:41:9: required from ‘void boost::BFSVisitorConcept<Visitor, Graph>::constraints() [with Visitor = boost::detail::graph::brandes_unweighted_shortest_paths::visitor_type<const boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >, boost::iterator_property_map<__gnu_cxx::__normal_iterator<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >*, std::vector<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >, std::allocator<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > > > > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>, std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >, std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>, double, double&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>, long unsigned int, long unsigned int&> >; Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::BFSVisitorConcept<boost::detail::graph::brandes_unweighted_shortest_paths::visitor_type<const boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >, boost::iterator_property_map<__gnu_cxx::__normal_iterator<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >*, std::vector<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >, std::allocator<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > > > > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>, std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >, std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>, double, double&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>, long unsigned int, long unsigned int&> >, boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > > >]’
32 | inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
| ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied<boost::BFSVisitorConcept<boost::detail::graph::brandes_unweighted_shortest_paths::visitor_type<const boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >, boost::iterator_property_map<__gnu_cxx::__normal_iterator<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >*, std::vector<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >, std::allocator<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > > > > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>, std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >, std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>, double, double&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>, long unsigned int, long unsigned int&> >, boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > > > >::value’
44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied<boost::BFSVisitorConcept<boost::detail::graph::brandes_unweighted_shortest_paths::visitor_type<const boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >, boost::iterator_property_map<__gnu_cxx::__normal_iterator<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >*, std::vector<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >, std::allocator<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > > > > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>, std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >, std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>, double, double&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>, long unsigned int, long unsigned int&> >, boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > > > >’
45 | typedef boost::integral_constant<bool, value> type;
| ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_<void (*)(boost::BFSVisitorConcept<boost::detail::graph::brandes_unweighted_shortest_paths::visitor_type<const boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >, boost::iterator_property_map<__gnu_cxx::__normal_iterator<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >*, std::vector<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >, std::allocator<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > > > > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>, std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >, std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>, double, double&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>, long unsigned int, long unsigned int&> >, boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > > >)>’
72 | struct requirement_<void(*)(Model)>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:65:5: [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:500:43: required from ‘void boost::detail::graph::brandes_betweenness_centrality_dispatch2(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >; CentralityMap = boost::dummy_property_map; EdgeCentralityMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>]’
500 | brandes_betweenness_centrality(g, centrality, edge_centrality_map,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
501 | make_iterator_property_map(incoming.begin(), vertex_index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
502 | make_iterator_property_map(distance.begin(), vertex_index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
503 | make_iterator_property_map(dependency.begin(), vertex_index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
504 | make_iterator_property_map(path_count.begin(), vertex_index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
505 | vertex_index);
| ~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:531:57: required from ‘static void boost::detail::graph::brandes_betweenness_centrality_dispatch1<boost::param_not_found>::run(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap, boost::param_not_found) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >; CentralityMap = boost::dummy_property_map; EdgeCentralityMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>]’
531 | brandes_betweenness_centrality_dispatch2(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
532 | g, centrality, edge_centrality_map, vertex_index);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:558:71: required from ‘void boost::brandes_betweenness_centrality(const Graph&, const bgl_named_params<T, Tag, Base>&, typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >; Param = vec_adj_list_vertex_id_map<property<vertex_index_t, int, property<vertex_centrality_t, double> >, long unsigned int>; Tag = vertex_index_t; Rest = bgl_named_params<adj_list_edge_property_map<undirected_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_centrality_t, double> >, edge_centrality_t>, edge_centrality_t, no_property>; typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits<Graph>::traversal_category = undir_adj_list_traversal_tag]’
558 | detail::graph::brandes_betweenness_centrality_dispatch1< ew >::run(g,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
559 | choose_param(
| ~~~~~~~~~~~~~
560 | get_param(params, vertex_centrality), dummy_property_map()),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
561 | choose_param(get_param(params, edge_centrality), dummy_property_map()),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
562 | choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
563 | get_param(params, edge_weight));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/bc_clustering.hpp:131:39: required from ‘void boost::betweenness_centrality_clustering(MutableGraph&, Done, EdgeCentralityMap, VertexIndexMap) [with MutableGraph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >; Done = clustering_threshold; EdgeCentralityMap = adj_list_edge_property_map<undirected_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_centrality_t, double> >, edge_centrality_t>; VertexIndexMap = vec_adj_list_vertex_id_map<property<vertex_index_t, int, property<vertex_centrality_t, double> >, long unsigned int>]’
131 | brandes_betweenness_centrality(g,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
132 | edge_centrality_map(edge_centrality)
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
133 | .vertex_index_map(vertex_index));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/bc_clustering.hpp:150:38: required from ‘void boost::betweenness_centrality_clustering(MutableGraph&, Done, EdgeCentralityMap) [with MutableGraph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >; Done = clustering_threshold; EdgeCentralityMap = adj_list_edge_property_map<undirected_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_centrality_t, double> >, edge_centrality_t>]’
150 | betweenness_centrality_clustering(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
151 | g, done, edge_centrality, get(vertex_index, g));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
bbc.cpp:149:36: required from here
149 | betweenness_centrality_clustering(g,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
150 | clustering_threshold(threshold, g, normalize),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
151 | get(edge_centrality, g));
| ~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:165:17: note: in a call to non-static member function ‘boost::CopyConstructibleConcept<boost::detail::graph::brandes_unweighted_shortest_paths::visitor_type<const boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >, boost::iterator_property_map<__gnu_cxx::__normal_iterator<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >*, std::vector<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >, std::allocator<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > > > > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>, std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >, std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>, double, double&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>, long unsigned int, long unsigned int&> > >::~CopyConstructibleConcept()’
165 | BOOST_concept(CopyConstructible,(TT))
| ^~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/preprocessor/cat.hpp:29:34: note: in definition of macro ‘BOOST_PP_CAT_I’
29 | # define BOOST_PP_CAT_I(a, b) a ## b
| ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/concept_def.hpp:23:12: note: in expansion of macro ‘BOOST_PP_CAT’
23 | struct BOOST_PP_CAT(name,Concept) \
| ^~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:165:3: note: in expansion of macro ‘BOOST_concept’
165 | BOOST_concept(CopyConstructible,(TT))
| ^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::constraint<Model>::failed() [with Model = boost::ReadablePropertyMapConcept<boost::iterator_property_map<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>, boost::default_color_type, boost::default_color_type&>, long unsigned int>]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:206:7: required from ‘void boost::ReadWritePropertyMapConcept<PMap, Key>::constraints() [with PMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>, boost::default_color_type, boost::default_color_type&>; Key = long unsigned int]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::ReadWritePropertyMapConcept<boost::iterator_property_map<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>, boost::default_color_type, boost::default_color_type&>, long unsigned int>]’
32 | inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
| ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied<boost::ReadWritePropertyMapConcept<boost::iterator_property_map<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>, boost::default_color_type, boost::default_color_type&>, long unsigned int> >::value’
44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied<boost::ReadWritePropertyMapConcept<boost::iterator_property_map<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>, boost::default_color_type, boost::default_color_type&>, long unsigned int> >’
45 | typedef boost::integral_constant<bool, value> type;
| ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_<void (*)(boost::ReadWritePropertyMapConcept<boost::iterator_property_map<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>, boost::default_color_type, boost::default_color_type&>, long unsigned int>)>’
72 | struct requirement_<void(*)(Model)>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:66:5: [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:500:43: required from ‘void boost::detail::graph::brandes_betweenness_centrality_dispatch2(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >; CentralityMap = boost::dummy_property_map; EdgeCentralityMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>]’
500 | brandes_betweenness_centrality(g, centrality, edge_centrality_map,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
501 | make_iterator_property_map(incoming.begin(), vertex_index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
502 | make_iterator_property_map(distance.begin(), vertex_index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
503 | make_iterator_property_map(dependency.begin(), vertex_index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
504 | make_iterator_property_map(path_count.begin(), vertex_index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
505 | vertex_index);
| ~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:531:57: required from ‘static void boost::detail::graph::brandes_betweenness_centrality_dispatch1<boost::param_not_found>::run(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap, boost::param_not_found) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >; CentralityMap = boost::dummy_property_map; EdgeCentralityMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>]’
531 | brandes_betweenness_centrality_dispatch2(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
532 | g, centrality, edge_centrality_map, vertex_index);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:558:71: required from ‘void boost::brandes_betweenness_centrality(const Graph&, const bgl_named_params<T, Tag, Base>&, typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >; Param = vec_adj_list_vertex_id_map<property<vertex_index_t, int, property<vertex_centrality_t, double> >, long unsigned int>; Tag = vertex_index_t; Rest = bgl_named_params<adj_list_edge_property_map<undirected_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_centrality_t, double> >, edge_centrality_t>, edge_centrality_t, no_property>; typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits<Graph>::traversal_category = undir_adj_list_traversal_tag]’
558 | detail::graph::brandes_betweenness_centrality_dispatch1< ew >::run(g,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
559 | choose_param(
| ~~~~~~~~~~~~~
560 | get_param(params, vertex_centrality), dummy_property_map()),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
561 | choose_param(get_param(params, edge_centrality), dummy_property_map()),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
562 | choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
563 | get_param(params, edge_weight));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/bc_clustering.hpp:131:39: required from ‘void boost::betweenness_centrality_clustering(MutableGraph&, Done, EdgeCentralityMap, VertexIndexMap) [with MutableGraph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >; Done = clustering_threshold; EdgeCentralityMap = adj_list_edge_property_map<undirected_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_centrality_t, double> >, edge_centrality_t>; VertexIndexMap = vec_adj_list_vertex_id_map<property<vertex_index_t, int, property<vertex_centrality_t, double> >, long unsigned int>]’
131 | brandes_betweenness_centrality(g,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
132 | edge_centrality_map(edge_centrality)
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
133 | .vertex_index_map(vertex_index));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/bc_clustering.hpp:150:38: required from ‘void boost::betweenness_centrality_clustering(MutableGraph&, Done, EdgeCentralityMap) [with MutableGraph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >; Done = clustering_threshold; EdgeCentralityMap = adj_list_edge_property_map<undirected_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_centrality_t, double> >, edge_centrality_t>]’
150 | betweenness_centrality_clustering(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
151 | g, done, edge_centrality, get(vertex_index, g));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
bbc.cpp:149:36: required from here
149 | betweenness_centrality_clustering(g,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
150 | clustering_threshold(threshold, g, normalize),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
151 | get(edge_centrality, g));
| ~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:65:52: warning: ‘this’ pointer is null [-Wnonnull]
65 | static void failed() { ((Model*)0)->constraints(); }
| ~~~~~~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:147:10: note: in a call to non-static member function ‘void boost::ReadablePropertyMapConcept<PMap, Key>::constraints() [with PMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>, boost::default_color_type, boost::default_color_type&>; Key = long unsigned int]’
147 | void constraints() {
| ^~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::constraint<Model>::failed() [with Model = boost::WritablePropertyMapConcept<boost::iterator_property_map<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>, boost::default_color_type, boost::default_color_type&>, long unsigned int>]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:207:7: required from ‘void boost::ReadWritePropertyMapConcept<PMap, Key>::constraints() [with PMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>, boost::default_color_type, boost::default_color_type&>; Key = long unsigned int]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::ReadWritePropertyMapConcept<boost::iterator_property_map<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>, boost::default_color_type, boost::default_color_type&>, long unsigned int>]’
32 | inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
| ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied<boost::ReadWritePropertyMapConcept<boost::iterator_property_map<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>, boost::default_color_type, boost::default_color_type&>, long unsigned int> >::value’
44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied<boost::ReadWritePropertyMapConcept<boost::iterator_property_map<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>, boost::default_color_type, boost::default_color_type&>, long unsigned int> >’
45 | typedef boost::integral_constant<bool, value> type;
| ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_<void (*)(boost::ReadWritePropertyMapConcept<boost::iterator_property_map<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>, boost::default_color_type, boost::default_color_type&>, long unsigned int>)>’
72 | struct requirement_<void(*)(Model)>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:66:5: [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:500:43: required from ‘void boost::detail::graph::brandes_betweenness_centrality_dispatch2(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >; CentralityMap = boost::dummy_property_map; EdgeCentralityMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>]’
500 | brandes_betweenness_centrality(g, centrality, edge_centrality_map,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
501 | make_iterator_property_map(incoming.begin(), vertex_index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
502 | make_iterator_property_map(distance.begin(), vertex_index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
503 | make_iterator_property_map(dependency.begin(), vertex_index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
504 | make_iterator_property_map(path_count.begin(), vertex_index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
505 | vertex_index);
| ~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:531:57: required from ‘static void boost::detail::graph::brandes_betweenness_centrality_dispatch1<boost::param_not_found>::run(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap, boost::param_not_found) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >; CentralityMap = boost::dummy_property_map; EdgeCentralityMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>]’
531 | brandes_betweenness_centrality_dispatch2(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
532 | g, centrality, edge_centrality_map, vertex_index);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:558:71: required from ‘void boost::brandes_betweenness_centrality(const Graph&, const bgl_named_params<T, Tag, Base>&, typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >; Param = vec_adj_list_vertex_id_map<property<vertex_index_t, int, property<vertex_centrality_t, double> >, long unsigned int>; Tag = vertex_index_t; Rest = bgl_named_params<adj_list_edge_property_map<undirected_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_centrality_t, double> >, edge_centrality_t>, edge_centrality_t, no_property>; typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits<Graph>::traversal_category = undir_adj_list_traversal_tag]’
558 | detail::graph::brandes_betweenness_centrality_dispatch1< ew >::run(g,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
559 | choose_param(
| ~~~~~~~~~~~~~
560 | get_param(params, vertex_centrality), dummy_property_map()),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
561 | choose_param(get_param(params, edge_centrality), dummy_property_map()),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
562 | choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
563 | get_param(params, edge_weight));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/bc_clustering.hpp:131:39: required from ‘void boost::betweenness_centrality_clustering(MutableGraph&, Done, EdgeCentralityMap, VertexIndexMap) [with MutableGraph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >; Done = clustering_threshold; EdgeCentralityMap = adj_list_edge_property_map<undirected_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_centrality_t, double> >, edge_centrality_t>; VertexIndexMap = vec_adj_list_vertex_id_map<property<vertex_index_t, int, property<vertex_centrality_t, double> >, long unsigned int>]’
131 | brandes_betweenness_centrality(g,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
132 | edge_centrality_map(edge_centrality)
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
133 | .vertex_index_map(vertex_index));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/bc_clustering.hpp:150:38: required from ‘void boost::betweenness_centrality_clustering(MutableGraph&, Done, EdgeCentralityMap) [with MutableGraph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >; Done = clustering_threshold; EdgeCentralityMap = adj_list_edge_property_map<undirected_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_centrality_t, double> >, edge_centrality_t>]’
150 | betweenness_centrality_clustering(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
151 | g, done, edge_centrality, get(vertex_index, g));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
bbc.cpp:149:36: required from here
149 | betweenness_centrality_clustering(g,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
150 | clustering_threshold(threshold, g, normalize),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
151 | get(edge_centrality, g));
| ~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:65:52: warning: ‘this’ pointer is null [-Wnonnull]
65 | static void failed() { ((Model*)0)->constraints(); }
| ~~~~~~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:179:10: note: in a call to non-static member function ‘void boost::WritablePropertyMapConcept<PMap, Key>::constraints() [with PMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>, boost::default_color_type, boost::default_color_type&>; Key = long unsigned int]’
179 | void constraints() {
| ^~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Convertible<boost::lvalue_property_map_tag, boost::read_write_property_map_tag> >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/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> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/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))
| ^~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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);
| ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/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) );
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/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;
| ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 11 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:500:43: required from ‘void boost::detail::graph::brandes_betweenness_centrality_dispatch2(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >; CentralityMap = boost::dummy_property_map; EdgeCentralityMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>]’
500 | brandes_betweenness_centrality(g, centrality, edge_centrality_map,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
501 | make_iterator_property_map(incoming.begin(), vertex_index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
502 | make_iterator_property_map(distance.begin(), vertex_index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
503 | make_iterator_property_map(dependency.begin(), vertex_index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
504 | make_iterator_property_map(path_count.begin(), vertex_index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
505 | vertex_index);
| ~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:531:57: required from ‘static void boost::detail::graph::brandes_betweenness_centrality_dispatch1<boost::param_not_found>::run(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap, boost::param_not_found) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >; CentralityMap = boost::dummy_property_map; EdgeCentralityMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>]’
531 | brandes_betweenness_centrality_dispatch2(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
532 | g, centrality, edge_centrality_map, vertex_index);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:558:71: required from ‘void boost::brandes_betweenness_centrality(const Graph&, const bgl_named_params<T, Tag, Base>&, typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >; Param = vec_adj_list_vertex_id_map<property<vertex_index_t, int, property<vertex_centrality_t, double> >, long unsigned int>; Tag = vertex_index_t; Rest = bgl_named_params<adj_list_edge_property_map<undirected_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_centrality_t, double> >, edge_centrality_t>, edge_centrality_t, no_property>; typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits<Graph>::traversal_category = undir_adj_list_traversal_tag]’
558 | detail::graph::brandes_betweenness_centrality_dispatch1< ew >::run(g,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
559 | choose_param(
| ~~~~~~~~~~~~~
560 | get_param(params, vertex_centrality), dummy_property_map()),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
561 | choose_param(get_param(params, edge_centrality), dummy_property_map()),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
562 | choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
563 | get_param(params, edge_weight));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/bc_clustering.hpp:131:39: required from ‘void boost::betweenness_centrality_clustering(MutableGraph&, Done, EdgeCentralityMap, VertexIndexMap) [with MutableGraph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >; Done = clustering_threshold; EdgeCentralityMap = adj_list_edge_property_map<undirected_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_centrality_t, double> >, edge_centrality_t>; VertexIndexMap = vec_adj_list_vertex_id_map<property<vertex_index_t, int, property<vertex_centrality_t, double> >, long unsigned int>]’
131 | brandes_betweenness_centrality(g,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
132 | edge_centrality_map(edge_centrality)
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
133 | .vertex_index_map(vertex_index));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/bc_clustering.hpp:150:38: required from ‘void boost::betweenness_centrality_clustering(MutableGraph&, Done, EdgeCentralityMap) [with MutableGraph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >; Done = clustering_threshold; EdgeCentralityMap = adj_list_edge_property_map<undirected_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_centrality_t, double> >, edge_centrality_t>]’
150 | betweenness_centrality_clustering(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
151 | g, done, edge_centrality, get(vertex_index, g));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
bbc.cpp:149:36: required from here
149 | betweenness_centrality_clustering(g,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
150 | clustering_threshold(threshold, g, normalize),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
151 | get(edge_centrality, g));
| ~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Convertible<boost::lvalue_property_map_tag, boost::read_write_property_map_tag>]’
20 | ~usage_requirements() { ((Model*)0)->~Model(); }
| ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::ConvertibleConcept<boost::lvalue_property_map_tag, boost::read_write_property_map_tag>]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:208:7: required from ‘void boost::ReadWritePropertyMapConcept<PMap, Key>::constraints() [with PMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>, boost::default_color_type, boost::default_color_type&>; Key = long unsigned int]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::ReadWritePropertyMapConcept<boost::iterator_property_map<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>, boost::default_color_type, boost::default_color_type&>, long unsigned int>]’
32 | inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
| ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied<boost::ReadWritePropertyMapConcept<boost::iterator_property_map<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>, boost::default_color_type, boost::default_color_type&>, long unsigned int> >::value’
44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied<boost::ReadWritePropertyMapConcept<boost::iterator_property_map<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>, boost::default_color_type, boost::default_color_type&>, long unsigned int> >’
45 | typedef boost::integral_constant<bool, value> type;
| ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_<void (*)(boost::ReadWritePropertyMapConcept<boost::iterator_property_map<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>, boost::default_color_type, boost::default_color_type&>, long unsigned int>)>’
72 | struct requirement_<void(*)(Model)>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:66:5: [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:500:43: required from ‘void boost::detail::graph::brandes_betweenness_centrality_dispatch2(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >; CentralityMap = boost::dummy_property_map; EdgeCentralityMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>]’
500 | brandes_betweenness_centrality(g, centrality, edge_centrality_map,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
501 | make_iterator_property_map(incoming.begin(), vertex_index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
502 | make_iterator_property_map(distance.begin(), vertex_index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
503 | make_iterator_property_map(dependency.begin(), vertex_index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
504 | make_iterator_property_map(path_count.begin(), vertex_index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
505 | vertex_index);
| ~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:531:57: required from ‘static void boost::detail::graph::brandes_betweenness_centrality_dispatch1<boost::param_not_found>::run(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap, boost::param_not_found) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >; CentralityMap = boost::dummy_property_map; EdgeCentralityMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>]’
531 | brandes_betweenness_centrality_dispatch2(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
532 | g, centrality, edge_centrality_map, vertex_index);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:558:71: required from ‘void boost::brandes_betweenness_centrality(const Graph&, const bgl_named_params<T, Tag, Base>&, typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >; Param = vec_adj_list_vertex_id_map<property<vertex_index_t, int, property<vertex_centrality_t, double> >, long unsigned int>; Tag = vertex_index_t; Rest = bgl_named_params<adj_list_edge_property_map<undirected_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_centrality_t, double> >, edge_centrality_t>, edge_centrality_t, no_property>; typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits<Graph>::traversal_category = undir_adj_list_traversal_tag]’
558 | detail::graph::brandes_betweenness_centrality_dispatch1< ew >::run(g,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
559 | choose_param(
| ~~~~~~~~~~~~~
560 | get_param(params, vertex_centrality), dummy_property_map()),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
561 | choose_param(get_param(params, edge_centrality), dummy_property_map()),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
562 | choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
563 | get_param(params, edge_weight));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/bc_clustering.hpp:131:39: required from ‘void boost::betweenness_centrality_clustering(MutableGraph&, Done, EdgeCentralityMap, VertexIndexMap) [with MutableGraph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >; Done = clustering_threshold; EdgeCentralityMap = adj_list_edge_property_map<undirected_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_centrality_t, double> >, edge_centrality_t>; VertexIndexMap = vec_adj_list_vertex_id_map<property<vertex_index_t, int, property<vertex_centrality_t, double> >, long unsigned int>]’
131 | brandes_betweenness_centrality(g,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
132 | edge_centrality_map(edge_centrality)
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
133 | .vertex_index_map(vertex_index));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/bc_clustering.hpp:150:38: required from ‘void boost::betweenness_centrality_clustering(MutableGraph&, Done, EdgeCentralityMap) [with MutableGraph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >; Done = clustering_threshold; EdgeCentralityMap = adj_list_edge_property_map<undirected_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_centrality_t, double> >, edge_centrality_t>]’
150 | betweenness_centrality_clustering(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
151 | g, done, edge_centrality, get(vertex_index, g));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
bbc.cpp:149:36: required from here
149 | betweenness_centrality_clustering(g,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
150 | clustering_threshold(threshold, g, normalize),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
151 | get(edge_centrality, g));
| ~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:206:17: note: in a call to non-static member function ‘boost::ConvertibleConcept<boost::lvalue_property_map_tag, boost::read_write_property_map_tag>::~ConvertibleConcept()’
206 | BOOST_concept(Convertible,(X)(Y))
| ^~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/preprocessor/cat.hpp:29:34: note: in definition of macro ‘BOOST_PP_CAT_I’
29 | # define BOOST_PP_CAT_I(a, b) a ## b
| ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/concept_def.hpp:23:12: note: in expansion of macro ‘BOOST_PP_CAT’
23 | struct BOOST_PP_CAT(name,Concept) \
| ^~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:206:3: note: in expansion of macro ‘BOOST_concept’
206 | BOOST_concept(Convertible,(X)(Y))
| ^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::concepts::MultiPassInputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > > >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > > >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > > >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:52:50: required from ‘struct boost::concepts::MultiPassInputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > > >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > > >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > > >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> >’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::concepts::MultiPassInputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > > >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > > >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > > >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> >]’
32 | inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
| ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied<boost::concepts::MultiPassInputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > > >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > > >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > > >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> > >::value’
44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied<boost::concepts::MultiPassInputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > > >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > > >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > > >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> > >’
45 | typedef boost::integral_constant<bool, value> type;
| ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_<void (*)(boost::concepts::MultiPassInputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > > >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > > >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > > >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> >)>’
72 | struct requirement_<void(*)(Model)>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:89:9: [ skipping 7 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:500:43: required from ‘void boost::detail::graph::brandes_betweenness_centrality_dispatch2(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >; CentralityMap = boost::dummy_property_map; EdgeCentralityMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>]’
500 | brandes_betweenness_centrality(g, centrality, edge_centrality_map,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
501 | make_iterator_property_map(incoming.begin(), vertex_index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
502 | make_iterator_property_map(distance.begin(), vertex_index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
503 | make_iterator_property_map(dependency.begin(), vertex_index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
504 | make_iterator_property_map(path_count.begin(), vertex_index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
505 | vertex_index);
| ~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:531:57: required from ‘static void boost::detail::graph::brandes_betweenness_centrality_dispatch1<boost::param_not_found>::run(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap, boost::param_not_found) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >; CentralityMap = boost::dummy_property_map; EdgeCentralityMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>]’
531 | brandes_betweenness_centrality_dispatch2(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
532 | g, centrality, edge_centrality_map, vertex_index);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:558:71: required from ‘void boost::brandes_betweenness_centrality(const Graph&, const bgl_named_params<T, Tag, Base>&, typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >; Param = vec_adj_list_vertex_id_map<property<vertex_index_t, int, property<vertex_centrality_t, double> >, long unsigned int>; Tag = vertex_index_t; Rest = bgl_named_params<adj_list_edge_property_map<undirected_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_centrality_t, double> >, edge_centrality_t>, edge_centrality_t, no_property>; typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits<Graph>::traversal_category = undir_adj_list_traversal_tag]’
558 | detail::graph::brandes_betweenness_centrality_dispatch1< ew >::run(g,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
559 | choose_param(
| ~~~~~~~~~~~~~
560 | get_param(params, vertex_centrality), dummy_property_map()),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
561 | choose_param(get_param(params, edge_centrality), dummy_property_map()),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
562 | choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
563 | get_param(params, edge_weight));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/bc_clustering.hpp:131:39: required from ‘void boost::betweenness_centrality_clustering(MutableGraph&, Done, EdgeCentralityMap, VertexIndexMap) [with MutableGraph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >; Done = clustering_threshold; EdgeCentralityMap = adj_list_edge_property_map<undirected_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_centrality_t, double> >, edge_centrality_t>; VertexIndexMap = vec_adj_list_vertex_id_map<property<vertex_index_t, int, property<vertex_centrality_t, double> >, long unsigned int>]’
131 | brandes_betweenness_centrality(g,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
132 | edge_centrality_map(edge_centrality)
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
133 | .vertex_index_map(vertex_index));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/bc_clustering.hpp:150:38: required from ‘void boost::betweenness_centrality_clustering(MutableGraph&, Done, EdgeCentralityMap) [with MutableGraph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >; Done = clustering_threshold; EdgeCentralityMap = adj_list_edge_property_map<undirected_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_centrality_t, double> >, edge_centrality_t>]’
150 | betweenness_centrality_clustering(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
151 | g, done, edge_centrality, get(vertex_index, g));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
bbc.cpp:149:36: required from here
149 | betweenness_centrality_clustering(g,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
150 | clustering_threshold(threshold, g, normalize),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
151 | get(edge_centrality, g));
| ~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::concepts::MultiPassInputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > > >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > > >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > > >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> >]’
20 | ~usage_requirements() { ((Model*)0)->~Model(); }
| ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::MultiPassInputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > > >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > > >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > > >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:89:9: required from ‘boost::concepts::IncidenceGraph<G>::~IncidenceGraph() [with G = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:75:1: required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::IncidenceGraphConcept<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > > >]’
75 | BOOST_concept(IncidenceGraph, (G)) : Graph< G >
| ^~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:129:9: required from ‘void boost::breadth_first_visit(const IncidenceGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with IncidenceGraph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >; Buffer = queue<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > >; BFSVisitor = detail::graph::brandes_unweighted_shortest_paths::visitor_type<const adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >, iterator_property_map<__gnu_cxx::__normal_iterator<std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<undirected_tag, long unsigned int> > >*, std::vector<std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<undirected_tag, long unsigned int> > >, std::allocator<std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<undirected_tag, long unsigned int> > > > > >, vec_adj_list_vertex_id_map<property<vertex_index_t, int, property<vertex_centrality_t, double> >, long unsigned int>, std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<undirected_tag, long unsigned int> > >, std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<undirected_tag, long unsigned int> > >&>, iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > >, vec_adj_list_vertex_id_map<property<vertex_index_t, int, property<vertex_centrality_t, double> >, long unsigned int>, double, double&>, iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > >, vec_adj_list_vertex_id_map<property<vertex_index_t, int, property<vertex_centrality_t, double> >, long unsigned int>, long unsigned int, long unsigned int&> >; ColorMap = iterator_property_map<__gnu_cxx::__normal_iterator<default_color_type*, std::vector<default_color_type> >, vec_adj_list_vertex_id_map<property<vertex_index_t, int, property<vertex_centrality_t, double> >, long unsigned int>, default_color_type, default_color_type&>; SourceIterator = long unsigned int*]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:118:24: required from ‘void boost::breadth_first_visit(const IncidenceGraph&, typename graph_traits<Graph>::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with IncidenceGraph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >; Buffer = queue<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > >; BFSVisitor = detail::graph::brandes_unweighted_shortest_paths::visitor_type<const adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >, iterator_property_map<__gnu_cxx::__normal_iterator<std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<undirected_tag, long unsigned int> > >*, std::vector<std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<undirected_tag, long unsigned int> > >, std::allocator<std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<undirected_tag, long unsigned int> > > > > >, vec_adj_list_vertex_id_map<property<vertex_index_t, int, property<vertex_centrality_t, double> >, long unsigned int>, std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<undirected_tag, long unsigned int> > >, std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<undirected_tag, long unsigned int> > >&>, iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > >, vec_adj_list_vertex_id_map<property<vertex_index_t, int, property<vertex_centrality_t, double> >, long unsigned int>, double, double&>, iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > >, vec_adj_list_vertex_id_map<property<vertex_index_t, int, property<vertex_centrality_t, double> >, long unsigned int>, long unsigned int, long unsigned int&> >; ColorMap = iterator_property_map<__gnu_cxx::__normal_iterator<default_color_type*, std::vector<default_color_type> >, vec_adj_list_vertex_id_map<property<vertex_index_t, int, property<vertex_centrality_t, double> >, long unsigned int>, default_color_type, default_color_type&>; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
118 | breadth_first_visit(g, sources, sources + 1, Q, vis, color);
| ~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:248:36: required from ‘void boost::detail::graph::brandes_unweighted_shortest_paths::operator()(Graph&, typename boost::graph_traits<Graph>::vertex_descriptor, std::stack<typename boost::graph_traits<Graph>::vertex_descriptor>&, IncomingMap, DistanceMap, PathCountMap, VertexIndexMap) [with Graph = const boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >; IncomingMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >*, std::vector<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >, std::allocator<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > > > > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>, std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >, std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >&>; DistanceMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>, double, double&>; PathCountMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’
248 | breadth_first_visit(g, s, Q, visitor,
| ~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~
249 | make_iterator_property_map(colors.begin(), vertex_index));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:349:31: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:500:43: required from ‘void boost::detail::graph::brandes_betweenness_centrality_dispatch2(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >; CentralityMap = boost::dummy_property_map; EdgeCentralityMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>]’
500 | brandes_betweenness_centrality(g, centrality, edge_centrality_map,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
501 | make_iterator_property_map(incoming.begin(), vertex_index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
502 | make_iterator_property_map(distance.begin(), vertex_index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
503 | make_iterator_property_map(dependency.begin(), vertex_index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
504 | make_iterator_property_map(path_count.begin(), vertex_index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
505 | vertex_index);
| ~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:531:57: required from ‘static void boost::detail::graph::brandes_betweenness_centrality_dispatch1<boost::param_not_found>::run(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap, boost::param_not_found) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >; CentralityMap = boost::dummy_property_map; EdgeCentralityMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>]’
531 | brandes_betweenness_centrality_dispatch2(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
532 | g, centrality, edge_centrality_map, vertex_index);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:558:71: required from ‘void boost::brandes_betweenness_centrality(const Graph&, const bgl_named_params<T, Tag, Base>&, typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >; Param = vec_adj_list_vertex_id_map<property<vertex_index_t, int, property<vertex_centrality_t, double> >, long unsigned int>; Tag = vertex_index_t; Rest = bgl_named_params<adj_list_edge_property_map<undirected_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_centrality_t, double> >, edge_centrality_t>, edge_centrality_t, no_property>; typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits<Graph>::traversal_category = undir_adj_list_traversal_tag]’
558 | detail::graph::brandes_betweenness_centrality_dispatch1< ew >::run(g,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
559 | choose_param(
| ~~~~~~~~~~~~~
560 | get_param(params, vertex_centrality), dummy_property_map()),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
561 | choose_param(get_param(params, edge_centrality), dummy_property_map()),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
562 | choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
563 | get_param(params, edge_weight));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/bc_clustering.hpp:131:39: required from ‘void boost::betweenness_centrality_clustering(MutableGraph&, Done, EdgeCentralityMap, VertexIndexMap) [with MutableGraph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >; Done = clustering_threshold; EdgeCentralityMap = adj_list_edge_property_map<undirected_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_centrality_t, double> >, edge_centrality_t>; VertexIndexMap = vec_adj_list_vertex_id_map<property<vertex_index_t, int, property<vertex_centrality_t, double> >, long unsigned int>]’
131 | brandes_betweenness_centrality(g,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
132 | edge_centrality_map(edge_centrality)
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
133 | .vertex_index_map(vertex_index));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/bc_clustering.hpp:150:38: required from ‘void boost::betweenness_centrality_clustering(MutableGraph&, Done, EdgeCentralityMap) [with MutableGraph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >; Done = clustering_threshold; EdgeCentralityMap = adj_list_edge_property_map<undirected_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_centrality_t, double> >, edge_centrality_t>]’
150 | betweenness_centrality_clustering(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
151 | g, done, edge_centrality, get(vertex_index, g));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
bbc.cpp:149:36: required from here
149 | betweenness_centrality_clustering(g,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
150 | clustering_threshold(threshold, g, normalize),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
151 | get(edge_centrality, g));
| ~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::concepts::MultiPassInputIterator<T>::~MultiPassInputIterator() [with T = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > > >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > > >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > > >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int>]’
37 | ~model()
| ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:52:50: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
52 | BOOST_concept(MultiPassInputIterator, (T)) { BOOST_CONCEPT_USAGE(
| ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::DefaultConstructible<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:137:5: required from ‘struct boost::DefaultConstructible<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> >’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::DefaultConstructible<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> >]’
32 | inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
| ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied<boost::DefaultConstructible<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >::value’
44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied<boost::DefaultConstructible<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >’
45 | typedef boost::integral_constant<bool, value> type;
| ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_<void (*)(boost::DefaultConstructible<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> >)>’
72 | struct requirement_<void(*)(Model)>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:90:9: [ skipping 7 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:500:43: required from ‘void boost::detail::graph::brandes_betweenness_centrality_dispatch2(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >; CentralityMap = boost::dummy_property_map; EdgeCentralityMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>]’
500 | brandes_betweenness_centrality(g, centrality, edge_centrality_map,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
501 | make_iterator_property_map(incoming.begin(), vertex_index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
502 | make_iterator_property_map(distance.begin(), vertex_index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
503 | make_iterator_property_map(dependency.begin(), vertex_index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
504 | make_iterator_property_map(path_count.begin(), vertex_index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
505 | vertex_index);
| ~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:531:57: required from ‘static void boost::detail::graph::brandes_betweenness_centrality_dispatch1<boost::param_not_found>::run(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap, boost::param_not_found) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >; CentralityMap = boost::dummy_property_map; EdgeCentralityMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>]’
531 | brandes_betweenness_centrality_dispatch2(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
532 | g, centrality, edge_centrality_map, vertex_index);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:558:71: required from ‘void boost::brandes_betweenness_centrality(const Graph&, const bgl_named_params<T, Tag, Base>&, typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >; Param = vec_adj_list_vertex_id_map<property<vertex_index_t, int, property<vertex_centrality_t, double> >, long unsigned int>; Tag = vertex_index_t; Rest = bgl_named_params<adj_list_edge_property_map<undirected_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_centrality_t, double> >, edge_centrality_t>, edge_centrality_t, no_property>; typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits<Graph>::traversal_category = undir_adj_list_traversal_tag]’
558 | detail::graph::brandes_betweenness_centrality_dispatch1< ew >::run(g,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
559 | choose_param(
| ~~~~~~~~~~~~~
560 | get_param(params, vertex_centrality), dummy_property_map()),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
561 | choose_param(get_param(params, edge_centrality), dummy_property_map()),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
562 | choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
563 | get_param(params, edge_weight));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/bc_clustering.hpp:131:39: required from ‘void boost::betweenness_centrality_clustering(MutableGraph&, Done, EdgeCentralityMap, VertexIndexMap) [with MutableGraph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >; Done = clustering_threshold; EdgeCentralityMap = adj_list_edge_property_map<undirected_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_centrality_t, double> >, edge_centrality_t>; VertexIndexMap = vec_adj_list_vertex_id_map<property<vertex_index_t, int, property<vertex_centrality_t, double> >, long unsigned int>]’
131 | brandes_betweenness_centrality(g,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
132 | edge_centrality_map(edge_centrality)
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
133 | .vertex_index_map(vertex_index));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/bc_clustering.hpp:150:38: required from ‘void boost::betweenness_centrality_clustering(MutableGraph&, Done, EdgeCentralityMap) [with MutableGraph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >; Done = clustering_threshold; EdgeCentralityMap = adj_list_edge_property_map<undirected_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_centrality_t, double> >, edge_centrality_t>]’
150 | betweenness_centrality_clustering(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
151 | g, done, edge_centrality, get(vertex_index, g));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
bbc.cpp:149:36: required from here
149 | betweenness_centrality_clustering(g,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
150 | clustering_threshold(threshold, g, normalize),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
151 | get(edge_centrality, g));
| ~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::DefaultConstructible<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> >]’
20 | ~usage_requirements() { ((Model*)0)->~Model(); }
| ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::DefaultConstructible<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:90:9: required from ‘boost::concepts::IncidenceGraph<G>::~IncidenceGraph() [with G = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:75:1: required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::IncidenceGraphConcept<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > > >]’
75 | BOOST_concept(IncidenceGraph, (G)) : Graph< G >
| ^~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:129:9: required from ‘void boost::breadth_first_visit(const IncidenceGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with IncidenceGraph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >; Buffer = queue<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > >; BFSVisitor = detail::graph::brandes_unweighted_shortest_paths::visitor_type<const adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >, iterator_property_map<__gnu_cxx::__normal_iterator<std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<undirected_tag, long unsigned int> > >*, std::vector<std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<undirected_tag, long unsigned int> > >, std::allocator<std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<undirected_tag, long unsigned int> > > > > >, vec_adj_list_vertex_id_map<property<vertex_index_t, int, property<vertex_centrality_t, double> >, long unsigned int>, std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<undirected_tag, long unsigned int> > >, std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<undirected_tag, long unsigned int> > >&>, iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > >, vec_adj_list_vertex_id_map<property<vertex_index_t, int, property<vertex_centrality_t, double> >, long unsigned int>, double, double&>, iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > >, vec_adj_list_vertex_id_map<property<vertex_index_t, int, property<vertex_centrality_t, double> >, long unsigned int>, long unsigned int, long unsigned int&> >; ColorMap = iterator_property_map<__gnu_cxx::__normal_iterator<default_color_type*, std::vector<default_color_type> >, vec_adj_list_vertex_id_map<property<vertex_index_t, int, property<vertex_centrality_t, double> >, long unsigned int>, default_color_type, default_color_type&>; SourceIterator = long unsigned int*]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:118:24: required from ‘void boost::breadth_first_visit(const IncidenceGraph&, typename graph_traits<Graph>::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with IncidenceGraph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >; Buffer = queue<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > >; BFSVisitor = detail::graph::brandes_unweighted_shortest_paths::visitor_type<const adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >, iterator_property_map<__gnu_cxx::__normal_iterator<std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<undirected_tag, long unsigned int> > >*, std::vector<std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<undirected_tag, long unsigned int> > >, std::allocator<std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<undirected_tag, long unsigned int> > > > > >, vec_adj_list_vertex_id_map<property<vertex_index_t, int, property<vertex_centrality_t, double> >, long unsigned int>, std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<undirected_tag, long unsigned int> > >, std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<undirected_tag, long unsigned int> > >&>, iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > >, vec_adj_list_vertex_id_map<property<vertex_index_t, int, property<vertex_centrality_t, double> >, long unsigned int>, double, double&>, iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > >, vec_adj_list_vertex_id_map<property<vertex_index_t, int, property<vertex_centrality_t, double> >, long unsigned int>, long unsigned int, long unsigned int&> >; ColorMap = iterator_property_map<__gnu_cxx::__normal_iterator<default_color_type*, std::vector<default_color_type> >, vec_adj_list_vertex_id_map<property<vertex_index_t, int, property<vertex_centrality_t, double> >, long unsigned int>, default_color_type, default_color_type&>; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
118 | breadth_first_visit(g, sources, sources + 1, Q, vis, color);
| ~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:248:36: required from ‘void boost::detail::graph::brandes_unweighted_shortest_paths::operator()(Graph&, typename boost::graph_traits<Graph>::vertex_descriptor, std::stack<typename boost::graph_traits<Graph>::vertex_descriptor>&, IncomingMap, DistanceMap, PathCountMap, VertexIndexMap) [with Graph = const boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >; IncomingMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >*, std::vector<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >, std::allocator<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > > > > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>, std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >, std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >&>; DistanceMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>, double, double&>; PathCountMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’
248 | breadth_first_visit(g, s, Q, visitor,
| ~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~
249 | make_iterator_property_map(colors.begin(), vertex_index));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:349:31: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:500:43: required from ‘void boost::detail::graph::brandes_betweenness_centrality_dispatch2(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >; CentralityMap = boost::dummy_property_map; EdgeCentralityMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>]’
500 | brandes_betweenness_centrality(g, centrality, edge_centrality_map,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
501 | make_iterator_property_map(incoming.begin(), vertex_index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
502 | make_iterator_property_map(distance.begin(), vertex_index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
503 | make_iterator_property_map(dependency.begin(), vertex_index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
504 | make_iterator_property_map(path_count.begin(), vertex_index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
505 | vertex_index);
| ~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:531:57: required from ‘static void boost::detail::graph::brandes_betweenness_centrality_dispatch1<boost::param_not_found>::run(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap, boost::param_not_found) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >; CentralityMap = boost::dummy_property_map; EdgeCentralityMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>]’
531 | brandes_betweenness_centrality_dispatch2(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
532 | g, centrality, edge_centrality_map, vertex_index);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:558:71: required from ‘void boost::brandes_betweenness_centrality(const Graph&, const bgl_named_params<T, Tag, Base>&, typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >; Param = vec_adj_list_vertex_id_map<property<vertex_index_t, int, property<vertex_centrality_t, double> >, long unsigned int>; Tag = vertex_index_t; Rest = bgl_named_params<adj_list_edge_property_map<undirected_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_centrality_t, double> >, edge_centrality_t>, edge_centrality_t, no_property>; typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits<Graph>::traversal_category = undir_adj_list_traversal_tag]’
558 | detail::graph::brandes_betweenness_centrality_dispatch1< ew >::run(g,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
559 | choose_param(
| ~~~~~~~~~~~~~
560 | get_param(params, vertex_centrality), dummy_property_map()),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
561 | choose_param(get_param(params, edge_centrality), dummy_property_map()),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
562 | choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
563 | get_param(params, edge_weight));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/bc_clustering.hpp:131:39: required from ‘void boost::betweenness_centrality_clustering(MutableGraph&, Done, EdgeCentralityMap, VertexIndexMap) [with MutableGraph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >; Done = clustering_threshold; EdgeCentralityMap = adj_list_edge_property_map<undirected_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_centrality_t, double> >, edge_centrality_t>; VertexIndexMap = vec_adj_list_vertex_id_map<property<vertex_index_t, int, property<vertex_centrality_t, double> >, long unsigned int>]’
131 | brandes_betweenness_centrality(g,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
132 | edge_centrality_map(edge_centrality)
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
133 | .vertex_index_map(vertex_index));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/bc_clustering.hpp:150:38: required from ‘void boost::betweenness_centrality_clustering(MutableGraph&, Done, EdgeCentralityMap) [with MutableGraph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >; Done = clustering_threshold; EdgeCentralityMap = adj_list_edge_property_map<undirected_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_centrality_t, double> >, edge_centrality_t>]’
150 | betweenness_centrality_clustering(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
151 | g, done, edge_centrality, get(vertex_index, g));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
bbc.cpp:149:36: required from here
149 | betweenness_centrality_clustering(g,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
150 | clustering_threshold(threshold, g, normalize),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
151 | get(edge_centrality, g));
| ~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::DefaultConstructible<TT>::~DefaultConstructible() [with TT = boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>]’
37 | ~model()
| ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:137:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
137 | BOOST_CONCEPT_USAGE(DefaultConstructible) {
| ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::EqualityComparable<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> >’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::EqualityComparable<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> >]’
32 | inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
| ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied<boost::EqualityComparable<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >::value’
44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied<boost::EqualityComparable<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >’
45 | typedef boost::integral_constant<bool, value> type;
| ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_<void (*)(boost::EqualityComparable<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> >)>’
72 | struct requirement_<void(*)(Model)>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:91:9: [ skipping 7 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:500:43: required from ‘void boost::detail::graph::brandes_betweenness_centrality_dispatch2(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >; CentralityMap = boost::dummy_property_map; EdgeCentralityMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>]’
500 | brandes_betweenness_centrality(g, centrality, edge_centrality_map,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
501 | make_iterator_property_map(incoming.begin(), vertex_index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
502 | make_iterator_property_map(distance.begin(), vertex_index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
503 | make_iterator_property_map(dependency.begin(), vertex_index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
504 | make_iterator_property_map(path_count.begin(), vertex_index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
505 | vertex_index);
| ~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:531:57: required from ‘static void boost::detail::graph::brandes_betweenness_centrality_dispatch1<boost::param_not_found>::run(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap, boost::param_not_found) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >; CentralityMap = boost::dummy_property_map; EdgeCentralityMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>]’
531 | brandes_betweenness_centrality_dispatch2(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
532 | g, centrality, edge_centrality_map, vertex_index);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:558:71: required from ‘void boost::brandes_betweenness_centrality(const Graph&, const bgl_named_params<T, Tag, Base>&, typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >; Param = vec_adj_list_vertex_id_map<property<vertex_index_t, int, property<vertex_centrality_t, double> >, long unsigned int>; Tag = vertex_index_t; Rest = bgl_named_params<adj_list_edge_property_map<undirected_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_centrality_t, double> >, edge_centrality_t>, edge_centrality_t, no_property>; typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits<Graph>::traversal_category = undir_adj_list_traversal_tag]’
558 | detail::graph::brandes_betweenness_centrality_dispatch1< ew >::run(g,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
559 | choose_param(
| ~~~~~~~~~~~~~
560 | get_param(params, vertex_centrality), dummy_property_map()),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
561 | choose_param(get_param(params, edge_centrality), dummy_property_map()),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
562 | choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
563 | get_param(params, edge_weight));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/bc_clustering.hpp:131:39: required from ‘void boost::betweenness_centrality_clustering(MutableGraph&, Done, EdgeCentralityMap, VertexIndexMap) [with MutableGraph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >; Done = clustering_threshold; EdgeCentralityMap = adj_list_edge_property_map<undirected_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_centrality_t, double> >, edge_centrality_t>; VertexIndexMap = vec_adj_list_vertex_id_map<property<vertex_index_t, int, property<vertex_centrality_t, double> >, long unsigned int>]’
131 | brandes_betweenness_centrality(g,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
132 | edge_centrality_map(edge_centrality)
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
133 | .vertex_index_map(vertex_index));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/bc_clustering.hpp:150:38: required from ‘void boost::betweenness_centrality_clustering(MutableGraph&, Done, EdgeCentralityMap) [with MutableGraph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >; Done = clustering_threshold; EdgeCentralityMap = adj_list_edge_property_map<undirected_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_centrality_t, double> >, edge_centrality_t>]’
150 | betweenness_centrality_clustering(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
151 | g, done, edge_centrality, get(vertex_index, g));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
bbc.cpp:149:36: required from here
149 | betweenness_centrality_clustering(g,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
150 | clustering_threshold(threshold, g, normalize),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
151 | get(edge_centrality, g));
| ~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::EqualityComparable<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> >]’
20 | ~usage_requirements() { ((Model*)0)->~Model(); }
| ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::EqualityComparable<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:91:9: required from ‘boost::concepts::IncidenceGraph<G>::~IncidenceGraph() [with G = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:75:1: required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::IncidenceGraphConcept<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > > >]’
75 | BOOST_concept(IncidenceGraph, (G)) : Graph< G >
| ^~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:129:9: required from ‘void boost::breadth_first_visit(const IncidenceGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with IncidenceGraph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >; Buffer = queue<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > >; BFSVisitor = detail::graph::brandes_unweighted_shortest_paths::visitor_type<const adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >, iterator_property_map<__gnu_cxx::__normal_iterator<std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<undirected_tag, long unsigned int> > >*, std::vector<std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<undirected_tag, long unsigned int> > >, std::allocator<std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<undirected_tag, long unsigned int> > > > > >, vec_adj_list_vertex_id_map<property<vertex_index_t, int, property<vertex_centrality_t, double> >, long unsigned int>, std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<undirected_tag, long unsigned int> > >, std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<undirected_tag, long unsigned int> > >&>, iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > >, vec_adj_list_vertex_id_map<property<vertex_index_t, int, property<vertex_centrality_t, double> >, long unsigned int>, double, double&>, iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > >, vec_adj_list_vertex_id_map<property<vertex_index_t, int, property<vertex_centrality_t, double> >, long unsigned int>, long unsigned int, long unsigned int&> >; ColorMap = iterator_property_map<__gnu_cxx::__normal_iterator<default_color_type*, std::vector<default_color_type> >, vec_adj_list_vertex_id_map<property<vertex_index_t, int, property<vertex_centrality_t, double> >, long unsigned int>, default_color_type, default_color_type&>; SourceIterator = long unsigned int*]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:118:24: required from ‘void boost::breadth_first_visit(const IncidenceGraph&, typename graph_traits<Graph>::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with IncidenceGraph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >; Buffer = queue<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > >; BFSVisitor = detail::graph::brandes_unweighted_shortest_paths::visitor_type<const adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >, iterator_property_map<__gnu_cxx::__normal_iterator<std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<undirected_tag, long unsigned int> > >*, std::vector<std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<undirected_tag, long unsigned int> > >, std::allocator<std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<undirected_tag, long unsigned int> > > > > >, vec_adj_list_vertex_id_map<property<vertex_index_t, int, property<vertex_centrality_t, double> >, long unsigned int>, std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<undirected_tag, long unsigned int> > >, std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<undirected_tag, long unsigned int> > >&>, iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > >, vec_adj_list_vertex_id_map<property<vertex_index_t, int, property<vertex_centrality_t, double> >, long unsigned int>, double, double&>, iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > >, vec_adj_list_vertex_id_map<property<vertex_index_t, int, property<vertex_centrality_t, double> >, long unsigned int>, long unsigned int, long unsigned int&> >; ColorMap = iterator_property_map<__gnu_cxx::__normal_iterator<default_color_type*, std::vector<default_color_type> >, vec_adj_list_vertex_id_map<property<vertex_index_t, int, property<vertex_centrality_t, double> >, long unsigned int>, default_color_type, default_color_type&>; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
118 | breadth_first_visit(g, sources, sources + 1, Q, vis, color);
| ~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:248:36: required from ‘void boost::detail::graph::brandes_unweighted_shortest_paths::operator()(Graph&, typename boost::graph_traits<Graph>::vertex_descriptor, std::stack<typename boost::graph_traits<Graph>::vertex_descriptor>&, IncomingMap, DistanceMap, PathCountMap, VertexIndexMap) [with Graph = const boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >; IncomingMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >*, std::vector<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >, std::allocator<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > > > > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>, std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >, std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >&>; DistanceMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>, double, double&>; PathCountMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’
248 | breadth_first_visit(g, s, Q, visitor,
| ~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~
249 | make_iterator_property_map(colors.begin(), vertex_index));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:349:31: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:500:43: required from ‘void boost::detail::graph::brandes_betweenness_centrality_dispatch2(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >; CentralityMap = boost::dummy_property_map; EdgeCentralityMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>]’
500 | brandes_betweenness_centrality(g, centrality, edge_centrality_map,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
501 | make_iterator_property_map(incoming.begin(), vertex_index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
502 | make_iterator_property_map(distance.begin(), vertex_index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
503 | make_iterator_property_map(dependency.begin(), vertex_index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
504 | make_iterator_property_map(path_count.begin(), vertex_index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
505 | vertex_index);
| ~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:531:57: required from ‘static void boost::detail::graph::brandes_betweenness_centrality_dispatch1<boost::param_not_found>::run(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap, boost::param_not_found) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >; CentralityMap = boost::dummy_property_map; EdgeCentralityMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>]’
531 | brandes_betweenness_centrality_dispatch2(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
532 | g, centrality, edge_centrality_map, vertex_index);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:558:71: required from ‘void boost::brandes_betweenness_centrality(const Graph&, const bgl_named_params<T, Tag, Base>&, typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >; Param = vec_adj_list_vertex_id_map<property<vertex_index_t, int, property<vertex_centrality_t, double> >, long unsigned int>; Tag = vertex_index_t; Rest = bgl_named_params<adj_list_edge_property_map<undirected_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_centrality_t, double> >, edge_centrality_t>, edge_centrality_t, no_property>; typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits<Graph>::traversal_category = undir_adj_list_traversal_tag]’
558 | detail::graph::brandes_betweenness_centrality_dispatch1< ew >::run(g,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
559 | choose_param(
| ~~~~~~~~~~~~~
560 | get_param(params, vertex_centrality), dummy_property_map()),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
561 | choose_param(get_param(params, edge_centrality), dummy_property_map()),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
562 | choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
563 | get_param(params, edge_weight));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/bc_clustering.hpp:131:39: required from ‘void boost::betweenness_centrality_clustering(MutableGraph&, Done, EdgeCentralityMap, VertexIndexMap) [with MutableGraph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >; Done = clustering_threshold; EdgeCentralityMap = adj_list_edge_property_map<undirected_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_centrality_t, double> >, edge_centrality_t>; VertexIndexMap = vec_adj_list_vertex_id_map<property<vertex_index_t, int, property<vertex_centrality_t, double> >, long unsigned int>]’
131 | brandes_betweenness_centrality(g,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
132 | edge_centrality_map(edge_centrality)
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
133 | .vertex_index_map(vertex_index));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/bc_clustering.hpp:150:38: required from ‘void boost::betweenness_centrality_clustering(MutableGraph&, Done, EdgeCentralityMap) [with MutableGraph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >; Done = clustering_threshold; EdgeCentralityMap = adj_list_edge_property_map<undirected_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_centrality_t, double> >, edge_centrality_t>]’
150 | betweenness_centrality_clustering(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
151 | g, done, edge_centrality, get(vertex_index, g));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
bbc.cpp:149:36: required from here
149 | betweenness_centrality_clustering(g,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
150 | clustering_threshold(threshold, g, normalize),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
151 | get(edge_centrality, g));
| ~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::EqualityComparable<TT>::~EqualityComparable() [with TT = boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>]’
37 | ~model()
| ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:233:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
233 | BOOST_CONCEPT_USAGE(EqualityComparable) {
| ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Assignable<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:145:5: required from ‘struct boost::Assignable<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> >’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::Assignable<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> >]’
32 | inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
| ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied<boost::Assignable<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >::value’
44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied<boost::Assignable<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >’
45 | typedef boost::integral_constant<bool, value> type;
| ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_<void (*)(boost::Assignable<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> >)>’
72 | struct requirement_<void(*)(Model)>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:92:9: [ skipping 7 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:500:43: required from ‘void boost::detail::graph::brandes_betweenness_centrality_dispatch2(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >; CentralityMap = boost::dummy_property_map; EdgeCentralityMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>]’
500 | brandes_betweenness_centrality(g, centrality, edge_centrality_map,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
501 | make_iterator_property_map(incoming.begin(), vertex_index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
502 | make_iterator_property_map(distance.begin(), vertex_index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
503 | make_iterator_property_map(dependency.begin(), vertex_index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
504 | make_iterator_property_map(path_count.begin(), vertex_index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
505 | vertex_index);
| ~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:531:57: required from ‘static void boost::detail::graph::brandes_betweenness_centrality_dispatch1<boost::param_not_found>::run(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap, boost::param_not_found) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >; CentralityMap = boost::dummy_property_map; EdgeCentralityMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>]’
531 | brandes_betweenness_centrality_dispatch2(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
532 | g, centrality, edge_centrality_map, vertex_index);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:558:71: required from ‘void boost::brandes_betweenness_centrality(const Graph&, const bgl_named_params<T, Tag, Base>&, typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >; Param = vec_adj_list_vertex_id_map<property<vertex_index_t, int, property<vertex_centrality_t, double> >, long unsigned int>; Tag = vertex_index_t; Rest = bgl_named_params<adj_list_edge_property_map<undirected_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_centrality_t, double> >, edge_centrality_t>, edge_centrality_t, no_property>; typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits<Graph>::traversal_category = undir_adj_list_traversal_tag]’
558 | detail::graph::brandes_betweenness_centrality_dispatch1< ew >::run(g,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
559 | choose_param(
| ~~~~~~~~~~~~~
560 | get_param(params, vertex_centrality), dummy_property_map()),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
561 | choose_param(get_param(params, edge_centrality), dummy_property_map()),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
562 | choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
563 | get_param(params, edge_weight));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/bc_clustering.hpp:131:39: required from ‘void boost::betweenness_centrality_clustering(MutableGraph&, Done, EdgeCentralityMap, VertexIndexMap) [with MutableGraph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >; Done = clustering_threshold; EdgeCentralityMap = adj_list_edge_property_map<undirected_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_centrality_t, double> >, edge_centrality_t>; VertexIndexMap = vec_adj_list_vertex_id_map<property<vertex_index_t, int, property<vertex_centrality_t, double> >, long unsigned int>]’
131 | brandes_betweenness_centrality(g,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
132 | edge_centrality_map(edge_centrality)
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
133 | .vertex_index_map(vertex_index));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/bc_clustering.hpp:150:38: required from ‘void boost::betweenness_centrality_clustering(MutableGraph&, Done, EdgeCentralityMap) [with MutableGraph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >; Done = clustering_threshold; EdgeCentralityMap = adj_list_edge_property_map<undirected_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_centrality_t, double> >, edge_centrality_t>]’
150 | betweenness_centrality_clustering(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
151 | g, done, edge_centrality, get(vertex_index, g));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
bbc.cpp:149:36: required from here
149 | betweenness_centrality_clustering(g,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
150 | clustering_threshold(threshold, g, normalize),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
151 | get(edge_centrality, g));
| ~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Assignable<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> >]’
20 | ~usage_requirements() { ((Model*)0)->~Model(); }
| ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::Assignable<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:92:9: required from ‘boost::concepts::IncidenceGraph<G>::~IncidenceGraph() [with G = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:75:1: required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::IncidenceGraphConcept<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > > >]’
75 | BOOST_concept(IncidenceGraph, (G)) : Graph< G >
| ^~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:129:9: required from ‘void boost::breadth_first_visit(const IncidenceGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with IncidenceGraph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >; Buffer = queue<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > >; BFSVisitor = detail::graph::brandes_unweighted_shortest_paths::visitor_type<const adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >, iterator_property_map<__gnu_cxx::__normal_iterator<std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<undirected_tag, long unsigned int> > >*, std::vector<std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<undirected_tag, long unsigned int> > >, std::allocator<std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<undirected_tag, long unsigned int> > > > > >, vec_adj_list_vertex_id_map<property<vertex_index_t, int, property<vertex_centrality_t, double> >, long unsigned int>, std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<undirected_tag, long unsigned int> > >, std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<undirected_tag, long unsigned int> > >&>, iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > >, vec_adj_list_vertex_id_map<property<vertex_index_t, int, property<vertex_centrality_t, double> >, long unsigned int>, double, double&>, iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > >, vec_adj_list_vertex_id_map<property<vertex_index_t, int, property<vertex_centrality_t, double> >, long unsigned int>, long unsigned int, long unsigned int&> >; ColorMap = iterator_property_map<__gnu_cxx::__normal_iterator<default_color_type*, std::vector<default_color_type> >, vec_adj_list_vertex_id_map<property<vertex_index_t, int, property<vertex_centrality_t, double> >, long unsigned int>, default_color_type, default_color_type&>; SourceIterator = long unsigned int*]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:118:24: required from ‘void boost::breadth_first_visit(const IncidenceGraph&, typename graph_traits<Graph>::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with IncidenceGraph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >; Buffer = queue<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > >; BFSVisitor = detail::graph::brandes_unweighted_shortest_paths::visitor_type<const adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >, iterator_property_map<__gnu_cxx::__normal_iterator<std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<undirected_tag, long unsigned int> > >*, std::vector<std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<undirected_tag, long unsigned int> > >, std::allocator<std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<undirected_tag, long unsigned int> > > > > >, vec_adj_list_vertex_id_map<property<vertex_index_t, int, property<vertex_centrality_t, double> >, long unsigned int>, std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<undirected_tag, long unsigned int> > >, std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<undirected_tag, long unsigned int> > >&>, iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > >, vec_adj_list_vertex_id_map<property<vertex_index_t, int, property<vertex_centrality_t, double> >, long unsigned int>, double, double&>, iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > >, vec_adj_list_vertex_id_map<property<vertex_index_t, int, property<vertex_centrality_t, double> >, long unsigned int>, long unsigned int, long unsigned int&> >; ColorMap = iterator_property_map<__gnu_cxx::__normal_iterator<default_color_type*, std::vector<default_color_type> >, vec_adj_list_vertex_id_map<property<vertex_index_t, int, property<vertex_centrality_t, double> >, long unsigned int>, default_color_type, default_color_type&>; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
118 | breadth_first_visit(g, sources, sources + 1, Q, vis, color);
| ~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:248:36: required from ‘void boost::detail::graph::brandes_unweighted_shortest_paths::operator()(Graph&, typename boost::graph_traits<Graph>::vertex_descriptor, std::stack<typename boost::graph_traits<Graph>::vertex_descriptor>&, IncomingMap, DistanceMap, PathCountMap, VertexIndexMap) [with Graph = const boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >; IncomingMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >*, std::vector<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >, std::allocator<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > > > > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>, std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >, std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >&>; DistanceMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>, double, double&>; PathCountMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’
248 | breadth_first_visit(g, s, Q, visitor,
| ~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~
249 | make_iterator_property_map(colors.begin(), vertex_index));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:349:31: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:500:43: required from ‘void boost::detail::graph::brandes_betweenness_centrality_dispatch2(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >; CentralityMap = boost::dummy_property_map; EdgeCentralityMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>]’
500 | brandes_betweenness_centrality(g, centrality, edge_centrality_map,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
501 | make_iterator_property_map(incoming.begin(), vertex_index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
502 | make_iterator_property_map(distance.begin(), vertex_index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
503 | make_iterator_property_map(dependency.begin(), vertex_index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
504 | make_iterator_property_map(path_count.begin(), vertex_index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
505 | vertex_index);
| ~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:531:57: required from ‘static void boost::detail::graph::brandes_betweenness_centrality_dispatch1<boost::param_not_found>::run(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap, boost::param_not_found) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >; CentralityMap = boost::dummy_property_map; EdgeCentralityMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>]’
531 | brandes_betweenness_centrality_dispatch2(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
532 | g, centrality, edge_centrality_map, vertex_index);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:558:71: required from ‘void boost::brandes_betweenness_centrality(const Graph&, const bgl_named_params<T, Tag, Base>&, typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >; Param = vec_adj_list_vertex_id_map<property<vertex_index_t, int, property<vertex_centrality_t, double> >, long unsigned int>; Tag = vertex_index_t; Rest = bgl_named_params<adj_list_edge_property_map<undirected_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_centrality_t, double> >, edge_centrality_t>, edge_centrality_t, no_property>; typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits<Graph>::traversal_category = undir_adj_list_traversal_tag]’
558 | detail::graph::brandes_betweenness_centrality_dispatch1< ew >::run(g,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
559 | choose_param(
| ~~~~~~~~~~~~~
560 | get_param(params, vertex_centrality), dummy_property_map()),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
561 | choose_param(get_param(params, edge_centrality), dummy_property_map()),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
562 | choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
563 | get_param(params, edge_weight));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/bc_clustering.hpp:131:39: required from ‘void boost::betweenness_centrality_clustering(MutableGraph&, Done, EdgeCentralityMap, VertexIndexMap) [with MutableGraph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >; Done = clustering_threshold; EdgeCentralityMap = adj_list_edge_property_map<undirected_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_centrality_t, double> >, edge_centrality_t>; VertexIndexMap = vec_adj_list_vertex_id_map<property<vertex_index_t, int, property<vertex_centrality_t, double> >, long unsigned int>]’
131 | brandes_betweenness_centrality(g,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
132 | edge_centrality_map(edge_centrality)
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
133 | .vertex_index_map(vertex_index));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/bc_clustering.hpp:150:38: required from ‘void boost::betweenness_centrality_clustering(MutableGraph&, Done, EdgeCentralityMap) [with MutableGraph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >; Done = clustering_threshold; EdgeCentralityMap = adj_list_edge_property_map<undirected_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_centrality_t, double> >, edge_centrality_t>]’
150 | betweenness_centrality_clustering(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
151 | g, done, edge_centrality, get(vertex_index, g));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
bbc.cpp:149:36: required from here
149 | betweenness_centrality_clustering(g,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
150 | clustering_threshold(threshold, g, normalize),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
151 | get(edge_centrality, g));
| ~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Assignable<TT>::~Assignable() [with TT = boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>]’
37 | ~model()
| ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:145:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
145 | BOOST_CONCEPT_USAGE(Assignable) {
| ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Convertible<boost::undir_adj_list_traversal_tag, boost::incidence_graph_tag> >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible<boost::undir_adj_list_traversal_tag, boost::incidence_graph_tag>’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::Convertible<boost::undir_adj_list_traversal_tag, boost::incidence_graph_tag>]’
32 | inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
| ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied<boost::Convertible<boost::undir_adj_list_traversal_tag, boost::incidence_graph_tag> >::value’
44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied<boost::Convertible<boost::undir_adj_list_traversal_tag, boost::incidence_graph_tag> >’
45 | typedef boost::integral_constant<bool, value> type;
| ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_<void (*)(boost::Convertible<boost::undir_adj_list_traversal_tag, boost::incidence_graph_tag>)>’
72 | struct requirement_<void(*)(Model)>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:93:9: [ skipping 7 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:500:43: required from ‘void boost::detail::graph::brandes_betweenness_centrality_dispatch2(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >; CentralityMap = boost::dummy_property_map; EdgeCentralityMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>]’
500 | brandes_betweenness_centrality(g, centrality, edge_centrality_map,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
501 | make_iterator_property_map(incoming.begin(), vertex_index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
502 | make_iterator_property_map(distance.begin(), vertex_index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
503 | make_iterator_property_map(dependency.begin(), vertex_index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
504 | make_iterator_property_map(path_count.begin(), vertex_index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
505 | vertex_index);
| ~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:531:57: required from ‘static void boost::detail::graph::brandes_betweenness_centrality_dispatch1<boost::param_not_found>::run(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap, boost::param_not_found) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >; CentralityMap = boost::dummy_property_map; EdgeCentralityMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>]’
531 | brandes_betweenness_centrality_dispatch2(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
532 | g, centrality, edge_centrality_map, vertex_index);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:558:71: required from ‘void boost::brandes_betweenness_centrality(const Graph&, const bgl_named_params<T, Tag, Base>&, typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >; Param = vec_adj_list_vertex_id_map<property<vertex_index_t, int, property<vertex_centrality_t, double> >, long unsigned int>; Tag = vertex_index_t; Rest = bgl_named_params<adj_list_edge_property_map<undirected_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_centrality_t, double> >, edge_centrality_t>, edge_centrality_t, no_property>; typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits<Graph>::traversal_category = undir_adj_list_traversal_tag]’
558 | detail::graph::brandes_betweenness_centrality_dispatch1< ew >::run(g,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
559 | choose_param(
| ~~~~~~~~~~~~~
560 | get_param(params, vertex_centrality), dummy_property_map()),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
561 | choose_param(get_param(params, edge_centrality), dummy_property_map()),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
562 | choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
563 | get_param(params, edge_weight));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/bc_clustering.hpp:131:39: required from ‘void boost::betweenness_centrality_clustering(MutableGraph&, Done, EdgeCentralityMap, VertexIndexMap) [with MutableGraph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >; Done = clustering_threshold; EdgeCentralityMap = adj_list_edge_property_map<undirected_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_centrality_t, double> >, edge_centrality_t>; VertexIndexMap = vec_adj_list_vertex_id_map<property<vertex_index_t, int, property<vertex_centrality_t, double> >, long unsigned int>]’
131 | brandes_betweenness_centrality(g,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
132 | edge_centrality_map(edge_centrality)
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
133 | .vertex_index_map(vertex_index));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/bc_clustering.hpp:150:38: required from ‘void boost::betweenness_centrality_clustering(MutableGraph&, Done, EdgeCentralityMap) [with MutableGraph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >; Done = clustering_threshold; EdgeCentralityMap = adj_list_edge_property_map<undirected_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_centrality_t, double> >, edge_centrality_t>]’
150 | betweenness_centrality_clustering(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
151 | g, done, edge_centrality, get(vertex_index, g));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
bbc.cpp:149:36: required from here
149 | betweenness_centrality_clustering(g,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
150 | clustering_threshold(threshold, g, normalize),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
151 | get(edge_centrality, g));
| ~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Convertible<boost::undir_adj_list_traversal_tag, boost::incidence_graph_tag>]’
20 | ~usage_requirements() { ((Model*)0)->~Model(); }
| ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::Convertible<boost::undir_adj_list_traversal_tag, boost::incidence_graph_tag>]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:93:9: required from ‘boost::concepts::IncidenceGraph<G>::~IncidenceGraph() [with G = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:75:1: required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::IncidenceGraphConcept<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > > >]’
75 | BOOST_concept(IncidenceGraph, (G)) : Graph< G >
| ^~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:129:9: required from ‘void boost::breadth_first_visit(const IncidenceGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with IncidenceGraph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >; Buffer = queue<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > >; BFSVisitor = detail::graph::brandes_unweighted_shortest_paths::visitor_type<const adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >, iterator_property_map<__gnu_cxx::__normal_iterator<std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<undirected_tag, long unsigned int> > >*, std::vector<std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<undirected_tag, long unsigned int> > >, std::allocator<std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<undirected_tag, long unsigned int> > > > > >, vec_adj_list_vertex_id_map<property<vertex_index_t, int, property<vertex_centrality_t, double> >, long unsigned int>, std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<undirected_tag, long unsigned int> > >, std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<undirected_tag, long unsigned int> > >&>, iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > >, vec_adj_list_vertex_id_map<property<vertex_index_t, int, property<vertex_centrality_t, double> >, long unsigned int>, double, double&>, iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > >, vec_adj_list_vertex_id_map<property<vertex_index_t, int, property<vertex_centrality_t, double> >, long unsigned int>, long unsigned int, long unsigned int&> >; ColorMap = iterator_property_map<__gnu_cxx::__normal_iterator<default_color_type*, std::vector<default_color_type> >, vec_adj_list_vertex_id_map<property<vertex_index_t, int, property<vertex_centrality_t, double> >, long unsigned int>, default_color_type, default_color_type&>; SourceIterator = long unsigned int*]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:118:24: required from ‘void boost::breadth_first_visit(const IncidenceGraph&, typename graph_traits<Graph>::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with IncidenceGraph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >; Buffer = queue<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > >; BFSVisitor = detail::graph::brandes_unweighted_shortest_paths::visitor_type<const adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >, iterator_property_map<__gnu_cxx::__normal_iterator<std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<undirected_tag, long unsigned int> > >*, std::vector<std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<undirected_tag, long unsigned int> > >, std::allocator<std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<undirected_tag, long unsigned int> > > > > >, vec_adj_list_vertex_id_map<property<vertex_index_t, int, property<vertex_centrality_t, double> >, long unsigned int>, std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<undirected_tag, long unsigned int> > >, std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<undirected_tag, long unsigned int> > >&>, iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > >, vec_adj_list_vertex_id_map<property<vertex_index_t, int, property<vertex_centrality_t, double> >, long unsigned int>, double, double&>, iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > >, vec_adj_list_vertex_id_map<property<vertex_index_t, int, property<vertex_centrality_t, double> >, long unsigned int>, long unsigned int, long unsigned int&> >; ColorMap = iterator_property_map<__gnu_cxx::__normal_iterator<default_color_type*, std::vector<default_color_type> >, vec_adj_list_vertex_id_map<property<vertex_index_t, int, property<vertex_centrality_t, double> >, long unsigned int>, default_color_type, default_color_type&>; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
118 | breadth_first_visit(g, sources, sources + 1, Q, vis, color);
| ~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:248:36: required from ‘void boost::detail::graph::brandes_unweighted_shortest_paths::operator()(Graph&, typename boost::graph_traits<Graph>::vertex_descriptor, std::stack<typename boost::graph_traits<Graph>::vertex_descriptor>&, IncomingMap, DistanceMap, PathCountMap, VertexIndexMap) [with Graph = const boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >; IncomingMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >*, std::vector<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >, std::allocator<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > > > > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>, std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >, std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >&>; DistanceMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>, double, double&>; PathCountMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’
248 | breadth_first_visit(g, s, Q, visitor,
| ~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~
249 | make_iterator_property_map(colors.begin(), vertex_index));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:349:31: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:500:43: required from ‘void boost::detail::graph::brandes_betweenness_centrality_dispatch2(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >; CentralityMap = boost::dummy_property_map; EdgeCentralityMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>]’
500 | brandes_betweenness_centrality(g, centrality, edge_centrality_map,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
501 | make_iterator_property_map(incoming.begin(), vertex_index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
502 | make_iterator_property_map(distance.begin(), vertex_index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
503 | make_iterator_property_map(dependency.begin(), vertex_index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
504 | make_iterator_property_map(path_count.begin(), vertex_index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
505 | vertex_index);
| ~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:531:57: required from ‘static void boost::detail::graph::brandes_betweenness_centrality_dispatch1<boost::param_not_found>::run(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap, boost::param_not_found) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >; CentralityMap = boost::dummy_property_map; EdgeCentralityMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>]’
531 | brandes_betweenness_centrality_dispatch2(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
532 | g, centrality, edge_centrality_map, vertex_index);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:558:71: required from ‘void boost::brandes_betweenness_centrality(const Graph&, const bgl_named_params<T, Tag, Base>&, typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >; Param = vec_adj_list_vertex_id_map<property<vertex_index_t, int, property<vertex_centrality_t, double> >, long unsigned int>; Tag = vertex_index_t; Rest = bgl_named_params<adj_list_edge_property_map<undirected_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_centrality_t, double> >, edge_centrality_t>, edge_centrality_t, no_property>; typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits<Graph>::traversal_category = undir_adj_list_traversal_tag]’
558 | detail::graph::brandes_betweenness_centrality_dispatch1< ew >::run(g,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
559 | choose_param(
| ~~~~~~~~~~~~~
560 | get_param(params, vertex_centrality), dummy_property_map()),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
561 | choose_param(get_param(params, edge_centrality), dummy_property_map()),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
562 | choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
563 | get_param(params, edge_weight));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/bc_clustering.hpp:131:39: required from ‘void boost::betweenness_centrality_clustering(MutableGraph&, Done, EdgeCentralityMap, VertexIndexMap) [with MutableGraph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >; Done = clustering_threshold; EdgeCentralityMap = adj_list_edge_property_map<undirected_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_centrality_t, double> >, edge_centrality_t>; VertexIndexMap = vec_adj_list_vertex_id_map<property<vertex_index_t, int, property<vertex_centrality_t, double> >, long unsigned int>]’
131 | brandes_betweenness_centrality(g,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
132 | edge_centrality_map(edge_centrality)
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
133 | .vertex_index_map(vertex_index));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/bc_clustering.hpp:150:38: required from ‘void boost::betweenness_centrality_clustering(MutableGraph&, Done, EdgeCentralityMap) [with MutableGraph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >; Done = clustering_threshold; EdgeCentralityMap = adj_list_edge_property_map<undirected_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_centrality_t, double> >, edge_centrality_t>]’
150 | betweenness_centrality_clustering(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
151 | g, done, edge_centrality, get(vertex_index, g));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
bbc.cpp:149:36: required from here
149 | betweenness_centrality_clustering(g,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
150 | clustering_threshold(threshold, g, normalize),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
151 | get(edge_centrality, g));
| ~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible<X, Y>::~Convertible() [with X = boost::undir_adj_list_traversal_tag; Y = boost::incidence_graph_tag]’
37 | ~model()
| ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
208 | BOOST_CONCEPT_USAGE(Convertible) {
| ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::CopyConstructible<boost::detail::graph::brandes_unweighted_shortest_paths::visitor_type<const boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >, boost::iterator_property_map<__gnu_cxx::__normal_iterator<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >*, std::vector<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >, std::allocator<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > > > > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>, std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >, std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>, double, double&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>, long unsigned int, long unsigned int&> > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/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::graph::brandes_unweighted_shortest_paths::visitor_type<const boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >, boost::iterator_property_map<__gnu_cxx::__normal_iterator<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >*, std::vector<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >, std::allocator<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > > > > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>, std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >, std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>, double, double&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>, long unsigned int, long unsigned int&> > > >]’
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:167:5: required from ‘struct boost::CopyConstructible<boost::detail::graph::brandes_unweighted_shortest_paths::visitor_type<const boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >, boost::iterator_property_map<__gnu_cxx::__normal_iterator<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >*, std::vector<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >, std::allocator<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > > > > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>, std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >, std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>, double, double&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>, long unsigned int, long unsigned int&> > >’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:165:3: required from ‘struct boost::CopyConstructibleConcept<boost::detail::graph::brandes_unweighted_shortest_paths::visitor_type<const boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >, boost::iterator_property_map<__gnu_cxx::__normal_iterator<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >*, std::vector<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >, std::allocator<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > > > > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>, std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >, std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>, double, double&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>, long unsigned int, long unsigned int&> > >’
165 | BOOST_concept(CopyConstructible,(TT))
| ^~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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::graph::brandes_unweighted_shortest_paths::visitor_type<const boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >, boost::iterator_property_map<__gnu_cxx::__normal_iterator<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >*, std::vector<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >, std::allocator<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > > > > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>, std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >, std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>, double, double&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>, long unsigned int, long unsigned int&> > >]’
32 | inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
| ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied<boost::CopyConstructibleConcept<boost::detail::graph::brandes_unweighted_shortest_paths::visitor_type<const boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >, boost::iterator_property_map<__gnu_cxx::__normal_iterator<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >*, std::vector<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >, std::allocator<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > > > > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>, std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >, std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>, double, double&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>, long unsigned int, long unsigned int&> > > >::value’
44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 12 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:500:43: required from ‘void boost::detail::graph::brandes_betweenness_centrality_dispatch2(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >; CentralityMap = boost::dummy_property_map; EdgeCentralityMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>]’
500 | brandes_betweenness_centrality(g, centrality, edge_centrality_map,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
501 | make_iterator_property_map(incoming.begin(), vertex_index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
502 | make_iterator_property_map(distance.begin(), vertex_index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
503 | make_iterator_property_map(dependency.begin(), vertex_index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
504 | make_iterator_property_map(path_count.begin(), vertex_index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
505 | vertex_index);
| ~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:531:57: required from ‘static void boost::detail::graph::brandes_betweenness_centrality_dispatch1<boost::param_not_found>::run(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap, boost::param_not_found) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >; CentralityMap = boost::dummy_property_map; EdgeCentralityMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>]’
531 | brandes_betweenness_centrality_dispatch2(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
532 | g, centrality, edge_centrality_map, vertex_index);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:558:71: required from ‘void boost::brandes_betweenness_centrality(const Graph&, const bgl_named_params<T, Tag, Base>&, typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >; Param = vec_adj_list_vertex_id_map<property<vertex_index_t, int, property<vertex_centrality_t, double> >, long unsigned int>; Tag = vertex_index_t; Rest = bgl_named_params<adj_list_edge_property_map<undirected_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_centrality_t, double> >, edge_centrality_t>, edge_centrality_t, no_property>; typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits<Graph>::traversal_category = undir_adj_list_traversal_tag]’
558 | detail::graph::brandes_betweenness_centrality_dispatch1< ew >::run(g,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
559 | choose_param(
| ~~~~~~~~~~~~~
560 | get_param(params, vertex_centrality), dummy_property_map()),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
561 | choose_param(get_param(params, edge_centrality), dummy_property_map()),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
562 | choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
563 | get_param(params, edge_weight));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/bc_clustering.hpp:131:39: required from ‘void boost::betweenness_centrality_clustering(MutableGraph&, Done, EdgeCentralityMap, VertexIndexMap) [with MutableGraph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >; Done = clustering_threshold; EdgeCentralityMap = adj_list_edge_property_map<undirected_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_centrality_t, double> >, edge_centrality_t>; VertexIndexMap = vec_adj_list_vertex_id_map<property<vertex_index_t, int, property<vertex_centrality_t, double> >, long unsigned int>]’
131 | brandes_betweenness_centrality(g,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
132 | edge_centrality_map(edge_centrality)
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
133 | .vertex_index_map(vertex_index));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/bc_clustering.hpp:150:38: required from ‘void boost::betweenness_centrality_clustering(MutableGraph&, Done, EdgeCentralityMap) [with MutableGraph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >; Done = clustering_threshold; EdgeCentralityMap = adj_list_edge_property_map<undirected_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_centrality_t, double> >, edge_centrality_t>]’
150 | betweenness_centrality_clustering(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
151 | g, done, edge_centrality, get(vertex_index, g));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
bbc.cpp:149:36: required from here
149 | betweenness_centrality_clustering(g,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
150 | clustering_threshold(threshold, g, normalize),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
151 | get(edge_centrality, g));
| ~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
20 | ~usage_requirements() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/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::graph::brandes_unweighted_shortest_paths::visitor_type<const boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >, boost::iterator_property_map<__gnu_cxx::__normal_iterator<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >*, std::vector<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >, std::allocator<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > > > > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>, std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >, std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>, double, double&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>, long unsigned int, long unsigned int&> >]’
37 | ~model()
| ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:167:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
167 | BOOST_CONCEPT_USAGE(CopyConstructible) {
| ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Convertible<boost::lvalue_property_map_tag, boost::readable_property_map_tag> >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/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> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/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))
| ^~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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);
| ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/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) );
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/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;
| ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 16 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:500:43: required from ‘void boost::detail::graph::brandes_betweenness_centrality_dispatch2(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >; CentralityMap = boost::dummy_property_map; EdgeCentralityMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>]’
500 | brandes_betweenness_centrality(g, centrality, edge_centrality_map,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
501 | make_iterator_property_map(incoming.begin(), vertex_index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
502 | make_iterator_property_map(distance.begin(), vertex_index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
503 | make_iterator_property_map(dependency.begin(), vertex_index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
504 | make_iterator_property_map(path_count.begin(), vertex_index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
505 | vertex_index);
| ~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:531:57: required from ‘static void boost::detail::graph::brandes_betweenness_centrality_dispatch1<boost::param_not_found>::run(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap, boost::param_not_found) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >; CentralityMap = boost::dummy_property_map; EdgeCentralityMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>]’
531 | brandes_betweenness_centrality_dispatch2(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
532 | g, centrality, edge_centrality_map, vertex_index);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:558:71: required from ‘void boost::brandes_betweenness_centrality(const Graph&, const bgl_named_params<T, Tag, Base>&, typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >; Param = vec_adj_list_vertex_id_map<property<vertex_index_t, int, property<vertex_centrality_t, double> >, long unsigned int>; Tag = vertex_index_t; Rest = bgl_named_params<adj_list_edge_property_map<undirected_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_centrality_t, double> >, edge_centrality_t>, edge_centrality_t, no_property>; typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits<Graph>::traversal_category = undir_adj_list_traversal_tag]’
558 | detail::graph::brandes_betweenness_centrality_dispatch1< ew >::run(g,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
559 | choose_param(
| ~~~~~~~~~~~~~
560 | get_param(params, vertex_centrality), dummy_property_map()),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
561 | choose_param(get_param(params, edge_centrality), dummy_property_map()),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
562 | choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
563 | get_param(params, edge_weight));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/bc_clustering.hpp:131:39: required from ‘void boost::betweenness_centrality_clustering(MutableGraph&, Done, EdgeCentralityMap, VertexIndexMap) [with MutableGraph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >; Done = clustering_threshold; EdgeCentralityMap = adj_list_edge_property_map<undirected_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_centrality_t, double> >, edge_centrality_t>; VertexIndexMap = vec_adj_list_vertex_id_map<property<vertex_index_t, int, property<vertex_centrality_t, double> >, long unsigned int>]’
131 | brandes_betweenness_centrality(g,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
132 | edge_centrality_map(edge_centrality)
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
133 | .vertex_index_map(vertex_index));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/bc_clustering.hpp:150:38: required from ‘void boost::betweenness_centrality_clustering(MutableGraph&, Done, EdgeCentralityMap) [with MutableGraph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >; Done = clustering_threshold; EdgeCentralityMap = adj_list_edge_property_map<undirected_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_centrality_t, double> >, edge_centrality_t>]’
150 | betweenness_centrality_clustering(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
151 | g, done, edge_centrality, get(vertex_index, g));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
bbc.cpp:149:36: required from here
149 | betweenness_centrality_clustering(g,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
150 | clustering_threshold(threshold, g, normalize),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
151 | get(edge_centrality, g));
| ~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Convertible<boost::lvalue_property_map_tag, boost::readable_property_map_tag>]’
20 | ~usage_requirements() { ((Model*)0)->~Model(); }
| ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::ConvertibleConcept<boost::lvalue_property_map_tag, boost::readable_property_map_tag>]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:148:7: required from ‘void boost::ReadablePropertyMapConcept<PMap, Key>::constraints() [with PMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>, boost::default_color_type, boost::default_color_type&>; Key = long unsigned int]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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::iterator_property_map<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>, boost::default_color_type, boost::default_color_type&>, long unsigned int>]’
32 | inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
| ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied<boost::ReadablePropertyMapConcept<boost::iterator_property_map<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>, boost::default_color_type, boost::default_color_type&>, long unsigned int> >::value’
44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied<boost::ReadablePropertyMapConcept<boost::iterator_property_map<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>, boost::default_color_type, boost::default_color_type&>, long unsigned int> >’
45 | typedef boost::integral_constant<bool, value> type;
| ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_<void (*)(boost::ReadablePropertyMapConcept<boost::iterator_property_map<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>, boost::default_color_type, boost::default_color_type&>, long unsigned int>)>’
72 | struct requirement_<void(*)(Model)>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:206:7: [ skipping 10 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:500:43: required from ‘void boost::detail::graph::brandes_betweenness_centrality_dispatch2(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >; CentralityMap = boost::dummy_property_map; EdgeCentralityMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>]’
500 | brandes_betweenness_centrality(g, centrality, edge_centrality_map,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
501 | make_iterator_property_map(incoming.begin(), vertex_index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
502 | make_iterator_property_map(distance.begin(), vertex_index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
503 | make_iterator_property_map(dependency.begin(), vertex_index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
504 | make_iterator_property_map(path_count.begin(), vertex_index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
505 | vertex_index);
| ~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:531:57: required from ‘static void boost::detail::graph::brandes_betweenness_centrality_dispatch1<boost::param_not_found>::run(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap, boost::param_not_found) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >; CentralityMap = boost::dummy_property_map; EdgeCentralityMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>]’
531 | brandes_betweenness_centrality_dispatch2(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
532 | g, centrality, edge_centrality_map, vertex_index);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:558:71: required from ‘void boost::brandes_betweenness_centrality(const Graph&, const bgl_named_params<T, Tag, Base>&, typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >; Param = vec_adj_list_vertex_id_map<property<vertex_index_t, int, property<vertex_centrality_t, double> >, long unsigned int>; Tag = vertex_index_t; Rest = bgl_named_params<adj_list_edge_property_map<undirected_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_centrality_t, double> >, edge_centrality_t>, edge_centrality_t, no_property>; typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits<Graph>::traversal_category = undir_adj_list_traversal_tag]’
558 | detail::graph::brandes_betweenness_centrality_dispatch1< ew >::run(g,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
559 | choose_param(
| ~~~~~~~~~~~~~
560 | get_param(params, vertex_centrality), dummy_property_map()),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
561 | choose_param(get_param(params, edge_centrality), dummy_property_map()),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
562 | choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
563 | get_param(params, edge_weight));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/bc_clustering.hpp:131:39: required from ‘void boost::betweenness_centrality_clustering(MutableGraph&, Done, EdgeCentralityMap, VertexIndexMap) [with MutableGraph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >; Done = clustering_threshold; EdgeCentralityMap = adj_list_edge_property_map<undirected_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_centrality_t, double> >, edge_centrality_t>; VertexIndexMap = vec_adj_list_vertex_id_map<property<vertex_index_t, int, property<vertex_centrality_t, double> >, long unsigned int>]’
131 | brandes_betweenness_centrality(g,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
132 | edge_centrality_map(edge_centrality)
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
133 | .vertex_index_map(vertex_index));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/bc_clustering.hpp:150:38: required from ‘void boost::betweenness_centrality_clustering(MutableGraph&, Done, EdgeCentralityMap) [with MutableGraph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >; Done = clustering_threshold; EdgeCentralityMap = adj_list_edge_property_map<undirected_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_centrality_t, double> >, edge_centrality_t>]’
150 | betweenness_centrality_clustering(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
151 | g, done, edge_centrality, get(vertex_index, g));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
bbc.cpp:149:36: required from here
149 | betweenness_centrality_clustering(g,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
150 | clustering_threshold(threshold, g, normalize),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
151 | get(edge_centrality, g));
| ~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:206:17: note: in a call to non-static member function ‘boost::ConvertibleConcept<boost::lvalue_property_map_tag, boost::readable_property_map_tag>::~ConvertibleConcept()’
206 | BOOST_concept(Convertible,(X)(Y))
| ^~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/preprocessor/cat.hpp:29:34: note: in definition of macro ‘BOOST_PP_CAT_I’
29 | # define BOOST_PP_CAT_I(a, b) a ## b
| ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/concept_def.hpp:23:12: note: in expansion of macro ‘BOOST_PP_CAT’
23 | struct BOOST_PP_CAT(name,Concept) \
| ^~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:206:3: note: in expansion of macro ‘BOOST_concept’
206 | BOOST_concept(Convertible,(X)(Y))
| ^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Convertible<boost::lvalue_property_map_tag, boost::writable_property_map_tag> >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/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> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/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))
| ^~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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);
| ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/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) );
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/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;
| ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 16 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:500:43: required from ‘void boost::detail::graph::brandes_betweenness_centrality_dispatch2(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >; CentralityMap = boost::dummy_property_map; EdgeCentralityMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>]’
500 | brandes_betweenness_centrality(g, centrality, edge_centrality_map,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
501 | make_iterator_property_map(incoming.begin(), vertex_index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
502 | make_iterator_property_map(distance.begin(), vertex_index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
503 | make_iterator_property_map(dependency.begin(), vertex_index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
504 | make_iterator_property_map(path_count.begin(), vertex_index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
505 | vertex_index);
| ~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:531:57: required from ‘static void boost::detail::graph::brandes_betweenness_centrality_dispatch1<boost::param_not_found>::run(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap, boost::param_not_found) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >; CentralityMap = boost::dummy_property_map; EdgeCentralityMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>]’
531 | brandes_betweenness_centrality_dispatch2(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
532 | g, centrality, edge_centrality_map, vertex_index);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:558:71: required from ‘void boost::brandes_betweenness_centrality(const Graph&, const bgl_named_params<T, Tag, Base>&, typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >; Param = vec_adj_list_vertex_id_map<property<vertex_index_t, int, property<vertex_centrality_t, double> >, long unsigned int>; Tag = vertex_index_t; Rest = bgl_named_params<adj_list_edge_property_map<undirected_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_centrality_t, double> >, edge_centrality_t>, edge_centrality_t, no_property>; typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits<Graph>::traversal_category = undir_adj_list_traversal_tag]’
558 | detail::graph::brandes_betweenness_centrality_dispatch1< ew >::run(g,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
559 | choose_param(
| ~~~~~~~~~~~~~
560 | get_param(params, vertex_centrality), dummy_property_map()),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
561 | choose_param(get_param(params, edge_centrality), dummy_property_map()),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
562 | choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
563 | get_param(params, edge_weight));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/bc_clustering.hpp:131:39: required from ‘void boost::betweenness_centrality_clustering(MutableGraph&, Done, EdgeCentralityMap, VertexIndexMap) [with MutableGraph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >; Done = clustering_threshold; EdgeCentralityMap = adj_list_edge_property_map<undirected_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_centrality_t, double> >, edge_centrality_t>; VertexIndexMap = vec_adj_list_vertex_id_map<property<vertex_index_t, int, property<vertex_centrality_t, double> >, long unsigned int>]’
131 | brandes_betweenness_centrality(g,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
132 | edge_centrality_map(edge_centrality)
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
133 | .vertex_index_map(vertex_index));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/bc_clustering.hpp:150:38: required from ‘void boost::betweenness_centrality_clustering(MutableGraph&, Done, EdgeCentralityMap) [with MutableGraph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >; Done = clustering_threshold; EdgeCentralityMap = adj_list_edge_property_map<undirected_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_centrality_t, double> >, edge_centrality_t>]’
150 | betweenness_centrality_clustering(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
151 | g, done, edge_centrality, get(vertex_index, g));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
bbc.cpp:149:36: required from here
149 | betweenness_centrality_clustering(g,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
150 | clustering_threshold(threshold, g, normalize),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
151 | get(edge_centrality, g));
| ~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Convertible<boost::lvalue_property_map_tag, boost::writable_property_map_tag>]’
20 | ~usage_requirements() { ((Model*)0)->~Model(); }
| ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::ConvertibleConcept<boost::lvalue_property_map_tag, boost::writable_property_map_tag>]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:180:7: required from ‘void boost::WritablePropertyMapConcept<PMap, Key>::constraints() [with PMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>, boost::default_color_type, boost::default_color_type&>; Key = long unsigned int]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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::iterator_property_map<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>, boost::default_color_type, boost::default_color_type&>, long unsigned int>]’
32 | inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
| ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied<boost::WritablePropertyMapConcept<boost::iterator_property_map<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>, boost::default_color_type, boost::default_color_type&>, long unsigned int> >::value’
44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied<boost::WritablePropertyMapConcept<boost::iterator_property_map<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>, boost::default_color_type, boost::default_color_type&>, long unsigned int> >’
45 | typedef boost::integral_constant<bool, value> type;
| ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_<void (*)(boost::WritablePropertyMapConcept<boost::iterator_property_map<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>, boost::default_color_type, boost::default_color_type&>, long unsigned int>)>’
72 | struct requirement_<void(*)(Model)>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:207:7: [ skipping 10 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:500:43: required from ‘void boost::detail::graph::brandes_betweenness_centrality_dispatch2(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >; CentralityMap = boost::dummy_property_map; EdgeCentralityMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>]’
500 | brandes_betweenness_centrality(g, centrality, edge_centrality_map,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
501 | make_iterator_property_map(incoming.begin(), vertex_index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
502 | make_iterator_property_map(distance.begin(), vertex_index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
503 | make_iterator_property_map(dependency.begin(), vertex_index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
504 | make_iterator_property_map(path_count.begin(), vertex_index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
505 | vertex_index);
| ~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:531:57: required from ‘static void boost::detail::graph::brandes_betweenness_centrality_dispatch1<boost::param_not_found>::run(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap, boost::param_not_found) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >; CentralityMap = boost::dummy_property_map; EdgeCentralityMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>]’
531 | brandes_betweenness_centrality_dispatch2(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
532 | g, centrality, edge_centrality_map, vertex_index);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:558:71: required from ‘void boost::brandes_betweenness_centrality(const Graph&, const bgl_named_params<T, Tag, Base>&, typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >; Param = vec_adj_list_vertex_id_map<property<vertex_index_t, int, property<vertex_centrality_t, double> >, long unsigned int>; Tag = vertex_index_t; Rest = bgl_named_params<adj_list_edge_property_map<undirected_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_centrality_t, double> >, edge_centrality_t>, edge_centrality_t, no_property>; typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits<Graph>::traversal_category = undir_adj_list_traversal_tag]’
558 | detail::graph::brandes_betweenness_centrality_dispatch1< ew >::run(g,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
559 | choose_param(
| ~~~~~~~~~~~~~
560 | get_param(params, vertex_centrality), dummy_property_map()),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
561 | choose_param(get_param(params, edge_centrality), dummy_property_map()),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
562 | choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
563 | get_param(params, edge_weight));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/bc_clustering.hpp:131:39: required from ‘void boost::betweenness_centrality_clustering(MutableGraph&, Done, EdgeCentralityMap, VertexIndexMap) [with MutableGraph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >; Done = clustering_threshold; EdgeCentralityMap = adj_list_edge_property_map<undirected_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_centrality_t, double> >, edge_centrality_t>; VertexIndexMap = vec_adj_list_vertex_id_map<property<vertex_index_t, int, property<vertex_centrality_t, double> >, long unsigned int>]’
131 | brandes_betweenness_centrality(g,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
132 | edge_centrality_map(edge_centrality)
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
133 | .vertex_index_map(vertex_index));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/bc_clustering.hpp:150:38: required from ‘void boost::betweenness_centrality_clustering(MutableGraph&, Done, EdgeCentralityMap) [with MutableGraph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >; Done = clustering_threshold; EdgeCentralityMap = adj_list_edge_property_map<undirected_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_centrality_t, double> >, edge_centrality_t>]’
150 | betweenness_centrality_clustering(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
151 | g, done, edge_centrality, get(vertex_index, g));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
bbc.cpp:149:36: required from here
149 | betweenness_centrality_clustering(g,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
150 | clustering_threshold(threshold, g, normalize),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
151 | get(edge_centrality, g));
| ~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:206:17: note: in a call to non-static member function ‘boost::ConvertibleConcept<boost::lvalue_property_map_tag, boost::writable_property_map_tag>::~ConvertibleConcept()’
206 | BOOST_concept(Convertible,(X)(Y))
| ^~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/preprocessor/cat.hpp:29:34: note: in definition of macro ‘BOOST_PP_CAT_I’
29 | # define BOOST_PP_CAT_I(a, b) a ## b
| ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/concept_def.hpp:23:12: note: in expansion of macro ‘BOOST_PP_CAT’
23 | struct BOOST_PP_CAT(name,Concept) \
| ^~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:206:3: note: in expansion of macro ‘BOOST_concept’
206 | BOOST_concept(Convertible,(X)(Y))
| ^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Convertible<boost::lvalue_property_map_tag, boost::read_write_property_map_tag>]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/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(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/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> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/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))
| ^~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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);
| ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/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) );
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 12 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:500:43: required from ‘void boost::detail::graph::brandes_betweenness_centrality_dispatch2(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >; CentralityMap = boost::dummy_property_map; EdgeCentralityMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>]’
500 | brandes_betweenness_centrality(g, centrality, edge_centrality_map,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
501 | make_iterator_property_map(incoming.begin(), vertex_index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
502 | make_iterator_property_map(distance.begin(), vertex_index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
503 | make_iterator_property_map(dependency.begin(), vertex_index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
504 | make_iterator_property_map(path_count.begin(), vertex_index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
505 | vertex_index);
| ~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:531:57: required from ‘static void boost::detail::graph::brandes_betweenness_centrality_dispatch1<boost::param_not_found>::run(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap, boost::param_not_found) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >; CentralityMap = boost::dummy_property_map; EdgeCentralityMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>]’
531 | brandes_betweenness_centrality_dispatch2(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
532 | g, centrality, edge_centrality_map, vertex_index);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:558:71: required from ‘void boost::brandes_betweenness_centrality(const Graph&, const bgl_named_params<T, Tag, Base>&, typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >; Param = vec_adj_list_vertex_id_map<property<vertex_index_t, int, property<vertex_centrality_t, double> >, long unsigned int>; Tag = vertex_index_t; Rest = bgl_named_params<adj_list_edge_property_map<undirected_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_centrality_t, double> >, edge_centrality_t>, edge_centrality_t, no_property>; typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits<Graph>::traversal_category = undir_adj_list_traversal_tag]’
558 | detail::graph::brandes_betweenness_centrality_dispatch1< ew >::run(g,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
559 | choose_param(
| ~~~~~~~~~~~~~
560 | get_param(params, vertex_centrality), dummy_property_map()),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
561 | choose_param(get_param(params, edge_centrality), dummy_property_map()),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
562 | choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
563 | get_param(params, edge_weight));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/bc_clustering.hpp:131:39: required from ‘void boost::betweenness_centrality_clustering(MutableGraph&, Done, EdgeCentralityMap, VertexIndexMap) [with MutableGraph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >; Done = clustering_threshold; EdgeCentralityMap = adj_list_edge_property_map<undirected_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_centrality_t, double> >, edge_centrality_t>; VertexIndexMap = vec_adj_list_vertex_id_map<property<vertex_index_t, int, property<vertex_centrality_t, double> >, long unsigned int>]’
131 | brandes_betweenness_centrality(g,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
132 | edge_centrality_map(edge_centrality)
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
133 | .vertex_index_map(vertex_index));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/bc_clustering.hpp:150:38: required from ‘void boost::betweenness_centrality_clustering(MutableGraph&, Done, EdgeCentralityMap) [with MutableGraph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >; Done = clustering_threshold; EdgeCentralityMap = adj_list_edge_property_map<undirected_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_centrality_t, double> >, edge_centrality_t>]’
150 | betweenness_centrality_clustering(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
151 | g, done, edge_centrality, get(vertex_index, g));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
bbc.cpp:149:36: required from here
149 | betweenness_centrality_clustering(g,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
150 | clustering_threshold(threshold, g, normalize),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
151 | get(edge_centrality, g));
| ~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
20 | ~usage_requirements() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible<X, Y>::~Convertible() [with X = boost::lvalue_property_map_tag; Y = boost::read_write_property_map_tag]’
37 | ~model()
| ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
208 | BOOST_CONCEPT_USAGE(Convertible) {
| ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::DefaultConstructible<long unsigned int> >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:137:5: required from ‘struct boost::DefaultConstructible<long unsigned int>’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::DefaultConstructible<long unsigned int>]’
32 | inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
| ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied<boost::DefaultConstructible<long unsigned int> >::value’
44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied<boost::DefaultConstructible<long unsigned int> >’
45 | typedef boost::integral_constant<bool, value> type;
| ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_<void (*)(boost::DefaultConstructible<long unsigned int>)>’
72 | struct requirement_<void(*)(Model)>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:68:9: [ skipping 15 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:500:43: required from ‘void boost::detail::graph::brandes_betweenness_centrality_dispatch2(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >; CentralityMap = boost::dummy_property_map; EdgeCentralityMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>]’
500 | brandes_betweenness_centrality(g, centrality, edge_centrality_map,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
501 | make_iterator_property_map(incoming.begin(), vertex_index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
502 | make_iterator_property_map(distance.begin(), vertex_index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
503 | make_iterator_property_map(dependency.begin(), vertex_index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
504 | make_iterator_property_map(path_count.begin(), vertex_index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
505 | vertex_index);
| ~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:531:57: required from ‘static void boost::detail::graph::brandes_betweenness_centrality_dispatch1<boost::param_not_found>::run(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap, boost::param_not_found) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >; CentralityMap = boost::dummy_property_map; EdgeCentralityMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>]’
531 | brandes_betweenness_centrality_dispatch2(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
532 | g, centrality, edge_centrality_map, vertex_index);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:558:71: required from ‘void boost::brandes_betweenness_centrality(const Graph&, const bgl_named_params<T, Tag, Base>&, typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >; Param = vec_adj_list_vertex_id_map<property<vertex_index_t, int, property<vertex_centrality_t, double> >, long unsigned int>; Tag = vertex_index_t; Rest = bgl_named_params<adj_list_edge_property_map<undirected_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_centrality_t, double> >, edge_centrality_t>, edge_centrality_t, no_property>; typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits<Graph>::traversal_category = undir_adj_list_traversal_tag]’
558 | detail::graph::brandes_betweenness_centrality_dispatch1< ew >::run(g,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
559 | choose_param(
| ~~~~~~~~~~~~~
560 | get_param(params, vertex_centrality), dummy_property_map()),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
561 | choose_param(get_param(params, edge_centrality), dummy_property_map()),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
562 | choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
563 | get_param(params, edge_weight));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/bc_clustering.hpp:131:39: required from ‘void boost::betweenness_centrality_clustering(MutableGraph&, Done, EdgeCentralityMap, VertexIndexMap) [with MutableGraph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >; Done = clustering_threshold; EdgeCentralityMap = adj_list_edge_property_map<undirected_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_centrality_t, double> >, edge_centrality_t>; VertexIndexMap = vec_adj_list_vertex_id_map<property<vertex_index_t, int, property<vertex_centrality_t, double> >, long unsigned int>]’
131 | brandes_betweenness_centrality(g,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
132 | edge_centrality_map(edge_centrality)
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
133 | .vertex_index_map(vertex_index));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/bc_clustering.hpp:150:38: required from ‘void boost::betweenness_centrality_clustering(MutableGraph&, Done, EdgeCentralityMap) [with MutableGraph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >; Done = clustering_threshold; EdgeCentralityMap = adj_list_edge_property_map<undirected_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_centrality_t, double> >, edge_centrality_t>]’
150 | betweenness_centrality_clustering(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
151 | g, done, edge_centrality, get(vertex_index, g));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
bbc.cpp:149:36: required from here
149 | betweenness_centrality_clustering(g,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
150 | clustering_threshold(threshold, g, normalize),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
151 | get(edge_centrality, g));
| ~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::DefaultConstructible<long unsigned int>]’
20 | ~usage_requirements() { ((Model*)0)->~Model(); }
| ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::DefaultConstructible<long unsigned int>]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:68:9: required from ‘boost::concepts::Graph<G>::~Graph() [with G = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: required from ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::concepts::Graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > > >]’
20 | ~usage_requirements() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::concepts::Graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > > > >]’
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:66:5: required from ‘struct boost::concepts::Graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > > >’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:75:1: required from ‘struct boost::concepts::IncidenceGraph<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > > >’
75 | BOOST_concept(IncidenceGraph, (G)) : Graph< G >
| ^~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:75:1: [ skipping 10 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:500:43: required from ‘void boost::detail::graph::brandes_betweenness_centrality_dispatch2(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >; CentralityMap = boost::dummy_property_map; EdgeCentralityMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>]’
500 | brandes_betweenness_centrality(g, centrality, edge_centrality_map,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
501 | make_iterator_property_map(incoming.begin(), vertex_index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
502 | make_iterator_property_map(distance.begin(), vertex_index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
503 | make_iterator_property_map(dependency.begin(), vertex_index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
504 | make_iterator_property_map(path_count.begin(), vertex_index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
505 | vertex_index);
| ~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:531:57: required from ‘static void boost::detail::graph::brandes_betweenness_centrality_dispatch1<boost::param_not_found>::run(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap, boost::param_not_found) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >; CentralityMap = boost::dummy_property_map; EdgeCentralityMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>]’
531 | brandes_betweenness_centrality_dispatch2(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
532 | g, centrality, edge_centrality_map, vertex_index);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:558:71: required from ‘void boost::brandes_betweenness_centrality(const Graph&, const bgl_named_params<T, Tag, Base>&, typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >; Param = vec_adj_list_vertex_id_map<property<vertex_index_t, int, property<vertex_centrality_t, double> >, long unsigned int>; Tag = vertex_index_t; Rest = bgl_named_params<adj_list_edge_property_map<undirected_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_centrality_t, double> >, edge_centrality_t>, edge_centrality_t, no_property>; typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits<Graph>::traversal_category = undir_adj_list_traversal_tag]’
558 | detail::graph::brandes_betweenness_centrality_dispatch1< ew >::run(g,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
559 | choose_param(
| ~~~~~~~~~~~~~
560 | get_param(params, vertex_centrality), dummy_property_map()),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
561 | choose_param(get_param(params, edge_centrality), dummy_property_map()),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
562 | choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
563 | get_param(params, edge_weight));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/bc_clustering.hpp:131:39: required from ‘void boost::betweenness_centrality_clustering(MutableGraph&, Done, EdgeCentralityMap, VertexIndexMap) [with MutableGraph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >; Done = clustering_threshold; EdgeCentralityMap = adj_list_edge_property_map<undirected_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_centrality_t, double> >, edge_centrality_t>; VertexIndexMap = vec_adj_list_vertex_id_map<property<vertex_index_t, int, property<vertex_centrality_t, double> >, long unsigned int>]’
131 | brandes_betweenness_centrality(g,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
132 | edge_centrality_map(edge_centrality)
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
133 | .vertex_index_map(vertex_index));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/bc_clustering.hpp:150:38: required from ‘void boost::betweenness_centrality_clustering(MutableGraph&, Done, EdgeCentralityMap) [with MutableGraph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >; Done = clustering_threshold; EdgeCentralityMap = adj_list_edge_property_map<undirected_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_centrality_t, double> >, edge_centrality_t>]’
150 | betweenness_centrality_clustering(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
151 | g, done, edge_centrality, get(vertex_index, g));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
bbc.cpp:149:36: required from here
149 | betweenness_centrality_clustering(g,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
150 | clustering_threshold(threshold, g, normalize),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
151 | get(edge_centrality, g));
| ~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::DefaultConstructible<TT>::~DefaultConstructible() [with TT = long unsigned int]’
37 | ~model()
| ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:137:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
137 | BOOST_CONCEPT_USAGE(DefaultConstructible) {
| ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::EqualityComparable<long unsigned int> >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable<long unsigned int>’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::EqualityComparable<long unsigned int>]’
32 | inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
| ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied<boost::EqualityComparable<long unsigned int> >::value’
44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied<boost::EqualityComparable<long unsigned int> >’
45 | typedef boost::integral_constant<bool, value> type;
| ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_<void (*)(boost::EqualityComparable<long unsigned int>)>’
72 | struct requirement_<void(*)(Model)>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:69:9: [ skipping 15 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:500:43: required from ‘void boost::detail::graph::brandes_betweenness_centrality_dispatch2(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >; CentralityMap = boost::dummy_property_map; EdgeCentralityMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>]’
500 | brandes_betweenness_centrality(g, centrality, edge_centrality_map,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
501 | make_iterator_property_map(incoming.begin(), vertex_index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
502 | make_iterator_property_map(distance.begin(), vertex_index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
503 | make_iterator_property_map(dependency.begin(), vertex_index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
504 | make_iterator_property_map(path_count.begin(), vertex_index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
505 | vertex_index);
| ~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:531:57: required from ‘static void boost::detail::graph::brandes_betweenness_centrality_dispatch1<boost::param_not_found>::run(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap, boost::param_not_found) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >; CentralityMap = boost::dummy_property_map; EdgeCentralityMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>]’
531 | brandes_betweenness_centrality_dispatch2(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
532 | g, centrality, edge_centrality_map, vertex_index);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:558:71: required from ‘void boost::brandes_betweenness_centrality(const Graph&, const bgl_named_params<T, Tag, Base>&, typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >; Param = vec_adj_list_vertex_id_map<property<vertex_index_t, int, property<vertex_centrality_t, double> >, long unsigned int>; Tag = vertex_index_t; Rest = bgl_named_params<adj_list_edge_property_map<undirected_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_centrality_t, double> >, edge_centrality_t>, edge_centrality_t, no_property>; typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits<Graph>::traversal_category = undir_adj_list_traversal_tag]’
558 | detail::graph::brandes_betweenness_centrality_dispatch1< ew >::run(g,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
559 | choose_param(
| ~~~~~~~~~~~~~
560 | get_param(params, vertex_centrality), dummy_property_map()),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
561 | choose_param(get_param(params, edge_centrality), dummy_property_map()),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
562 | choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
563 | get_param(params, edge_weight));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/bc_clustering.hpp:131:39: required from ‘void boost::betweenness_centrality_clustering(MutableGraph&, Done, EdgeCentralityMap, VertexIndexMap) [with MutableGraph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >; Done = clustering_threshold; EdgeCentralityMap = adj_list_edge_property_map<undirected_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_centrality_t, double> >, edge_centrality_t>; VertexIndexMap = vec_adj_list_vertex_id_map<property<vertex_index_t, int, property<vertex_centrality_t, double> >, long unsigned int>]’
131 | brandes_betweenness_centrality(g,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
132 | edge_centrality_map(edge_centrality)
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
133 | .vertex_index_map(vertex_index));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/bc_clustering.hpp:150:38: required from ‘void boost::betweenness_centrality_clustering(MutableGraph&, Done, EdgeCentralityMap) [with MutableGraph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >; Done = clustering_threshold; EdgeCentralityMap = adj_list_edge_property_map<undirected_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_centrality_t, double> >, edge_centrality_t>]’
150 | betweenness_centrality_clustering(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
151 | g, done, edge_centrality, get(vertex_index, g));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
bbc.cpp:149:36: required from here
149 | betweenness_centrality_clustering(g,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
150 | clustering_threshold(threshold, g, normalize),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
151 | get(edge_centrality, g));
| ~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::EqualityComparable<long unsigned int>]’
20 | ~usage_requirements() { ((Model*)0)->~Model(); }
| ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::EqualityComparable<long unsigned int>]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:69:9: required from ‘boost::concepts::Graph<G>::~Graph() [with G = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: required from ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::concepts::Graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > > >]’
20 | ~usage_requirements() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::concepts::Graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > > > >]’
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:66:5: required from ‘struct boost::concepts::Graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > > >’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:75:1: required from ‘struct boost::concepts::IncidenceGraph<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > > >’
75 | BOOST_concept(IncidenceGraph, (G)) : Graph< G >
| ^~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:75:1: [ skipping 10 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:500:43: required from ‘void boost::detail::graph::brandes_betweenness_centrality_dispatch2(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >; CentralityMap = boost::dummy_property_map; EdgeCentralityMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>]’
500 | brandes_betweenness_centrality(g, centrality, edge_centrality_map,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
501 | make_iterator_property_map(incoming.begin(), vertex_index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
502 | make_iterator_property_map(distance.begin(), vertex_index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
503 | make_iterator_property_map(dependency.begin(), vertex_index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
504 | make_iterator_property_map(path_count.begin(), vertex_index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
505 | vertex_index);
| ~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:531:57: required from ‘static void boost::detail::graph::brandes_betweenness_centrality_dispatch1<boost::param_not_found>::run(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap, boost::param_not_found) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >; CentralityMap = boost::dummy_property_map; EdgeCentralityMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>]’
531 | brandes_betweenness_centrality_dispatch2(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
532 | g, centrality, edge_centrality_map, vertex_index);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:558:71: required from ‘void boost::brandes_betweenness_centrality(const Graph&, const bgl_named_params<T, Tag, Base>&, typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >; Param = vec_adj_list_vertex_id_map<property<vertex_index_t, int, property<vertex_centrality_t, double> >, long unsigned int>; Tag = vertex_index_t; Rest = bgl_named_params<adj_list_edge_property_map<undirected_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_centrality_t, double> >, edge_centrality_t>, edge_centrality_t, no_property>; typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits<Graph>::traversal_category = undir_adj_list_traversal_tag]’
558 | detail::graph::brandes_betweenness_centrality_dispatch1< ew >::run(g,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
559 | choose_param(
| ~~~~~~~~~~~~~
560 | get_param(params, vertex_centrality), dummy_property_map()),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
561 | choose_param(get_param(params, edge_centrality), dummy_property_map()),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
562 | choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
563 | get_param(params, edge_weight));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/bc_clustering.hpp:131:39: required from ‘void boost::betweenness_centrality_clustering(MutableGraph&, Done, EdgeCentralityMap, VertexIndexMap) [with MutableGraph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >; Done = clustering_threshold; EdgeCentralityMap = adj_list_edge_property_map<undirected_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_centrality_t, double> >, edge_centrality_t>; VertexIndexMap = vec_adj_list_vertex_id_map<property<vertex_index_t, int, property<vertex_centrality_t, double> >, long unsigned int>]’
131 | brandes_betweenness_centrality(g,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
132 | edge_centrality_map(edge_centrality)
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
133 | .vertex_index_map(vertex_index));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/bc_clustering.hpp:150:38: required from ‘void boost::betweenness_centrality_clustering(MutableGraph&, Done, EdgeCentralityMap) [with MutableGraph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >; Done = clustering_threshold; EdgeCentralityMap = adj_list_edge_property_map<undirected_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_centrality_t, double> >, edge_centrality_t>]’
150 | betweenness_centrality_clustering(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
151 | g, done, edge_centrality, get(vertex_index, g));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
bbc.cpp:149:36: required from here
149 | betweenness_centrality_clustering(g,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
150 | clustering_threshold(threshold, g, normalize),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
151 | get(edge_centrality, g));
| ~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::EqualityComparable<TT>::~EqualityComparable() [with TT = long unsigned int]’
37 | ~model()
| ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:233:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
233 | BOOST_CONCEPT_USAGE(EqualityComparable) {
| ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Assignable<long unsigned int> >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:145:5: required from ‘struct boost::Assignable<long unsigned int>’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::Assignable<long unsigned int>]’
32 | inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
| ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied<boost::Assignable<long unsigned int> >::value’
44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied<boost::Assignable<long unsigned int> >’
45 | typedef boost::integral_constant<bool, value> type;
| ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_<void (*)(boost::Assignable<long unsigned int>)>’
72 | struct requirement_<void(*)(Model)>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:70:9: [ skipping 15 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:500:43: required from ‘void boost::detail::graph::brandes_betweenness_centrality_dispatch2(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >; CentralityMap = boost::dummy_property_map; EdgeCentralityMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>]’
500 | brandes_betweenness_centrality(g, centrality, edge_centrality_map,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
501 | make_iterator_property_map(incoming.begin(), vertex_index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
502 | make_iterator_property_map(distance.begin(), vertex_index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
503 | make_iterator_property_map(dependency.begin(), vertex_index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
504 | make_iterator_property_map(path_count.begin(), vertex_index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
505 | vertex_index);
| ~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:531:57: required from ‘static void boost::detail::graph::brandes_betweenness_centrality_dispatch1<boost::param_not_found>::run(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap, boost::param_not_found) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >; CentralityMap = boost::dummy_property_map; EdgeCentralityMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>]’
531 | brandes_betweenness_centrality_dispatch2(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
532 | g, centrality, edge_centrality_map, vertex_index);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:558:71: required from ‘void boost::brandes_betweenness_centrality(const Graph&, const bgl_named_params<T, Tag, Base>&, typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >; Param = vec_adj_list_vertex_id_map<property<vertex_index_t, int, property<vertex_centrality_t, double> >, long unsigned int>; Tag = vertex_index_t; Rest = bgl_named_params<adj_list_edge_property_map<undirected_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_centrality_t, double> >, edge_centrality_t>, edge_centrality_t, no_property>; typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits<Graph>::traversal_category = undir_adj_list_traversal_tag]’
558 | detail::graph::brandes_betweenness_centrality_dispatch1< ew >::run(g,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
559 | choose_param(
| ~~~~~~~~~~~~~
560 | get_param(params, vertex_centrality), dummy_property_map()),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
561 | choose_param(get_param(params, edge_centrality), dummy_property_map()),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
562 | choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
563 | get_param(params, edge_weight));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/bc_clustering.hpp:131:39: required from ‘void boost::betweenness_centrality_clustering(MutableGraph&, Done, EdgeCentralityMap, VertexIndexMap) [with MutableGraph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >; Done = clustering_threshold; EdgeCentralityMap = adj_list_edge_property_map<undirected_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_centrality_t, double> >, edge_centrality_t>; VertexIndexMap = vec_adj_list_vertex_id_map<property<vertex_index_t, int, property<vertex_centrality_t, double> >, long unsigned int>]’
131 | brandes_betweenness_centrality(g,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
132 | edge_centrality_map(edge_centrality)
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
133 | .vertex_index_map(vertex_index));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/bc_clustering.hpp:150:38: required from ‘void boost::betweenness_centrality_clustering(MutableGraph&, Done, EdgeCentralityMap) [with MutableGraph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >; Done = clustering_threshold; EdgeCentralityMap = adj_list_edge_property_map<undirected_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_centrality_t, double> >, edge_centrality_t>]’
150 | betweenness_centrality_clustering(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
151 | g, done, edge_centrality, get(vertex_index, g));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
bbc.cpp:149:36: required from here
149 | betweenness_centrality_clustering(g,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
150 | clustering_threshold(threshold, g, normalize),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
151 | get(edge_centrality, g));
| ~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Assignable<long unsigned int>]’
20 | ~usage_requirements() { ((Model*)0)->~Model(); }
| ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::Assignable<long unsigned int>]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:70:9: required from ‘boost::concepts::Graph<G>::~Graph() [with G = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: required from ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::concepts::Graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > > >]’
20 | ~usage_requirements() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::concepts::Graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > > > >]’
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:66:5: required from ‘struct boost::concepts::Graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > > >’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:75:1: required from ‘struct boost::concepts::IncidenceGraph<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > > >’
75 | BOOST_concept(IncidenceGraph, (G)) : Graph< G >
| ^~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:75:1: [ skipping 10 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:500:43: required from ‘void boost::detail::graph::brandes_betweenness_centrality_dispatch2(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >; CentralityMap = boost::dummy_property_map; EdgeCentralityMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>]’
500 | brandes_betweenness_centrality(g, centrality, edge_centrality_map,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
501 | make_iterator_property_map(incoming.begin(), vertex_index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
502 | make_iterator_property_map(distance.begin(), vertex_index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
503 | make_iterator_property_map(dependency.begin(), vertex_index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
504 | make_iterator_property_map(path_count.begin(), vertex_index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
505 | vertex_index);
| ~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:531:57: required from ‘static void boost::detail::graph::brandes_betweenness_centrality_dispatch1<boost::param_not_found>::run(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap, boost::param_not_found) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >; CentralityMap = boost::dummy_property_map; EdgeCentralityMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>]’
531 | brandes_betweenness_centrality_dispatch2(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
532 | g, centrality, edge_centrality_map, vertex_index);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:558:71: required from ‘void boost::brandes_betweenness_centrality(const Graph&, const bgl_named_params<T, Tag, Base>&, typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >; Param = vec_adj_list_vertex_id_map<property<vertex_index_t, int, property<vertex_centrality_t, double> >, long unsigned int>; Tag = vertex_index_t; Rest = bgl_named_params<adj_list_edge_property_map<undirected_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_centrality_t, double> >, edge_centrality_t>, edge_centrality_t, no_property>; typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits<Graph>::traversal_category = undir_adj_list_traversal_tag]’
558 | detail::graph::brandes_betweenness_centrality_dispatch1< ew >::run(g,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
559 | choose_param(
| ~~~~~~~~~~~~~
560 | get_param(params, vertex_centrality), dummy_property_map()),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
561 | choose_param(get_param(params, edge_centrality), dummy_property_map()),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
562 | choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
563 | get_param(params, edge_weight));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/bc_clustering.hpp:131:39: required from ‘void boost::betweenness_centrality_clustering(MutableGraph&, Done, EdgeCentralityMap, VertexIndexMap) [with MutableGraph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >; Done = clustering_threshold; EdgeCentralityMap = adj_list_edge_property_map<undirected_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_centrality_t, double> >, edge_centrality_t>; VertexIndexMap = vec_adj_list_vertex_id_map<property<vertex_index_t, int, property<vertex_centrality_t, double> >, long unsigned int>]’
131 | brandes_betweenness_centrality(g,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
132 | edge_centrality_map(edge_centrality)
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
133 | .vertex_index_map(vertex_index));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/bc_clustering.hpp:150:38: required from ‘void boost::betweenness_centrality_clustering(MutableGraph&, Done, EdgeCentralityMap) [with MutableGraph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >; Done = clustering_threshold; EdgeCentralityMap = adj_list_edge_property_map<undirected_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_centrality_t, double> >, edge_centrality_t>]’
150 | betweenness_centrality_clustering(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
151 | g, done, edge_centrality, get(vertex_index, g));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
bbc.cpp:149:36: required from here
149 | betweenness_centrality_clustering(g,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
150 | clustering_threshold(threshold, g, normalize),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
151 | get(edge_centrality, g));
| ~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Assignable<TT>::~Assignable() [with TT = long unsigned int]’
37 | ~model()
| ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:145:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
145 | BOOST_CONCEPT_USAGE(Assignable) {
| ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::concepts::MultiPassInputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > > >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > > >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > > >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::concepts::MultiPassInputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > > >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > > >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > > >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> > >]’
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:52:50: required from ‘struct boost::concepts::MultiPassInputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > > >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > > >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > > >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> >’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::concepts::MultiPassInputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > > >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > > >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > > >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> >]’
32 | inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
| ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied<boost::concepts::MultiPassInputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > > >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > > >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > > >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> > >::value’
44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied<boost::concepts::MultiPassInputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > > >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > > >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > > >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> > >’
45 | typedef boost::integral_constant<bool, value> type;
| ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 8 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:500:43: required from ‘void boost::detail::graph::brandes_betweenness_centrality_dispatch2(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >; CentralityMap = boost::dummy_property_map; EdgeCentralityMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>]’
500 | brandes_betweenness_centrality(g, centrality, edge_centrality_map,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
501 | make_iterator_property_map(incoming.begin(), vertex_index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
502 | make_iterator_property_map(distance.begin(), vertex_index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
503 | make_iterator_property_map(dependency.begin(), vertex_index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
504 | make_iterator_property_map(path_count.begin(), vertex_index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
505 | vertex_index);
| ~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:531:57: required from ‘static void boost::detail::graph::brandes_betweenness_centrality_dispatch1<boost::param_not_found>::run(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap, boost::param_not_found) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >; CentralityMap = boost::dummy_property_map; EdgeCentralityMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>]’
531 | brandes_betweenness_centrality_dispatch2(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
532 | g, centrality, edge_centrality_map, vertex_index);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:558:71: required from ‘void boost::brandes_betweenness_centrality(const Graph&, const bgl_named_params<T, Tag, Base>&, typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >; Param = vec_adj_list_vertex_id_map<property<vertex_index_t, int, property<vertex_centrality_t, double> >, long unsigned int>; Tag = vertex_index_t; Rest = bgl_named_params<adj_list_edge_property_map<undirected_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_centrality_t, double> >, edge_centrality_t>, edge_centrality_t, no_property>; typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits<Graph>::traversal_category = undir_adj_list_traversal_tag]’
558 | detail::graph::brandes_betweenness_centrality_dispatch1< ew >::run(g,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
559 | choose_param(
| ~~~~~~~~~~~~~
560 | get_param(params, vertex_centrality), dummy_property_map()),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
561 | choose_param(get_param(params, edge_centrality), dummy_property_map()),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
562 | choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
563 | get_param(params, edge_weight));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/bc_clustering.hpp:131:39: required from ‘void boost::betweenness_centrality_clustering(MutableGraph&, Done, EdgeCentralityMap, VertexIndexMap) [with MutableGraph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >; Done = clustering_threshold; EdgeCentralityMap = adj_list_edge_property_map<undirected_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_centrality_t, double> >, edge_centrality_t>; VertexIndexMap = vec_adj_list_vertex_id_map<property<vertex_index_t, int, property<vertex_centrality_t, double> >, long unsigned int>]’
131 | brandes_betweenness_centrality(g,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
132 | edge_centrality_map(edge_centrality)
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
133 | .vertex_index_map(vertex_index));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/bc_clustering.hpp:150:38: required from ‘void boost::betweenness_centrality_clustering(MutableGraph&, Done, EdgeCentralityMap) [with MutableGraph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >; Done = clustering_threshold; EdgeCentralityMap = adj_list_edge_property_map<undirected_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_centrality_t, double> >, edge_centrality_t>]’
150 | betweenness_centrality_clustering(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
151 | g, done, edge_centrality, get(vertex_index, g));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
bbc.cpp:149:36: required from here
149 | betweenness_centrality_clustering(g,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
150 | clustering_threshold(threshold, g, normalize),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
151 | get(edge_centrality, g));
| ~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
20 | ~usage_requirements() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::concepts::MultiPassInputIterator<T>::~MultiPassInputIterator() [with T = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > > >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > > >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > > >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int>]’
37 | ~model()
| ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:52:50: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
52 | BOOST_concept(MultiPassInputIterator, (T)) { BOOST_CONCEPT_USAGE(
| ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::DefaultConstructible<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::DefaultConstructible<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >]’
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:137:5: required from ‘struct boost::DefaultConstructible<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> >’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::DefaultConstructible<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> >]’
32 | inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
| ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied<boost::DefaultConstructible<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >::value’
44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied<boost::DefaultConstructible<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >’
45 | typedef boost::integral_constant<bool, value> type;
| ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 8 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:500:43: required from ‘void boost::detail::graph::brandes_betweenness_centrality_dispatch2(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >; CentralityMap = boost::dummy_property_map; EdgeCentralityMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>]’
500 | brandes_betweenness_centrality(g, centrality, edge_centrality_map,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
501 | make_iterator_property_map(incoming.begin(), vertex_index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
502 | make_iterator_property_map(distance.begin(), vertex_index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
503 | make_iterator_property_map(dependency.begin(), vertex_index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
504 | make_iterator_property_map(path_count.begin(), vertex_index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
505 | vertex_index);
| ~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:531:57: required from ‘static void boost::detail::graph::brandes_betweenness_centrality_dispatch1<boost::param_not_found>::run(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap, boost::param_not_found) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >; CentralityMap = boost::dummy_property_map; EdgeCentralityMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>]’
531 | brandes_betweenness_centrality_dispatch2(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
532 | g, centrality, edge_centrality_map, vertex_index);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:558:71: required from ‘void boost::brandes_betweenness_centrality(const Graph&, const bgl_named_params<T, Tag, Base>&, typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >; Param = vec_adj_list_vertex_id_map<property<vertex_index_t, int, property<vertex_centrality_t, double> >, long unsigned int>; Tag = vertex_index_t; Rest = bgl_named_params<adj_list_edge_property_map<undirected_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_centrality_t, double> >, edge_centrality_t>, edge_centrality_t, no_property>; typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits<Graph>::traversal_category = undir_adj_list_traversal_tag]’
558 | detail::graph::brandes_betweenness_centrality_dispatch1< ew >::run(g,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
559 | choose_param(
| ~~~~~~~~~~~~~
560 | get_param(params, vertex_centrality), dummy_property_map()),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
561 | choose_param(get_param(params, edge_centrality), dummy_property_map()),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
562 | choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
563 | get_param(params, edge_weight));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/bc_clustering.hpp:131:39: required from ‘void boost::betweenness_centrality_clustering(MutableGraph&, Done, EdgeCentralityMap, VertexIndexMap) [with MutableGraph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >; Done = clustering_threshold; EdgeCentralityMap = adj_list_edge_property_map<undirected_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_centrality_t, double> >, edge_centrality_t>; VertexIndexMap = vec_adj_list_vertex_id_map<property<vertex_index_t, int, property<vertex_centrality_t, double> >, long unsigned int>]’
131 | brandes_betweenness_centrality(g,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
132 | edge_centrality_map(edge_centrality)
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
133 | .vertex_index_map(vertex_index));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/bc_clustering.hpp:150:38: required from ‘void boost::betweenness_centrality_clustering(MutableGraph&, Done, EdgeCentralityMap) [with MutableGraph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >; Done = clustering_threshold; EdgeCentralityMap = adj_list_edge_property_map<undirected_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_centrality_t, double> >, edge_centrality_t>]’
150 | betweenness_centrality_clustering(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
151 | g, done, edge_centrality, get(vertex_index, g));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
bbc.cpp:149:36: required from here
149 | betweenness_centrality_clustering(g,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
150 | clustering_threshold(threshold, g, normalize),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
151 | get(edge_centrality, g));
| ~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
20 | ~usage_requirements() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::DefaultConstructible<TT>::~DefaultConstructible() [with TT = boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>]’
37 | ~model()
| ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:137:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
137 | BOOST_CONCEPT_USAGE(DefaultConstructible) {
| ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::EqualityComparable<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::EqualityComparable<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >]’
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> >’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::EqualityComparable<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> >]’
32 | inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
| ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied<boost::EqualityComparable<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >::value’
44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied<boost::EqualityComparable<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >’
45 | typedef boost::integral_constant<bool, value> type;
| ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 8 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:500:43: required from ‘void boost::detail::graph::brandes_betweenness_centrality_dispatch2(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >; CentralityMap = boost::dummy_property_map; EdgeCentralityMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>]’
500 | brandes_betweenness_centrality(g, centrality, edge_centrality_map,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
501 | make_iterator_property_map(incoming.begin(), vertex_index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
502 | make_iterator_property_map(distance.begin(), vertex_index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
503 | make_iterator_property_map(dependency.begin(), vertex_index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
504 | make_iterator_property_map(path_count.begin(), vertex_index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
505 | vertex_index);
| ~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:531:57: required from ‘static void boost::detail::graph::brandes_betweenness_centrality_dispatch1<boost::param_not_found>::run(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap, boost::param_not_found) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >; CentralityMap = boost::dummy_property_map; EdgeCentralityMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>]’
531 | brandes_betweenness_centrality_dispatch2(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
532 | g, centrality, edge_centrality_map, vertex_index);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:558:71: required from ‘void boost::brandes_betweenness_centrality(const Graph&, const bgl_named_params<T, Tag, Base>&, typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >; Param = vec_adj_list_vertex_id_map<property<vertex_index_t, int, property<vertex_centrality_t, double> >, long unsigned int>; Tag = vertex_index_t; Rest = bgl_named_params<adj_list_edge_property_map<undirected_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_centrality_t, double> >, edge_centrality_t>, edge_centrality_t, no_property>; typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits<Graph>::traversal_category = undir_adj_list_traversal_tag]’
558 | detail::graph::brandes_betweenness_centrality_dispatch1< ew >::run(g,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
559 | choose_param(
| ~~~~~~~~~~~~~
560 | get_param(params, vertex_centrality), dummy_property_map()),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
561 | choose_param(get_param(params, edge_centrality), dummy_property_map()),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
562 | choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
563 | get_param(params, edge_weight));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/bc_clustering.hpp:131:39: required from ‘void boost::betweenness_centrality_clustering(MutableGraph&, Done, EdgeCentralityMap, VertexIndexMap) [with MutableGraph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >; Done = clustering_threshold; EdgeCentralityMap = adj_list_edge_property_map<undirected_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_centrality_t, double> >, edge_centrality_t>; VertexIndexMap = vec_adj_list_vertex_id_map<property<vertex_index_t, int, property<vertex_centrality_t, double> >, long unsigned int>]’
131 | brandes_betweenness_centrality(g,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
132 | edge_centrality_map(edge_centrality)
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
133 | .vertex_index_map(vertex_index));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/bc_clustering.hpp:150:38: required from ‘void boost::betweenness_centrality_clustering(MutableGraph&, Done, EdgeCentralityMap) [with MutableGraph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >; Done = clustering_threshold; EdgeCentralityMap = adj_list_edge_property_map<undirected_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_centrality_t, double> >, edge_centrality_t>]’
150 | betweenness_centrality_clustering(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
151 | g, done, edge_centrality, get(vertex_index, g));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
bbc.cpp:149:36: required from here
149 | betweenness_centrality_clustering(g,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
150 | clustering_threshold(threshold, g, normalize),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
151 | get(edge_centrality, g));
| ~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
20 | ~usage_requirements() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::EqualityComparable<TT>::~EqualityComparable() [with TT = boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>]’
37 | ~model()
| ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:233:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
233 | BOOST_CONCEPT_USAGE(EqualityComparable) {
| ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Assignable<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Assignable<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >]’
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:145:5: required from ‘struct boost::Assignable<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> >’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::Assignable<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> >]’
32 | inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
| ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied<boost::Assignable<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >::value’
44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied<boost::Assignable<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >’
45 | typedef boost::integral_constant<bool, value> type;
| ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 8 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:500:43: required from ‘void boost::detail::graph::brandes_betweenness_centrality_dispatch2(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >; CentralityMap = boost::dummy_property_map; EdgeCentralityMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>]’
500 | brandes_betweenness_centrality(g, centrality, edge_centrality_map,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
501 | make_iterator_property_map(incoming.begin(), vertex_index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
502 | make_iterator_property_map(distance.begin(), vertex_index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
503 | make_iterator_property_map(dependency.begin(), vertex_index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
504 | make_iterator_property_map(path_count.begin(), vertex_index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
505 | vertex_index);
| ~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:531:57: required from ‘static void boost::detail::graph::brandes_betweenness_centrality_dispatch1<boost::param_not_found>::run(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap, boost::param_not_found) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >; CentralityMap = boost::dummy_property_map; EdgeCentralityMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>]’
531 | brandes_betweenness_centrality_dispatch2(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
532 | g, centrality, edge_centrality_map, vertex_index);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:558:71: required from ‘void boost::brandes_betweenness_centrality(const Graph&, const bgl_named_params<T, Tag, Base>&, typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >; Param = vec_adj_list_vertex_id_map<property<vertex_index_t, int, property<vertex_centrality_t, double> >, long unsigned int>; Tag = vertex_index_t; Rest = bgl_named_params<adj_list_edge_property_map<undirected_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_centrality_t, double> >, edge_centrality_t>, edge_centrality_t, no_property>; typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits<Graph>::traversal_category = undir_adj_list_traversal_tag]’
558 | detail::graph::brandes_betweenness_centrality_dispatch1< ew >::run(g,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
559 | choose_param(
| ~~~~~~~~~~~~~
560 | get_param(params, vertex_centrality), dummy_property_map()),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
561 | choose_param(get_param(params, edge_centrality), dummy_property_map()),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
562 | choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
563 | get_param(params, edge_weight));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/bc_clustering.hpp:131:39: required from ‘void boost::betweenness_centrality_clustering(MutableGraph&, Done, EdgeCentralityMap, VertexIndexMap) [with MutableGraph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >; Done = clustering_threshold; EdgeCentralityMap = adj_list_edge_property_map<undirected_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_centrality_t, double> >, edge_centrality_t>; VertexIndexMap = vec_adj_list_vertex_id_map<property<vertex_index_t, int, property<vertex_centrality_t, double> >, long unsigned int>]’
131 | brandes_betweenness_centrality(g,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
132 | edge_centrality_map(edge_centrality)
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
133 | .vertex_index_map(vertex_index));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/bc_clustering.hpp:150:38: required from ‘void boost::betweenness_centrality_clustering(MutableGraph&, Done, EdgeCentralityMap) [with MutableGraph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >; Done = clustering_threshold; EdgeCentralityMap = adj_list_edge_property_map<undirected_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_centrality_t, double> >, edge_centrality_t>]’
150 | betweenness_centrality_clustering(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
151 | g, done, edge_centrality, get(vertex_index, g));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
bbc.cpp:149:36: required from here
149 | betweenness_centrality_clustering(g,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
150 | clustering_threshold(threshold, g, normalize),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
151 | get(edge_centrality, g));
| ~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
20 | ~usage_requirements() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Assignable<TT>::~Assignable() [with TT = boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>]’
37 | ~model()
| ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:145:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
145 | BOOST_CONCEPT_USAGE(Assignable) {
| ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Convertible<boost::undir_adj_list_traversal_tag, boost::incidence_graph_tag>]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Convertible<boost::undir_adj_list_traversal_tag, boost::incidence_graph_tag> >]’
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible<boost::undir_adj_list_traversal_tag, boost::incidence_graph_tag>’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::Convertible<boost::undir_adj_list_traversal_tag, boost::incidence_graph_tag>]’
32 | inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
| ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied<boost::Convertible<boost::undir_adj_list_traversal_tag, boost::incidence_graph_tag> >::value’
44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied<boost::Convertible<boost::undir_adj_list_traversal_tag, boost::incidence_graph_tag> >’
45 | typedef boost::integral_constant<bool, value> type;
| ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 8 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:500:43: required from ‘void boost::detail::graph::brandes_betweenness_centrality_dispatch2(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >; CentralityMap = boost::dummy_property_map; EdgeCentralityMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>]’
500 | brandes_betweenness_centrality(g, centrality, edge_centrality_map,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
501 | make_iterator_property_map(incoming.begin(), vertex_index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
502 | make_iterator_property_map(distance.begin(), vertex_index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
503 | make_iterator_property_map(dependency.begin(), vertex_index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
504 | make_iterator_property_map(path_count.begin(), vertex_index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
505 | vertex_index);
| ~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:531:57: required from ‘static void boost::detail::graph::brandes_betweenness_centrality_dispatch1<boost::param_not_found>::run(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap, boost::param_not_found) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >; CentralityMap = boost::dummy_property_map; EdgeCentralityMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>]’
531 | brandes_betweenness_centrality_dispatch2(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
532 | g, centrality, edge_centrality_map, vertex_index);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:558:71: required from ‘void boost::brandes_betweenness_centrality(const Graph&, const bgl_named_params<T, Tag, Base>&, typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >; Param = vec_adj_list_vertex_id_map<property<vertex_index_t, int, property<vertex_centrality_t, double> >, long unsigned int>; Tag = vertex_index_t; Rest = bgl_named_params<adj_list_edge_property_map<undirected_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_centrality_t, double> >, edge_centrality_t>, edge_centrality_t, no_property>; typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits<Graph>::traversal_category = undir_adj_list_traversal_tag]’
558 | detail::graph::brandes_betweenness_centrality_dispatch1< ew >::run(g,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
559 | choose_param(
| ~~~~~~~~~~~~~
560 | get_param(params, vertex_centrality), dummy_property_map()),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
561 | choose_param(get_param(params, edge_centrality), dummy_property_map()),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
562 | choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
563 | get_param(params, edge_weight));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/bc_clustering.hpp:131:39: required from ‘void boost::betweenness_centrality_clustering(MutableGraph&, Done, EdgeCentralityMap, VertexIndexMap) [with MutableGraph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >; Done = clustering_threshold; EdgeCentralityMap = adj_list_edge_property_map<undirected_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_centrality_t, double> >, edge_centrality_t>; VertexIndexMap = vec_adj_list_vertex_id_map<property<vertex_index_t, int, property<vertex_centrality_t, double> >, long unsigned int>]’
131 | brandes_betweenness_centrality(g,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
132 | edge_centrality_map(edge_centrality)
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
133 | .vertex_index_map(vertex_index));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/bc_clustering.hpp:150:38: required from ‘void boost::betweenness_centrality_clustering(MutableGraph&, Done, EdgeCentralityMap) [with MutableGraph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >; Done = clustering_threshold; EdgeCentralityMap = adj_list_edge_property_map<undirected_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_centrality_t, double> >, edge_centrality_t>]’
150 | betweenness_centrality_clustering(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
151 | g, done, edge_centrality, get(vertex_index, g));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
bbc.cpp:149:36: required from here
149 | betweenness_centrality_clustering(g,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
150 | clustering_threshold(threshold, g, normalize),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
151 | get(edge_centrality, g));
| ~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
20 | ~usage_requirements() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible<X, Y>::~Convertible() [with X = boost::undir_adj_list_traversal_tag; Y = boost::incidence_graph_tag]’
37 | ~model()
| ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
208 | BOOST_CONCEPT_USAGE(Convertible) {
| ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Convertible<boost::lvalue_property_map_tag, boost::readable_property_map_tag>]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/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(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/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> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/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))
| ^~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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);
| ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/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) );
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 17 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:500:43: required from ‘void boost::detail::graph::brandes_betweenness_centrality_dispatch2(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >; CentralityMap = boost::dummy_property_map; EdgeCentralityMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>]’
500 | brandes_betweenness_centrality(g, centrality, edge_centrality_map,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
501 | make_iterator_property_map(incoming.begin(), vertex_index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
502 | make_iterator_property_map(distance.begin(), vertex_index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
503 | make_iterator_property_map(dependency.begin(), vertex_index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
504 | make_iterator_property_map(path_count.begin(), vertex_index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
505 | vertex_index);
| ~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:531:57: required from ‘static void boost::detail::graph::brandes_betweenness_centrality_dispatch1<boost::param_not_found>::run(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap, boost::param_not_found) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >; CentralityMap = boost::dummy_property_map; EdgeCentralityMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>]’
531 | brandes_betweenness_centrality_dispatch2(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
532 | g, centrality, edge_centrality_map, vertex_index);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:558:71: required from ‘void boost::brandes_betweenness_centrality(const Graph&, const bgl_named_params<T, Tag, Base>&, typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >; Param = vec_adj_list_vertex_id_map<property<vertex_index_t, int, property<vertex_centrality_t, double> >, long unsigned int>; Tag = vertex_index_t; Rest = bgl_named_params<adj_list_edge_property_map<undirected_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_centrality_t, double> >, edge_centrality_t>, edge_centrality_t, no_property>; typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits<Graph>::traversal_category = undir_adj_list_traversal_tag]’
558 | detail::graph::brandes_betweenness_centrality_dispatch1< ew >::run(g,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
559 | choose_param(
| ~~~~~~~~~~~~~
560 | get_param(params, vertex_centrality), dummy_property_map()),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
561 | choose_param(get_param(params, edge_centrality), dummy_property_map()),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
562 | choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
563 | get_param(params, edge_weight));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/bc_clustering.hpp:131:39: required from ‘void boost::betweenness_centrality_clustering(MutableGraph&, Done, EdgeCentralityMap, VertexIndexMap) [with MutableGraph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >; Done = clustering_threshold; EdgeCentralityMap = adj_list_edge_property_map<undirected_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_centrality_t, double> >, edge_centrality_t>; VertexIndexMap = vec_adj_list_vertex_id_map<property<vertex_index_t, int, property<vertex_centrality_t, double> >, long unsigned int>]’
131 | brandes_betweenness_centrality(g,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
132 | edge_centrality_map(edge_centrality)
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
133 | .vertex_index_map(vertex_index));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/bc_clustering.hpp:150:38: required from ‘void boost::betweenness_centrality_clustering(MutableGraph&, Done, EdgeCentralityMap) [with MutableGraph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >; Done = clustering_threshold; EdgeCentralityMap = adj_list_edge_property_map<undirected_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_centrality_t, double> >, edge_centrality_t>]’
150 | betweenness_centrality_clustering(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
151 | g, done, edge_centrality, get(vertex_index, g));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
bbc.cpp:149:36: required from here
149 | betweenness_centrality_clustering(g,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
150 | clustering_threshold(threshold, g, normalize),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
151 | get(edge_centrality, g));
| ~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
20 | ~usage_requirements() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible<X, Y>::~Convertible() [with X = boost::lvalue_property_map_tag; Y = boost::readable_property_map_tag]’
37 | ~model()
| ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
208 | BOOST_CONCEPT_USAGE(Convertible) {
| ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Convertible<boost::lvalue_property_map_tag, boost::writable_property_map_tag>]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/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(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/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> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/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))
| ^~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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);
| ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/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) );
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 17 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:500:43: required from ‘void boost::detail::graph::brandes_betweenness_centrality_dispatch2(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >; CentralityMap = boost::dummy_property_map; EdgeCentralityMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>]’
500 | brandes_betweenness_centrality(g, centrality, edge_centrality_map,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
501 | make_iterator_property_map(incoming.begin(), vertex_index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
502 | make_iterator_property_map(distance.begin(), vertex_index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
503 | make_iterator_property_map(dependency.begin(), vertex_index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
504 | make_iterator_property_map(path_count.begin(), vertex_index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
505 | vertex_index);
| ~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:531:57: required from ‘static void boost::detail::graph::brandes_betweenness_centrality_dispatch1<boost::param_not_found>::run(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap, boost::param_not_found) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >; CentralityMap = boost::dummy_property_map; EdgeCentralityMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>]’
531 | brandes_betweenness_centrality_dispatch2(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
532 | g, centrality, edge_centrality_map, vertex_index);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:558:71: required from ‘void boost::brandes_betweenness_centrality(const Graph&, const bgl_named_params<T, Tag, Base>&, typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >; Param = vec_adj_list_vertex_id_map<property<vertex_index_t, int, property<vertex_centrality_t, double> >, long unsigned int>; Tag = vertex_index_t; Rest = bgl_named_params<adj_list_edge_property_map<undirected_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_centrality_t, double> >, edge_centrality_t>, edge_centrality_t, no_property>; typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits<Graph>::traversal_category = undir_adj_list_traversal_tag]’
558 | detail::graph::brandes_betweenness_centrality_dispatch1< ew >::run(g,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
559 | choose_param(
| ~~~~~~~~~~~~~
560 | get_param(params, vertex_centrality), dummy_property_map()),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
561 | choose_param(get_param(params, edge_centrality), dummy_property_map()),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
562 | choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
563 | get_param(params, edge_weight));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/bc_clustering.hpp:131:39: required from ‘void boost::betweenness_centrality_clustering(MutableGraph&, Done, EdgeCentralityMap, VertexIndexMap) [with MutableGraph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >; Done = clustering_threshold; EdgeCentralityMap = adj_list_edge_property_map<undirected_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_centrality_t, double> >, edge_centrality_t>; VertexIndexMap = vec_adj_list_vertex_id_map<property<vertex_index_t, int, property<vertex_centrality_t, double> >, long unsigned int>]’
131 | brandes_betweenness_centrality(g,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
132 | edge_centrality_map(edge_centrality)
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
133 | .vertex_index_map(vertex_index));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/bc_clustering.hpp:150:38: required from ‘void boost::betweenness_centrality_clustering(MutableGraph&, Done, EdgeCentralityMap) [with MutableGraph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >; Done = clustering_threshold; EdgeCentralityMap = adj_list_edge_property_map<undirected_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_centrality_t, double> >, edge_centrality_t>]’
150 | betweenness_centrality_clustering(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
151 | g, done, edge_centrality, get(vertex_index, g));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
bbc.cpp:149:36: required from here
149 | betweenness_centrality_clustering(g,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
150 | clustering_threshold(threshold, g, normalize),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
151 | get(edge_centrality, g));
| ~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
20 | ~usage_requirements() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible<X, Y>::~Convertible() [with X = boost::lvalue_property_map_tag; Y = boost::writable_property_map_tag]’
37 | ~model()
| ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
208 | BOOST_CONCEPT_USAGE(Convertible) {
| ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::DefaultConstructible<long unsigned int>]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::DefaultConstructible<long unsigned int> >]’
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:137:5: required from ‘struct boost::DefaultConstructible<long unsigned int>’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::DefaultConstructible<long unsigned int>]’
32 | inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
| ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied<boost::DefaultConstructible<long unsigned int> >::value’
44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied<boost::DefaultConstructible<long unsigned int> >’
45 | typedef boost::integral_constant<bool, value> type;
| ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 16 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:500:43: required from ‘void boost::detail::graph::brandes_betweenness_centrality_dispatch2(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >; CentralityMap = boost::dummy_property_map; EdgeCentralityMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>]’
500 | brandes_betweenness_centrality(g, centrality, edge_centrality_map,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
501 | make_iterator_property_map(incoming.begin(), vertex_index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
502 | make_iterator_property_map(distance.begin(), vertex_index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
503 | make_iterator_property_map(dependency.begin(), vertex_index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
504 | make_iterator_property_map(path_count.begin(), vertex_index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
505 | vertex_index);
| ~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:531:57: required from ‘static void boost::detail::graph::brandes_betweenness_centrality_dispatch1<boost::param_not_found>::run(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap, boost::param_not_found) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >; CentralityMap = boost::dummy_property_map; EdgeCentralityMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>]’
531 | brandes_betweenness_centrality_dispatch2(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
532 | g, centrality, edge_centrality_map, vertex_index);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:558:71: required from ‘void boost::brandes_betweenness_centrality(const Graph&, const bgl_named_params<T, Tag, Base>&, typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >; Param = vec_adj_list_vertex_id_map<property<vertex_index_t, int, property<vertex_centrality_t, double> >, long unsigned int>; Tag = vertex_index_t; Rest = bgl_named_params<adj_list_edge_property_map<undirected_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_centrality_t, double> >, edge_centrality_t>, edge_centrality_t, no_property>; typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits<Graph>::traversal_category = undir_adj_list_traversal_tag]’
558 | detail::graph::brandes_betweenness_centrality_dispatch1< ew >::run(g,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
559 | choose_param(
| ~~~~~~~~~~~~~
560 | get_param(params, vertex_centrality), dummy_property_map()),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
561 | choose_param(get_param(params, edge_centrality), dummy_property_map()),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
562 | choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
563 | get_param(params, edge_weight));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/bc_clustering.hpp:131:39: required from ‘void boost::betweenness_centrality_clustering(MutableGraph&, Done, EdgeCentralityMap, VertexIndexMap) [with MutableGraph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >; Done = clustering_threshold; EdgeCentralityMap = adj_list_edge_property_map<undirected_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_centrality_t, double> >, edge_centrality_t>; VertexIndexMap = vec_adj_list_vertex_id_map<property<vertex_index_t, int, property<vertex_centrality_t, double> >, long unsigned int>]’
131 | brandes_betweenness_centrality(g,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
132 | edge_centrality_map(edge_centrality)
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
133 | .vertex_index_map(vertex_index));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/bc_clustering.hpp:150:38: required from ‘void boost::betweenness_centrality_clustering(MutableGraph&, Done, EdgeCentralityMap) [with MutableGraph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >; Done = clustering_threshold; EdgeCentralityMap = adj_list_edge_property_map<undirected_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_centrality_t, double> >, edge_centrality_t>]’
150 | betweenness_centrality_clustering(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
151 | g, done, edge_centrality, get(vertex_index, g));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
bbc.cpp:149:36: required from here
149 | betweenness_centrality_clustering(g,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
150 | clustering_threshold(threshold, g, normalize),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
151 | get(edge_centrality, g));
| ~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
20 | ~usage_requirements() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::DefaultConstructible<TT>::~DefaultConstructible() [with TT = long unsigned int]’
37 | ~model()
| ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:137:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
137 | BOOST_CONCEPT_USAGE(DefaultConstructible) {
| ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::EqualityComparable<long unsigned int>]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::EqualityComparable<long unsigned int> >]’
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable<long unsigned int>’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::EqualityComparable<long unsigned int>]’
32 | inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
| ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied<boost::EqualityComparable<long unsigned int> >::value’
44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied<boost::EqualityComparable<long unsigned int> >’
45 | typedef boost::integral_constant<bool, value> type;
| ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 16 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:500:43: required from ‘void boost::detail::graph::brandes_betweenness_centrality_dispatch2(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >; CentralityMap = boost::dummy_property_map; EdgeCentralityMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>]’
500 | brandes_betweenness_centrality(g, centrality, edge_centrality_map,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
501 | make_iterator_property_map(incoming.begin(), vertex_index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
502 | make_iterator_property_map(distance.begin(), vertex_index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
503 | make_iterator_property_map(dependency.begin(), vertex_index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
504 | make_iterator_property_map(path_count.begin(), vertex_index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
505 | vertex_index);
| ~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:531:57: required from ‘static void boost::detail::graph::brandes_betweenness_centrality_dispatch1<boost::param_not_found>::run(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap, boost::param_not_found) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >; CentralityMap = boost::dummy_property_map; EdgeCentralityMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>]’
531 | brandes_betweenness_centrality_dispatch2(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
532 | g, centrality, edge_centrality_map, vertex_index);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:558:71: required from ‘void boost::brandes_betweenness_centrality(const Graph&, const bgl_named_params<T, Tag, Base>&, typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >; Param = vec_adj_list_vertex_id_map<property<vertex_index_t, int, property<vertex_centrality_t, double> >, long unsigned int>; Tag = vertex_index_t; Rest = bgl_named_params<adj_list_edge_property_map<undirected_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_centrality_t, double> >, edge_centrality_t>, edge_centrality_t, no_property>; typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits<Graph>::traversal_category = undir_adj_list_traversal_tag]’
558 | detail::graph::brandes_betweenness_centrality_dispatch1< ew >::run(g,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
559 | choose_param(
| ~~~~~~~~~~~~~
560 | get_param(params, vertex_centrality), dummy_property_map()),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
561 | choose_param(get_param(params, edge_centrality), dummy_property_map()),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
562 | choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
563 | get_param(params, edge_weight));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/bc_clustering.hpp:131:39: required from ‘void boost::betweenness_centrality_clustering(MutableGraph&, Done, EdgeCentralityMap, VertexIndexMap) [with MutableGraph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >; Done = clustering_threshold; EdgeCentralityMap = adj_list_edge_property_map<undirected_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_centrality_t, double> >, edge_centrality_t>; VertexIndexMap = vec_adj_list_vertex_id_map<property<vertex_index_t, int, property<vertex_centrality_t, double> >, long unsigned int>]’
131 | brandes_betweenness_centrality(g,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
132 | edge_centrality_map(edge_centrality)
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
133 | .vertex_index_map(vertex_index));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/bc_clustering.hpp:150:38: required from ‘void boost::betweenness_centrality_clustering(MutableGraph&, Done, EdgeCentralityMap) [with MutableGraph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >; Done = clustering_threshold; EdgeCentralityMap = adj_list_edge_property_map<undirected_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_centrality_t, double> >, edge_centrality_t>]’
150 | betweenness_centrality_clustering(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
151 | g, done, edge_centrality, get(vertex_index, g));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
bbc.cpp:149:36: required from here
149 | betweenness_centrality_clustering(g,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
150 | clustering_threshold(threshold, g, normalize),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
151 | get(edge_centrality, g));
| ~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
20 | ~usage_requirements() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::EqualityComparable<TT>::~EqualityComparable() [with TT = long unsigned int]’
37 | ~model()
| ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:233:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
233 | BOOST_CONCEPT_USAGE(EqualityComparable) {
| ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Assignable<long unsigned int>]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Assignable<long unsigned int> >]’
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:145:5: required from ‘struct boost::Assignable<long unsigned int>’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::Assignable<long unsigned int>]’
32 | inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
| ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied<boost::Assignable<long unsigned int> >::value’
44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied<boost::Assignable<long unsigned int> >’
45 | typedef boost::integral_constant<bool, value> type;
| ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 16 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:500:43: required from ‘void boost::detail::graph::brandes_betweenness_centrality_dispatch2(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >; CentralityMap = boost::dummy_property_map; EdgeCentralityMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>]’
500 | brandes_betweenness_centrality(g, centrality, edge_centrality_map,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
501 | make_iterator_property_map(incoming.begin(), vertex_index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
502 | make_iterator_property_map(distance.begin(), vertex_index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
503 | make_iterator_property_map(dependency.begin(), vertex_index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
504 | make_iterator_property_map(path_count.begin(), vertex_index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
505 | vertex_index);
| ~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:531:57: required from ‘static void boost::detail::graph::brandes_betweenness_centrality_dispatch1<boost::param_not_found>::run(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap, boost::param_not_found) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >; CentralityMap = boost::dummy_property_map; EdgeCentralityMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>]’
531 | brandes_betweenness_centrality_dispatch2(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
532 | g, centrality, edge_centrality_map, vertex_index);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:558:71: required from ‘void boost::brandes_betweenness_centrality(const Graph&, const bgl_named_params<T, Tag, Base>&, typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >; Param = vec_adj_list_vertex_id_map<property<vertex_index_t, int, property<vertex_centrality_t, double> >, long unsigned int>; Tag = vertex_index_t; Rest = bgl_named_params<adj_list_edge_property_map<undirected_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_centrality_t, double> >, edge_centrality_t>, edge_centrality_t, no_property>; typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits<Graph>::traversal_category = undir_adj_list_traversal_tag]’
558 | detail::graph::brandes_betweenness_centrality_dispatch1< ew >::run(g,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
559 | choose_param(
| ~~~~~~~~~~~~~
560 | get_param(params, vertex_centrality), dummy_property_map()),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
561 | choose_param(get_param(params, edge_centrality), dummy_property_map()),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
562 | choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
563 | get_param(params, edge_weight));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/bc_clustering.hpp:131:39: required from ‘void boost::betweenness_centrality_clustering(MutableGraph&, Done, EdgeCentralityMap, VertexIndexMap) [with MutableGraph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >; Done = clustering_threshold; EdgeCentralityMap = adj_list_edge_property_map<undirected_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_centrality_t, double> >, edge_centrality_t>; VertexIndexMap = vec_adj_list_vertex_id_map<property<vertex_index_t, int, property<vertex_centrality_t, double> >, long unsigned int>]’
131 | brandes_betweenness_centrality(g,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
132 | edge_centrality_map(edge_centrality)
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
133 | .vertex_index_map(vertex_index));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/bc_clustering.hpp:150:38: required from ‘void boost::betweenness_centrality_clustering(MutableGraph&, Done, EdgeCentralityMap) [with MutableGraph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >; Done = clustering_threshold; EdgeCentralityMap = adj_list_edge_property_map<undirected_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_centrality_t, double> >, edge_centrality_t>]’
150 | betweenness_centrality_clustering(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
151 | g, done, edge_centrality, get(vertex_index, g));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
bbc.cpp:149:36: required from here
149 | betweenness_centrality_clustering(g,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
150 | clustering_threshold(threshold, g, normalize),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
151 | get(edge_centrality, g));
| ~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
20 | ~usage_requirements() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Assignable<TT>::~Assignable() [with TT = long unsigned int]’
37 | ~model()
| ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:145:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
145 | BOOST_CONCEPT_USAGE(Assignable) {
| ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Assignable<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > > >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > > >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > > >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:145:5: required from ‘struct boost::Assignable<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > > >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > > >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > > >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> >’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > > >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > > >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > > >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> >’
502 | BOOST_concept(InputIterator,(TT))
| ^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::InputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > > >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > > >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > > >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> >]’
32 | inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
| ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied<boost::InputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > > >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > > >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > > >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> > >::value’
44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied<boost::InputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > > >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > > >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > > >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> > >’
45 | typedef boost::integral_constant<bool, value> type;
| ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 10 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:500:43: required from ‘void boost::detail::graph::brandes_betweenness_centrality_dispatch2(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >; CentralityMap = boost::dummy_property_map; EdgeCentralityMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>]’
500 | brandes_betweenness_centrality(g, centrality, edge_centrality_map,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
501 | make_iterator_property_map(incoming.begin(), vertex_index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
502 | make_iterator_property_map(distance.begin(), vertex_index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
503 | make_iterator_property_map(dependency.begin(), vertex_index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
504 | make_iterator_property_map(path_count.begin(), vertex_index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
505 | vertex_index);
| ~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:531:57: required from ‘static void boost::detail::graph::brandes_betweenness_centrality_dispatch1<boost::param_not_found>::run(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap, boost::param_not_found) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >; CentralityMap = boost::dummy_property_map; EdgeCentralityMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>]’
531 | brandes_betweenness_centrality_dispatch2(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
532 | g, centrality, edge_centrality_map, vertex_index);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:558:71: required from ‘void boost::brandes_betweenness_centrality(const Graph&, const bgl_named_params<T, Tag, Base>&, typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >; Param = vec_adj_list_vertex_id_map<property<vertex_index_t, int, property<vertex_centrality_t, double> >, long unsigned int>; Tag = vertex_index_t; Rest = bgl_named_params<adj_list_edge_property_map<undirected_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_centrality_t, double> >, edge_centrality_t>, edge_centrality_t, no_property>; typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits<Graph>::traversal_category = undir_adj_list_traversal_tag]’
558 | detail::graph::brandes_betweenness_centrality_dispatch1< ew >::run(g,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
559 | choose_param(
| ~~~~~~~~~~~~~
560 | get_param(params, vertex_centrality), dummy_property_map()),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
561 | choose_param(get_param(params, edge_centrality), dummy_property_map()),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
562 | choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
563 | get_param(params, edge_weight));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/bc_clustering.hpp:131:39: required from ‘void boost::betweenness_centrality_clustering(MutableGraph&, Done, EdgeCentralityMap, VertexIndexMap) [with MutableGraph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >; Done = clustering_threshold; EdgeCentralityMap = adj_list_edge_property_map<undirected_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_centrality_t, double> >, edge_centrality_t>; VertexIndexMap = vec_adj_list_vertex_id_map<property<vertex_index_t, int, property<vertex_centrality_t, double> >, long unsigned int>]’
131 | brandes_betweenness_centrality(g,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
132 | edge_centrality_map(edge_centrality)
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
133 | .vertex_index_map(vertex_index));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/bc_clustering.hpp:150:38: required from ‘void boost::betweenness_centrality_clustering(MutableGraph&, Done, EdgeCentralityMap) [with MutableGraph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >; Done = clustering_threshold; EdgeCentralityMap = adj_list_edge_property_map<undirected_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_centrality_t, double> >, edge_centrality_t>]’
150 | betweenness_centrality_clustering(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
151 | g, done, edge_centrality, get(vertex_index, g));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
bbc.cpp:149:36: required from here
149 | betweenness_centrality_clustering(g,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
150 | clustering_threshold(threshold, g, normalize),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
151 | get(edge_centrality, g));
| ~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Assignable<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > > >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > > >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > > >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> >]’
20 | ~usage_requirements() { ((Model*)0)->~Model(); }
| ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::EqualityComparable<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > > >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > > >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > > >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > > >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > > >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > > >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> >’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > > >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > > >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > > >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> >’
502 | BOOST_concept(InputIterator,(TT))
| ^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::InputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > > >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > > >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > > >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> >]’
32 | inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
| ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied<boost::InputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > > >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > > >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > > >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> > >::value’
44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied<boost::InputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > > >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > > >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > > >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> > >’
45 | typedef boost::integral_constant<bool, value> type;
| ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 10 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:500:43: required from ‘void boost::detail::graph::brandes_betweenness_centrality_dispatch2(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >; CentralityMap = boost::dummy_property_map; EdgeCentralityMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>]’
500 | brandes_betweenness_centrality(g, centrality, edge_centrality_map,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
501 | make_iterator_property_map(incoming.begin(), vertex_index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
502 | make_iterator_property_map(distance.begin(), vertex_index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
503 | make_iterator_property_map(dependency.begin(), vertex_index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
504 | make_iterator_property_map(path_count.begin(), vertex_index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
505 | vertex_index);
| ~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:531:57: required from ‘static void boost::detail::graph::brandes_betweenness_centrality_dispatch1<boost::param_not_found>::run(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap, boost::param_not_found) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >; CentralityMap = boost::dummy_property_map; EdgeCentralityMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>]’
531 | brandes_betweenness_centrality_dispatch2(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
532 | g, centrality, edge_centrality_map, vertex_index);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:558:71: required from ‘void boost::brandes_betweenness_centrality(const Graph&, const bgl_named_params<T, Tag, Base>&, typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >; Param = vec_adj_list_vertex_id_map<property<vertex_index_t, int, property<vertex_centrality_t, double> >, long unsigned int>; Tag = vertex_index_t; Rest = bgl_named_params<adj_list_edge_property_map<undirected_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_centrality_t, double> >, edge_centrality_t>, edge_centrality_t, no_property>; typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits<Graph>::traversal_category = undir_adj_list_traversal_tag]’
558 | detail::graph::brandes_betweenness_centrality_dispatch1< ew >::run(g,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
559 | choose_param(
| ~~~~~~~~~~~~~
560 | get_param(params, vertex_centrality), dummy_property_map()),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
561 | choose_param(get_param(params, edge_centrality), dummy_property_map()),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
562 | choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
563 | get_param(params, edge_weight));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/bc_clustering.hpp:131:39: required from ‘void boost::betweenness_centrality_clustering(MutableGraph&, Done, EdgeCentralityMap, VertexIndexMap) [with MutableGraph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >; Done = clustering_threshold; EdgeCentralityMap = adj_list_edge_property_map<undirected_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_centrality_t, double> >, edge_centrality_t>; VertexIndexMap = vec_adj_list_vertex_id_map<property<vertex_index_t, int, property<vertex_centrality_t, double> >, long unsigned int>]’
131 | brandes_betweenness_centrality(g,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
132 | edge_centrality_map(edge_centrality)
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
133 | .vertex_index_map(vertex_index));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/bc_clustering.hpp:150:38: required from ‘void boost::betweenness_centrality_clustering(MutableGraph&, Done, EdgeCentralityMap) [with MutableGraph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >; Done = clustering_threshold; EdgeCentralityMap = adj_list_edge_property_map<undirected_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_centrality_t, double> >, edge_centrality_t>]’
150 | betweenness_centrality_clustering(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
151 | g, done, edge_centrality, get(vertex_index, g));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
bbc.cpp:149:36: required from here
149 | betweenness_centrality_clustering(g,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
150 | clustering_threshold(threshold, g, normalize),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
151 | get(edge_centrality, g));
| ~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::EqualityComparable<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > > >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > > >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > > >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> >]’
20 | ~usage_requirements() { ((Model*)0)->~Model(); }
| ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::InputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > > >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > > >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > > >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:512:7: required from ‘struct boost::InputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > > >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > > >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > > >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> >’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::InputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > > >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > > >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > > >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> >]’
32 | inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
| ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied<boost::InputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > > >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > > >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > > >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> > >::value’
44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied<boost::InputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > > >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > > >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > > >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> > >’
45 | typedef boost::integral_constant<bool, value> type;
| ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_<void (*)(boost::InputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > > >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > > >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > > >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> >)>’
72 | struct requirement_<void(*)(Model)>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:53:35: [ skipping 9 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:500:43: required from ‘void boost::detail::graph::brandes_betweenness_centrality_dispatch2(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >; CentralityMap = boost::dummy_property_map; EdgeCentralityMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>]’
500 | brandes_betweenness_centrality(g, centrality, edge_centrality_map,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
501 | make_iterator_property_map(incoming.begin(), vertex_index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
502 | make_iterator_property_map(distance.begin(), vertex_index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
503 | make_iterator_property_map(dependency.begin(), vertex_index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
504 | make_iterator_property_map(path_count.begin(), vertex_index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
505 | vertex_index);
| ~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:531:57: required from ‘static void boost::detail::graph::brandes_betweenness_centrality_dispatch1<boost::param_not_found>::run(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap, boost::param_not_found) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >; CentralityMap = boost::dummy_property_map; EdgeCentralityMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>]’
531 | brandes_betweenness_centrality_dispatch2(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
532 | g, centrality, edge_centrality_map, vertex_index);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:558:71: required from ‘void boost::brandes_betweenness_centrality(const Graph&, const bgl_named_params<T, Tag, Base>&, typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >; Param = vec_adj_list_vertex_id_map<property<vertex_index_t, int, property<vertex_centrality_t, double> >, long unsigned int>; Tag = vertex_index_t; Rest = bgl_named_params<adj_list_edge_property_map<undirected_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_centrality_t, double> >, edge_centrality_t>, edge_centrality_t, no_property>; typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits<Graph>::traversal_category = undir_adj_list_traversal_tag]’
558 | detail::graph::brandes_betweenness_centrality_dispatch1< ew >::run(g,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
559 | choose_param(
| ~~~~~~~~~~~~~
560 | get_param(params, vertex_centrality), dummy_property_map()),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
561 | choose_param(get_param(params, edge_centrality), dummy_property_map()),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
562 | choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
563 | get_param(params, edge_weight));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/bc_clustering.hpp:131:39: required from ‘void boost::betweenness_centrality_clustering(MutableGraph&, Done, EdgeCentralityMap, VertexIndexMap) [with MutableGraph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >; Done = clustering_threshold; EdgeCentralityMap = adj_list_edge_property_map<undirected_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_centrality_t, double> >, edge_centrality_t>; VertexIndexMap = vec_adj_list_vertex_id_map<property<vertex_index_t, int, property<vertex_centrality_t, double> >, long unsigned int>]’
131 | brandes_betweenness_centrality(g,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
132 | edge_centrality_map(edge_centrality)
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
133 | .vertex_index_map(vertex_index));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/bc_clustering.hpp:150:38: required from ‘void boost::betweenness_centrality_clustering(MutableGraph&, Done, EdgeCentralityMap) [with MutableGraph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >; Done = clustering_threshold; EdgeCentralityMap = adj_list_edge_property_map<undirected_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_centrality_t, double> >, edge_centrality_t>]’
150 | betweenness_centrality_clustering(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
151 | g, done, edge_centrality, get(vertex_index, g));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
bbc.cpp:149:36: required from here
149 | betweenness_centrality_clustering(g,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
150 | clustering_threshold(threshold, g, normalize),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
151 | get(edge_centrality, g));
| ~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::InputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > > >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > > >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > > >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> >]’
20 | ~usage_requirements() { ((Model*)0)->~Model(); }
| ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::InputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > > >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > > >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > > >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:53:35: required from ‘boost::concepts::MultiPassInputIterator<T>::~MultiPassInputIterator() [with T = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > > >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > > >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > > >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int>]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::MultiPassInputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > > >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > > >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > > >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> >]’
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:89:9: required from ‘boost::concepts::IncidenceGraph<G>::~IncidenceGraph() [with G = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:75:1: required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::IncidenceGraphConcept<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > > >]’
75 | BOOST_concept(IncidenceGraph, (G)) : Graph< G >
| ^~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:129:9: required from ‘void boost::breadth_first_visit(const IncidenceGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with IncidenceGraph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >; Buffer = queue<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > >; BFSVisitor = detail::graph::brandes_unweighted_shortest_paths::visitor_type<const adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >, iterator_property_map<__gnu_cxx::__normal_iterator<std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<undirected_tag, long unsigned int> > >*, std::vector<std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<undirected_tag, long unsigned int> > >, std::allocator<std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<undirected_tag, long unsigned int> > > > > >, vec_adj_list_vertex_id_map<property<vertex_index_t, int, property<vertex_centrality_t, double> >, long unsigned int>, std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<undirected_tag, long unsigned int> > >, std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<undirected_tag, long unsigned int> > >&>, iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > >, vec_adj_list_vertex_id_map<property<vertex_index_t, int, property<vertex_centrality_t, double> >, long unsigned int>, double, double&>, iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > >, vec_adj_list_vertex_id_map<property<vertex_index_t, int, property<vertex_centrality_t, double> >, long unsigned int>, long unsigned int, long unsigned int&> >; ColorMap = iterator_property_map<__gnu_cxx::__normal_iterator<default_color_type*, std::vector<default_color_type> >, vec_adj_list_vertex_id_map<property<vertex_index_t, int, property<vertex_centrality_t, double> >, long unsigned int>, default_color_type, default_color_type&>; SourceIterator = long unsigned int*]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:118:24: [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:500:43: required from ‘void boost::detail::graph::brandes_betweenness_centrality_dispatch2(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >; CentralityMap = boost::dummy_property_map; EdgeCentralityMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>]’
500 | brandes_betweenness_centrality(g, centrality, edge_centrality_map,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
501 | make_iterator_property_map(incoming.begin(), vertex_index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
502 | make_iterator_property_map(distance.begin(), vertex_index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
503 | make_iterator_property_map(dependency.begin(), vertex_index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
504 | make_iterator_property_map(path_count.begin(), vertex_index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
505 | vertex_index);
| ~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:531:57: required from ‘static void boost::detail::graph::brandes_betweenness_centrality_dispatch1<boost::param_not_found>::run(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap, boost::param_not_found) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >; CentralityMap = boost::dummy_property_map; EdgeCentralityMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>]’
531 | brandes_betweenness_centrality_dispatch2(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
532 | g, centrality, edge_centrality_map, vertex_index);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:558:71: required from ‘void boost::brandes_betweenness_centrality(const Graph&, const bgl_named_params<T, Tag, Base>&, typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >; Param = vec_adj_list_vertex_id_map<property<vertex_index_t, int, property<vertex_centrality_t, double> >, long unsigned int>; Tag = vertex_index_t; Rest = bgl_named_params<adj_list_edge_property_map<undirected_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_centrality_t, double> >, edge_centrality_t>, edge_centrality_t, no_property>; typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits<Graph>::traversal_category = undir_adj_list_traversal_tag]’
558 | detail::graph::brandes_betweenness_centrality_dispatch1< ew >::run(g,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
559 | choose_param(
| ~~~~~~~~~~~~~
560 | get_param(params, vertex_centrality), dummy_property_map()),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
561 | choose_param(get_param(params, edge_centrality), dummy_property_map()),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
562 | choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
563 | get_param(params, edge_weight));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/bc_clustering.hpp:131:39: required from ‘void boost::betweenness_centrality_clustering(MutableGraph&, Done, EdgeCentralityMap, VertexIndexMap) [with MutableGraph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >; Done = clustering_threshold; EdgeCentralityMap = adj_list_edge_property_map<undirected_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_centrality_t, double> >, edge_centrality_t>; VertexIndexMap = vec_adj_list_vertex_id_map<property<vertex_index_t, int, property<vertex_centrality_t, double> >, long unsigned int>]’
131 | brandes_betweenness_centrality(g,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
132 | edge_centrality_map(edge_centrality)
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
133 | .vertex_index_map(vertex_index));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/bc_clustering.hpp:150:38: required from ‘void boost::betweenness_centrality_clustering(MutableGraph&, Done, EdgeCentralityMap) [with MutableGraph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >; Done = clustering_threshold; EdgeCentralityMap = adj_list_edge_property_map<undirected_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_centrality_t, double> >, edge_centrality_t>]’
150 | betweenness_centrality_clustering(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
151 | g, done, edge_centrality, get(vertex_index, g));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
bbc.cpp:149:36: required from here
149 | betweenness_centrality_clustering(g,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
150 | clustering_threshold(threshold, g, normalize),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
151 | get(edge_centrality, g));
| ~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::InputIterator<TT>::~InputIterator() [with TT = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > > >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > > >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > > >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int>]’
37 | ~model()
| ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:512:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
512 | BOOST_CONCEPT_USAGE(InputIterator)
| ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::constraint<Model>::failed() [with Model = boost::BFSVisitorConcept<boost::detail::dijkstra_bfs_visitor<boost::detail::graph::brandes_dijkstra_visitor<const boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >, boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_weight_t>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >*, std::vector<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >, std::allocator<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > > > > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>, std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >, std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>, double, double&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>, long unsigned int, long unsigned int&> >, boost::d_ary_heap_indirect<long unsigned int, 4, boost::iterator_property_map<long unsigned int*, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>, double, double&>, std::less<double>, std::vector<long unsigned int, std::allocator<long unsigned int> > >, boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_weight_t>, boost::dummy_property_map, boost::iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>, double, double&>, std::plus<double>, std::less<double> >, boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:65:5: required from ‘void boost::breadth_first_visit(const IncidenceGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with IncidenceGraph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >; Buffer = d_ary_heap_indirect<long unsigned int, 4, iterator_property_map<long unsigned int*, vec_adj_list_vertex_id_map<property<vertex_index_t, int, property<vertex_centrality_t, double> >, long unsigned int>, long unsigned int, long unsigned int&>, iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > >, vec_adj_list_vertex_id_map<property<vertex_index_t, int, property<vertex_centrality_t, double> >, long unsigned int>, double, double&>, std::less<double>, std::vector<long unsigned int, std::allocator<long unsigned int> > >; BFSVisitor = detail::dijkstra_bfs_visitor<detail::graph::brandes_dijkstra_visitor<const adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >, adj_list_edge_property_map<undirected_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_centrality_t, double> >, edge_weight_t>, iterator_property_map<__gnu_cxx::__normal_iterator<std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<undirected_tag, long unsigned int> > >*, std::vector<std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<undirected_tag, long unsigned int> > >, std::allocator<std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<undirected_tag, long unsigned int> > > > > >, vec_adj_list_vertex_id_map<property<vertex_index_t, int, property<vertex_centrality_t, double> >, long unsigned int>, std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<undirected_tag, long unsigned int> > >, std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<undirected_tag, long unsigned int> > >&>, iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > >, vec_adj_list_vertex_id_map<property<vertex_index_t, int, property<vertex_centrality_t, double> >, long unsigned int>, double, double&>, iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > >, vec_adj_list_vertex_id_map<property<vertex_index_t, int, property<vertex_centrality_t, double> >, long unsigned int>, long unsigned int, long unsigned int&> >, d_ary_heap_indirect<long unsigned int, 4, iterator_property_map<long unsigned int*, vec_adj_list_vertex_id_map<property<vertex_index_t, int, property<vertex_centrality_t, double> >, long unsigned int>, long unsigned int, long unsigned int&>, iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > >, vec_adj_list_vertex_id_map<property<vertex_index_t, int, property<vertex_centrality_t, double> >, long unsigned int>, double, double&>, std::less<double>, std::vector<long unsigned int, std::allocator<long unsigned int> > >, adj_list_edge_property_map<undirected_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_centrality_t, double> >, edge_weight_t>, dummy_property_map, iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > >, vec_adj_list_vertex_id_map<property<vertex_index_t, int, property<vertex_centrality_t, double> >, long unsigned int>, double, double&>, std::plus<double>, std::less<double> >; ColorMap = two_bit_color_map<vec_adj_list_vertex_id_map<property<vertex_index_t, int, property<vertex_centrality_t, double> >, long unsigned int> >; SourceIterator = long unsigned int*]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dijkstra_shortest_paths.hpp:387:24: required from ‘void boost::dijkstra_shortest_paths_no_init(const Graph&, SourceInputIter, SourceInputIter, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistZero, DijkstraVisitor, ColorMap) [with Graph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >; SourceInputIter = long unsigned int*; DijkstraVisitor = detail::graph::brandes_dijkstra_visitor<const adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >, adj_list_edge_property_map<undirected_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_centrality_t, double> >, edge_weight_t>, iterator_property_map<__gnu_cxx::__normal_iterator<std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<undirected_tag, long unsigned int> > >*, std::vector<std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<undirected_tag, long unsigned int> > >, std::allocator<std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<undirected_tag, long unsigned int> > > > > >, vec_adj_list_vertex_id_map<property<vertex_index_t, int, property<vertex_centrality_t, double> >, long unsigned int>, std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<undirected_tag, long unsigned int> > >, std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<undirected_tag, long unsigned int> > >&>, iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > >, vec_adj_list_vertex_id_map<property<vertex_index_t, int, property<vertex_centrality_t, double> >, long unsigned int>, double, double&>, iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > >, vec_adj_list_vertex_id_map<property<vertex_index_t, int, property<vertex_centrality_t, double> >, long unsigned int>, long unsigned int, long unsigned int&> >; PredecessorMap = dummy_property_map; DistanceMap = iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > >, vec_adj_list_vertex_id_map<property<vertex_index_t, int, property<vertex_centrality_t, double> >, long unsigned int>, double, double&>; WeightMap = adj_list_edge_property_map<undirected_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_centrality_t, double> >, edge_weight_t>; IndexMap = vec_adj_list_vertex_id_map<property<vertex_index_t, int, property<vertex_centrality_t, double> >, long unsigned int>; Compare = std::less<double>; Combine = std::plus<double>; DistZero = double; ColorMap = two_bit_color_map<vec_adj_list_vertex_id_map<property<vertex_index_t, int, property<vertex_centrality_t, double> >, long unsigned int> >]’
387 | breadth_first_visit(g, s_begin, s_end, Q, bfs_vis, color);
| ~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dijkstra_shortest_paths.hpp:464:36: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, SourceInputIter, SourceInputIter, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistInf, DistZero, DijkstraVisitor, ColorMap) [with VertexListGraph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >; SourceInputIter = long unsigned int*; DijkstraVisitor = detail::graph::brandes_dijkstra_visitor<const adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >, adj_list_edge_property_map<undirected_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_centrality_t, double> >, edge_weight_t>, iterator_property_map<__gnu_cxx::__normal_iterator<std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<undirected_tag, long unsigned int> > >*, std::vector<std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<undirected_tag, long unsigned int> > >, std::allocator<std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<undirected_tag, long unsigned int> > > > > >, vec_adj_list_vertex_id_map<property<vertex_index_t, int, property<vertex_centrality_t, double> >, long unsigned int>, std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<undirected_tag, long unsigned int> > >, std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<undirected_tag, long unsigned int> > >&>, iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > >, vec_adj_list_vertex_id_map<property<vertex_index_t, int, property<vertex_centrality_t, double> >, long unsigned int>, double, double&>, iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > >, vec_adj_list_vertex_id_map<property<vertex_index_t, int, property<vertex_centrality_t, double> >, long unsigned int>, long unsigned int, long unsigned int&> >; PredecessorMap = dummy_property_map; DistanceMap = iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > >, vec_adj_list_vertex_id_map<property<vertex_index_t, int, property<vertex_centrality_t, double> >, long unsigned int>, double, double&>; WeightMap = adj_list_edge_property_map<undirected_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_centrality_t, double> >, edge_weight_t>; IndexMap = vec_adj_list_vertex_id_map<property<vertex_index_t, int, property<vertex_centrality_t, double> >, long unsigned int>; Compare = std::less<double>; Combine = std::plus<double>; DistInf = double; DistZero = double; ColorMap = two_bit_color_map<vec_adj_list_vertex_id_map<property<vertex_index_t, int, property<vertex_centrality_t, double> >, long unsigned int> >]’
464 | dijkstra_shortest_paths_no_init(g, s_begin, s_end, predecessor, distance,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
465 | weight, index_map, compare, combine, zero, vis, color);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dijkstra_shortest_paths.hpp:417:28: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, SourceInputIter, SourceInputIter, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistInf, DistZero, DijkstraVisitor, const bgl_named_params<T, Tag, Base>&, typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type) [with VertexListGraph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >; SourceInputIter = long unsigned int*; DijkstraVisitor = detail::graph::brandes_dijkstra_visitor<const adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >, adj_list_edge_property_map<undirected_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_centrality_t, double> >, edge_weight_t>, iterator_property_map<__gnu_cxx::__normal_iterator<std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<undirected_tag, long unsigned int> > >*, std::vector<std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<undirected_tag, long unsigned int> > >, std::allocator<std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<undirected_tag, long unsigned int> > > > > >, vec_adj_list_vertex_id_map<property<vertex_index_t, int, property<vertex_centrality_t, double> >, long unsigned int>, std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<undirected_tag, long unsigned int> > >, std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<undirected_tag, long unsigned int> > >&>, iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > >, vec_adj_list_vertex_id_map<property<vertex_index_t, int, property<vertex_centrality_t, double> >, long unsigned int>, double, double&>, iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > >, vec_adj_list_vertex_id_map<property<vertex_index_t, int, property<vertex_centrality_t, double> >, long unsigned int>, long unsigned int, long unsigned int&> >; PredecessorMap = dummy_property_map; DistanceMap = iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > >, vec_adj_list_vertex_id_map<property<vertex_index_t, int, property<vertex_centrality_t, double> >, long unsigned int>, double, double&>; WeightMap = adj_list_edge_property_map<undirected_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_centrality_t, double> >, edge_weight_t>; IndexMap = vec_adj_list_vertex_id_map<property<vertex_index_t, int, property<vertex_centrality_t, double> >, long unsigned int>; Compare = std::less<double>; Combine = std::plus<double>; DistInf = double; DistZero = double; T = char; Tag = detail::unused_tag_type; Base = no_property; typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits<Graph>::traversal_category = undir_adj_list_traversal_tag]’
417 | dijkstra_shortest_paths(g, s_begin, s_end, predecessor, distance, weight,
| ~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
418 | index_map, compare, combine, inf, zero, vis, color);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dijkstra_shortest_paths.hpp:491:28: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, SourceInputIter, SourceInputIter, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistInf, DistZero, DijkstraVisitor) [with VertexListGraph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >; SourceInputIter = long unsigned int*; DijkstraVisitor = detail::graph::brandes_dijkstra_visitor<const adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >, adj_list_edge_property_map<undirected_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_centrality_t, double> >, edge_weight_t>, iterator_property_map<__gnu_cxx::__normal_iterator<std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<undirected_tag, long unsigned int> > >*, std::vector<std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<undirected_tag, long unsigned int> > >, std::allocator<std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<undirected_tag, long unsigned int> > > > > >, vec_adj_list_vertex_id_map<property<vertex_index_t, int, property<vertex_centrality_t, double> >, long unsigned int>, std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<undirected_tag, long unsigned int> > >, std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<undirected_tag, long unsigned int> > >&>, iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > >, vec_adj_list_vertex_id_map<property<vertex_index_t, int, property<vertex_centrality_t, double> >, long unsigned int>, double, double&>, iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > >, vec_adj_list_vertex_id_map<property<vertex_index_t, int, property<vertex_centrality_t, double> >, long unsigned int>, long unsigned int, long unsigned int&> >; PredecessorMap = dummy_property_map; DistanceMap = iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > >, vec_adj_list_vertex_id_map<property<vertex_index_t, int, property<vertex_centrality_t, double> >, long unsigned int>, double, double&>; WeightMap = adj_list_edge_property_map<undirected_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_centrality_t, double> >, edge_weight_t>; IndexMap = vec_adj_list_vertex_id_map<property<vertex_index_t, int, property<vertex_centrality_t, double> >, long unsigned int>; Compare = std::less<double>; Combine = std::plus<double>; DistInf = double; DistZero = double]’
491 | dijkstra_shortest_paths(g, s_begin, s_end, predecessor, distance, weight,
| ~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
492 | index_map, compare, combine, inf, zero, vis, no_named_parameters());
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dijkstra_shortest_paths.hpp:434:28: [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:349:31: required from ‘void boost::detail::graph::brandes_betweenness_centrality_impl(const Graph&, CentralityMap, EdgeCentralityMap, IncomingMap, DistanceMap, DependencyMap, PathCountMap, VertexIndexMap, ShortestPaths) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >; CentralityMap = boost::vec_adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >, boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_centrality_t>; IncomingMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >*, std::vector<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >, std::allocator<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > > > > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>, std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >, std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >&>; DistanceMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>, double, double&>; DependencyMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>, double, double&>; PathCountMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>; ShortestPaths = brandes_dijkstra_shortest_paths<boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_weight_t> >]’
349 | shortest_paths(g, *s, ordered_vertices, incoming, distance,
| ~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
350 | path_count, vertex_index);
| ~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:434:55: required from ‘void boost::brandes_betweenness_centrality(const Graph&, CentralityMap, EdgeCentralityMap, IncomingMap, DistanceMap, DependencyMap, PathCountMap, VertexIndexMap, WeightMap, typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >; CentralityMap = vec_adj_list_vertex_property_map<adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >, adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >*, double, double&, vertex_centrality_t>; EdgeCentralityMap = adj_list_edge_property_map<undirected_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_centrality_t, double> >, edge_centrality_t>; IncomingMap = iterator_property_map<__gnu_cxx::__normal_iterator<std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<undirected_tag, long unsigned int> > >*, std::vector<std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<undirected_tag, long unsigned int> > >, std::allocator<std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<undirected_tag, long unsigned int> > > > > >, vec_adj_list_vertex_id_map<property<vertex_index_t, int, property<vertex_centrality_t, double> >, long unsigned int>, std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<undirected_tag, long unsigned int> > >, std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<undirected_tag, long unsigned int> > >&>; DistanceMap = iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > >, vec_adj_list_vertex_id_map<property<vertex_index_t, int, property<vertex_centrality_t, double> >, long unsigned int>, double, double&>; DependencyMap = iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > >, vec_adj_list_vertex_id_map<property<vertex_index_t, int, property<vertex_centrality_t, double> >, long unsigned int>, double, double&>; PathCountMap = iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > >, vec_adj_list_vertex_id_map<property<vertex_index_t, int, property<vertex_centrality_t, double> >, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = vec_adj_list_vertex_id_map<property<vertex_index_t, int, property<vertex_centrality_t, double> >, long unsigned int>; WeightMap = adj_list_edge_property_map<undirected_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_centrality_t, double> >, edge_weight_t>; typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits<Graph>::traversal_category = undir_adj_list_traversal_tag]’
434 | detail::graph::brandes_betweenness_centrality_impl(g, centrality,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~
435 | edge_centrality_map, incoming, distance, dependency, path_count,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
436 | vertex_index, shortest_paths);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:468:43: required from ‘void boost::detail::graph::brandes_betweenness_centrality_dispatch2(const Graph&, CentralityMap, EdgeCentralityMap, WeightMap, VertexIndexMap) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >; CentralityMap = boost::vec_adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >, boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_centrality_t>; WeightMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_weight_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>]’
468 | brandes_betweenness_centrality(g, centrality, edge_centrality_map,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
469 | make_iterator_property_map(incoming.begin(), vertex_index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
470 | make_iterator_property_map(distance.begin(), vertex_index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
471 | make_iterator_property_map(dependency.begin(), vertex_index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
472 | make_iterator_property_map(path_count.begin(), vertex_index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
473 | vertex_index, weight_map);
| ~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:517:57: required from ‘static void boost::detail::graph::brandes_betweenness_centrality_dispatch1<WeightMap>::run(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap, WeightMap) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >; CentralityMap = boost::vec_adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >, boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>; WeightMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_weight_t>]’
517 | brandes_betweenness_centrality_dispatch2(g, centrality,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~
518 | edge_centrality_map, weight_map, vertex_index);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:558:71: required from ‘void boost::brandes_betweenness_centrality(const Graph&, const bgl_named_params<T, Tag, Base>&, typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >; Param = adj_list_edge_property_map<undirected_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_centrality_t, double> >, edge_weight_t>; Tag = edge_weight_t; Rest = bgl_named_params<adj_list_edge_property_map<undirected_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_centrality_t, double> >, edge_centrality_t>, edge_centrality_t, bgl_named_params<vec_adj_list_vertex_property_map<adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >, adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >*, double, double&, vertex_centrality_t>, vertex_centrality_t, no_property> >; typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits<Graph>::traversal_category = undir_adj_list_traversal_tag]’
558 | detail::graph::brandes_betweenness_centrality_dispatch1< ew >::run(g,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
559 | choose_param(
| ~~~~~~~~~~~~~
560 | get_param(params, vertex_centrality), dummy_property_map()),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
561 | choose_param(get_param(params, edge_centrality), dummy_property_map()),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
562 | choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
563 | get_param(params, edge_weight));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
bbc.cpp:67:33: required from here
67 | brandes_betweenness_centrality(g,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
68 | centrality_map(get(vertex_centrality, g)).
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
69 | edge_centrality_map(get(edge_centrality, g)).
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
70 | weight_map(get(edge_weight, g)));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:65:52: warning: ‘this’ pointer is null [-Wnonnull]
65 | static void failed() { ((Model*)0)->constraints(); }
| ~~~~~~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:37:10: note: in a call to non-static member function ‘void boost::BFSVisitorConcept<Visitor, Graph>::constraints() [with Visitor = boost::detail::dijkstra_bfs_visitor<boost::detail::graph::brandes_dijkstra_visitor<const boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >, boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_weight_t>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >*, std::vector<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >, std::allocator<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > > > > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>, std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >, std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>, double, double&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>, long unsigned int, long unsigned int&> >, boost::d_ary_heap_indirect<long unsigned int, 4, boost::iterator_property_map<long unsigned int*, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>, double, double&>, std::less<double>, std::vector<long unsigned int, std::allocator<long unsigned int> > >, boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_weight_t>, boost::dummy_property_map, boost::iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>, double, double&>, std::plus<double>, std::less<double> >; Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >]’
37 | void constraints()
| ^~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::constraint<Model>::failed() [with Model = boost::ReadWritePropertyMapConcept<boost::two_bit_color_map<boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int> >, long unsigned int>]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:66:5: required from ‘void boost::breadth_first_visit(const IncidenceGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with IncidenceGraph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >; Buffer = d_ary_heap_indirect<long unsigned int, 4, iterator_property_map<long unsigned int*, vec_adj_list_vertex_id_map<property<vertex_index_t, int, property<vertex_centrality_t, double> >, long unsigned int>, long unsigned int, long unsigned int&>, iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > >, vec_adj_list_vertex_id_map<property<vertex_index_t, int, property<vertex_centrality_t, double> >, long unsigned int>, double, double&>, std::less<double>, std::vector<long unsigned int, std::allocator<long unsigned int> > >; BFSVisitor = detail::dijkstra_bfs_visitor<detail::graph::brandes_dijkstra_visitor<const adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >, adj_list_edge_property_map<undirected_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_centrality_t, double> >, edge_weight_t>, iterator_property_map<__gnu_cxx::__normal_iterator<std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<undirected_tag, long unsigned int> > >*, std::vector<std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<undirected_tag, long unsigned int> > >, std::allocator<std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<undirected_tag, long unsigned int> > > > > >, vec_adj_list_vertex_id_map<property<vertex_index_t, int, property<vertex_centrality_t, double> >, long unsigned int>, std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<undirected_tag, long unsigned int> > >, std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<undirected_tag, long unsigned int> > >&>, iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > >, vec_adj_list_vertex_id_map<property<vertex_index_t, int, property<vertex_centrality_t, double> >, long unsigned int>, double, double&>, iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > >, vec_adj_list_vertex_id_map<property<vertex_index_t, int, property<vertex_centrality_t, double> >, long unsigned int>, long unsigned int, long unsigned int&> >, d_ary_heap_indirect<long unsigned int, 4, iterator_property_map<long unsigned int*, vec_adj_list_vertex_id_map<property<vertex_index_t, int, property<vertex_centrality_t, double> >, long unsigned int>, long unsigned int, long unsigned int&>, iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > >, vec_adj_list_vertex_id_map<property<vertex_index_t, int, property<vertex_centrality_t, double> >, long unsigned int>, double, double&>, std::less<double>, std::vector<long unsigned int, std::allocator<long unsigned int> > >, adj_list_edge_property_map<undirected_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_centrality_t, double> >, edge_weight_t>, dummy_property_map, iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > >, vec_adj_list_vertex_id_map<property<vertex_index_t, int, property<vertex_centrality_t, double> >, long unsigned int>, double, double&>, std::plus<double>, std::less<double> >; ColorMap = two_bit_color_map<vec_adj_list_vertex_id_map<property<vertex_index_t, int, property<vertex_centrality_t, double> >, long unsigned int> >; SourceIterator = long unsigned int*]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dijkstra_shortest_paths.hpp:387:24: required from ‘void boost::dijkstra_shortest_paths_no_init(const Graph&, SourceInputIter, SourceInputIter, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistZero, DijkstraVisitor, ColorMap) [with Graph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >; SourceInputIter = long unsigned int*; DijkstraVisitor = detail::graph::brandes_dijkstra_visitor<const adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >, adj_list_edge_property_map<undirected_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_centrality_t, double> >, edge_weight_t>, iterator_property_map<__gnu_cxx::__normal_iterator<std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<undirected_tag, long unsigned int> > >*, std::vector<std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<undirected_tag, long unsigned int> > >, std::allocator<std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<undirected_tag, long unsigned int> > > > > >, vec_adj_list_vertex_id_map<property<vertex_index_t, int, property<vertex_centrality_t, double> >, long unsigned int>, std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<undirected_tag, long unsigned int> > >, std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<undirected_tag, long unsigned int> > >&>, iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > >, vec_adj_list_vertex_id_map<property<vertex_index_t, int, property<vertex_centrality_t, double> >, long unsigned int>, double, double&>, iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > >, vec_adj_list_vertex_id_map<property<vertex_index_t, int, property<vertex_centrality_t, double> >, long unsigned int>, long unsigned int, long unsigned int&> >; PredecessorMap = dummy_property_map; DistanceMap = iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > >, vec_adj_list_vertex_id_map<property<vertex_index_t, int, property<vertex_centrality_t, double> >, long unsigned int>, double, double&>; WeightMap = adj_list_edge_property_map<undirected_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_centrality_t, double> >, edge_weight_t>; IndexMap = vec_adj_list_vertex_id_map<property<vertex_index_t, int, property<vertex_centrality_t, double> >, long unsigned int>; Compare = std::less<double>; Combine = std::plus<double>; DistZero = double; ColorMap = two_bit_color_map<vec_adj_list_vertex_id_map<property<vertex_index_t, int, property<vertex_centrality_t, double> >, long unsigned int> >]’
387 | breadth_first_visit(g, s_begin, s_end, Q, bfs_vis, color);
| ~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dijkstra_shortest_paths.hpp:464:36: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, SourceInputIter, SourceInputIter, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistInf, DistZero, DijkstraVisitor, ColorMap) [with VertexListGraph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >; SourceInputIter = long unsigned int*; DijkstraVisitor = detail::graph::brandes_dijkstra_visitor<const adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >, adj_list_edge_property_map<undirected_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_centrality_t, double> >, edge_weight_t>, iterator_property_map<__gnu_cxx::__normal_iterator<std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<undirected_tag, long unsigned int> > >*, std::vector<std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<undirected_tag, long unsigned int> > >, std::allocator<std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<undirected_tag, long unsigned int> > > > > >, vec_adj_list_vertex_id_map<property<vertex_index_t, int, property<vertex_centrality_t, double> >, long unsigned int>, std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<undirected_tag, long unsigned int> > >, std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<undirected_tag, long unsigned int> > >&>, iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > >, vec_adj_list_vertex_id_map<property<vertex_index_t, int, property<vertex_centrality_t, double> >, long unsigned int>, double, double&>, iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > >, vec_adj_list_vertex_id_map<property<vertex_index_t, int, property<vertex_centrality_t, double> >, long unsigned int>, long unsigned int, long unsigned int&> >; PredecessorMap = dummy_property_map; DistanceMap = iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > >, vec_adj_list_vertex_id_map<property<vertex_index_t, int, property<vertex_centrality_t, double> >, long unsigned int>, double, double&>; WeightMap = adj_list_edge_property_map<undirected_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_centrality_t, double> >, edge_weight_t>; IndexMap = vec_adj_list_vertex_id_map<property<vertex_index_t, int, property<vertex_centrality_t, double> >, long unsigned int>; Compare = std::less<double>; Combine = std::plus<double>; DistInf = double; DistZero = double; ColorMap = two_bit_color_map<vec_adj_list_vertex_id_map<property<vertex_index_t, int, property<vertex_centrality_t, double> >, long unsigned int> >]’
464 | dijkstra_shortest_paths_no_init(g, s_begin, s_end, predecessor, distance,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
465 | weight, index_map, compare, combine, zero, vis, color);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dijkstra_shortest_paths.hpp:417:28: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, SourceInputIter, SourceInputIter, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistInf, DistZero, DijkstraVisitor, const bgl_named_params<T, Tag, Base>&, typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type) [with VertexListGraph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >; SourceInputIter = long unsigned int*; DijkstraVisitor = detail::graph::brandes_dijkstra_visitor<const adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >, adj_list_edge_property_map<undirected_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_centrality_t, double> >, edge_weight_t>, iterator_property_map<__gnu_cxx::__normal_iterator<std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<undirected_tag, long unsigned int> > >*, std::vector<std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<undirected_tag, long unsigned int> > >, std::allocator<std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<undirected_tag, long unsigned int> > > > > >, vec_adj_list_vertex_id_map<property<vertex_index_t, int, property<vertex_centrality_t, double> >, long unsigned int>, std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<undirected_tag, long unsigned int> > >, std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<undirected_tag, long unsigned int> > >&>, iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > >, vec_adj_list_vertex_id_map<property<vertex_index_t, int, property<vertex_centrality_t, double> >, long unsigned int>, double, double&>, iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > >, vec_adj_list_vertex_id_map<property<vertex_index_t, int, property<vertex_centrality_t, double> >, long unsigned int>, long unsigned int, long unsigned int&> >; PredecessorMap = dummy_property_map; DistanceMap = iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > >, vec_adj_list_vertex_id_map<property<vertex_index_t, int, property<vertex_centrality_t, double> >, long unsigned int>, double, double&>; WeightMap = adj_list_edge_property_map<undirected_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_centrality_t, double> >, edge_weight_t>; IndexMap = vec_adj_list_vertex_id_map<property<vertex_index_t, int, property<vertex_centrality_t, double> >, long unsigned int>; Compare = std::less<double>; Combine = std::plus<double>; DistInf = double; DistZero = double; T = char; Tag = detail::unused_tag_type; Base = no_property; typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits<Graph>::traversal_category = undir_adj_list_traversal_tag]’
417 | dijkstra_shortest_paths(g, s_begin, s_end, predecessor, distance, weight,
| ~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
418 | index_map, compare, combine, inf, zero, vis, color);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dijkstra_shortest_paths.hpp:491:28: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, SourceInputIter, SourceInputIter, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistInf, DistZero, DijkstraVisitor) [with VertexListGraph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >; SourceInputIter = long unsigned int*; DijkstraVisitor = detail::graph::brandes_dijkstra_visitor<const adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >, adj_list_edge_property_map<undirected_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_centrality_t, double> >, edge_weight_t>, iterator_property_map<__gnu_cxx::__normal_iterator<std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<undirected_tag, long unsigned int> > >*, std::vector<std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<undirected_tag, long unsigned int> > >, std::allocator<std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<undirected_tag, long unsigned int> > > > > >, vec_adj_list_vertex_id_map<property<vertex_index_t, int, property<vertex_centrality_t, double> >, long unsigned int>, std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<undirected_tag, long unsigned int> > >, std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<undirected_tag, long unsigned int> > >&>, iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > >, vec_adj_list_vertex_id_map<property<vertex_index_t, int, property<vertex_centrality_t, double> >, long unsigned int>, double, double&>, iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > >, vec_adj_list_vertex_id_map<property<vertex_index_t, int, property<vertex_centrality_t, double> >, long unsigned int>, long unsigned int, long unsigned int&> >; PredecessorMap = dummy_property_map; DistanceMap = iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > >, vec_adj_list_vertex_id_map<property<vertex_index_t, int, property<vertex_centrality_t, double> >, long unsigned int>, double, double&>; WeightMap = adj_list_edge_property_map<undirected_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_centrality_t, double> >, edge_weight_t>; IndexMap = vec_adj_list_vertex_id_map<property<vertex_index_t, int, property<vertex_centrality_t, double> >, long unsigned int>; Compare = std::less<double>; Combine = std::plus<double>; DistInf = double; DistZero = double]’
491 | dijkstra_shortest_paths(g, s_begin, s_end, predecessor, distance, weight,
| ~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
492 | index_map, compare, combine, inf, zero, vis, no_named_parameters());
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dijkstra_shortest_paths.hpp:434:28: [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:349:31: required from ‘void boost::detail::graph::brandes_betweenness_centrality_impl(const Graph&, CentralityMap, EdgeCentralityMap, IncomingMap, DistanceMap, DependencyMap, PathCountMap, VertexIndexMap, ShortestPaths) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >; CentralityMap = boost::vec_adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >, boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_centrality_t>; IncomingMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >*, std::vector<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >, std::allocator<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > > > > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>, std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >, std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >&>; DistanceMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>, double, double&>; DependencyMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>, double, double&>; PathCountMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>; ShortestPaths = brandes_dijkstra_shortest_paths<boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_weight_t> >]’
349 | shortest_paths(g, *s, ordered_vertices, incoming, distance,
| ~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
350 | path_count, vertex_index);
| ~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:434:55: required from ‘void boost::brandes_betweenness_centrality(const Graph&, CentralityMap, EdgeCentralityMap, IncomingMap, DistanceMap, DependencyMap, PathCountMap, VertexIndexMap, WeightMap, typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >; CentralityMap = vec_adj_list_vertex_property_map<adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >, adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >*, double, double&, vertex_centrality_t>; EdgeCentralityMap = adj_list_edge_property_map<undirected_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_centrality_t, double> >, edge_centrality_t>; IncomingMap = iterator_property_map<__gnu_cxx::__normal_iterator<std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<undirected_tag, long unsigned int> > >*, std::vector<std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<undirected_tag, long unsigned int> > >, std::allocator<std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<undirected_tag, long unsigned int> > > > > >, vec_adj_list_vertex_id_map<property<vertex_index_t, int, property<vertex_centrality_t, double> >, long unsigned int>, std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<undirected_tag, long unsigned int> > >, std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<undirected_tag, long unsigned int> > >&>; DistanceMap = iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > >, vec_adj_list_vertex_id_map<property<vertex_index_t, int, property<vertex_centrality_t, double> >, long unsigned int>, double, double&>; DependencyMap = iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > >, vec_adj_list_vertex_id_map<property<vertex_index_t, int, property<vertex_centrality_t, double> >, long unsigned int>, double, double&>; PathCountMap = iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > >, vec_adj_list_vertex_id_map<property<vertex_index_t, int, property<vertex_centrality_t, double> >, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = vec_adj_list_vertex_id_map<property<vertex_index_t, int, property<vertex_centrality_t, double> >, long unsigned int>; WeightMap = adj_list_edge_property_map<undirected_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_centrality_t, double> >, edge_weight_t>; typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits<Graph>::traversal_category = undir_adj_list_traversal_tag]’
434 | detail::graph::brandes_betweenness_centrality_impl(g, centrality,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~
435 | edge_centrality_map, incoming, distance, dependency, path_count,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
436 | vertex_index, shortest_paths);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:468:43: required from ‘void boost::detail::graph::brandes_betweenness_centrality_dispatch2(const Graph&, CentralityMap, EdgeCentralityMap, WeightMap, VertexIndexMap) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >; CentralityMap = boost::vec_adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >, boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_centrality_t>; WeightMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_weight_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>]’
468 | brandes_betweenness_centrality(g, centrality, edge_centrality_map,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
469 | make_iterator_property_map(incoming.begin(), vertex_index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
470 | make_iterator_property_map(distance.begin(), vertex_index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
471 | make_iterator_property_map(dependency.begin(), vertex_index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
472 | make_iterator_property_map(path_count.begin(), vertex_index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
473 | vertex_index, weight_map);
| ~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:517:57: required from ‘static void boost::detail::graph::brandes_betweenness_centrality_dispatch1<WeightMap>::run(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap, WeightMap) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >; CentralityMap = boost::vec_adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >, boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>; WeightMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_weight_t>]’
517 | brandes_betweenness_centrality_dispatch2(g, centrality,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~
518 | edge_centrality_map, weight_map, vertex_index);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:558:71: required from ‘void boost::brandes_betweenness_centrality(const Graph&, const bgl_named_params<T, Tag, Base>&, typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >; Param = adj_list_edge_property_map<undirected_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_centrality_t, double> >, edge_weight_t>; Tag = edge_weight_t; Rest = bgl_named_params<adj_list_edge_property_map<undirected_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_centrality_t, double> >, edge_centrality_t>, edge_centrality_t, bgl_named_params<vec_adj_list_vertex_property_map<adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >, adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >*, double, double&, vertex_centrality_t>, vertex_centrality_t, no_property> >; typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits<Graph>::traversal_category = undir_adj_list_traversal_tag]’
558 | detail::graph::brandes_betweenness_centrality_dispatch1< ew >::run(g,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
559 | choose_param(
| ~~~~~~~~~~~~~
560 | get_param(params, vertex_centrality), dummy_property_map()),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
561 | choose_param(get_param(params, edge_centrality), dummy_property_map()),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
562 | choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
563 | get_param(params, edge_weight));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
bbc.cpp:67:33: required from here
67 | brandes_betweenness_centrality(g,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
68 | centrality_map(get(vertex_centrality, g)).
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
69 | edge_centrality_map(get(edge_centrality, g)).
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
70 | weight_map(get(edge_weight, g)));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:65:52: warning: ‘this’ pointer is null [-Wnonnull]
65 | static void failed() { ((Model*)0)->constraints(); }
| ~~~~~~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:205:10: note: in a call to non-static member function ‘void boost::ReadWritePropertyMapConcept<PMap, Key>::constraints() [with PMap = boost::two_bit_color_map<boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int> >; Key = long unsigned int]’
205 | void constraints() {
| ^~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Assignable<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > > >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > > >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > > >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Assignable<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > > >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > > >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > > >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> > >]’
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:145:5: required from ‘struct boost::Assignable<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > > >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > > >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > > >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> >’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > > >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > > >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > > >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> >’
502 | BOOST_concept(InputIterator,(TT))
| ^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::InputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > > >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > > >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > > >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> >]’
32 | inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
| ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied<boost::InputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > > >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > > >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > > >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> > >::value’
44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 11 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:500:43: required from ‘void boost::detail::graph::brandes_betweenness_centrality_dispatch2(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >; CentralityMap = boost::dummy_property_map; EdgeCentralityMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>]’
500 | brandes_betweenness_centrality(g, centrality, edge_centrality_map,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
501 | make_iterator_property_map(incoming.begin(), vertex_index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
502 | make_iterator_property_map(distance.begin(), vertex_index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
503 | make_iterator_property_map(dependency.begin(), vertex_index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
504 | make_iterator_property_map(path_count.begin(), vertex_index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
505 | vertex_index);
| ~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:531:57: required from ‘static void boost::detail::graph::brandes_betweenness_centrality_dispatch1<boost::param_not_found>::run(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap, boost::param_not_found) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >; CentralityMap = boost::dummy_property_map; EdgeCentralityMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>]’
531 | brandes_betweenness_centrality_dispatch2(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
532 | g, centrality, edge_centrality_map, vertex_index);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:558:71: required from ‘void boost::brandes_betweenness_centrality(const Graph&, const bgl_named_params<T, Tag, Base>&, typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >; Param = vec_adj_list_vertex_id_map<property<vertex_index_t, int, property<vertex_centrality_t, double> >, long unsigned int>; Tag = vertex_index_t; Rest = bgl_named_params<adj_list_edge_property_map<undirected_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_centrality_t, double> >, edge_centrality_t>, edge_centrality_t, no_property>; typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits<Graph>::traversal_category = undir_adj_list_traversal_tag]’
558 | detail::graph::brandes_betweenness_centrality_dispatch1< ew >::run(g,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
559 | choose_param(
| ~~~~~~~~~~~~~
560 | get_param(params, vertex_centrality), dummy_property_map()),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
561 | choose_param(get_param(params, edge_centrality), dummy_property_map()),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
562 | choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
563 | get_param(params, edge_weight));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/bc_clustering.hpp:131:39: required from ‘void boost::betweenness_centrality_clustering(MutableGraph&, Done, EdgeCentralityMap, VertexIndexMap) [with MutableGraph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >; Done = clustering_threshold; EdgeCentralityMap = adj_list_edge_property_map<undirected_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_centrality_t, double> >, edge_centrality_t>; VertexIndexMap = vec_adj_list_vertex_id_map<property<vertex_index_t, int, property<vertex_centrality_t, double> >, long unsigned int>]’
131 | brandes_betweenness_centrality(g,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
132 | edge_centrality_map(edge_centrality)
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
133 | .vertex_index_map(vertex_index));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/bc_clustering.hpp:150:38: required from ‘void boost::betweenness_centrality_clustering(MutableGraph&, Done, EdgeCentralityMap) [with MutableGraph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >; Done = clustering_threshold; EdgeCentralityMap = adj_list_edge_property_map<undirected_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_centrality_t, double> >, edge_centrality_t>]’
150 | betweenness_centrality_clustering(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
151 | g, done, edge_centrality, get(vertex_index, g));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
bbc.cpp:149:36: required from here
149 | betweenness_centrality_clustering(g,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
150 | clustering_threshold(threshold, g, normalize),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
151 | get(edge_centrality, g));
| ~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
20 | ~usage_requirements() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Assignable<TT>::~Assignable() [with TT = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > > >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > > >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > > >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int>]’
37 | ~model()
| ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:145:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
145 | BOOST_CONCEPT_USAGE(Assignable) {
| ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::EqualityComparable<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > > >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > > >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > > >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::EqualityComparable<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > > >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > > >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > > >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> > >]’
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > > >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > > >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > > >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> >’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > > >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > > >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > > >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> >’
502 | BOOST_concept(InputIterator,(TT))
| ^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::InputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > > >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > > >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > > >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> >]’
32 | inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
| ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied<boost::InputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > > >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > > >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > > >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> > >::value’
44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 11 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:500:43: required from ‘void boost::detail::graph::brandes_betweenness_centrality_dispatch2(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >; CentralityMap = boost::dummy_property_map; EdgeCentralityMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>]’
500 | brandes_betweenness_centrality(g, centrality, edge_centrality_map,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
501 | make_iterator_property_map(incoming.begin(), vertex_index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
502 | make_iterator_property_map(distance.begin(), vertex_index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
503 | make_iterator_property_map(dependency.begin(), vertex_index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
504 | make_iterator_property_map(path_count.begin(), vertex_index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
505 | vertex_index);
| ~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:531:57: required from ‘static void boost::detail::graph::brandes_betweenness_centrality_dispatch1<boost::param_not_found>::run(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap, boost::param_not_found) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >; CentralityMap = boost::dummy_property_map; EdgeCentralityMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>]’
531 | brandes_betweenness_centrality_dispatch2(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
532 | g, centrality, edge_centrality_map, vertex_index);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:558:71: required from ‘void boost::brandes_betweenness_centrality(const Graph&, const bgl_named_params<T, Tag, Base>&, typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >; Param = vec_adj_list_vertex_id_map<property<vertex_index_t, int, property<vertex_centrality_t, double> >, long unsigned int>; Tag = vertex_index_t; Rest = bgl_named_params<adj_list_edge_property_map<undirected_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_centrality_t, double> >, edge_centrality_t>, edge_centrality_t, no_property>; typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits<Graph>::traversal_category = undir_adj_list_traversal_tag]’
558 | detail::graph::brandes_betweenness_centrality_dispatch1< ew >::run(g,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
559 | choose_param(
| ~~~~~~~~~~~~~
560 | get_param(params, vertex_centrality), dummy_property_map()),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
561 | choose_param(get_param(params, edge_centrality), dummy_property_map()),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
562 | choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
563 | get_param(params, edge_weight));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/bc_clustering.hpp:131:39: required from ‘void boost::betweenness_centrality_clustering(MutableGraph&, Done, EdgeCentralityMap, VertexIndexMap) [with MutableGraph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >; Done = clustering_threshold; EdgeCentralityMap = adj_list_edge_property_map<undirected_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_centrality_t, double> >, edge_centrality_t>; VertexIndexMap = vec_adj_list_vertex_id_map<property<vertex_index_t, int, property<vertex_centrality_t, double> >, long unsigned int>]’
131 | brandes_betweenness_centrality(g,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
132 | edge_centrality_map(edge_centrality)
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
133 | .vertex_index_map(vertex_index));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/bc_clustering.hpp:150:38: required from ‘void boost::betweenness_centrality_clustering(MutableGraph&, Done, EdgeCentralityMap) [with MutableGraph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >; Done = clustering_threshold; EdgeCentralityMap = adj_list_edge_property_map<undirected_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_centrality_t, double> >, edge_centrality_t>]’
150 | betweenness_centrality_clustering(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
151 | g, done, edge_centrality, get(vertex_index, g));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
bbc.cpp:149:36: required from here
149 | betweenness_centrality_clustering(g,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
150 | clustering_threshold(threshold, g, normalize),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
151 | get(edge_centrality, g));
| ~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
20 | ~usage_requirements() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::EqualityComparable<TT>::~EqualityComparable() [with TT = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > > >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > > >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > > >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int>]’
37 | ~model()
| ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:233:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
233 | BOOST_CONCEPT_USAGE(EqualityComparable) {
| ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::InputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > > >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > > >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > > >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::InputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > > >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > > >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > > >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> > >]’
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:512:7: required from ‘struct boost::InputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > > >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > > >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > > >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> >’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::InputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > > >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > > >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > > >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> >]’
32 | inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
| ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied<boost::InputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > > >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > > >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > > >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> > >::value’
44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied<boost::InputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > > >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > > >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > > >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> > >’
45 | typedef boost::integral_constant<bool, value> type;
| ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 10 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:500:43: required from ‘void boost::detail::graph::brandes_betweenness_centrality_dispatch2(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >; CentralityMap = boost::dummy_property_map; EdgeCentralityMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>]’
500 | brandes_betweenness_centrality(g, centrality, edge_centrality_map,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
501 | make_iterator_property_map(incoming.begin(), vertex_index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
502 | make_iterator_property_map(distance.begin(), vertex_index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
503 | make_iterator_property_map(dependency.begin(), vertex_index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
504 | make_iterator_property_map(path_count.begin(), vertex_index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
505 | vertex_index);
| ~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:531:57: required from ‘static void boost::detail::graph::brandes_betweenness_centrality_dispatch1<boost::param_not_found>::run(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap, boost::param_not_found) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >; CentralityMap = boost::dummy_property_map; EdgeCentralityMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>]’
531 | brandes_betweenness_centrality_dispatch2(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
532 | g, centrality, edge_centrality_map, vertex_index);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:558:71: required from ‘void boost::brandes_betweenness_centrality(const Graph&, const bgl_named_params<T, Tag, Base>&, typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >; Param = vec_adj_list_vertex_id_map<property<vertex_index_t, int, property<vertex_centrality_t, double> >, long unsigned int>; Tag = vertex_index_t; Rest = bgl_named_params<adj_list_edge_property_map<undirected_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_centrality_t, double> >, edge_centrality_t>, edge_centrality_t, no_property>; typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits<Graph>::traversal_category = undir_adj_list_traversal_tag]’
558 | detail::graph::brandes_betweenness_centrality_dispatch1< ew >::run(g,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
559 | choose_param(
| ~~~~~~~~~~~~~
560 | get_param(params, vertex_centrality), dummy_property_map()),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
561 | choose_param(get_param(params, edge_centrality), dummy_property_map()),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
562 | choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
563 | get_param(params, edge_weight));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/bc_clustering.hpp:131:39: required from ‘void boost::betweenness_centrality_clustering(MutableGraph&, Done, EdgeCentralityMap, VertexIndexMap) [with MutableGraph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >; Done = clustering_threshold; EdgeCentralityMap = adj_list_edge_property_map<undirected_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_centrality_t, double> >, edge_centrality_t>; VertexIndexMap = vec_adj_list_vertex_id_map<property<vertex_index_t, int, property<vertex_centrality_t, double> >, long unsigned int>]’
131 | brandes_betweenness_centrality(g,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
132 | edge_centrality_map(edge_centrality)
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
133 | .vertex_index_map(vertex_index));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/bc_clustering.hpp:150:38: required from ‘void boost::betweenness_centrality_clustering(MutableGraph&, Done, EdgeCentralityMap) [with MutableGraph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >; Done = clustering_threshold; EdgeCentralityMap = adj_list_edge_property_map<undirected_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_centrality_t, double> >, edge_centrality_t>]’
150 | betweenness_centrality_clustering(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
151 | g, done, edge_centrality, get(vertex_index, g));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
bbc.cpp:149:36: required from here
149 | betweenness_centrality_clustering(g,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
150 | clustering_threshold(threshold, g, normalize),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
151 | get(edge_centrality, g));
| ~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
20 | ~usage_requirements() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::InputIterator<TT>::~InputIterator() [with TT = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > > >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > > >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > > >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int>]’
37 | ~model()
| ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:512:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
512 | BOOST_CONCEPT_USAGE(InputIterator)
| ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::CopyConstructible<boost::detail::dijkstra_bfs_visitor<boost::detail::graph::brandes_dijkstra_visitor<const boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >, boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_weight_t>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >*, std::vector<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >, std::allocator<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > > > > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>, std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >, std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>, double, double&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>, long unsigned int, long unsigned int&> >, boost::d_ary_heap_indirect<long unsigned int, 4, boost::iterator_property_map<long unsigned int*, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>, double, double&>, std::less<double>, std::vector<long unsigned int, std::allocator<long unsigned int> > >, boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_weight_t>, boost::dummy_property_map, boost::iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>, double, double&>, std::plus<double>, std::less<double> > > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:167:5: required from ‘struct boost::CopyConstructible<boost::detail::dijkstra_bfs_visitor<boost::detail::graph::brandes_dijkstra_visitor<const boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >, boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_weight_t>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >*, std::vector<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >, std::allocator<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > > > > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>, std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >, std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>, double, double&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>, long unsigned int, long unsigned int&> >, boost::d_ary_heap_indirect<long unsigned int, 4, boost::iterator_property_map<long unsigned int*, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>, double, double&>, std::less<double>, std::vector<long unsigned int, std::allocator<long unsigned int> > >, boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_weight_t>, boost::dummy_property_map, boost::iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>, double, double&>, std::plus<double>, std::less<double> > >’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:165:3: required from ‘struct boost::CopyConstructibleConcept<boost::detail::dijkstra_bfs_visitor<boost::detail::graph::brandes_dijkstra_visitor<const boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >, boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_weight_t>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >*, std::vector<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >, std::allocator<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > > > > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>, std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >, std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>, double, double&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>, long unsigned int, long unsigned int&> >, boost::d_ary_heap_indirect<long unsigned int, 4, boost::iterator_property_map<long unsigned int*, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>, double, double&>, std::less<double>, std::vector<long unsigned int, std::allocator<long unsigned int> > >, boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_weight_t>, boost::dummy_property_map, boost::iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>, double, double&>, std::plus<double>, std::less<double> > >’
165 | BOOST_concept(CopyConstructible,(TT))
| ^~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::CopyConstructibleConcept<boost::detail::dijkstra_bfs_visitor<boost::detail::graph::brandes_dijkstra_visitor<const boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >, boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_weight_t>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >*, std::vector<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >, std::allocator<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > > > > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>, std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >, std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>, double, double&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>, long unsigned int, long unsigned int&> >, boost::d_ary_heap_indirect<long unsigned int, 4, boost::iterator_property_map<long unsigned int*, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>, double, double&>, std::less<double>, std::vector<long unsigned int, std::allocator<long unsigned int> > >, boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_weight_t>, boost::dummy_property_map, boost::iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>, double, double&>, std::plus<double>, std::less<double> > >]’
32 | inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
| ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied<boost::CopyConstructibleConcept<boost::detail::dijkstra_bfs_visitor<boost::detail::graph::brandes_dijkstra_visitor<const boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >, boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_weight_t>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >*, std::vector<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >, std::allocator<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > > > > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>, std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >, std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>, double, double&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>, long unsigned int, long unsigned int&> >, boost::d_ary_heap_indirect<long unsigned int, 4, boost::iterator_property_map<long unsigned int*, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>, double, double&>, std::less<double>, std::vector<long unsigned int, std::allocator<long unsigned int> > >, boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_weight_t>, boost::dummy_property_map, boost::iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>, double, double&>, std::plus<double>, std::less<double> > > >::value’
44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied<boost::CopyConstructibleConcept<boost::detail::dijkstra_bfs_visitor<boost::detail::graph::brandes_dijkstra_visitor<const boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >, boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_weight_t>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >*, std::vector<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >, std::allocator<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > > > > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>, std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >, std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>, double, double&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>, long unsigned int, long unsigned int&> >, boost::d_ary_heap_indirect<long unsigned int, 4, boost::iterator_property_map<long unsigned int*, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>, double, double&>, std::less<double>, std::vector<long unsigned int, std::allocator<long unsigned int> > >, boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_weight_t>, boost::dummy_property_map, boost::iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>, double, double&>, std::plus<double>, std::less<double> > > >’
45 | typedef boost::integral_constant<bool, value> type;
| ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 16 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:349:31: required from ‘void boost::detail::graph::brandes_betweenness_centrality_impl(const Graph&, CentralityMap, EdgeCentralityMap, IncomingMap, DistanceMap, DependencyMap, PathCountMap, VertexIndexMap, ShortestPaths) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >; CentralityMap = boost::vec_adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >, boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_centrality_t>; IncomingMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >*, std::vector<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >, std::allocator<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > > > > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>, std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >, std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >&>; DistanceMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>, double, double&>; DependencyMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>, double, double&>; PathCountMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>; ShortestPaths = brandes_dijkstra_shortest_paths<boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_weight_t> >]’
349 | shortest_paths(g, *s, ordered_vertices, incoming, distance,
| ~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
350 | path_count, vertex_index);
| ~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:434:55: required from ‘void boost::brandes_betweenness_centrality(const Graph&, CentralityMap, EdgeCentralityMap, IncomingMap, DistanceMap, DependencyMap, PathCountMap, VertexIndexMap, WeightMap, typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >; CentralityMap = vec_adj_list_vertex_property_map<adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >, adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >*, double, double&, vertex_centrality_t>; EdgeCentralityMap = adj_list_edge_property_map<undirected_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_centrality_t, double> >, edge_centrality_t>; IncomingMap = iterator_property_map<__gnu_cxx::__normal_iterator<std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<undirected_tag, long unsigned int> > >*, std::vector<std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<undirected_tag, long unsigned int> > >, std::allocator<std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<undirected_tag, long unsigned int> > > > > >, vec_adj_list_vertex_id_map<property<vertex_index_t, int, property<vertex_centrality_t, double> >, long unsigned int>, std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<undirected_tag, long unsigned int> > >, std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<undirected_tag, long unsigned int> > >&>; DistanceMap = iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > >, vec_adj_list_vertex_id_map<property<vertex_index_t, int, property<vertex_centrality_t, double> >, long unsigned int>, double, double&>; DependencyMap = iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > >, vec_adj_list_vertex_id_map<property<vertex_index_t, int, property<vertex_centrality_t, double> >, long unsigned int>, double, double&>; PathCountMap = iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > >, vec_adj_list_vertex_id_map<property<vertex_index_t, int, property<vertex_centrality_t, double> >, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = vec_adj_list_vertex_id_map<property<vertex_index_t, int, property<vertex_centrality_t, double> >, long unsigned int>; WeightMap = adj_list_edge_property_map<undirected_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_centrality_t, double> >, edge_weight_t>; typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits<Graph>::traversal_category = undir_adj_list_traversal_tag]’
434 | detail::graph::brandes_betweenness_centrality_impl(g, centrality,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~
435 | edge_centrality_map, incoming, distance, dependency, path_count,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
436 | vertex_index, shortest_paths);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:468:43: required from ‘void boost::detail::graph::brandes_betweenness_centrality_dispatch2(const Graph&, CentralityMap, EdgeCentralityMap, WeightMap, VertexIndexMap) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >; CentralityMap = boost::vec_adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >, boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_centrality_t>; WeightMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_weight_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>]’
468 | brandes_betweenness_centrality(g, centrality, edge_centrality_map,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
469 | make_iterator_property_map(incoming.begin(), vertex_index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
470 | make_iterator_property_map(distance.begin(), vertex_index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
471 | make_iterator_property_map(dependency.begin(), vertex_index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
472 | make_iterator_property_map(path_count.begin(), vertex_index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
473 | vertex_index, weight_map);
| ~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:517:57: required from ‘static void boost::detail::graph::brandes_betweenness_centrality_dispatch1<WeightMap>::run(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap, WeightMap) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >; CentralityMap = boost::vec_adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >, boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>; WeightMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_weight_t>]’
517 | brandes_betweenness_centrality_dispatch2(g, centrality,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~
518 | edge_centrality_map, weight_map, vertex_index);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:558:71: required from ‘void boost::brandes_betweenness_centrality(const Graph&, const bgl_named_params<T, Tag, Base>&, typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >; Param = adj_list_edge_property_map<undirected_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_centrality_t, double> >, edge_weight_t>; Tag = edge_weight_t; Rest = bgl_named_params<adj_list_edge_property_map<undirected_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_centrality_t, double> >, edge_centrality_t>, edge_centrality_t, bgl_named_params<vec_adj_list_vertex_property_map<adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >, adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >*, double, double&, vertex_centrality_t>, vertex_centrality_t, no_property> >; typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits<Graph>::traversal_category = undir_adj_list_traversal_tag]’
558 | detail::graph::brandes_betweenness_centrality_dispatch1< ew >::run(g,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
559 | choose_param(
| ~~~~~~~~~~~~~
560 | get_param(params, vertex_centrality), dummy_property_map()),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
561 | choose_param(get_param(params, edge_centrality), dummy_property_map()),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
562 | choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
563 | get_param(params, edge_weight));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
bbc.cpp:67:33: required from here
67 | brandes_betweenness_centrality(g,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
68 | centrality_map(get(vertex_centrality, g)).
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
69 | edge_centrality_map(get(edge_centrality, g)).
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
70 | weight_map(get(edge_weight, g)));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::CopyConstructible<boost::detail::dijkstra_bfs_visitor<boost::detail::graph::brandes_dijkstra_visitor<const boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >, boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_weight_t>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >*, std::vector<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >, std::allocator<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > > > > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>, std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >, std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>, double, double&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>, long unsigned int, long unsigned int&> >, boost::d_ary_heap_indirect<long unsigned int, 4, boost::iterator_property_map<long unsigned int*, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>, double, double&>, std::less<double>, std::vector<long unsigned int, std::allocator<long unsigned int> > >, boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_weight_t>, boost::dummy_property_map, boost::iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>, double, double&>, std::plus<double>, std::less<double> > >]’
20 | ~usage_requirements() { ((Model*)0)->~Model(); }
| ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::CopyConstructibleConcept<boost::detail::dijkstra_bfs_visitor<boost::detail::graph::brandes_dijkstra_visitor<const boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >, boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_weight_t>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >*, std::vector<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >, std::allocator<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > > > > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>, std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >, std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>, double, double&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>, long unsigned int, long unsigned int&> >, boost::d_ary_heap_indirect<long unsigned int, 4, boost::iterator_property_map<long unsigned int*, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>, double, double&>, std::less<double>, std::vector<long unsigned int, std::allocator<long unsigned int> > >, boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_weight_t>, boost::dummy_property_map, boost::iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>, double, double&>, std::plus<double>, std::less<double> > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:41:9: required from ‘void boost::BFSVisitorConcept<Visitor, Graph>::constraints() [with Visitor = boost::detail::dijkstra_bfs_visitor<boost::detail::graph::brandes_dijkstra_visitor<const boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >, boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_weight_t>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >*, std::vector<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >, std::allocator<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > > > > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>, std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >, std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>, double, double&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>, long unsigned int, long unsigned int&> >, boost::d_ary_heap_indirect<long unsigned int, 4, boost::iterator_property_map<long unsigned int*, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>, double, double&>, std::less<double>, std::vector<long unsigned int, std::allocator<long unsigned int> > >, boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_weight_t>, boost::dummy_property_map, boost::iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>, double, double&>, std::plus<double>, std::less<double> >; Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::BFSVisitorConcept<boost::detail::dijkstra_bfs_visitor<boost::detail::graph::brandes_dijkstra_visitor<const boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >, boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_weight_t>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >*, std::vector<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >, std::allocator<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > > > > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>, std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >, std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>, double, double&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>, long unsigned int, long unsigned int&> >, boost::d_ary_heap_indirect<long unsigned int, 4, boost::iterator_property_map<long unsigned int*, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>, double, double&>, std::less<double>, std::vector<long unsigned int, std::allocator<long unsigned int> > >, boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_weight_t>, boost::dummy_property_map, boost::iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>, double, double&>, std::plus<double>, std::less<double> >, boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > > >]’
32 | inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
| ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied<boost::BFSVisitorConcept<boost::detail::dijkstra_bfs_visitor<boost::detail::graph::brandes_dijkstra_visitor<const boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >, boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_weight_t>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >*, std::vector<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >, std::allocator<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > > > > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>, std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >, std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>, double, double&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>, long unsigned int, long unsigned int&> >, boost::d_ary_heap_indirect<long unsigned int, 4, boost::iterator_property_map<long unsigned int*, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>, double, double&>, std::less<double>, std::vector<long unsigned int, std::allocator<long unsigned int> > >, boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_weight_t>, boost::dummy_property_map, boost::iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>, double, double&>, std::plus<double>, std::less<double> >, boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > > > >::value’
44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied<boost::BFSVisitorConcept<boost::detail::dijkstra_bfs_visitor<boost::detail::graph::brandes_dijkstra_visitor<const boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >, boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_weight_t>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >*, std::vector<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >, std::allocator<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > > > > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>, std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >, std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>, double, double&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>, long unsigned int, long unsigned int&> >, boost::d_ary_heap_indirect<long unsigned int, 4, boost::iterator_property_map<long unsigned int*, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>, double, double&>, std::less<double>, std::vector<long unsigned int, std::allocator<long unsigned int> > >, boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_weight_t>, boost::dummy_property_map, boost::iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>, double, double&>, std::plus<double>, std::less<double> >, boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > > > >’
45 | typedef boost::integral_constant<bool, value> type;
| ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_<void (*)(boost::BFSVisitorConcept<boost::detail::dijkstra_bfs_visitor<boost::detail::graph::brandes_dijkstra_visitor<const boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >, boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_weight_t>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >*, std::vector<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >, std::allocator<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > > > > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>, std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >, std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>, double, double&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>, long unsigned int, long unsigned int&> >, boost::d_ary_heap_indirect<long unsigned int, 4, boost::iterator_property_map<long unsigned int*, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>, double, double&>, std::less<double>, std::vector<long unsigned int, std::allocator<long unsigned int> > >, boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_weight_t>, boost::dummy_property_map, boost::iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>, double, double&>, std::plus<double>, std::less<double> >, boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > > >)>’
72 | struct requirement_<void(*)(Model)>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:65:5: [ skipping 10 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:349:31: required from ‘void boost::detail::graph::brandes_betweenness_centrality_impl(const Graph&, CentralityMap, EdgeCentralityMap, IncomingMap, DistanceMap, DependencyMap, PathCountMap, VertexIndexMap, ShortestPaths) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >; CentralityMap = boost::vec_adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >, boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_centrality_t>; IncomingMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >*, std::vector<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >, std::allocator<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > > > > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>, std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >, std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >&>; DistanceMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>, double, double&>; DependencyMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>, double, double&>; PathCountMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>; ShortestPaths = brandes_dijkstra_shortest_paths<boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_weight_t> >]’
349 | shortest_paths(g, *s, ordered_vertices, incoming, distance,
| ~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
350 | path_count, vertex_index);
| ~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:434:55: required from ‘void boost::brandes_betweenness_centrality(const Graph&, CentralityMap, EdgeCentralityMap, IncomingMap, DistanceMap, DependencyMap, PathCountMap, VertexIndexMap, WeightMap, typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >; CentralityMap = vec_adj_list_vertex_property_map<adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >, adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >*, double, double&, vertex_centrality_t>; EdgeCentralityMap = adj_list_edge_property_map<undirected_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_centrality_t, double> >, edge_centrality_t>; IncomingMap = iterator_property_map<__gnu_cxx::__normal_iterator<std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<undirected_tag, long unsigned int> > >*, std::vector<std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<undirected_tag, long unsigned int> > >, std::allocator<std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<undirected_tag, long unsigned int> > > > > >, vec_adj_list_vertex_id_map<property<vertex_index_t, int, property<vertex_centrality_t, double> >, long unsigned int>, std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<undirected_tag, long unsigned int> > >, std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<undirected_tag, long unsigned int> > >&>; DistanceMap = iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > >, vec_adj_list_vertex_id_map<property<vertex_index_t, int, property<vertex_centrality_t, double> >, long unsigned int>, double, double&>; DependencyMap = iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > >, vec_adj_list_vertex_id_map<property<vertex_index_t, int, property<vertex_centrality_t, double> >, long unsigned int>, double, double&>; PathCountMap = iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > >, vec_adj_list_vertex_id_map<property<vertex_index_t, int, property<vertex_centrality_t, double> >, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = vec_adj_list_vertex_id_map<property<vertex_index_t, int, property<vertex_centrality_t, double> >, long unsigned int>; WeightMap = adj_list_edge_property_map<undirected_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_centrality_t, double> >, edge_weight_t>; typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits<Graph>::traversal_category = undir_adj_list_traversal_tag]’
434 | detail::graph::brandes_betweenness_centrality_impl(g, centrality,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~
435 | edge_centrality_map, incoming, distance, dependency, path_count,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
436 | vertex_index, shortest_paths);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:468:43: required from ‘void boost::detail::graph::brandes_betweenness_centrality_dispatch2(const Graph&, CentralityMap, EdgeCentralityMap, WeightMap, VertexIndexMap) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >; CentralityMap = boost::vec_adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >, boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_centrality_t>; WeightMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_weight_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>]’
468 | brandes_betweenness_centrality(g, centrality, edge_centrality_map,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
469 | make_iterator_property_map(incoming.begin(), vertex_index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
470 | make_iterator_property_map(distance.begin(), vertex_index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
471 | make_iterator_property_map(dependency.begin(), vertex_index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
472 | make_iterator_property_map(path_count.begin(), vertex_index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
473 | vertex_index, weight_map);
| ~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:517:57: required from ‘static void boost::detail::graph::brandes_betweenness_centrality_dispatch1<WeightMap>::run(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap, WeightMap) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >; CentralityMap = boost::vec_adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >, boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>; WeightMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_weight_t>]’
517 | brandes_betweenness_centrality_dispatch2(g, centrality,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~
518 | edge_centrality_map, weight_map, vertex_index);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:558:71: required from ‘void boost::brandes_betweenness_centrality(const Graph&, const bgl_named_params<T, Tag, Base>&, typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >; Param = adj_list_edge_property_map<undirected_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_centrality_t, double> >, edge_weight_t>; Tag = edge_weight_t; Rest = bgl_named_params<adj_list_edge_property_map<undirected_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_centrality_t, double> >, edge_centrality_t>, edge_centrality_t, bgl_named_params<vec_adj_list_vertex_property_map<adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >, adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >*, double, double&, vertex_centrality_t>, vertex_centrality_t, no_property> >; typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits<Graph>::traversal_category = undir_adj_list_traversal_tag]’
558 | detail::graph::brandes_betweenness_centrality_dispatch1< ew >::run(g,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
559 | choose_param(
| ~~~~~~~~~~~~~
560 | get_param(params, vertex_centrality), dummy_property_map()),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
561 | choose_param(get_param(params, edge_centrality), dummy_property_map()),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
562 | choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
563 | get_param(params, edge_weight));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
bbc.cpp:67:33: required from here
67 | brandes_betweenness_centrality(g,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
68 | centrality_map(get(vertex_centrality, g)).
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
69 | edge_centrality_map(get(edge_centrality, g)).
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
70 | weight_map(get(edge_weight, g)));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:165:17: note: in a call to non-static member function ‘boost::CopyConstructibleConcept<boost::detail::dijkstra_bfs_visitor<boost::detail::graph::brandes_dijkstra_visitor<const boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >, boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_weight_t>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >*, std::vector<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >, std::allocator<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > > > > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>, std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >, std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>, double, double&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>, long unsigned int, long unsigned int&> >, boost::d_ary_heap_indirect<long unsigned int, 4, boost::iterator_property_map<long unsigned int*, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>, double, double&>, std::less<double>, std::vector<long unsigned int, std::allocator<long unsigned int> > >, boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_weight_t>, boost::dummy_property_map, boost::iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>, double, double&>, std::plus<double>, std::less<double> > >::~CopyConstructibleConcept()’
165 | BOOST_concept(CopyConstructible,(TT))
| ^~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/preprocessor/cat.hpp:29:34: note: in definition of macro ‘BOOST_PP_CAT_I’
29 | # define BOOST_PP_CAT_I(a, b) a ## b
| ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/concept_def.hpp:23:12: note: in expansion of macro ‘BOOST_PP_CAT’
23 | struct BOOST_PP_CAT(name,Concept) \
| ^~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:165:3: note: in expansion of macro ‘BOOST_concept’
165 | BOOST_concept(CopyConstructible,(TT))
| ^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::constraint<Model>::failed() [with Model = boost::ReadablePropertyMapConcept<boost::two_bit_color_map<boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int> >, long unsigned int>]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:206:7: required from ‘void boost::ReadWritePropertyMapConcept<PMap, Key>::constraints() [with PMap = boost::two_bit_color_map<boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int> >; Key = long unsigned int]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::ReadWritePropertyMapConcept<boost::two_bit_color_map<boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int> >, long unsigned int>]’
32 | inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
| ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied<boost::ReadWritePropertyMapConcept<boost::two_bit_color_map<boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int> >, long unsigned int> >::value’
44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied<boost::ReadWritePropertyMapConcept<boost::two_bit_color_map<boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int> >, long unsigned int> >’
45 | typedef boost::integral_constant<bool, value> type;
| ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_<void (*)(boost::ReadWritePropertyMapConcept<boost::two_bit_color_map<boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int> >, long unsigned int>)>’
72 | struct requirement_<void(*)(Model)>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:66:5: [ skipping 10 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:349:31: required from ‘void boost::detail::graph::brandes_betweenness_centrality_impl(const Graph&, CentralityMap, EdgeCentralityMap, IncomingMap, DistanceMap, DependencyMap, PathCountMap, VertexIndexMap, ShortestPaths) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >; CentralityMap = boost::vec_adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >, boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_centrality_t>; IncomingMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >*, std::vector<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >, std::allocator<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > > > > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>, std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >, std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >&>; DistanceMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>, double, double&>; DependencyMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>, double, double&>; PathCountMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>; ShortestPaths = brandes_dijkstra_shortest_paths<boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_weight_t> >]’
349 | shortest_paths(g, *s, ordered_vertices, incoming, distance,
| ~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
350 | path_count, vertex_index);
| ~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:434:55: required from ‘void boost::brandes_betweenness_centrality(const Graph&, CentralityMap, EdgeCentralityMap, IncomingMap, DistanceMap, DependencyMap, PathCountMap, VertexIndexMap, WeightMap, typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >; CentralityMap = vec_adj_list_vertex_property_map<adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >, adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >*, double, double&, vertex_centrality_t>; EdgeCentralityMap = adj_list_edge_property_map<undirected_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_centrality_t, double> >, edge_centrality_t>; IncomingMap = iterator_property_map<__gnu_cxx::__normal_iterator<std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<undirected_tag, long unsigned int> > >*, std::vector<std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<undirected_tag, long unsigned int> > >, std::allocator<std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<undirected_tag, long unsigned int> > > > > >, vec_adj_list_vertex_id_map<property<vertex_index_t, int, property<vertex_centrality_t, double> >, long unsigned int>, std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<undirected_tag, long unsigned int> > >, std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<undirected_tag, long unsigned int> > >&>; DistanceMap = iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > >, vec_adj_list_vertex_id_map<property<vertex_index_t, int, property<vertex_centrality_t, double> >, long unsigned int>, double, double&>; DependencyMap = iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > >, vec_adj_list_vertex_id_map<property<vertex_index_t, int, property<vertex_centrality_t, double> >, long unsigned int>, double, double&>; PathCountMap = iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > >, vec_adj_list_vertex_id_map<property<vertex_index_t, int, property<vertex_centrality_t, double> >, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = vec_adj_list_vertex_id_map<property<vertex_index_t, int, property<vertex_centrality_t, double> >, long unsigned int>; WeightMap = adj_list_edge_property_map<undirected_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_centrality_t, double> >, edge_weight_t>; typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits<Graph>::traversal_category = undir_adj_list_traversal_tag]’
434 | detail::graph::brandes_betweenness_centrality_impl(g, centrality,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~
435 | edge_centrality_map, incoming, distance, dependency, path_count,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
436 | vertex_index, shortest_paths);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:468:43: required from ‘void boost::detail::graph::brandes_betweenness_centrality_dispatch2(const Graph&, CentralityMap, EdgeCentralityMap, WeightMap, VertexIndexMap) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >; CentralityMap = boost::vec_adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >, boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_centrality_t>; WeightMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_weight_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>]’
468 | brandes_betweenness_centrality(g, centrality, edge_centrality_map,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
469 | make_iterator_property_map(incoming.begin(), vertex_index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
470 | make_iterator_property_map(distance.begin(), vertex_index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
471 | make_iterator_property_map(dependency.begin(), vertex_index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
472 | make_iterator_property_map(path_count.begin(), vertex_index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
473 | vertex_index, weight_map);
| ~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:517:57: required from ‘static void boost::detail::graph::brandes_betweenness_centrality_dispatch1<WeightMap>::run(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap, WeightMap) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >; CentralityMap = boost::vec_adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >, boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>; WeightMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_weight_t>]’
517 | brandes_betweenness_centrality_dispatch2(g, centrality,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~
518 | edge_centrality_map, weight_map, vertex_index);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:558:71: required from ‘void boost::brandes_betweenness_centrality(const Graph&, const bgl_named_params<T, Tag, Base>&, typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >; Param = adj_list_edge_property_map<undirected_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_centrality_t, double> >, edge_weight_t>; Tag = edge_weight_t; Rest = bgl_named_params<adj_list_edge_property_map<undirected_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_centrality_t, double> >, edge_centrality_t>, edge_centrality_t, bgl_named_params<vec_adj_list_vertex_property_map<adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >, adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >*, double, double&, vertex_centrality_t>, vertex_centrality_t, no_property> >; typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits<Graph>::traversal_category = undir_adj_list_traversal_tag]’
558 | detail::graph::brandes_betweenness_centrality_dispatch1< ew >::run(g,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
559 | choose_param(
| ~~~~~~~~~~~~~
560 | get_param(params, vertex_centrality), dummy_property_map()),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
561 | choose_param(get_param(params, edge_centrality), dummy_property_map()),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
562 | choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
563 | get_param(params, edge_weight));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
bbc.cpp:67:33: required from here
67 | brandes_betweenness_centrality(g,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
68 | centrality_map(get(vertex_centrality, g)).
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
69 | edge_centrality_map(get(edge_centrality, g)).
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
70 | weight_map(get(edge_weight, g)));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:65:52: warning: ‘this’ pointer is null [-Wnonnull]
65 | static void failed() { ((Model*)0)->constraints(); }
| ~~~~~~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:147:10: note: in a call to non-static member function ‘void boost::ReadablePropertyMapConcept<PMap, Key>::constraints() [with PMap = boost::two_bit_color_map<boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int> >; Key = long unsigned int]’
147 | void constraints() {
| ^~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::constraint<Model>::failed() [with Model = boost::WritablePropertyMapConcept<boost::two_bit_color_map<boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int> >, long unsigned int>]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:207:7: required from ‘void boost::ReadWritePropertyMapConcept<PMap, Key>::constraints() [with PMap = boost::two_bit_color_map<boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int> >; Key = long unsigned int]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::ReadWritePropertyMapConcept<boost::two_bit_color_map<boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int> >, long unsigned int>]’
32 | inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
| ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied<boost::ReadWritePropertyMapConcept<boost::two_bit_color_map<boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int> >, long unsigned int> >::value’
44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied<boost::ReadWritePropertyMapConcept<boost::two_bit_color_map<boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int> >, long unsigned int> >’
45 | typedef boost::integral_constant<bool, value> type;
| ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_<void (*)(boost::ReadWritePropertyMapConcept<boost::two_bit_color_map<boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int> >, long unsigned int>)>’
72 | struct requirement_<void(*)(Model)>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:66:5: [ skipping 10 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:349:31: required from ‘void boost::detail::graph::brandes_betweenness_centrality_impl(const Graph&, CentralityMap, EdgeCentralityMap, IncomingMap, DistanceMap, DependencyMap, PathCountMap, VertexIndexMap, ShortestPaths) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >; CentralityMap = boost::vec_adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >, boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_centrality_t>; IncomingMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >*, std::vector<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >, std::allocator<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > > > > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>, std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >, std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >&>; DistanceMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>, double, double&>; DependencyMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>, double, double&>; PathCountMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>; ShortestPaths = brandes_dijkstra_shortest_paths<boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_weight_t> >]’
349 | shortest_paths(g, *s, ordered_vertices, incoming, distance,
| ~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
350 | path_count, vertex_index);
| ~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:434:55: required from ‘void boost::brandes_betweenness_centrality(const Graph&, CentralityMap, EdgeCentralityMap, IncomingMap, DistanceMap, DependencyMap, PathCountMap, VertexIndexMap, WeightMap, typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >; CentralityMap = vec_adj_list_vertex_property_map<adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >, adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >*, double, double&, vertex_centrality_t>; EdgeCentralityMap = adj_list_edge_property_map<undirected_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_centrality_t, double> >, edge_centrality_t>; IncomingMap = iterator_property_map<__gnu_cxx::__normal_iterator<std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<undirected_tag, long unsigned int> > >*, std::vector<std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<undirected_tag, long unsigned int> > >, std::allocator<std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<undirected_tag, long unsigned int> > > > > >, vec_adj_list_vertex_id_map<property<vertex_index_t, int, property<vertex_centrality_t, double> >, long unsigned int>, std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<undirected_tag, long unsigned int> > >, std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<undirected_tag, long unsigned int> > >&>; DistanceMap = iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > >, vec_adj_list_vertex_id_map<property<vertex_index_t, int, property<vertex_centrality_t, double> >, long unsigned int>, double, double&>; DependencyMap = iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > >, vec_adj_list_vertex_id_map<property<vertex_index_t, int, property<vertex_centrality_t, double> >, long unsigned int>, double, double&>; PathCountMap = iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > >, vec_adj_list_vertex_id_map<property<vertex_index_t, int, property<vertex_centrality_t, double> >, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = vec_adj_list_vertex_id_map<property<vertex_index_t, int, property<vertex_centrality_t, double> >, long unsigned int>; WeightMap = adj_list_edge_property_map<undirected_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_centrality_t, double> >, edge_weight_t>; typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits<Graph>::traversal_category = undir_adj_list_traversal_tag]’
434 | detail::graph::brandes_betweenness_centrality_impl(g, centrality,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~
435 | edge_centrality_map, incoming, distance, dependency, path_count,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
436 | vertex_index, shortest_paths);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:468:43: required from ‘void boost::detail::graph::brandes_betweenness_centrality_dispatch2(const Graph&, CentralityMap, EdgeCentralityMap, WeightMap, VertexIndexMap) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >; CentralityMap = boost::vec_adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >, boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_centrality_t>; WeightMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_weight_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>]’
468 | brandes_betweenness_centrality(g, centrality, edge_centrality_map,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
469 | make_iterator_property_map(incoming.begin(), vertex_index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
470 | make_iterator_property_map(distance.begin(), vertex_index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
471 | make_iterator_property_map(dependency.begin(), vertex_index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
472 | make_iterator_property_map(path_count.begin(), vertex_index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
473 | vertex_index, weight_map);
| ~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:517:57: required from ‘static void boost::detail::graph::brandes_betweenness_centrality_dispatch1<WeightMap>::run(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap, WeightMap) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >; CentralityMap = boost::vec_adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >, boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>; WeightMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_weight_t>]’
517 | brandes_betweenness_centrality_dispatch2(g, centrality,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~
518 | edge_centrality_map, weight_map, vertex_index);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:558:71: required from ‘void boost::brandes_betweenness_centrality(const Graph&, const bgl_named_params<T, Tag, Base>&, typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >; Param = adj_list_edge_property_map<undirected_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_centrality_t, double> >, edge_weight_t>; Tag = edge_weight_t; Rest = bgl_named_params<adj_list_edge_property_map<undirected_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_centrality_t, double> >, edge_centrality_t>, edge_centrality_t, bgl_named_params<vec_adj_list_vertex_property_map<adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >, adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >*, double, double&, vertex_centrality_t>, vertex_centrality_t, no_property> >; typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits<Graph>::traversal_category = undir_adj_list_traversal_tag]’
558 | detail::graph::brandes_betweenness_centrality_dispatch1< ew >::run(g,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
559 | choose_param(
| ~~~~~~~~~~~~~
560 | get_param(params, vertex_centrality), dummy_property_map()),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
561 | choose_param(get_param(params, edge_centrality), dummy_property_map()),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
562 | choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
563 | get_param(params, edge_weight));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
bbc.cpp:67:33: required from here
67 | brandes_betweenness_centrality(g,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
68 | centrality_map(get(vertex_centrality, g)).
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
69 | edge_centrality_map(get(edge_centrality, g)).
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
70 | weight_map(get(edge_weight, g)));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:65:52: warning: ‘this’ pointer is null [-Wnonnull]
65 | static void failed() { ((Model*)0)->constraints(); }
| ~~~~~~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:179:10: note: in a call to non-static member function ‘void boost::WritablePropertyMapConcept<PMap, Key>::constraints() [with PMap = boost::two_bit_color_map<boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int> >; Key = long unsigned int]’
179 | void constraints() {
| ^~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Convertible<boost::read_write_property_map_tag, boost::read_write_property_map_tag> >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible<boost::read_write_property_map_tag, boost::read_write_property_map_tag>’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:206:3: required from ‘struct boost::ConvertibleConcept<boost::read_write_property_map_tag, boost::read_write_property_map_tag>’
206 | BOOST_concept(Convertible,(X)(Y))
| ^~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::ConvertibleConcept<boost::read_write_property_map_tag, boost::read_write_property_map_tag>]’
32 | inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
| ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied<boost::ConvertibleConcept<boost::read_write_property_map_tag, boost::read_write_property_map_tag> >::value’
44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied<boost::ConvertibleConcept<boost::read_write_property_map_tag, boost::read_write_property_map_tag> >’
45 | typedef boost::integral_constant<bool, value> type;
| ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 16 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:349:31: required from ‘void boost::detail::graph::brandes_betweenness_centrality_impl(const Graph&, CentralityMap, EdgeCentralityMap, IncomingMap, DistanceMap, DependencyMap, PathCountMap, VertexIndexMap, ShortestPaths) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >; CentralityMap = boost::vec_adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >, boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_centrality_t>; IncomingMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >*, std::vector<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >, std::allocator<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > > > > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>, std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >, std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >&>; DistanceMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>, double, double&>; DependencyMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>, double, double&>; PathCountMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>; ShortestPaths = brandes_dijkstra_shortest_paths<boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_weight_t> >]’
349 | shortest_paths(g, *s, ordered_vertices, incoming, distance,
| ~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
350 | path_count, vertex_index);
| ~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:434:55: required from ‘void boost::brandes_betweenness_centrality(const Graph&, CentralityMap, EdgeCentralityMap, IncomingMap, DistanceMap, DependencyMap, PathCountMap, VertexIndexMap, WeightMap, typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >; CentralityMap = vec_adj_list_vertex_property_map<adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >, adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >*, double, double&, vertex_centrality_t>; EdgeCentralityMap = adj_list_edge_property_map<undirected_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_centrality_t, double> >, edge_centrality_t>; IncomingMap = iterator_property_map<__gnu_cxx::__normal_iterator<std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<undirected_tag, long unsigned int> > >*, std::vector<std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<undirected_tag, long unsigned int> > >, std::allocator<std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<undirected_tag, long unsigned int> > > > > >, vec_adj_list_vertex_id_map<property<vertex_index_t, int, property<vertex_centrality_t, double> >, long unsigned int>, std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<undirected_tag, long unsigned int> > >, std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<undirected_tag, long unsigned int> > >&>; DistanceMap = iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > >, vec_adj_list_vertex_id_map<property<vertex_index_t, int, property<vertex_centrality_t, double> >, long unsigned int>, double, double&>; DependencyMap = iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > >, vec_adj_list_vertex_id_map<property<vertex_index_t, int, property<vertex_centrality_t, double> >, long unsigned int>, double, double&>; PathCountMap = iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > >, vec_adj_list_vertex_id_map<property<vertex_index_t, int, property<vertex_centrality_t, double> >, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = vec_adj_list_vertex_id_map<property<vertex_index_t, int, property<vertex_centrality_t, double> >, long unsigned int>; WeightMap = adj_list_edge_property_map<undirected_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_centrality_t, double> >, edge_weight_t>; typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits<Graph>::traversal_category = undir_adj_list_traversal_tag]’
434 | detail::graph::brandes_betweenness_centrality_impl(g, centrality,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~
435 | edge_centrality_map, incoming, distance, dependency, path_count,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
436 | vertex_index, shortest_paths);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:468:43: required from ‘void boost::detail::graph::brandes_betweenness_centrality_dispatch2(const Graph&, CentralityMap, EdgeCentralityMap, WeightMap, VertexIndexMap) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >; CentralityMap = boost::vec_adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >, boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_centrality_t>; WeightMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_weight_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>]’
468 | brandes_betweenness_centrality(g, centrality, edge_centrality_map,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
469 | make_iterator_property_map(incoming.begin(), vertex_index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
470 | make_iterator_property_map(distance.begin(), vertex_index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
471 | make_iterator_property_map(dependency.begin(), vertex_index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
472 | make_iterator_property_map(path_count.begin(), vertex_index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
473 | vertex_index, weight_map);
| ~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:517:57: required from ‘static void boost::detail::graph::brandes_betweenness_centrality_dispatch1<WeightMap>::run(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap, WeightMap) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >; CentralityMap = boost::vec_adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >, boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>; WeightMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_weight_t>]’
517 | brandes_betweenness_centrality_dispatch2(g, centrality,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~
518 | edge_centrality_map, weight_map, vertex_index);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:558:71: required from ‘void boost::brandes_betweenness_centrality(const Graph&, const bgl_named_params<T, Tag, Base>&, typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >; Param = adj_list_edge_property_map<undirected_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_centrality_t, double> >, edge_weight_t>; Tag = edge_weight_t; Rest = bgl_named_params<adj_list_edge_property_map<undirected_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_centrality_t, double> >, edge_centrality_t>, edge_centrality_t, bgl_named_params<vec_adj_list_vertex_property_map<adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >, adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >*, double, double&, vertex_centrality_t>, vertex_centrality_t, no_property> >; typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits<Graph>::traversal_category = undir_adj_list_traversal_tag]’
558 | detail::graph::brandes_betweenness_centrality_dispatch1< ew >::run(g,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
559 | choose_param(
| ~~~~~~~~~~~~~
560 | get_param(params, vertex_centrality), dummy_property_map()),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
561 | choose_param(get_param(params, edge_centrality), dummy_property_map()),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
562 | choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
563 | get_param(params, edge_weight));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
bbc.cpp:67:33: required from here
67 | brandes_betweenness_centrality(g,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
68 | centrality_map(get(vertex_centrality, g)).
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
69 | edge_centrality_map(get(edge_centrality, g)).
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
70 | weight_map(get(edge_weight, g)));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Convertible<boost::read_write_property_map_tag, boost::read_write_property_map_tag>]’
20 | ~usage_requirements() { ((Model*)0)->~Model(); }
| ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::ConvertibleConcept<boost::read_write_property_map_tag, boost::read_write_property_map_tag>]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:208:7: required from ‘void boost::ReadWritePropertyMapConcept<PMap, Key>::constraints() [with PMap = boost::two_bit_color_map<boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int> >; Key = long unsigned int]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::ReadWritePropertyMapConcept<boost::two_bit_color_map<boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int> >, long unsigned int>]’
32 | inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
| ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied<boost::ReadWritePropertyMapConcept<boost::two_bit_color_map<boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int> >, long unsigned int> >::value’
44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied<boost::ReadWritePropertyMapConcept<boost::two_bit_color_map<boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int> >, long unsigned int> >’
45 | typedef boost::integral_constant<bool, value> type;
| ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_<void (*)(boost::ReadWritePropertyMapConcept<boost::two_bit_color_map<boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int> >, long unsigned int>)>’
72 | struct requirement_<void(*)(Model)>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:66:5: [ skipping 10 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:349:31: required from ‘void boost::detail::graph::brandes_betweenness_centrality_impl(const Graph&, CentralityMap, EdgeCentralityMap, IncomingMap, DistanceMap, DependencyMap, PathCountMap, VertexIndexMap, ShortestPaths) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >; CentralityMap = boost::vec_adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >, boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_centrality_t>; IncomingMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >*, std::vector<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >, std::allocator<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > > > > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>, std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >, std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >&>; DistanceMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>, double, double&>; DependencyMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>, double, double&>; PathCountMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>; ShortestPaths = brandes_dijkstra_shortest_paths<boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_weight_t> >]’
349 | shortest_paths(g, *s, ordered_vertices, incoming, distance,
| ~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
350 | path_count, vertex_index);
| ~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:434:55: required from ‘void boost::brandes_betweenness_centrality(const Graph&, CentralityMap, EdgeCentralityMap, IncomingMap, DistanceMap, DependencyMap, PathCountMap, VertexIndexMap, WeightMap, typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >; CentralityMap = vec_adj_list_vertex_property_map<adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >, adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >*, double, double&, vertex_centrality_t>; EdgeCentralityMap = adj_list_edge_property_map<undirected_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_centrality_t, double> >, edge_centrality_t>; IncomingMap = iterator_property_map<__gnu_cxx::__normal_iterator<std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<undirected_tag, long unsigned int> > >*, std::vector<std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<undirected_tag, long unsigned int> > >, std::allocator<std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<undirected_tag, long unsigned int> > > > > >, vec_adj_list_vertex_id_map<property<vertex_index_t, int, property<vertex_centrality_t, double> >, long unsigned int>, std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<undirected_tag, long unsigned int> > >, std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<undirected_tag, long unsigned int> > >&>; DistanceMap = iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > >, vec_adj_list_vertex_id_map<property<vertex_index_t, int, property<vertex_centrality_t, double> >, long unsigned int>, double, double&>; DependencyMap = iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > >, vec_adj_list_vertex_id_map<property<vertex_index_t, int, property<vertex_centrality_t, double> >, long unsigned int>, double, double&>; PathCountMap = iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > >, vec_adj_list_vertex_id_map<property<vertex_index_t, int, property<vertex_centrality_t, double> >, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = vec_adj_list_vertex_id_map<property<vertex_index_t, int, property<vertex_centrality_t, double> >, long unsigned int>; WeightMap = adj_list_edge_property_map<undirected_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_centrality_t, double> >, edge_weight_t>; typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits<Graph>::traversal_category = undir_adj_list_traversal_tag]’
434 | detail::graph::brandes_betweenness_centrality_impl(g, centrality,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~
435 | edge_centrality_map, incoming, distance, dependency, path_count,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
436 | vertex_index, shortest_paths);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:468:43: required from ‘void boost::detail::graph::brandes_betweenness_centrality_dispatch2(const Graph&, CentralityMap, EdgeCentralityMap, WeightMap, VertexIndexMap) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >; CentralityMap = boost::vec_adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >, boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_centrality_t>; WeightMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_weight_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>]’
468 | brandes_betweenness_centrality(g, centrality, edge_centrality_map,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
469 | make_iterator_property_map(incoming.begin(), vertex_index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
470 | make_iterator_property_map(distance.begin(), vertex_index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
471 | make_iterator_property_map(dependency.begin(), vertex_index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
472 | make_iterator_property_map(path_count.begin(), vertex_index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
473 | vertex_index, weight_map);
| ~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:517:57: required from ‘static void boost::detail::graph::brandes_betweenness_centrality_dispatch1<WeightMap>::run(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap, WeightMap) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >; CentralityMap = boost::vec_adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >, boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>; WeightMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_weight_t>]’
517 | brandes_betweenness_centrality_dispatch2(g, centrality,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~
518 | edge_centrality_map, weight_map, vertex_index);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:558:71: required from ‘void boost::brandes_betweenness_centrality(const Graph&, const bgl_named_params<T, Tag, Base>&, typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >; Param = adj_list_edge_property_map<undirected_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_centrality_t, double> >, edge_weight_t>; Tag = edge_weight_t; Rest = bgl_named_params<adj_list_edge_property_map<undirected_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_centrality_t, double> >, edge_centrality_t>, edge_centrality_t, bgl_named_params<vec_adj_list_vertex_property_map<adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >, adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >*, double, double&, vertex_centrality_t>, vertex_centrality_t, no_property> >; typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits<Graph>::traversal_category = undir_adj_list_traversal_tag]’
558 | detail::graph::brandes_betweenness_centrality_dispatch1< ew >::run(g,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
559 | choose_param(
| ~~~~~~~~~~~~~
560 | get_param(params, vertex_centrality), dummy_property_map()),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
561 | choose_param(get_param(params, edge_centrality), dummy_property_map()),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
562 | choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
563 | get_param(params, edge_weight));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
bbc.cpp:67:33: required from here
67 | brandes_betweenness_centrality(g,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
68 | centrality_map(get(vertex_centrality, g)).
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
69 | edge_centrality_map(get(edge_centrality, g)).
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
70 | weight_map(get(edge_weight, g)));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:206:17: note: in a call to non-static member function ‘boost::ConvertibleConcept<boost::read_write_property_map_tag, boost::read_write_property_map_tag>::~ConvertibleConcept()’
206 | BOOST_concept(Convertible,(X)(Y))
| ^~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/preprocessor/cat.hpp:29:34: note: in definition of macro ‘BOOST_PP_CAT_I’
29 | # define BOOST_PP_CAT_I(a, b) a ## b
| ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/concept_def.hpp:23:12: note: in expansion of macro ‘BOOST_PP_CAT’
23 | struct BOOST_PP_CAT(name,Concept) \
| ^~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:206:3: note: in expansion of macro ‘BOOST_concept’
206 | BOOST_concept(Convertible,(X)(Y))
| ^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Convertible<boost::iterators::detail::iterator_category_with_traversal<std::input_iterator_tag, boost::iterators::random_access_traversal_tag>, std::input_iterator_tag> >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/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> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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);
| ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/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) );
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/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;
| ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/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)>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:515:9: [ skipping 11 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:500:43: required from ‘void boost::detail::graph::brandes_betweenness_centrality_dispatch2(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >; CentralityMap = boost::dummy_property_map; EdgeCentralityMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>]’
500 | brandes_betweenness_centrality(g, centrality, edge_centrality_map,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
501 | make_iterator_property_map(incoming.begin(), vertex_index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
502 | make_iterator_property_map(distance.begin(), vertex_index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
503 | make_iterator_property_map(dependency.begin(), vertex_index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
504 | make_iterator_property_map(path_count.begin(), vertex_index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
505 | vertex_index);
| ~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:531:57: required from ‘static void boost::detail::graph::brandes_betweenness_centrality_dispatch1<boost::param_not_found>::run(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap, boost::param_not_found) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >; CentralityMap = boost::dummy_property_map; EdgeCentralityMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>]’
531 | brandes_betweenness_centrality_dispatch2(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
532 | g, centrality, edge_centrality_map, vertex_index);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:558:71: required from ‘void boost::brandes_betweenness_centrality(const Graph&, const bgl_named_params<T, Tag, Base>&, typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >; Param = vec_adj_list_vertex_id_map<property<vertex_index_t, int, property<vertex_centrality_t, double> >, long unsigned int>; Tag = vertex_index_t; Rest = bgl_named_params<adj_list_edge_property_map<undirected_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_centrality_t, double> >, edge_centrality_t>, edge_centrality_t, no_property>; typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits<Graph>::traversal_category = undir_adj_list_traversal_tag]’
558 | detail::graph::brandes_betweenness_centrality_dispatch1< ew >::run(g,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
559 | choose_param(
| ~~~~~~~~~~~~~
560 | get_param(params, vertex_centrality), dummy_property_map()),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
561 | choose_param(get_param(params, edge_centrality), dummy_property_map()),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
562 | choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
563 | get_param(params, edge_weight));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/bc_clustering.hpp:131:39: required from ‘void boost::betweenness_centrality_clustering(MutableGraph&, Done, EdgeCentralityMap, VertexIndexMap) [with MutableGraph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >; Done = clustering_threshold; EdgeCentralityMap = adj_list_edge_property_map<undirected_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_centrality_t, double> >, edge_centrality_t>; VertexIndexMap = vec_adj_list_vertex_id_map<property<vertex_index_t, int, property<vertex_centrality_t, double> >, long unsigned int>]’
131 | brandes_betweenness_centrality(g,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
132 | edge_centrality_map(edge_centrality)
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
133 | .vertex_index_map(vertex_index));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/bc_clustering.hpp:150:38: required from ‘void boost::betweenness_centrality_clustering(MutableGraph&, Done, EdgeCentralityMap) [with MutableGraph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >; Done = clustering_threshold; EdgeCentralityMap = adj_list_edge_property_map<undirected_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_centrality_t, double> >, edge_centrality_t>]’
150 | betweenness_centrality_clustering(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
151 | g, done, edge_centrality, get(vertex_index, g));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
bbc.cpp:149:36: required from here
149 | betweenness_centrality_clustering(g,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
150 | clustering_threshold(threshold, g, normalize),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
151 | get(edge_centrality, g));
| ~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Convertible<boost::iterators::detail::iterator_category_with_traversal<std::input_iterator_tag, boost::iterators::random_access_traversal_tag>, std::input_iterator_tag>]’
20 | ~usage_requirements() { ((Model*)0)->~Model(); }
| ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::Convertible<boost::iterators::detail::iterator_category_with_traversal<std::input_iterator_tag, boost::iterators::random_access_traversal_tag>, std::input_iterator_tag>]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:515:9: required from ‘boost::InputIterator<TT>::~InputIterator() [with TT = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > > >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > > >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > > >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int>]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::InputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > > >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > > >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > > >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> >]’
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:53:35: required from ‘boost::concepts::MultiPassInputIterator<T>::~MultiPassInputIterator() [with T = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > > >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > > >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > > >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int>]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::MultiPassInputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > > >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > > >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > > >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> >]’
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:89:9: required from ‘boost::concepts::IncidenceGraph<G>::~IncidenceGraph() [with G = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:75:1: [ skipping 6 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:500:43: required from ‘void boost::detail::graph::brandes_betweenness_centrality_dispatch2(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >; CentralityMap = boost::dummy_property_map; EdgeCentralityMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>]’
500 | brandes_betweenness_centrality(g, centrality, edge_centrality_map,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
501 | make_iterator_property_map(incoming.begin(), vertex_index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
502 | make_iterator_property_map(distance.begin(), vertex_index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
503 | make_iterator_property_map(dependency.begin(), vertex_index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
504 | make_iterator_property_map(path_count.begin(), vertex_index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
505 | vertex_index);
| ~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:531:57: required from ‘static void boost::detail::graph::brandes_betweenness_centrality_dispatch1<boost::param_not_found>::run(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap, boost::param_not_found) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >; CentralityMap = boost::dummy_property_map; EdgeCentralityMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>]’
531 | brandes_betweenness_centrality_dispatch2(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
532 | g, centrality, edge_centrality_map, vertex_index);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:558:71: required from ‘void boost::brandes_betweenness_centrality(const Graph&, const bgl_named_params<T, Tag, Base>&, typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >; Param = vec_adj_list_vertex_id_map<property<vertex_index_t, int, property<vertex_centrality_t, double> >, long unsigned int>; Tag = vertex_index_t; Rest = bgl_named_params<adj_list_edge_property_map<undirected_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_centrality_t, double> >, edge_centrality_t>, edge_centrality_t, no_property>; typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits<Graph>::traversal_category = undir_adj_list_traversal_tag]’
558 | detail::graph::brandes_betweenness_centrality_dispatch1< ew >::run(g,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
559 | choose_param(
| ~~~~~~~~~~~~~
560 | get_param(params, vertex_centrality), dummy_property_map()),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
561 | choose_param(get_param(params, edge_centrality), dummy_property_map()),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
562 | choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
563 | get_param(params, edge_weight));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/bc_clustering.hpp:131:39: required from ‘void boost::betweenness_centrality_clustering(MutableGraph&, Done, EdgeCentralityMap, VertexIndexMap) [with MutableGraph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >; Done = clustering_threshold; EdgeCentralityMap = adj_list_edge_property_map<undirected_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_centrality_t, double> >, edge_centrality_t>; VertexIndexMap = vec_adj_list_vertex_id_map<property<vertex_index_t, int, property<vertex_centrality_t, double> >, long unsigned int>]’
131 | brandes_betweenness_centrality(g,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
132 | edge_centrality_map(edge_centrality)
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
133 | .vertex_index_map(vertex_index));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/bc_clustering.hpp:150:38: required from ‘void boost::betweenness_centrality_clustering(MutableGraph&, Done, EdgeCentralityMap) [with MutableGraph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >; Done = clustering_threshold; EdgeCentralityMap = adj_list_edge_property_map<undirected_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_centrality_t, double> >, edge_centrality_t>]’
150 | betweenness_centrality_clustering(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
151 | g, done, edge_centrality, get(vertex_index, g));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
bbc.cpp:149:36: required from here
149 | betweenness_centrality_clustering(g,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
150 | clustering_threshold(threshold, g, normalize),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
151 | get(edge_centrality, g));
| ~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible<X, Y>::~Convertible() [with X = boost::iterators::detail::iterator_category_with_traversal<std::input_iterator_tag, boost::iterators::random_access_traversal_tag>; Y = std::input_iterator_tag]’
37 | ~model()
| ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
208 | BOOST_CONCEPT_USAGE(Convertible) {
| ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Assignable<long unsigned int*> >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:145:5: required from ‘struct boost::Assignable<long unsigned int*>’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator<long unsigned int*>’
502 | BOOST_concept(InputIterator,(TT))
| ^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:540:3: required from ‘struct boost::ForwardIterator<long unsigned int*>’
540 | BOOST_concept(ForwardIterator,(TT))
| ^~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator<long unsigned int*>’
568 | BOOST_concept(BidirectionalIterator,(TT))
| ^~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<long unsigned int*>’
597 | BOOST_concept(RandomAccessIterator,(TT))
| ^~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3: [ skipping 17 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:349:31: required from ‘void boost::detail::graph::brandes_betweenness_centrality_impl(const Graph&, CentralityMap, EdgeCentralityMap, IncomingMap, DistanceMap, DependencyMap, PathCountMap, VertexIndexMap, ShortestPaths) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >; CentralityMap = boost::vec_adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >, boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_centrality_t>; IncomingMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >*, std::vector<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >, std::allocator<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > > > > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>, std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >, std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >&>; DistanceMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>, double, double&>; DependencyMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>, double, double&>; PathCountMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>; ShortestPaths = brandes_dijkstra_shortest_paths<boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_weight_t> >]’
349 | shortest_paths(g, *s, ordered_vertices, incoming, distance,
| ~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
350 | path_count, vertex_index);
| ~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:434:55: required from ‘void boost::brandes_betweenness_centrality(const Graph&, CentralityMap, EdgeCentralityMap, IncomingMap, DistanceMap, DependencyMap, PathCountMap, VertexIndexMap, WeightMap, typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >; CentralityMap = vec_adj_list_vertex_property_map<adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >, adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >*, double, double&, vertex_centrality_t>; EdgeCentralityMap = adj_list_edge_property_map<undirected_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_centrality_t, double> >, edge_centrality_t>; IncomingMap = iterator_property_map<__gnu_cxx::__normal_iterator<std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<undirected_tag, long unsigned int> > >*, std::vector<std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<undirected_tag, long unsigned int> > >, std::allocator<std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<undirected_tag, long unsigned int> > > > > >, vec_adj_list_vertex_id_map<property<vertex_index_t, int, property<vertex_centrality_t, double> >, long unsigned int>, std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<undirected_tag, long unsigned int> > >, std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<undirected_tag, long unsigned int> > >&>; DistanceMap = iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > >, vec_adj_list_vertex_id_map<property<vertex_index_t, int, property<vertex_centrality_t, double> >, long unsigned int>, double, double&>; DependencyMap = iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > >, vec_adj_list_vertex_id_map<property<vertex_index_t, int, property<vertex_centrality_t, double> >, long unsigned int>, double, double&>; PathCountMap = iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > >, vec_adj_list_vertex_id_map<property<vertex_index_t, int, property<vertex_centrality_t, double> >, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = vec_adj_list_vertex_id_map<property<vertex_index_t, int, property<vertex_centrality_t, double> >, long unsigned int>; WeightMap = adj_list_edge_property_map<undirected_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_centrality_t, double> >, edge_weight_t>; typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits<Graph>::traversal_category = undir_adj_list_traversal_tag]’
434 | detail::graph::brandes_betweenness_centrality_impl(g, centrality,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~
435 | edge_centrality_map, incoming, distance, dependency, path_count,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
436 | vertex_index, shortest_paths);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:468:43: required from ‘void boost::detail::graph::brandes_betweenness_centrality_dispatch2(const Graph&, CentralityMap, EdgeCentralityMap, WeightMap, VertexIndexMap) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >; CentralityMap = boost::vec_adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >, boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_centrality_t>; WeightMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_weight_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>]’
468 | brandes_betweenness_centrality(g, centrality, edge_centrality_map,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
469 | make_iterator_property_map(incoming.begin(), vertex_index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
470 | make_iterator_property_map(distance.begin(), vertex_index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
471 | make_iterator_property_map(dependency.begin(), vertex_index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
472 | make_iterator_property_map(path_count.begin(), vertex_index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
473 | vertex_index, weight_map);
| ~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:517:57: required from ‘static void boost::detail::graph::brandes_betweenness_centrality_dispatch1<WeightMap>::run(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap, WeightMap) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >; CentralityMap = boost::vec_adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >, boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>; WeightMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_weight_t>]’
517 | brandes_betweenness_centrality_dispatch2(g, centrality,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~
518 | edge_centrality_map, weight_map, vertex_index);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:558:71: required from ‘void boost::brandes_betweenness_centrality(const Graph&, const bgl_named_params<T, Tag, Base>&, typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >; Param = adj_list_edge_property_map<undirected_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_centrality_t, double> >, edge_weight_t>; Tag = edge_weight_t; Rest = bgl_named_params<adj_list_edge_property_map<undirected_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_centrality_t, double> >, edge_centrality_t>, edge_centrality_t, bgl_named_params<vec_adj_list_vertex_property_map<adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >, adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >*, double, double&, vertex_centrality_t>, vertex_centrality_t, no_property> >; typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits<Graph>::traversal_category = undir_adj_list_traversal_tag]’
558 | detail::graph::brandes_betweenness_centrality_dispatch1< ew >::run(g,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
559 | choose_param(
| ~~~~~~~~~~~~~
560 | get_param(params, vertex_centrality), dummy_property_map()),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
561 | choose_param(get_param(params, edge_centrality), dummy_property_map()),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
562 | choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
563 | get_param(params, edge_weight));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
bbc.cpp:67:33: required from here
67 | brandes_betweenness_centrality(g,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
68 | centrality_map(get(vertex_centrality, g)).
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
69 | edge_centrality_map(get(edge_centrality, g)).
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
70 | weight_map(get(edge_weight, g)));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Assignable<long unsigned int*>]’
20 | ~usage_requirements() { ((Model*)0)->~Model(); }
| ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::EqualityComparable<long unsigned int*> >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable<long unsigned int*>’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator<long unsigned int*>’
502 | BOOST_concept(InputIterator,(TT))
| ^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:540:3: required from ‘struct boost::ForwardIterator<long unsigned int*>’
540 | BOOST_concept(ForwardIterator,(TT))
| ^~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator<long unsigned int*>’
568 | BOOST_concept(BidirectionalIterator,(TT))
| ^~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<long unsigned int*>’
597 | BOOST_concept(RandomAccessIterator,(TT))
| ^~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3: [ skipping 17 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:349:31: required from ‘void boost::detail::graph::brandes_betweenness_centrality_impl(const Graph&, CentralityMap, EdgeCentralityMap, IncomingMap, DistanceMap, DependencyMap, PathCountMap, VertexIndexMap, ShortestPaths) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >; CentralityMap = boost::vec_adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >, boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_centrality_t>; IncomingMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >*, std::vector<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >, std::allocator<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > > > > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>, std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >, std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >&>; DistanceMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>, double, double&>; DependencyMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>, double, double&>; PathCountMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>; ShortestPaths = brandes_dijkstra_shortest_paths<boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_weight_t> >]’
349 | shortest_paths(g, *s, ordered_vertices, incoming, distance,
| ~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
350 | path_count, vertex_index);
| ~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:434:55: required from ‘void boost::brandes_betweenness_centrality(const Graph&, CentralityMap, EdgeCentralityMap, IncomingMap, DistanceMap, DependencyMap, PathCountMap, VertexIndexMap, WeightMap, typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >; CentralityMap = vec_adj_list_vertex_property_map<adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >, adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >*, double, double&, vertex_centrality_t>; EdgeCentralityMap = adj_list_edge_property_map<undirected_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_centrality_t, double> >, edge_centrality_t>; IncomingMap = iterator_property_map<__gnu_cxx::__normal_iterator<std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<undirected_tag, long unsigned int> > >*, std::vector<std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<undirected_tag, long unsigned int> > >, std::allocator<std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<undirected_tag, long unsigned int> > > > > >, vec_adj_list_vertex_id_map<property<vertex_index_t, int, property<vertex_centrality_t, double> >, long unsigned int>, std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<undirected_tag, long unsigned int> > >, std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<undirected_tag, long unsigned int> > >&>; DistanceMap = iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > >, vec_adj_list_vertex_id_map<property<vertex_index_t, int, property<vertex_centrality_t, double> >, long unsigned int>, double, double&>; DependencyMap = iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > >, vec_adj_list_vertex_id_map<property<vertex_index_t, int, property<vertex_centrality_t, double> >, long unsigned int>, double, double&>; PathCountMap = iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > >, vec_adj_list_vertex_id_map<property<vertex_index_t, int, property<vertex_centrality_t, double> >, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = vec_adj_list_vertex_id_map<property<vertex_index_t, int, property<vertex_centrality_t, double> >, long unsigned int>; WeightMap = adj_list_edge_property_map<undirected_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_centrality_t, double> >, edge_weight_t>; typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits<Graph>::traversal_category = undir_adj_list_traversal_tag]’
434 | detail::graph::brandes_betweenness_centrality_impl(g, centrality,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~
435 | edge_centrality_map, incoming, distance, dependency, path_count,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
436 | vertex_index, shortest_paths);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:468:43: required from ‘void boost::detail::graph::brandes_betweenness_centrality_dispatch2(const Graph&, CentralityMap, EdgeCentralityMap, WeightMap, VertexIndexMap) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >; CentralityMap = boost::vec_adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >, boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_centrality_t>; WeightMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_weight_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>]’
468 | brandes_betweenness_centrality(g, centrality, edge_centrality_map,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
469 | make_iterator_property_map(incoming.begin(), vertex_index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
470 | make_iterator_property_map(distance.begin(), vertex_index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
471 | make_iterator_property_map(dependency.begin(), vertex_index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
472 | make_iterator_property_map(path_count.begin(), vertex_index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
473 | vertex_index, weight_map);
| ~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:517:57: required from ‘static void boost::detail::graph::brandes_betweenness_centrality_dispatch1<WeightMap>::run(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap, WeightMap) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >; CentralityMap = boost::vec_adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >, boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>; WeightMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_weight_t>]’
517 | brandes_betweenness_centrality_dispatch2(g, centrality,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~
518 | edge_centrality_map, weight_map, vertex_index);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:558:71: required from ‘void boost::brandes_betweenness_centrality(const Graph&, const bgl_named_params<T, Tag, Base>&, typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >; Param = adj_list_edge_property_map<undirected_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_centrality_t, double> >, edge_weight_t>; Tag = edge_weight_t; Rest = bgl_named_params<adj_list_edge_property_map<undirected_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_centrality_t, double> >, edge_centrality_t>, edge_centrality_t, bgl_named_params<vec_adj_list_vertex_property_map<adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >, adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >*, double, double&, vertex_centrality_t>, vertex_centrality_t, no_property> >; typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits<Graph>::traversal_category = undir_adj_list_traversal_tag]’
558 | detail::graph::brandes_betweenness_centrality_dispatch1< ew >::run(g,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
559 | choose_param(
| ~~~~~~~~~~~~~
560 | get_param(params, vertex_centrality), dummy_property_map()),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
561 | choose_param(get_param(params, edge_centrality), dummy_property_map()),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
562 | choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
563 | get_param(params, edge_weight));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
bbc.cpp:67:33: required from here
67 | brandes_betweenness_centrality(g,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
68 | centrality_map(get(vertex_centrality, g)).
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
69 | edge_centrality_map(get(edge_centrality, g)).
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
70 | weight_map(get(edge_weight, g)));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::EqualityComparable<long unsigned int*>]’
20 | ~usage_requirements() { ((Model*)0)->~Model(); }
| ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::InputIterator<long unsigned int*> >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:512:7: required from ‘struct boost::InputIterator<long unsigned int*>’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:540:3: required from ‘struct boost::ForwardIterator<long unsigned int*>’
540 | BOOST_concept(ForwardIterator,(TT))
| ^~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator<long unsigned int*>’
568 | BOOST_concept(BidirectionalIterator,(TT))
| ^~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<long unsigned int*>’
597 | BOOST_concept(RandomAccessIterator,(TT))
| ^~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<long unsigned int*>’
597 | BOOST_concept(RandomAccessIterator,(TT))
| ^~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: [ skipping 16 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:349:31: required from ‘void boost::detail::graph::brandes_betweenness_centrality_impl(const Graph&, CentralityMap, EdgeCentralityMap, IncomingMap, DistanceMap, DependencyMap, PathCountMap, VertexIndexMap, ShortestPaths) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >; CentralityMap = boost::vec_adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >, boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_centrality_t>; IncomingMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >*, std::vector<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >, std::allocator<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > > > > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>, std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >, std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >&>; DistanceMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>, double, double&>; DependencyMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>, double, double&>; PathCountMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>; ShortestPaths = brandes_dijkstra_shortest_paths<boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_weight_t> >]’
349 | shortest_paths(g, *s, ordered_vertices, incoming, distance,
| ~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
350 | path_count, vertex_index);
| ~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:434:55: required from ‘void boost::brandes_betweenness_centrality(const Graph&, CentralityMap, EdgeCentralityMap, IncomingMap, DistanceMap, DependencyMap, PathCountMap, VertexIndexMap, WeightMap, typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >; CentralityMap = vec_adj_list_vertex_property_map<adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >, adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >*, double, double&, vertex_centrality_t>; EdgeCentralityMap = adj_list_edge_property_map<undirected_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_centrality_t, double> >, edge_centrality_t>; IncomingMap = iterator_property_map<__gnu_cxx::__normal_iterator<std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<undirected_tag, long unsigned int> > >*, std::vector<std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<undirected_tag, long unsigned int> > >, std::allocator<std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<undirected_tag, long unsigned int> > > > > >, vec_adj_list_vertex_id_map<property<vertex_index_t, int, property<vertex_centrality_t, double> >, long unsigned int>, std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<undirected_tag, long unsigned int> > >, std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<undirected_tag, long unsigned int> > >&>; DistanceMap = iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > >, vec_adj_list_vertex_id_map<property<vertex_index_t, int, property<vertex_centrality_t, double> >, long unsigned int>, double, double&>; DependencyMap = iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > >, vec_adj_list_vertex_id_map<property<vertex_index_t, int, property<vertex_centrality_t, double> >, long unsigned int>, double, double&>; PathCountMap = iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > >, vec_adj_list_vertex_id_map<property<vertex_index_t, int, property<vertex_centrality_t, double> >, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = vec_adj_list_vertex_id_map<property<vertex_index_t, int, property<vertex_centrality_t, double> >, long unsigned int>; WeightMap = adj_list_edge_property_map<undirected_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_centrality_t, double> >, edge_weight_t>; typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits<Graph>::traversal_category = undir_adj_list_traversal_tag]’
434 | detail::graph::brandes_betweenness_centrality_impl(g, centrality,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~
435 | edge_centrality_map, incoming, distance, dependency, path_count,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
436 | vertex_index, shortest_paths);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:468:43: required from ‘void boost::detail::graph::brandes_betweenness_centrality_dispatch2(const Graph&, CentralityMap, EdgeCentralityMap, WeightMap, VertexIndexMap) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >; CentralityMap = boost::vec_adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >, boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_centrality_t>; WeightMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_weight_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>]’
468 | brandes_betweenness_centrality(g, centrality, edge_centrality_map,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
469 | make_iterator_property_map(incoming.begin(), vertex_index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
470 | make_iterator_property_map(distance.begin(), vertex_index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
471 | make_iterator_property_map(dependency.begin(), vertex_index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
472 | make_iterator_property_map(path_count.begin(), vertex_index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
473 | vertex_index, weight_map);
| ~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:517:57: required from ‘static void boost::detail::graph::brandes_betweenness_centrality_dispatch1<WeightMap>::run(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap, WeightMap) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >; CentralityMap = boost::vec_adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >, boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>; WeightMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_weight_t>]’
517 | brandes_betweenness_centrality_dispatch2(g, centrality,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~
518 | edge_centrality_map, weight_map, vertex_index);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:558:71: required from ‘void boost::brandes_betweenness_centrality(const Graph&, const bgl_named_params<T, Tag, Base>&, typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >; Param = adj_list_edge_property_map<undirected_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_centrality_t, double> >, edge_weight_t>; Tag = edge_weight_t; Rest = bgl_named_params<adj_list_edge_property_map<undirected_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_centrality_t, double> >, edge_centrality_t>, edge_centrality_t, bgl_named_params<vec_adj_list_vertex_property_map<adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >, adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >*, double, double&, vertex_centrality_t>, vertex_centrality_t, no_property> >; typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits<Graph>::traversal_category = undir_adj_list_traversal_tag]’
558 | detail::graph::brandes_betweenness_centrality_dispatch1< ew >::run(g,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
559 | choose_param(
| ~~~~~~~~~~~~~
560 | get_param(params, vertex_centrality), dummy_property_map()),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
561 | choose_param(get_param(params, edge_centrality), dummy_property_map()),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
562 | choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
563 | get_param(params, edge_weight));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
bbc.cpp:67:33: required from here
67 | brandes_betweenness_centrality(g,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
68 | centrality_map(get(vertex_centrality, g)).
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
69 | edge_centrality_map(get(edge_centrality, g)).
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
70 | weight_map(get(edge_weight, g)));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::InputIterator<long unsigned int*>]’
20 | ~usage_requirements() { ((Model*)0)->~Model(); }
| ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::ForwardIterator<long unsigned int*> >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:543:7: required from ‘struct boost::ForwardIterator<long unsigned int*>’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator<long unsigned int*>’
568 | BOOST_concept(BidirectionalIterator,(TT))
| ^~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<long unsigned int*>’
597 | BOOST_concept(RandomAccessIterator,(TT))
| ^~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<long unsigned int*>’
597 | BOOST_concept(RandomAccessIterator,(TT))
| ^~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::RandomAccessIteratorConcept<long unsigned int*>]’
32 | inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
| ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5: [ skipping 15 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:349:31: required from ‘void boost::detail::graph::brandes_betweenness_centrality_impl(const Graph&, CentralityMap, EdgeCentralityMap, IncomingMap, DistanceMap, DependencyMap, PathCountMap, VertexIndexMap, ShortestPaths) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >; CentralityMap = boost::vec_adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >, boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_centrality_t>; IncomingMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >*, std::vector<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >, std::allocator<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > > > > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>, std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >, std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >&>; DistanceMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>, double, double&>; DependencyMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>, double, double&>; PathCountMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>; ShortestPaths = brandes_dijkstra_shortest_paths<boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_weight_t> >]’
349 | shortest_paths(g, *s, ordered_vertices, incoming, distance,
| ~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
350 | path_count, vertex_index);
| ~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:434:55: required from ‘void boost::brandes_betweenness_centrality(const Graph&, CentralityMap, EdgeCentralityMap, IncomingMap, DistanceMap, DependencyMap, PathCountMap, VertexIndexMap, WeightMap, typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >; CentralityMap = vec_adj_list_vertex_property_map<adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >, adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >*, double, double&, vertex_centrality_t>; EdgeCentralityMap = adj_list_edge_property_map<undirected_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_centrality_t, double> >, edge_centrality_t>; IncomingMap = iterator_property_map<__gnu_cxx::__normal_iterator<std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<undirected_tag, long unsigned int> > >*, std::vector<std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<undirected_tag, long unsigned int> > >, std::allocator<std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<undirected_tag, long unsigned int> > > > > >, vec_adj_list_vertex_id_map<property<vertex_index_t, int, property<vertex_centrality_t, double> >, long unsigned int>, std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<undirected_tag, long unsigned int> > >, std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<undirected_tag, long unsigned int> > >&>; DistanceMap = iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > >, vec_adj_list_vertex_id_map<property<vertex_index_t, int, property<vertex_centrality_t, double> >, long unsigned int>, double, double&>; DependencyMap = iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > >, vec_adj_list_vertex_id_map<property<vertex_index_t, int, property<vertex_centrality_t, double> >, long unsigned int>, double, double&>; PathCountMap = iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > >, vec_adj_list_vertex_id_map<property<vertex_index_t, int, property<vertex_centrality_t, double> >, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = vec_adj_list_vertex_id_map<property<vertex_index_t, int, property<vertex_centrality_t, double> >, long unsigned int>; WeightMap = adj_list_edge_property_map<undirected_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_centrality_t, double> >, edge_weight_t>; typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits<Graph>::traversal_category = undir_adj_list_traversal_tag]’
434 | detail::graph::brandes_betweenness_centrality_impl(g, centrality,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~
435 | edge_centrality_map, incoming, distance, dependency, path_count,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
436 | vertex_index, shortest_paths);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:468:43: required from ‘void boost::detail::graph::brandes_betweenness_centrality_dispatch2(const Graph&, CentralityMap, EdgeCentralityMap, WeightMap, VertexIndexMap) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >; CentralityMap = boost::vec_adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >, boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_centrality_t>; WeightMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_weight_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>]’
468 | brandes_betweenness_centrality(g, centrality, edge_centrality_map,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
469 | make_iterator_property_map(incoming.begin(), vertex_index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
470 | make_iterator_property_map(distance.begin(), vertex_index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
471 | make_iterator_property_map(dependency.begin(), vertex_index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
472 | make_iterator_property_map(path_count.begin(), vertex_index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
473 | vertex_index, weight_map);
| ~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:517:57: required from ‘static void boost::detail::graph::brandes_betweenness_centrality_dispatch1<WeightMap>::run(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap, WeightMap) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >; CentralityMap = boost::vec_adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >, boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>; WeightMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_weight_t>]’
517 | brandes_betweenness_centrality_dispatch2(g, centrality,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~
518 | edge_centrality_map, weight_map, vertex_index);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:558:71: required from ‘void boost::brandes_betweenness_centrality(const Graph&, const bgl_named_params<T, Tag, Base>&, typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >; Param = adj_list_edge_property_map<undirected_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_centrality_t, double> >, edge_weight_t>; Tag = edge_weight_t; Rest = bgl_named_params<adj_list_edge_property_map<undirected_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_centrality_t, double> >, edge_centrality_t>, edge_centrality_t, bgl_named_params<vec_adj_list_vertex_property_map<adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >, adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >*, double, double&, vertex_centrality_t>, vertex_centrality_t, no_property> >; typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits<Graph>::traversal_category = undir_adj_list_traversal_tag]’
558 | detail::graph::brandes_betweenness_centrality_dispatch1< ew >::run(g,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
559 | choose_param(
| ~~~~~~~~~~~~~
560 | get_param(params, vertex_centrality), dummy_property_map()),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
561 | choose_param(get_param(params, edge_centrality), dummy_property_map()),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
562 | choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
563 | get_param(params, edge_weight));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
bbc.cpp:67:33: required from here
67 | brandes_betweenness_centrality(g,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
68 | centrality_map(get(vertex_centrality, g)).
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
69 | edge_centrality_map(get(edge_centrality, g)).
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
70 | weight_map(get(edge_weight, g)));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::ForwardIterator<long unsigned int*>]’
20 | ~usage_requirements() { ((Model*)0)->~Model(); }
| ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::BidirectionalIterator<long unsigned int*> >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:571:7: required from ‘struct boost::BidirectionalIterator<long unsigned int*>’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<long unsigned int*>’
597 | BOOST_concept(RandomAccessIterator,(TT))
| ^~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<long unsigned int*>’
597 | BOOST_concept(RandomAccessIterator,(TT))
| ^~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::RandomAccessIteratorConcept<long unsigned int*>]’
32 | inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
| ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied<boost::RandomAccessIteratorConcept<long unsigned int*> >::value’
44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 14 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:349:31: required from ‘void boost::detail::graph::brandes_betweenness_centrality_impl(const Graph&, CentralityMap, EdgeCentralityMap, IncomingMap, DistanceMap, DependencyMap, PathCountMap, VertexIndexMap, ShortestPaths) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >; CentralityMap = boost::vec_adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >, boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_centrality_t>; IncomingMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >*, std::vector<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >, std::allocator<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > > > > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>, std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >, std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >&>; DistanceMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>, double, double&>; DependencyMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>, double, double&>; PathCountMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>; ShortestPaths = brandes_dijkstra_shortest_paths<boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_weight_t> >]’
349 | shortest_paths(g, *s, ordered_vertices, incoming, distance,
| ~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
350 | path_count, vertex_index);
| ~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:434:55: required from ‘void boost::brandes_betweenness_centrality(const Graph&, CentralityMap, EdgeCentralityMap, IncomingMap, DistanceMap, DependencyMap, PathCountMap, VertexIndexMap, WeightMap, typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >; CentralityMap = vec_adj_list_vertex_property_map<adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >, adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >*, double, double&, vertex_centrality_t>; EdgeCentralityMap = adj_list_edge_property_map<undirected_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_centrality_t, double> >, edge_centrality_t>; IncomingMap = iterator_property_map<__gnu_cxx::__normal_iterator<std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<undirected_tag, long unsigned int> > >*, std::vector<std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<undirected_tag, long unsigned int> > >, std::allocator<std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<undirected_tag, long unsigned int> > > > > >, vec_adj_list_vertex_id_map<property<vertex_index_t, int, property<vertex_centrality_t, double> >, long unsigned int>, std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<undirected_tag, long unsigned int> > >, std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<undirected_tag, long unsigned int> > >&>; DistanceMap = iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > >, vec_adj_list_vertex_id_map<property<vertex_index_t, int, property<vertex_centrality_t, double> >, long unsigned int>, double, double&>; DependencyMap = iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > >, vec_adj_list_vertex_id_map<property<vertex_index_t, int, property<vertex_centrality_t, double> >, long unsigned int>, double, double&>; PathCountMap = iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > >, vec_adj_list_vertex_id_map<property<vertex_index_t, int, property<vertex_centrality_t, double> >, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = vec_adj_list_vertex_id_map<property<vertex_index_t, int, property<vertex_centrality_t, double> >, long unsigned int>; WeightMap = adj_list_edge_property_map<undirected_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_centrality_t, double> >, edge_weight_t>; typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits<Graph>::traversal_category = undir_adj_list_traversal_tag]’
434 | detail::graph::brandes_betweenness_centrality_impl(g, centrality,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~
435 | edge_centrality_map, incoming, distance, dependency, path_count,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
436 | vertex_index, shortest_paths);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:468:43: required from ‘void boost::detail::graph::brandes_betweenness_centrality_dispatch2(const Graph&, CentralityMap, EdgeCentralityMap, WeightMap, VertexIndexMap) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >; CentralityMap = boost::vec_adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >, boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_centrality_t>; WeightMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_weight_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>]’
468 | brandes_betweenness_centrality(g, centrality, edge_centrality_map,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
469 | make_iterator_property_map(incoming.begin(), vertex_index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
470 | make_iterator_property_map(distance.begin(), vertex_index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
471 | make_iterator_property_map(dependency.begin(), vertex_index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
472 | make_iterator_property_map(path_count.begin(), vertex_index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
473 | vertex_index, weight_map);
| ~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:517:57: required from ‘static void boost::detail::graph::brandes_betweenness_centrality_dispatch1<WeightMap>::run(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap, WeightMap) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >; CentralityMap = boost::vec_adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >, boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>; WeightMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_weight_t>]’
517 | brandes_betweenness_centrality_dispatch2(g, centrality,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~
518 | edge_centrality_map, weight_map, vertex_index);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:558:71: required from ‘void boost::brandes_betweenness_centrality(const Graph&, const bgl_named_params<T, Tag, Base>&, typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >; Param = adj_list_edge_property_map<undirected_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_centrality_t, double> >, edge_weight_t>; Tag = edge_weight_t; Rest = bgl_named_params<adj_list_edge_property_map<undirected_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_centrality_t, double> >, edge_centrality_t>, edge_centrality_t, bgl_named_params<vec_adj_list_vertex_property_map<adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >, adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >*, double, double&, vertex_centrality_t>, vertex_centrality_t, no_property> >; typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits<Graph>::traversal_category = undir_adj_list_traversal_tag]’
558 | detail::graph::brandes_betweenness_centrality_dispatch1< ew >::run(g,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
559 | choose_param(
| ~~~~~~~~~~~~~
560 | get_param(params, vertex_centrality), dummy_property_map()),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
561 | choose_param(get_param(params, edge_centrality), dummy_property_map()),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
562 | choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
563 | get_param(params, edge_weight));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
bbc.cpp:67:33: required from here
67 | brandes_betweenness_centrality(g,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
68 | centrality_map(get(vertex_centrality, g)).
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
69 | edge_centrality_map(get(edge_centrality, g)).
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
70 | weight_map(get(edge_weight, g)));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::BidirectionalIterator<long unsigned int*>]’
20 | ~usage_requirements() { ((Model*)0)->~Model(); }
| ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Comparable<long unsigned int*> >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:253:5: required from ‘struct boost::Comparable<long unsigned int*>’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<long unsigned int*>’
597 | BOOST_concept(RandomAccessIterator,(TT))
| ^~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<long unsigned int*>’
597 | BOOST_concept(RandomAccessIterator,(TT))
| ^~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::RandomAccessIteratorConcept<long unsigned int*>]’
32 | inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
| ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied<boost::RandomAccessIteratorConcept<long unsigned int*> >::value’
44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 14 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:349:31: required from ‘void boost::detail::graph::brandes_betweenness_centrality_impl(const Graph&, CentralityMap, EdgeCentralityMap, IncomingMap, DistanceMap, DependencyMap, PathCountMap, VertexIndexMap, ShortestPaths) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >; CentralityMap = boost::vec_adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >, boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_centrality_t>; IncomingMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >*, std::vector<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >, std::allocator<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > > > > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>, std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >, std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >&>; DistanceMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>, double, double&>; DependencyMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>, double, double&>; PathCountMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>; ShortestPaths = brandes_dijkstra_shortest_paths<boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_weight_t> >]’
349 | shortest_paths(g, *s, ordered_vertices, incoming, distance,
| ~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
350 | path_count, vertex_index);
| ~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:434:55: required from ‘void boost::brandes_betweenness_centrality(const Graph&, CentralityMap, EdgeCentralityMap, IncomingMap, DistanceMap, DependencyMap, PathCountMap, VertexIndexMap, WeightMap, typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >; CentralityMap = vec_adj_list_vertex_property_map<adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >, adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >*, double, double&, vertex_centrality_t>; EdgeCentralityMap = adj_list_edge_property_map<undirected_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_centrality_t, double> >, edge_centrality_t>; IncomingMap = iterator_property_map<__gnu_cxx::__normal_iterator<std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<undirected_tag, long unsigned int> > >*, std::vector<std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<undirected_tag, long unsigned int> > >, std::allocator<std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<undirected_tag, long unsigned int> > > > > >, vec_adj_list_vertex_id_map<property<vertex_index_t, int, property<vertex_centrality_t, double> >, long unsigned int>, std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<undirected_tag, long unsigned int> > >, std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<undirected_tag, long unsigned int> > >&>; DistanceMap = iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > >, vec_adj_list_vertex_id_map<property<vertex_index_t, int, property<vertex_centrality_t, double> >, long unsigned int>, double, double&>; DependencyMap = iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > >, vec_adj_list_vertex_id_map<property<vertex_index_t, int, property<vertex_centrality_t, double> >, long unsigned int>, double, double&>; PathCountMap = iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > >, vec_adj_list_vertex_id_map<property<vertex_index_t, int, property<vertex_centrality_t, double> >, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = vec_adj_list_vertex_id_map<property<vertex_index_t, int, property<vertex_centrality_t, double> >, long unsigned int>; WeightMap = adj_list_edge_property_map<undirected_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_centrality_t, double> >, edge_weight_t>; typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits<Graph>::traversal_category = undir_adj_list_traversal_tag]’
434 | detail::graph::brandes_betweenness_centrality_impl(g, centrality,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~
435 | edge_centrality_map, incoming, distance, dependency, path_count,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
436 | vertex_index, shortest_paths);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:468:43: required from ‘void boost::detail::graph::brandes_betweenness_centrality_dispatch2(const Graph&, CentralityMap, EdgeCentralityMap, WeightMap, VertexIndexMap) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >; CentralityMap = boost::vec_adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >, boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_centrality_t>; WeightMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_weight_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>]’
468 | brandes_betweenness_centrality(g, centrality, edge_centrality_map,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
469 | make_iterator_property_map(incoming.begin(), vertex_index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
470 | make_iterator_property_map(distance.begin(), vertex_index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
471 | make_iterator_property_map(dependency.begin(), vertex_index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
472 | make_iterator_property_map(path_count.begin(), vertex_index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
473 | vertex_index, weight_map);
| ~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:517:57: required from ‘static void boost::detail::graph::brandes_betweenness_centrality_dispatch1<WeightMap>::run(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap, WeightMap) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >; CentralityMap = boost::vec_adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >, boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>; WeightMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_weight_t>]’
517 | brandes_betweenness_centrality_dispatch2(g, centrality,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~
518 | edge_centrality_map, weight_map, vertex_index);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:558:71: required from ‘void boost::brandes_betweenness_centrality(const Graph&, const bgl_named_params<T, Tag, Base>&, typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >; Param = adj_list_edge_property_map<undirected_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_centrality_t, double> >, edge_weight_t>; Tag = edge_weight_t; Rest = bgl_named_params<adj_list_edge_property_map<undirected_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_centrality_t, double> >, edge_centrality_t>, edge_centrality_t, bgl_named_params<vec_adj_list_vertex_property_map<adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >, adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >*, double, double&, vertex_centrality_t>, vertex_centrality_t, no_property> >; typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits<Graph>::traversal_category = undir_adj_list_traversal_tag]’
558 | detail::graph::brandes_betweenness_centrality_dispatch1< ew >::run(g,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
559 | choose_param(
| ~~~~~~~~~~~~~
560 | get_param(params, vertex_centrality), dummy_property_map()),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
561 | choose_param(get_param(params, edge_centrality), dummy_property_map()),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
562 | choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
563 | get_param(params, edge_weight));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
bbc.cpp:67:33: required from here
67 | brandes_betweenness_centrality(g,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
68 | centrality_map(get(vertex_centrality, g)).
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
69 | edge_centrality_map(get(edge_centrality, g)).
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
70 | weight_map(get(edge_weight, g)));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Comparable<long unsigned int*>]’
20 | ~usage_requirements() { ((Model*)0)->~Model(); }
| ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::RandomAccessIterator<long unsigned int*> >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:601:7: required from ‘struct boost::RandomAccessIterator<long unsigned int*>’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<long unsigned int*>’
597 | BOOST_concept(RandomAccessIterator,(TT))
| ^~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::RandomAccessIteratorConcept<long unsigned int*>]’
32 | inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
| ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied<boost::RandomAccessIteratorConcept<long unsigned int*> >::value’
44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied<boost::RandomAccessIteratorConcept<long unsigned int*> >’
45 | typedef boost::integral_constant<bool, value> type;
| ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 13 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:349:31: required from ‘void boost::detail::graph::brandes_betweenness_centrality_impl(const Graph&, CentralityMap, EdgeCentralityMap, IncomingMap, DistanceMap, DependencyMap, PathCountMap, VertexIndexMap, ShortestPaths) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >; CentralityMap = boost::vec_adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >, boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_centrality_t>; IncomingMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >*, std::vector<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >, std::allocator<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > > > > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>, std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >, std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >&>; DistanceMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>, double, double&>; DependencyMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>, double, double&>; PathCountMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>; ShortestPaths = brandes_dijkstra_shortest_paths<boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_weight_t> >]’
349 | shortest_paths(g, *s, ordered_vertices, incoming, distance,
| ~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
350 | path_count, vertex_index);
| ~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:434:55: required from ‘void boost::brandes_betweenness_centrality(const Graph&, CentralityMap, EdgeCentralityMap, IncomingMap, DistanceMap, DependencyMap, PathCountMap, VertexIndexMap, WeightMap, typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >; CentralityMap = vec_adj_list_vertex_property_map<adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >, adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >*, double, double&, vertex_centrality_t>; EdgeCentralityMap = adj_list_edge_property_map<undirected_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_centrality_t, double> >, edge_centrality_t>; IncomingMap = iterator_property_map<__gnu_cxx::__normal_iterator<std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<undirected_tag, long unsigned int> > >*, std::vector<std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<undirected_tag, long unsigned int> > >, std::allocator<std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<undirected_tag, long unsigned int> > > > > >, vec_adj_list_vertex_id_map<property<vertex_index_t, int, property<vertex_centrality_t, double> >, long unsigned int>, std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<undirected_tag, long unsigned int> > >, std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<undirected_tag, long unsigned int> > >&>; DistanceMap = iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > >, vec_adj_list_vertex_id_map<property<vertex_index_t, int, property<vertex_centrality_t, double> >, long unsigned int>, double, double&>; DependencyMap = iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > >, vec_adj_list_vertex_id_map<property<vertex_index_t, int, property<vertex_centrality_t, double> >, long unsigned int>, double, double&>; PathCountMap = iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > >, vec_adj_list_vertex_id_map<property<vertex_index_t, int, property<vertex_centrality_t, double> >, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = vec_adj_list_vertex_id_map<property<vertex_index_t, int, property<vertex_centrality_t, double> >, long unsigned int>; WeightMap = adj_list_edge_property_map<undirected_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_centrality_t, double> >, edge_weight_t>; typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits<Graph>::traversal_category = undir_adj_list_traversal_tag]’
434 | detail::graph::brandes_betweenness_centrality_impl(g, centrality,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~
435 | edge_centrality_map, incoming, distance, dependency, path_count,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
436 | vertex_index, shortest_paths);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:468:43: required from ‘void boost::detail::graph::brandes_betweenness_centrality_dispatch2(const Graph&, CentralityMap, EdgeCentralityMap, WeightMap, VertexIndexMap) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >; CentralityMap = boost::vec_adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >, boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_centrality_t>; WeightMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_weight_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>]’
468 | brandes_betweenness_centrality(g, centrality, edge_centrality_map,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
469 | make_iterator_property_map(incoming.begin(), vertex_index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
470 | make_iterator_property_map(distance.begin(), vertex_index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
471 | make_iterator_property_map(dependency.begin(), vertex_index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
472 | make_iterator_property_map(path_count.begin(), vertex_index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
473 | vertex_index, weight_map);
| ~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:517:57: required from ‘static void boost::detail::graph::brandes_betweenness_centrality_dispatch1<WeightMap>::run(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap, WeightMap) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >; CentralityMap = boost::vec_adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >, boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>; WeightMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_weight_t>]’
517 | brandes_betweenness_centrality_dispatch2(g, centrality,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~
518 | edge_centrality_map, weight_map, vertex_index);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:558:71: required from ‘void boost::brandes_betweenness_centrality(const Graph&, const bgl_named_params<T, Tag, Base>&, typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >; Param = adj_list_edge_property_map<undirected_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_centrality_t, double> >, edge_weight_t>; Tag = edge_weight_t; Rest = bgl_named_params<adj_list_edge_property_map<undirected_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_centrality_t, double> >, edge_centrality_t>, edge_centrality_t, bgl_named_params<vec_adj_list_vertex_property_map<adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >, adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >*, double, double&, vertex_centrality_t>, vertex_centrality_t, no_property> >; typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits<Graph>::traversal_category = undir_adj_list_traversal_tag]’
558 | detail::graph::brandes_betweenness_centrality_dispatch1< ew >::run(g,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
559 | choose_param(
| ~~~~~~~~~~~~~
560 | get_param(params, vertex_centrality), dummy_property_map()),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
561 | choose_param(get_param(params, edge_centrality), dummy_property_map()),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
562 | choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
563 | get_param(params, edge_weight));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
bbc.cpp:67:33: required from here
67 | brandes_betweenness_centrality(g,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
68 | centrality_map(get(vertex_centrality, g)).
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
69 | edge_centrality_map(get(edge_centrality, g)).
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
70 | weight_map(get(edge_weight, g)));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::RandomAccessIterator<long unsigned int*>]’
20 | ~usage_requirements() { ((Model*)0)->~Model(); }
| ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::RandomAccessIteratorConcept<long unsigned int*>]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map<RAIter, ID, typename std::iterator_traits< <template-parameter-1-1> >::value_type, typename std::iterator_traits< <template-parameter-1-1> >::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = long unsigned int*; ID = vec_adj_list_vertex_id_map<property<vertex_index_t, int, property<vertex_centrality_t, double> >, long unsigned int>; typename std::iterator_traits< <template-parameter-1-1> >::value_type = long unsigned int; typename std::iterator_traits< <template-parameter-1-1> >::reference = long unsigned int&]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dijkstra_shortest_paths.hpp:245:46: required from ‘static boost::detail::vertex_property_map_generator_helper<Graph, IndexMap, Value, true>::type boost::detail::vertex_property_map_generator_helper<Graph, IndexMap, Value, true>::build(const Graph&, const IndexMap&, boost::scoped_array<Value>&) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >; IndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>; Value = long unsigned int; type = boost::iterator_property_map<long unsigned int*, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>, long unsigned int, long unsigned int&>]’
245 | return make_iterator_property_map(array_holder.get(), index);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dijkstra_shortest_paths.hpp:273:33: required from ‘static boost::detail::vertex_property_map_generator<Graph, IndexMap, Value>::type boost::detail::vertex_property_map_generator<Graph, IndexMap, Value>::build(const Graph&, const IndexMap&, boost::scoped_array<Value>&) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >; IndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>; Value = long unsigned int; type = boost::iterator_property_map<long unsigned int*, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>, long unsigned int, long unsigned int&>]’
273 | return helper::build(g, index, array_holder);
| ~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dijkstra_shortest_paths.hpp:377:38: required from ‘void boost::dijkstra_shortest_paths_no_init(const Graph&, SourceInputIter, SourceInputIter, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistZero, DijkstraVisitor, ColorMap) [with Graph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >; SourceInputIter = long unsigned int*; DijkstraVisitor = detail::graph::brandes_dijkstra_visitor<const adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >, adj_list_edge_property_map<undirected_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_centrality_t, double> >, edge_weight_t>, iterator_property_map<__gnu_cxx::__normal_iterator<std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<undirected_tag, long unsigned int> > >*, std::vector<std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<undirected_tag, long unsigned int> > >, std::allocator<std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<undirected_tag, long unsigned int> > > > > >, vec_adj_list_vertex_id_map<property<vertex_index_t, int, property<vertex_centrality_t, double> >, long unsigned int>, std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<undirected_tag, long unsigned int> > >, std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<undirected_tag, long unsigned int> > >&>, iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > >, vec_adj_list_vertex_id_map<property<vertex_index_t, int, property<vertex_centrality_t, double> >, long unsigned int>, double, double&>, iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > >, vec_adj_list_vertex_id_map<property<vertex_index_t, int, property<vertex_centrality_t, double> >, long unsigned int>, long unsigned int, long unsigned int&> >; PredecessorMap = dummy_property_map; DistanceMap = iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > >, vec_adj_list_vertex_id_map<property<vertex_index_t, int, property<vertex_centrality_t, double> >, long unsigned int>, double, double&>; WeightMap = adj_list_edge_property_map<undirected_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_centrality_t, double> >, edge_weight_t>; IndexMap = vec_adj_list_vertex_id_map<property<vertex_index_t, int, property<vertex_centrality_t, double> >, long unsigned int>; Compare = std::less<double>; Combine = std::plus<double>; DistZero = double; ColorMap = two_bit_color_map<vec_adj_list_vertex_id_map<property<vertex_index_t, int, property<vertex_centrality_t, double> >, long unsigned int> >]’
377 | = IndexInHeapMapHelper::build(g, index_map, index_in_heap_map_holder);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dijkstra_shortest_paths.hpp:464:36: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, SourceInputIter, SourceInputIter, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistInf, DistZero, DijkstraVisitor, ColorMap) [with VertexListGraph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >; SourceInputIter = long unsigned int*; DijkstraVisitor = detail::graph::brandes_dijkstra_visitor<const adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >, adj_list_edge_property_map<undirected_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_centrality_t, double> >, edge_weight_t>, iterator_property_map<__gnu_cxx::__normal_iterator<std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<undirected_tag, long unsigned int> > >*, std::vector<std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<undirected_tag, long unsigned int> > >, std::allocator<std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<undirected_tag, long unsigned int> > > > > >, vec_adj_list_vertex_id_map<property<vertex_index_t, int, property<vertex_centrality_t, double> >, long unsigned int>, std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<undirected_tag, long unsigned int> > >, std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<undirected_tag, long unsigned int> > >&>, iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > >, vec_adj_list_vertex_id_map<property<vertex_index_t, int, property<vertex_centrality_t, double> >, long unsigned int>, double, double&>, iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > >, vec_adj_list_vertex_id_map<property<vertex_index_t, int, property<vertex_centrality_t, double> >, long unsigned int>, long unsigned int, long unsigned int&> >; PredecessorMap = dummy_property_map; DistanceMap = iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > >, vec_adj_list_vertex_id_map<property<vertex_index_t, int, property<vertex_centrality_t, double> >, long unsigned int>, double, double&>; WeightMap = adj_list_edge_property_map<undirected_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_centrality_t, double> >, edge_weight_t>; IndexMap = vec_adj_list_vertex_id_map<property<vertex_index_t, int, property<vertex_centrality_t, double> >, long unsigned int>; Compare = std::less<double>; Combine = std::plus<double>; DistInf = double; DistZero = double; ColorMap = two_bit_color_map<vec_adj_list_vertex_id_map<property<vertex_index_t, int, property<vertex_centrality_t, double> >, long unsigned int> >]’
464 | dijkstra_shortest_paths_no_init(g, s_begin, s_end, predecessor, distance,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
465 | weight, index_map, compare, combine, zero, vis, color);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dijkstra_shortest_paths.hpp:417:28: [ skipping 7 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:349:31: required from ‘void boost::detail::graph::brandes_betweenness_centrality_impl(const Graph&, CentralityMap, EdgeCentralityMap, IncomingMap, DistanceMap, DependencyMap, PathCountMap, VertexIndexMap, ShortestPaths) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >; CentralityMap = boost::vec_adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >, boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_centrality_t>; IncomingMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >*, std::vector<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >, std::allocator<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > > > > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>, std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >, std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >&>; DistanceMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>, double, double&>; DependencyMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>, double, double&>; PathCountMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>; ShortestPaths = brandes_dijkstra_shortest_paths<boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_weight_t> >]’
349 | shortest_paths(g, *s, ordered_vertices, incoming, distance,
| ~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
350 | path_count, vertex_index);
| ~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:434:55: required from ‘void boost::brandes_betweenness_centrality(const Graph&, CentralityMap, EdgeCentralityMap, IncomingMap, DistanceMap, DependencyMap, PathCountMap, VertexIndexMap, WeightMap, typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >; CentralityMap = vec_adj_list_vertex_property_map<adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >, adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >*, double, double&, vertex_centrality_t>; EdgeCentralityMap = adj_list_edge_property_map<undirected_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_centrality_t, double> >, edge_centrality_t>; IncomingMap = iterator_property_map<__gnu_cxx::__normal_iterator<std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<undirected_tag, long unsigned int> > >*, std::vector<std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<undirected_tag, long unsigned int> > >, std::allocator<std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<undirected_tag, long unsigned int> > > > > >, vec_adj_list_vertex_id_map<property<vertex_index_t, int, property<vertex_centrality_t, double> >, long unsigned int>, std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<undirected_tag, long unsigned int> > >, std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<undirected_tag, long unsigned int> > >&>; DistanceMap = iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > >, vec_adj_list_vertex_id_map<property<vertex_index_t, int, property<vertex_centrality_t, double> >, long unsigned int>, double, double&>; DependencyMap = iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > >, vec_adj_list_vertex_id_map<property<vertex_index_t, int, property<vertex_centrality_t, double> >, long unsigned int>, double, double&>; PathCountMap = iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > >, vec_adj_list_vertex_id_map<property<vertex_index_t, int, property<vertex_centrality_t, double> >, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = vec_adj_list_vertex_id_map<property<vertex_index_t, int, property<vertex_centrality_t, double> >, long unsigned int>; WeightMap = adj_list_edge_property_map<undirected_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_centrality_t, double> >, edge_weight_t>; typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits<Graph>::traversal_category = undir_adj_list_traversal_tag]’
434 | detail::graph::brandes_betweenness_centrality_impl(g, centrality,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~
435 | edge_centrality_map, incoming, distance, dependency, path_count,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
436 | vertex_index, shortest_paths);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:468:43: required from ‘void boost::detail::graph::brandes_betweenness_centrality_dispatch2(const Graph&, CentralityMap, EdgeCentralityMap, WeightMap, VertexIndexMap) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >; CentralityMap = boost::vec_adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >, boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_centrality_t>; WeightMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_weight_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>]’
468 | brandes_betweenness_centrality(g, centrality, edge_centrality_map,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
469 | make_iterator_property_map(incoming.begin(), vertex_index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
470 | make_iterator_property_map(distance.begin(), vertex_index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
471 | make_iterator_property_map(dependency.begin(), vertex_index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
472 | make_iterator_property_map(path_count.begin(), vertex_index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
473 | vertex_index, weight_map);
| ~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:517:57: required from ‘static void boost::detail::graph::brandes_betweenness_centrality_dispatch1<WeightMap>::run(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap, WeightMap) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >; CentralityMap = boost::vec_adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >, boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>; WeightMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_weight_t>]’
517 | brandes_betweenness_centrality_dispatch2(g, centrality,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~
518 | edge_centrality_map, weight_map, vertex_index);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:558:71: required from ‘void boost::brandes_betweenness_centrality(const Graph&, const bgl_named_params<T, Tag, Base>&, typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >; Param = adj_list_edge_property_map<undirected_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_centrality_t, double> >, edge_weight_t>; Tag = edge_weight_t; Rest = bgl_named_params<adj_list_edge_property_map<undirected_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_centrality_t, double> >, edge_centrality_t>, edge_centrality_t, bgl_named_params<vec_adj_list_vertex_property_map<adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >, adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >*, double, double&, vertex_centrality_t>, vertex_centrality_t, no_property> >; typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits<Graph>::traversal_category = undir_adj_list_traversal_tag]’
558 | detail::graph::brandes_betweenness_centrality_dispatch1< ew >::run(g,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
559 | choose_param(
| ~~~~~~~~~~~~~
560 | get_param(params, vertex_centrality), dummy_property_map()),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
561 | choose_param(get_param(params, edge_centrality), dummy_property_map()),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
562 | choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
563 | get_param(params, edge_weight));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
bbc.cpp:67:33: required from here
67 | brandes_betweenness_centrality(g,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
68 | centrality_map(get(vertex_centrality, g)).
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
69 | edge_centrality_map(get(edge_centrality, g)).
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
70 | weight_map(get(edge_weight, g)));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:17: note: in a call to non-static member function ‘boost::RandomAccessIteratorConcept<long unsigned int*>::~RandomAccessIteratorConcept()’
597 | BOOST_concept(RandomAccessIterator,(TT))
| ^~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/preprocessor/cat.hpp:29:34: note: in definition of macro ‘BOOST_PP_CAT_I’
29 | # define BOOST_PP_CAT_I(a, b) a ## b
| ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/concept_def.hpp:23:12: note: in expansion of macro ‘BOOST_PP_CAT’
23 | struct BOOST_PP_CAT(name,Concept) \
| ^~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3: note: in expansion of macro ‘BOOST_concept’
597 | BOOST_concept(RandomAccessIterator,(TT))
| ^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::CopyConstructible<boost::detail::dijkstra_bfs_visitor<boost::detail::graph::brandes_dijkstra_visitor<const boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >, boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_weight_t>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >*, std::vector<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >, std::allocator<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > > > > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>, std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >, std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>, double, double&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>, long unsigned int, long unsigned int&> >, boost::d_ary_heap_indirect<long unsigned int, 4, boost::iterator_property_map<long unsigned int*, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>, double, double&>, std::less<double>, std::vector<long unsigned int, std::allocator<long unsigned int> > >, boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_weight_t>, boost::dummy_property_map, boost::iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>, double, double&>, std::plus<double>, std::less<double> > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::CopyConstructible<boost::detail::dijkstra_bfs_visitor<boost::detail::graph::brandes_dijkstra_visitor<const boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >, boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_weight_t>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >*, std::vector<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >, std::allocator<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > > > > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>, std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >, std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>, double, double&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>, long unsigned int, long unsigned int&> >, boost::d_ary_heap_indirect<long unsigned int, 4, boost::iterator_property_map<long unsigned int*, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>, double, double&>, std::less<double>, std::vector<long unsigned int, std::allocator<long unsigned int> > >, boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_weight_t>, boost::dummy_property_map, boost::iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>, double, double&>, std::plus<double>, std::less<double> > > >]’
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:167:5: required from ‘struct boost::CopyConstructible<boost::detail::dijkstra_bfs_visitor<boost::detail::graph::brandes_dijkstra_visitor<const boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >, boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_weight_t>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >*, std::vector<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >, std::allocator<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > > > > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>, std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >, std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>, double, double&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>, long unsigned int, long unsigned int&> >, boost::d_ary_heap_indirect<long unsigned int, 4, boost::iterator_property_map<long unsigned int*, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>, double, double&>, std::less<double>, std::vector<long unsigned int, std::allocator<long unsigned int> > >, boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_weight_t>, boost::dummy_property_map, boost::iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>, double, double&>, std::plus<double>, std::less<double> > >’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:165:3: required from ‘struct boost::CopyConstructibleConcept<boost::detail::dijkstra_bfs_visitor<boost::detail::graph::brandes_dijkstra_visitor<const boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >, boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_weight_t>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >*, std::vector<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >, std::allocator<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > > > > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>, std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >, std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>, double, double&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>, long unsigned int, long unsigned int&> >, boost::d_ary_heap_indirect<long unsigned int, 4, boost::iterator_property_map<long unsigned int*, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>, double, double&>, std::less<double>, std::vector<long unsigned int, std::allocator<long unsigned int> > >, boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_weight_t>, boost::dummy_property_map, boost::iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>, double, double&>, std::plus<double>, std::less<double> > >’
165 | BOOST_concept(CopyConstructible,(TT))
| ^~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::CopyConstructibleConcept<boost::detail::dijkstra_bfs_visitor<boost::detail::graph::brandes_dijkstra_visitor<const boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >, boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_weight_t>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >*, std::vector<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >, std::allocator<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > > > > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>, std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >, std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>, double, double&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>, long unsigned int, long unsigned int&> >, boost::d_ary_heap_indirect<long unsigned int, 4, boost::iterator_property_map<long unsigned int*, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>, double, double&>, std::less<double>, std::vector<long unsigned int, std::allocator<long unsigned int> > >, boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_weight_t>, boost::dummy_property_map, boost::iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>, double, double&>, std::plus<double>, std::less<double> > >]’
32 | inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
| ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied<boost::CopyConstructibleConcept<boost::detail::dijkstra_bfs_visitor<boost::detail::graph::brandes_dijkstra_visitor<const boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >, boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_weight_t>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >*, std::vector<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >, std::allocator<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > > > > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>, std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >, std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>, double, double&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>, long unsigned int, long unsigned int&> >, boost::d_ary_heap_indirect<long unsigned int, 4, boost::iterator_property_map<long unsigned int*, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>, double, double&>, std::less<double>, std::vector<long unsigned int, std::allocator<long unsigned int> > >, boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_weight_t>, boost::dummy_property_map, boost::iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>, double, double&>, std::plus<double>, std::less<double> > > >::value’
44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 17 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:349:31: required from ‘void boost::detail::graph::brandes_betweenness_centrality_impl(const Graph&, CentralityMap, EdgeCentralityMap, IncomingMap, DistanceMap, DependencyMap, PathCountMap, VertexIndexMap, ShortestPaths) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >; CentralityMap = boost::vec_adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >, boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_centrality_t>; IncomingMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >*, std::vector<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >, std::allocator<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > > > > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>, std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >, std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >&>; DistanceMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>, double, double&>; DependencyMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>, double, double&>; PathCountMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>; ShortestPaths = brandes_dijkstra_shortest_paths<boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_weight_t> >]’
349 | shortest_paths(g, *s, ordered_vertices, incoming, distance,
| ~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
350 | path_count, vertex_index);
| ~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:434:55: required from ‘void boost::brandes_betweenness_centrality(const Graph&, CentralityMap, EdgeCentralityMap, IncomingMap, DistanceMap, DependencyMap, PathCountMap, VertexIndexMap, WeightMap, typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >; CentralityMap = vec_adj_list_vertex_property_map<adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >, adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >*, double, double&, vertex_centrality_t>; EdgeCentralityMap = adj_list_edge_property_map<undirected_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_centrality_t, double> >, edge_centrality_t>; IncomingMap = iterator_property_map<__gnu_cxx::__normal_iterator<std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<undirected_tag, long unsigned int> > >*, std::vector<std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<undirected_tag, long unsigned int> > >, std::allocator<std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<undirected_tag, long unsigned int> > > > > >, vec_adj_list_vertex_id_map<property<vertex_index_t, int, property<vertex_centrality_t, double> >, long unsigned int>, std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<undirected_tag, long unsigned int> > >, std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<undirected_tag, long unsigned int> > >&>; DistanceMap = iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > >, vec_adj_list_vertex_id_map<property<vertex_index_t, int, property<vertex_centrality_t, double> >, long unsigned int>, double, double&>; DependencyMap = iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > >, vec_adj_list_vertex_id_map<property<vertex_index_t, int, property<vertex_centrality_t, double> >, long unsigned int>, double, double&>; PathCountMap = iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > >, vec_adj_list_vertex_id_map<property<vertex_index_t, int, property<vertex_centrality_t, double> >, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = vec_adj_list_vertex_id_map<property<vertex_index_t, int, property<vertex_centrality_t, double> >, long unsigned int>; WeightMap = adj_list_edge_property_map<undirected_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_centrality_t, double> >, edge_weight_t>; typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits<Graph>::traversal_category = undir_adj_list_traversal_tag]’
434 | detail::graph::brandes_betweenness_centrality_impl(g, centrality,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~
435 | edge_centrality_map, incoming, distance, dependency, path_count,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
436 | vertex_index, shortest_paths);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:468:43: required from ‘void boost::detail::graph::brandes_betweenness_centrality_dispatch2(const Graph&, CentralityMap, EdgeCentralityMap, WeightMap, VertexIndexMap) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >; CentralityMap = boost::vec_adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >, boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_centrality_t>; WeightMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_weight_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>]’
468 | brandes_betweenness_centrality(g, centrality, edge_centrality_map,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
469 | make_iterator_property_map(incoming.begin(), vertex_index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
470 | make_iterator_property_map(distance.begin(), vertex_index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
471 | make_iterator_property_map(dependency.begin(), vertex_index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
472 | make_iterator_property_map(path_count.begin(), vertex_index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
473 | vertex_index, weight_map);
| ~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:517:57: required from ‘static void boost::detail::graph::brandes_betweenness_centrality_dispatch1<WeightMap>::run(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap, WeightMap) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >; CentralityMap = boost::vec_adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >, boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>; WeightMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_weight_t>]’
517 | brandes_betweenness_centrality_dispatch2(g, centrality,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~
518 | edge_centrality_map, weight_map, vertex_index);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:558:71: required from ‘void boost::brandes_betweenness_centrality(const Graph&, const bgl_named_params<T, Tag, Base>&, typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >; Param = adj_list_edge_property_map<undirected_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_centrality_t, double> >, edge_weight_t>; Tag = edge_weight_t; Rest = bgl_named_params<adj_list_edge_property_map<undirected_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_centrality_t, double> >, edge_centrality_t>, edge_centrality_t, bgl_named_params<vec_adj_list_vertex_property_map<adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >, adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >*, double, double&, vertex_centrality_t>, vertex_centrality_t, no_property> >; typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits<Graph>::traversal_category = undir_adj_list_traversal_tag]’
558 | detail::graph::brandes_betweenness_centrality_dispatch1< ew >::run(g,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
559 | choose_param(
| ~~~~~~~~~~~~~
560 | get_param(params, vertex_centrality), dummy_property_map()),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
561 | choose_param(get_param(params, edge_centrality), dummy_property_map()),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
562 | choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
563 | get_param(params, edge_weight));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
bbc.cpp:67:33: required from here
67 | brandes_betweenness_centrality(g,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
68 | centrality_map(get(vertex_centrality, g)).
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
69 | edge_centrality_map(get(edge_centrality, g)).
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
70 | weight_map(get(edge_weight, g)));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
20 | ~usage_requirements() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::CopyConstructible<TT>::~CopyConstructible() [with TT = boost::detail::dijkstra_bfs_visitor<boost::detail::graph::brandes_dijkstra_visitor<const boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >, boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_weight_t>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >*, std::vector<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >, std::allocator<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > > > > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>, std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >, std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>, double, double&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>, long unsigned int, long unsigned int&> >, boost::d_ary_heap_indirect<long unsigned int, 4, boost::iterator_property_map<long unsigned int*, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>, double, double&>, std::less<double>, std::vector<long unsigned int, std::allocator<long unsigned int> > >, boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_weight_t>, boost::dummy_property_map, boost::iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>, double, double&>, std::plus<double>, std::less<double> >]’
37 | ~model()
| ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:167:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
167 | BOOST_CONCEPT_USAGE(CopyConstructible) {
| ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Convertible<boost::read_write_property_map_tag, boost::readable_property_map_tag> >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible<boost::read_write_property_map_tag, boost::readable_property_map_tag>’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:206:3: required from ‘struct boost::ConvertibleConcept<boost::read_write_property_map_tag, boost::readable_property_map_tag>’
206 | BOOST_concept(Convertible,(X)(Y))
| ^~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::ConvertibleConcept<boost::read_write_property_map_tag, boost::readable_property_map_tag>]’
32 | inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
| ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied<boost::ConvertibleConcept<boost::read_write_property_map_tag, boost::readable_property_map_tag> >::value’
44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied<boost::ConvertibleConcept<boost::read_write_property_map_tag, boost::readable_property_map_tag> >’
45 | typedef boost::integral_constant<bool, value> type;
| ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 21 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:349:31: required from ‘void boost::detail::graph::brandes_betweenness_centrality_impl(const Graph&, CentralityMap, EdgeCentralityMap, IncomingMap, DistanceMap, DependencyMap, PathCountMap, VertexIndexMap, ShortestPaths) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >; CentralityMap = boost::vec_adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >, boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_centrality_t>; IncomingMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >*, std::vector<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >, std::allocator<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > > > > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>, std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >, std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >&>; DistanceMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>, double, double&>; DependencyMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>, double, double&>; PathCountMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>; ShortestPaths = brandes_dijkstra_shortest_paths<boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_weight_t> >]’
349 | shortest_paths(g, *s, ordered_vertices, incoming, distance,
| ~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
350 | path_count, vertex_index);
| ~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:434:55: required from ‘void boost::brandes_betweenness_centrality(const Graph&, CentralityMap, EdgeCentralityMap, IncomingMap, DistanceMap, DependencyMap, PathCountMap, VertexIndexMap, WeightMap, typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >; CentralityMap = vec_adj_list_vertex_property_map<adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >, adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >*, double, double&, vertex_centrality_t>; EdgeCentralityMap = adj_list_edge_property_map<undirected_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_centrality_t, double> >, edge_centrality_t>; IncomingMap = iterator_property_map<__gnu_cxx::__normal_iterator<std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<undirected_tag, long unsigned int> > >*, std::vector<std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<undirected_tag, long unsigned int> > >, std::allocator<std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<undirected_tag, long unsigned int> > > > > >, vec_adj_list_vertex_id_map<property<vertex_index_t, int, property<vertex_centrality_t, double> >, long unsigned int>, std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<undirected_tag, long unsigned int> > >, std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<undirected_tag, long unsigned int> > >&>; DistanceMap = iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > >, vec_adj_list_vertex_id_map<property<vertex_index_t, int, property<vertex_centrality_t, double> >, long unsigned int>, double, double&>; DependencyMap = iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > >, vec_adj_list_vertex_id_map<property<vertex_index_t, int, property<vertex_centrality_t, double> >, long unsigned int>, double, double&>; PathCountMap = iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > >, vec_adj_list_vertex_id_map<property<vertex_index_t, int, property<vertex_centrality_t, double> >, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = vec_adj_list_vertex_id_map<property<vertex_index_t, int, property<vertex_centrality_t, double> >, long unsigned int>; WeightMap = adj_list_edge_property_map<undirected_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_centrality_t, double> >, edge_weight_t>; typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits<Graph>::traversal_category = undir_adj_list_traversal_tag]’
434 | detail::graph::brandes_betweenness_centrality_impl(g, centrality,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~
435 | edge_centrality_map, incoming, distance, dependency, path_count,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
436 | vertex_index, shortest_paths);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:468:43: required from ‘void boost::detail::graph::brandes_betweenness_centrality_dispatch2(const Graph&, CentralityMap, EdgeCentralityMap, WeightMap, VertexIndexMap) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >; CentralityMap = boost::vec_adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >, boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_centrality_t>; WeightMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_weight_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>]’
468 | brandes_betweenness_centrality(g, centrality, edge_centrality_map,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
469 | make_iterator_property_map(incoming.begin(), vertex_index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
470 | make_iterator_property_map(distance.begin(), vertex_index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
471 | make_iterator_property_map(dependency.begin(), vertex_index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
472 | make_iterator_property_map(path_count.begin(), vertex_index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
473 | vertex_index, weight_map);
| ~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:517:57: required from ‘static void boost::detail::graph::brandes_betweenness_centrality_dispatch1<WeightMap>::run(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap, WeightMap) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >; CentralityMap = boost::vec_adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >, boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>; WeightMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_weight_t>]’
517 | brandes_betweenness_centrality_dispatch2(g, centrality,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~
518 | edge_centrality_map, weight_map, vertex_index);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:558:71: required from ‘void boost::brandes_betweenness_centrality(const Graph&, const bgl_named_params<T, Tag, Base>&, typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >; Param = adj_list_edge_property_map<undirected_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_centrality_t, double> >, edge_weight_t>; Tag = edge_weight_t; Rest = bgl_named_params<adj_list_edge_property_map<undirected_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_centrality_t, double> >, edge_centrality_t>, edge_centrality_t, bgl_named_params<vec_adj_list_vertex_property_map<adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >, adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >*, double, double&, vertex_centrality_t>, vertex_centrality_t, no_property> >; typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits<Graph>::traversal_category = undir_adj_list_traversal_tag]’
558 | detail::graph::brandes_betweenness_centrality_dispatch1< ew >::run(g,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
559 | choose_param(
| ~~~~~~~~~~~~~
560 | get_param(params, vertex_centrality), dummy_property_map()),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
561 | choose_param(get_param(params, edge_centrality), dummy_property_map()),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
562 | choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
563 | get_param(params, edge_weight));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
bbc.cpp:67:33: required from here
67 | brandes_betweenness_centrality(g,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
68 | centrality_map(get(vertex_centrality, g)).
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
69 | edge_centrality_map(get(edge_centrality, g)).
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
70 | weight_map(get(edge_weight, g)));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Convertible<boost::read_write_property_map_tag, boost::readable_property_map_tag>]’
20 | ~usage_requirements() { ((Model*)0)->~Model(); }
| ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::ConvertibleConcept<boost::read_write_property_map_tag, boost::readable_property_map_tag>]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:148:7: required from ‘void boost::ReadablePropertyMapConcept<PMap, Key>::constraints() [with PMap = boost::two_bit_color_map<boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int> >; Key = long unsigned int]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::ReadablePropertyMapConcept<boost::two_bit_color_map<boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int> >, long unsigned int>]’
32 | inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
| ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied<boost::ReadablePropertyMapConcept<boost::two_bit_color_map<boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int> >, long unsigned int> >::value’
44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied<boost::ReadablePropertyMapConcept<boost::two_bit_color_map<boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int> >, long unsigned int> >’
45 | typedef boost::integral_constant<bool, value> type;
| ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_<void (*)(boost::ReadablePropertyMapConcept<boost::two_bit_color_map<boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int> >, long unsigned int>)>’
72 | struct requirement_<void(*)(Model)>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:206:7: [ skipping 15 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:349:31: required from ‘void boost::detail::graph::brandes_betweenness_centrality_impl(const Graph&, CentralityMap, EdgeCentralityMap, IncomingMap, DistanceMap, DependencyMap, PathCountMap, VertexIndexMap, ShortestPaths) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >; CentralityMap = boost::vec_adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >, boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_centrality_t>; IncomingMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >*, std::vector<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >, std::allocator<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > > > > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>, std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >, std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >&>; DistanceMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>, double, double&>; DependencyMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>, double, double&>; PathCountMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>; ShortestPaths = brandes_dijkstra_shortest_paths<boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_weight_t> >]’
349 | shortest_paths(g, *s, ordered_vertices, incoming, distance,
| ~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
350 | path_count, vertex_index);
| ~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:434:55: required from ‘void boost::brandes_betweenness_centrality(const Graph&, CentralityMap, EdgeCentralityMap, IncomingMap, DistanceMap, DependencyMap, PathCountMap, VertexIndexMap, WeightMap, typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >; CentralityMap = vec_adj_list_vertex_property_map<adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >, adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >*, double, double&, vertex_centrality_t>; EdgeCentralityMap = adj_list_edge_property_map<undirected_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_centrality_t, double> >, edge_centrality_t>; IncomingMap = iterator_property_map<__gnu_cxx::__normal_iterator<std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<undirected_tag, long unsigned int> > >*, std::vector<std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<undirected_tag, long unsigned int> > >, std::allocator<std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<undirected_tag, long unsigned int> > > > > >, vec_adj_list_vertex_id_map<property<vertex_index_t, int, property<vertex_centrality_t, double> >, long unsigned int>, std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<undirected_tag, long unsigned int> > >, std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<undirected_tag, long unsigned int> > >&>; DistanceMap = iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > >, vec_adj_list_vertex_id_map<property<vertex_index_t, int, property<vertex_centrality_t, double> >, long unsigned int>, double, double&>; DependencyMap = iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > >, vec_adj_list_vertex_id_map<property<vertex_index_t, int, property<vertex_centrality_t, double> >, long unsigned int>, double, double&>; PathCountMap = iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > >, vec_adj_list_vertex_id_map<property<vertex_index_t, int, property<vertex_centrality_t, double> >, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = vec_adj_list_vertex_id_map<property<vertex_index_t, int, property<vertex_centrality_t, double> >, long unsigned int>; WeightMap = adj_list_edge_property_map<undirected_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_centrality_t, double> >, edge_weight_t>; typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits<Graph>::traversal_category = undir_adj_list_traversal_tag]’
434 | detail::graph::brandes_betweenness_centrality_impl(g, centrality,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~
435 | edge_centrality_map, incoming, distance, dependency, path_count,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
436 | vertex_index, shortest_paths);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:468:43: required from ‘void boost::detail::graph::brandes_betweenness_centrality_dispatch2(const Graph&, CentralityMap, EdgeCentralityMap, WeightMap, VertexIndexMap) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >; CentralityMap = boost::vec_adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >, boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_centrality_t>; WeightMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_weight_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>]’
468 | brandes_betweenness_centrality(g, centrality, edge_centrality_map,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
469 | make_iterator_property_map(incoming.begin(), vertex_index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
470 | make_iterator_property_map(distance.begin(), vertex_index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
471 | make_iterator_property_map(dependency.begin(), vertex_index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
472 | make_iterator_property_map(path_count.begin(), vertex_index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
473 | vertex_index, weight_map);
| ~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:517:57: required from ‘static void boost::detail::graph::brandes_betweenness_centrality_dispatch1<WeightMap>::run(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap, WeightMap) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >; CentralityMap = boost::vec_adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >, boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>; WeightMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_weight_t>]’
517 | brandes_betweenness_centrality_dispatch2(g, centrality,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~
518 | edge_centrality_map, weight_map, vertex_index);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:558:71: required from ‘void boost::brandes_betweenness_centrality(const Graph&, const bgl_named_params<T, Tag, Base>&, typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >; Param = adj_list_edge_property_map<undirected_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_centrality_t, double> >, edge_weight_t>; Tag = edge_weight_t; Rest = bgl_named_params<adj_list_edge_property_map<undirected_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_centrality_t, double> >, edge_centrality_t>, edge_centrality_t, bgl_named_params<vec_adj_list_vertex_property_map<adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >, adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >*, double, double&, vertex_centrality_t>, vertex_centrality_t, no_property> >; typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits<Graph>::traversal_category = undir_adj_list_traversal_tag]’
558 | detail::graph::brandes_betweenness_centrality_dispatch1< ew >::run(g,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
559 | choose_param(
| ~~~~~~~~~~~~~
560 | get_param(params, vertex_centrality), dummy_property_map()),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
561 | choose_param(get_param(params, edge_centrality), dummy_property_map()),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
562 | choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
563 | get_param(params, edge_weight));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
bbc.cpp:67:33: required from here
67 | brandes_betweenness_centrality(g,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
68 | centrality_map(get(vertex_centrality, g)).
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
69 | edge_centrality_map(get(edge_centrality, g)).
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
70 | weight_map(get(edge_weight, g)));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:206:17: note: in a call to non-static member function ‘boost::ConvertibleConcept<boost::read_write_property_map_tag, boost::readable_property_map_tag>::~ConvertibleConcept()’
206 | BOOST_concept(Convertible,(X)(Y))
| ^~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/preprocessor/cat.hpp:29:34: note: in definition of macro ‘BOOST_PP_CAT_I’
29 | # define BOOST_PP_CAT_I(a, b) a ## b
| ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/concept_def.hpp:23:12: note: in expansion of macro ‘BOOST_PP_CAT’
23 | struct BOOST_PP_CAT(name,Concept) \
| ^~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:206:3: note: in expansion of macro ‘BOOST_concept’
206 | BOOST_concept(Convertible,(X)(Y))
| ^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Convertible<boost::read_write_property_map_tag, boost::writable_property_map_tag> >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible<boost::read_write_property_map_tag, boost::writable_property_map_tag>’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:206:3: required from ‘struct boost::ConvertibleConcept<boost::read_write_property_map_tag, boost::writable_property_map_tag>’
206 | BOOST_concept(Convertible,(X)(Y))
| ^~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::ConvertibleConcept<boost::read_write_property_map_tag, boost::writable_property_map_tag>]’
32 | inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
| ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied<boost::ConvertibleConcept<boost::read_write_property_map_tag, boost::writable_property_map_tag> >::value’
44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied<boost::ConvertibleConcept<boost::read_write_property_map_tag, boost::writable_property_map_tag> >’
45 | typedef boost::integral_constant<bool, value> type;
| ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 21 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:349:31: required from ‘void boost::detail::graph::brandes_betweenness_centrality_impl(const Graph&, CentralityMap, EdgeCentralityMap, IncomingMap, DistanceMap, DependencyMap, PathCountMap, VertexIndexMap, ShortestPaths) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >; CentralityMap = boost::vec_adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >, boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_centrality_t>; IncomingMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >*, std::vector<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >, std::allocator<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > > > > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>, std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >, std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >&>; DistanceMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>, double, double&>; DependencyMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>, double, double&>; PathCountMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>; ShortestPaths = brandes_dijkstra_shortest_paths<boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_weight_t> >]’
349 | shortest_paths(g, *s, ordered_vertices, incoming, distance,
| ~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
350 | path_count, vertex_index);
| ~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:434:55: required from ‘void boost::brandes_betweenness_centrality(const Graph&, CentralityMap, EdgeCentralityMap, IncomingMap, DistanceMap, DependencyMap, PathCountMap, VertexIndexMap, WeightMap, typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >; CentralityMap = vec_adj_list_vertex_property_map<adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >, adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >*, double, double&, vertex_centrality_t>; EdgeCentralityMap = adj_list_edge_property_map<undirected_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_centrality_t, double> >, edge_centrality_t>; IncomingMap = iterator_property_map<__gnu_cxx::__normal_iterator<std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<undirected_tag, long unsigned int> > >*, std::vector<std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<undirected_tag, long unsigned int> > >, std::allocator<std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<undirected_tag, long unsigned int> > > > > >, vec_adj_list_vertex_id_map<property<vertex_index_t, int, property<vertex_centrality_t, double> >, long unsigned int>, std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<undirected_tag, long unsigned int> > >, std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<undirected_tag, long unsigned int> > >&>; DistanceMap = iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > >, vec_adj_list_vertex_id_map<property<vertex_index_t, int, property<vertex_centrality_t, double> >, long unsigned int>, double, double&>; DependencyMap = iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > >, vec_adj_list_vertex_id_map<property<vertex_index_t, int, property<vertex_centrality_t, double> >, long unsigned int>, double, double&>; PathCountMap = iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > >, vec_adj_list_vertex_id_map<property<vertex_index_t, int, property<vertex_centrality_t, double> >, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = vec_adj_list_vertex_id_map<property<vertex_index_t, int, property<vertex_centrality_t, double> >, long unsigned int>; WeightMap = adj_list_edge_property_map<undirected_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_centrality_t, double> >, edge_weight_t>; typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits<Graph>::traversal_category = undir_adj_list_traversal_tag]’
434 | detail::graph::brandes_betweenness_centrality_impl(g, centrality,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~
435 | edge_centrality_map, incoming, distance, dependency, path_count,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
436 | vertex_index, shortest_paths);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:468:43: required from ‘void boost::detail::graph::brandes_betweenness_centrality_dispatch2(const Graph&, CentralityMap, EdgeCentralityMap, WeightMap, VertexIndexMap) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >; CentralityMap = boost::vec_adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >, boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_centrality_t>; WeightMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_weight_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>]’
468 | brandes_betweenness_centrality(g, centrality, edge_centrality_map,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
469 | make_iterator_property_map(incoming.begin(), vertex_index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
470 | make_iterator_property_map(distance.begin(), vertex_index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
471 | make_iterator_property_map(dependency.begin(), vertex_index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
472 | make_iterator_property_map(path_count.begin(), vertex_index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
473 | vertex_index, weight_map);
| ~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:517:57: required from ‘static void boost::detail::graph::brandes_betweenness_centrality_dispatch1<WeightMap>::run(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap, WeightMap) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >; CentralityMap = boost::vec_adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >, boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>; WeightMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_weight_t>]’
517 | brandes_betweenness_centrality_dispatch2(g, centrality,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~
518 | edge_centrality_map, weight_map, vertex_index);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:558:71: required from ‘void boost::brandes_betweenness_centrality(const Graph&, const bgl_named_params<T, Tag, Base>&, typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >; Param = adj_list_edge_property_map<undirected_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_centrality_t, double> >, edge_weight_t>; Tag = edge_weight_t; Rest = bgl_named_params<adj_list_edge_property_map<undirected_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_centrality_t, double> >, edge_centrality_t>, edge_centrality_t, bgl_named_params<vec_adj_list_vertex_property_map<adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >, adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >*, double, double&, vertex_centrality_t>, vertex_centrality_t, no_property> >; typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits<Graph>::traversal_category = undir_adj_list_traversal_tag]’
558 | detail::graph::brandes_betweenness_centrality_dispatch1< ew >::run(g,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
559 | choose_param(
| ~~~~~~~~~~~~~
560 | get_param(params, vertex_centrality), dummy_property_map()),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
561 | choose_param(get_param(params, edge_centrality), dummy_property_map()),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
562 | choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
563 | get_param(params, edge_weight));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
bbc.cpp:67:33: required from here
67 | brandes_betweenness_centrality(g,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
68 | centrality_map(get(vertex_centrality, g)).
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
69 | edge_centrality_map(get(edge_centrality, g)).
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
70 | weight_map(get(edge_weight, g)));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Convertible<boost::read_write_property_map_tag, boost::writable_property_map_tag>]’
20 | ~usage_requirements() { ((Model*)0)->~Model(); }
| ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::ConvertibleConcept<boost::read_write_property_map_tag, boost::writable_property_map_tag>]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:180:7: required from ‘void boost::WritablePropertyMapConcept<PMap, Key>::constraints() [with PMap = boost::two_bit_color_map<boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int> >; Key = long unsigned int]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::WritablePropertyMapConcept<boost::two_bit_color_map<boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int> >, long unsigned int>]’
32 | inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
| ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied<boost::WritablePropertyMapConcept<boost::two_bit_color_map<boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int> >, long unsigned int> >::value’
44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied<boost::WritablePropertyMapConcept<boost::two_bit_color_map<boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int> >, long unsigned int> >’
45 | typedef boost::integral_constant<bool, value> type;
| ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_<void (*)(boost::WritablePropertyMapConcept<boost::two_bit_color_map<boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int> >, long unsigned int>)>’
72 | struct requirement_<void(*)(Model)>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:207:7: [ skipping 15 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:349:31: required from ‘void boost::detail::graph::brandes_betweenness_centrality_impl(const Graph&, CentralityMap, EdgeCentralityMap, IncomingMap, DistanceMap, DependencyMap, PathCountMap, VertexIndexMap, ShortestPaths) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >; CentralityMap = boost::vec_adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >, boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_centrality_t>; IncomingMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >*, std::vector<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >, std::allocator<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > > > > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>, std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >, std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >&>; DistanceMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>, double, double&>; DependencyMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>, double, double&>; PathCountMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>; ShortestPaths = brandes_dijkstra_shortest_paths<boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_weight_t> >]’
349 | shortest_paths(g, *s, ordered_vertices, incoming, distance,
| ~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
350 | path_count, vertex_index);
| ~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:434:55: required from ‘void boost::brandes_betweenness_centrality(const Graph&, CentralityMap, EdgeCentralityMap, IncomingMap, DistanceMap, DependencyMap, PathCountMap, VertexIndexMap, WeightMap, typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >; CentralityMap = vec_adj_list_vertex_property_map<adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >, adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >*, double, double&, vertex_centrality_t>; EdgeCentralityMap = adj_list_edge_property_map<undirected_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_centrality_t, double> >, edge_centrality_t>; IncomingMap = iterator_property_map<__gnu_cxx::__normal_iterator<std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<undirected_tag, long unsigned int> > >*, std::vector<std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<undirected_tag, long unsigned int> > >, std::allocator<std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<undirected_tag, long unsigned int> > > > > >, vec_adj_list_vertex_id_map<property<vertex_index_t, int, property<vertex_centrality_t, double> >, long unsigned int>, std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<undirected_tag, long unsigned int> > >, std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<undirected_tag, long unsigned int> > >&>; DistanceMap = iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > >, vec_adj_list_vertex_id_map<property<vertex_index_t, int, property<vertex_centrality_t, double> >, long unsigned int>, double, double&>; DependencyMap = iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > >, vec_adj_list_vertex_id_map<property<vertex_index_t, int, property<vertex_centrality_t, double> >, long unsigned int>, double, double&>; PathCountMap = iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > >, vec_adj_list_vertex_id_map<property<vertex_index_t, int, property<vertex_centrality_t, double> >, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = vec_adj_list_vertex_id_map<property<vertex_index_t, int, property<vertex_centrality_t, double> >, long unsigned int>; WeightMap = adj_list_edge_property_map<undirected_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_centrality_t, double> >, edge_weight_t>; typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits<Graph>::traversal_category = undir_adj_list_traversal_tag]’
434 | detail::graph::brandes_betweenness_centrality_impl(g, centrality,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~
435 | edge_centrality_map, incoming, distance, dependency, path_count,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
436 | vertex_index, shortest_paths);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:468:43: required from ‘void boost::detail::graph::brandes_betweenness_centrality_dispatch2(const Graph&, CentralityMap, EdgeCentralityMap, WeightMap, VertexIndexMap) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >; CentralityMap = boost::vec_adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >, boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_centrality_t>; WeightMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_weight_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>]’
468 | brandes_betweenness_centrality(g, centrality, edge_centrality_map,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
469 | make_iterator_property_map(incoming.begin(), vertex_index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
470 | make_iterator_property_map(distance.begin(), vertex_index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
471 | make_iterator_property_map(dependency.begin(), vertex_index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
472 | make_iterator_property_map(path_count.begin(), vertex_index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
473 | vertex_index, weight_map);
| ~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:517:57: required from ‘static void boost::detail::graph::brandes_betweenness_centrality_dispatch1<WeightMap>::run(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap, WeightMap) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >; CentralityMap = boost::vec_adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >, boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>; WeightMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_weight_t>]’
517 | brandes_betweenness_centrality_dispatch2(g, centrality,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~
518 | edge_centrality_map, weight_map, vertex_index);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:558:71: required from ‘void boost::brandes_betweenness_centrality(const Graph&, const bgl_named_params<T, Tag, Base>&, typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >; Param = adj_list_edge_property_map<undirected_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_centrality_t, double> >, edge_weight_t>; Tag = edge_weight_t; Rest = bgl_named_params<adj_list_edge_property_map<undirected_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_centrality_t, double> >, edge_centrality_t>, edge_centrality_t, bgl_named_params<vec_adj_list_vertex_property_map<adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >, adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >*, double, double&, vertex_centrality_t>, vertex_centrality_t, no_property> >; typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits<Graph>::traversal_category = undir_adj_list_traversal_tag]’
558 | detail::graph::brandes_betweenness_centrality_dispatch1< ew >::run(g,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
559 | choose_param(
| ~~~~~~~~~~~~~
560 | get_param(params, vertex_centrality), dummy_property_map()),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
561 | choose_param(get_param(params, edge_centrality), dummy_property_map()),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
562 | choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
563 | get_param(params, edge_weight));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
bbc.cpp:67:33: required from here
67 | brandes_betweenness_centrality(g,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
68 | centrality_map(get(vertex_centrality, g)).
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
69 | edge_centrality_map(get(edge_centrality, g)).
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
70 | weight_map(get(edge_weight, g)));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:206:17: note: in a call to non-static member function ‘boost::ConvertibleConcept<boost::read_write_property_map_tag, boost::writable_property_map_tag>::~ConvertibleConcept()’
206 | BOOST_concept(Convertible,(X)(Y))
| ^~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/preprocessor/cat.hpp:29:34: note: in definition of macro ‘BOOST_PP_CAT_I’
29 | # define BOOST_PP_CAT_I(a, b) a ## b
| ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/concept_def.hpp:23:12: note: in expansion of macro ‘BOOST_PP_CAT’
23 | struct BOOST_PP_CAT(name,Concept) \
| ^~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:206:3: note: in expansion of macro ‘BOOST_concept’
206 | BOOST_concept(Convertible,(X)(Y))
| ^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Convertible<boost::read_write_property_map_tag, boost::read_write_property_map_tag>]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Convertible<boost::read_write_property_map_tag, boost::read_write_property_map_tag> >]’
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible<boost::read_write_property_map_tag, boost::read_write_property_map_tag>’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:206:3: required from ‘struct boost::ConvertibleConcept<boost::read_write_property_map_tag, boost::read_write_property_map_tag>’
206 | BOOST_concept(Convertible,(X)(Y))
| ^~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::ConvertibleConcept<boost::read_write_property_map_tag, boost::read_write_property_map_tag>]’
32 | inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
| ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied<boost::ConvertibleConcept<boost::read_write_property_map_tag, boost::read_write_property_map_tag> >::value’
44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 17 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:349:31: required from ‘void boost::detail::graph::brandes_betweenness_centrality_impl(const Graph&, CentralityMap, EdgeCentralityMap, IncomingMap, DistanceMap, DependencyMap, PathCountMap, VertexIndexMap, ShortestPaths) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >; CentralityMap = boost::vec_adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >, boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_centrality_t>; IncomingMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >*, std::vector<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >, std::allocator<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > > > > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>, std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >, std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >&>; DistanceMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>, double, double&>; DependencyMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>, double, double&>; PathCountMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>; ShortestPaths = brandes_dijkstra_shortest_paths<boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_weight_t> >]’
349 | shortest_paths(g, *s, ordered_vertices, incoming, distance,
| ~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
350 | path_count, vertex_index);
| ~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:434:55: required from ‘void boost::brandes_betweenness_centrality(const Graph&, CentralityMap, EdgeCentralityMap, IncomingMap, DistanceMap, DependencyMap, PathCountMap, VertexIndexMap, WeightMap, typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >; CentralityMap = vec_adj_list_vertex_property_map<adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >, adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >*, double, double&, vertex_centrality_t>; EdgeCentralityMap = adj_list_edge_property_map<undirected_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_centrality_t, double> >, edge_centrality_t>; IncomingMap = iterator_property_map<__gnu_cxx::__normal_iterator<std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<undirected_tag, long unsigned int> > >*, std::vector<std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<undirected_tag, long unsigned int> > >, std::allocator<std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<undirected_tag, long unsigned int> > > > > >, vec_adj_list_vertex_id_map<property<vertex_index_t, int, property<vertex_centrality_t, double> >, long unsigned int>, std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<undirected_tag, long unsigned int> > >, std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<undirected_tag, long unsigned int> > >&>; DistanceMap = iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > >, vec_adj_list_vertex_id_map<property<vertex_index_t, int, property<vertex_centrality_t, double> >, long unsigned int>, double, double&>; DependencyMap = iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > >, vec_adj_list_vertex_id_map<property<vertex_index_t, int, property<vertex_centrality_t, double> >, long unsigned int>, double, double&>; PathCountMap = iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > >, vec_adj_list_vertex_id_map<property<vertex_index_t, int, property<vertex_centrality_t, double> >, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = vec_adj_list_vertex_id_map<property<vertex_index_t, int, property<vertex_centrality_t, double> >, long unsigned int>; WeightMap = adj_list_edge_property_map<undirected_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_centrality_t, double> >, edge_weight_t>; typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits<Graph>::traversal_category = undir_adj_list_traversal_tag]’
434 | detail::graph::brandes_betweenness_centrality_impl(g, centrality,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~
435 | edge_centrality_map, incoming, distance, dependency, path_count,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
436 | vertex_index, shortest_paths);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:468:43: required from ‘void boost::detail::graph::brandes_betweenness_centrality_dispatch2(const Graph&, CentralityMap, EdgeCentralityMap, WeightMap, VertexIndexMap) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >; CentralityMap = boost::vec_adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >, boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_centrality_t>; WeightMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_weight_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>]’
468 | brandes_betweenness_centrality(g, centrality, edge_centrality_map,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
469 | make_iterator_property_map(incoming.begin(), vertex_index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
470 | make_iterator_property_map(distance.begin(), vertex_index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
471 | make_iterator_property_map(dependency.begin(), vertex_index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
472 | make_iterator_property_map(path_count.begin(), vertex_index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
473 | vertex_index, weight_map);
| ~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:517:57: required from ‘static void boost::detail::graph::brandes_betweenness_centrality_dispatch1<WeightMap>::run(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap, WeightMap) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >; CentralityMap = boost::vec_adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >, boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>; WeightMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_weight_t>]’
517 | brandes_betweenness_centrality_dispatch2(g, centrality,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~
518 | edge_centrality_map, weight_map, vertex_index);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:558:71: required from ‘void boost::brandes_betweenness_centrality(const Graph&, const bgl_named_params<T, Tag, Base>&, typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >; Param = adj_list_edge_property_map<undirected_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_centrality_t, double> >, edge_weight_t>; Tag = edge_weight_t; Rest = bgl_named_params<adj_list_edge_property_map<undirected_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_centrality_t, double> >, edge_centrality_t>, edge_centrality_t, bgl_named_params<vec_adj_list_vertex_property_map<adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >, adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >*, double, double&, vertex_centrality_t>, vertex_centrality_t, no_property> >; typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits<Graph>::traversal_category = undir_adj_list_traversal_tag]’
558 | detail::graph::brandes_betweenness_centrality_dispatch1< ew >::run(g,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
559 | choose_param(
| ~~~~~~~~~~~~~
560 | get_param(params, vertex_centrality), dummy_property_map()),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
561 | choose_param(get_param(params, edge_centrality), dummy_property_map()),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
562 | choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
563 | get_param(params, edge_weight));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
bbc.cpp:67:33: required from here
67 | brandes_betweenness_centrality(g,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
68 | centrality_map(get(vertex_centrality, g)).
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
69 | edge_centrality_map(get(edge_centrality, g)).
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
70 | weight_map(get(edge_weight, g)));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
20 | ~usage_requirements() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible<X, Y>::~Convertible() [with X = boost::read_write_property_map_tag; Y = boost::read_write_property_map_tag]’
37 | ~model()
| ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
208 | BOOST_CONCEPT_USAGE(Convertible) {
| ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Convertible<boost::iterators::detail::iterator_category_with_traversal<std::input_iterator_tag, boost::iterators::random_access_traversal_tag>, std::input_iterator_tag>]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/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(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/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> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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);
| ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/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) );
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/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;
| ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 12 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:500:43: required from ‘void boost::detail::graph::brandes_betweenness_centrality_dispatch2(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >; CentralityMap = boost::dummy_property_map; EdgeCentralityMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>]’
500 | brandes_betweenness_centrality(g, centrality, edge_centrality_map,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
501 | make_iterator_property_map(incoming.begin(), vertex_index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
502 | make_iterator_property_map(distance.begin(), vertex_index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
503 | make_iterator_property_map(dependency.begin(), vertex_index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
504 | make_iterator_property_map(path_count.begin(), vertex_index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
505 | vertex_index);
| ~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:531:57: required from ‘static void boost::detail::graph::brandes_betweenness_centrality_dispatch1<boost::param_not_found>::run(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap, boost::param_not_found) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >; CentralityMap = boost::dummy_property_map; EdgeCentralityMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>]’
531 | brandes_betweenness_centrality_dispatch2(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
532 | g, centrality, edge_centrality_map, vertex_index);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:558:71: required from ‘void boost::brandes_betweenness_centrality(const Graph&, const bgl_named_params<T, Tag, Base>&, typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >; Param = vec_adj_list_vertex_id_map<property<vertex_index_t, int, property<vertex_centrality_t, double> >, long unsigned int>; Tag = vertex_index_t; Rest = bgl_named_params<adj_list_edge_property_map<undirected_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_centrality_t, double> >, edge_centrality_t>, edge_centrality_t, no_property>; typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits<Graph>::traversal_category = undir_adj_list_traversal_tag]’
558 | detail::graph::brandes_betweenness_centrality_dispatch1< ew >::run(g,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
559 | choose_param(
| ~~~~~~~~~~~~~
560 | get_param(params, vertex_centrality), dummy_property_map()),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
561 | choose_param(get_param(params, edge_centrality), dummy_property_map()),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
562 | choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
563 | get_param(params, edge_weight));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/bc_clustering.hpp:131:39: required from ‘void boost::betweenness_centrality_clustering(MutableGraph&, Done, EdgeCentralityMap, VertexIndexMap) [with MutableGraph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >; Done = clustering_threshold; EdgeCentralityMap = adj_list_edge_property_map<undirected_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_centrality_t, double> >, edge_centrality_t>; VertexIndexMap = vec_adj_list_vertex_id_map<property<vertex_index_t, int, property<vertex_centrality_t, double> >, long unsigned int>]’
131 | brandes_betweenness_centrality(g,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
132 | edge_centrality_map(edge_centrality)
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
133 | .vertex_index_map(vertex_index));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/bc_clustering.hpp:150:38: required from ‘void boost::betweenness_centrality_clustering(MutableGraph&, Done, EdgeCentralityMap) [with MutableGraph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >; Done = clustering_threshold; EdgeCentralityMap = adj_list_edge_property_map<undirected_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_centrality_t, double> >, edge_centrality_t>]’
150 | betweenness_centrality_clustering(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
151 | g, done, edge_centrality, get(vertex_index, g));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
bbc.cpp:149:36: required from here
149 | betweenness_centrality_clustering(g,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
150 | clustering_threshold(threshold, g, normalize),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
151 | get(edge_centrality, g));
| ~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
20 | ~usage_requirements() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible<X, Y>::~Convertible() [with X = boost::iterators::detail::iterator_category_with_traversal<std::input_iterator_tag, boost::iterators::random_access_traversal_tag>; Y = std::input_iterator_tag]’
37 | ~model()
| ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
208 | BOOST_CONCEPT_USAGE(Convertible) {
| ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Assignable<long unsigned int*>]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Assignable<long unsigned int*> >]’
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:145:5: required from ‘struct boost::Assignable<long unsigned int*>’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator<long unsigned int*>’
502 | BOOST_concept(InputIterator,(TT))
| ^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:540:3: required from ‘struct boost::ForwardIterator<long unsigned int*>’
540 | BOOST_concept(ForwardIterator,(TT))
| ^~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator<long unsigned int*>’
568 | BOOST_concept(BidirectionalIterator,(TT))
| ^~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3: [ skipping 18 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:349:31: required from ‘void boost::detail::graph::brandes_betweenness_centrality_impl(const Graph&, CentralityMap, EdgeCentralityMap, IncomingMap, DistanceMap, DependencyMap, PathCountMap, VertexIndexMap, ShortestPaths) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >; CentralityMap = boost::vec_adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >, boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_centrality_t>; IncomingMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >*, std::vector<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >, std::allocator<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > > > > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>, std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >, std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >&>; DistanceMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>, double, double&>; DependencyMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>, double, double&>; PathCountMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>; ShortestPaths = brandes_dijkstra_shortest_paths<boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_weight_t> >]’
349 | shortest_paths(g, *s, ordered_vertices, incoming, distance,
| ~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
350 | path_count, vertex_index);
| ~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:434:55: required from ‘void boost::brandes_betweenness_centrality(const Graph&, CentralityMap, EdgeCentralityMap, IncomingMap, DistanceMap, DependencyMap, PathCountMap, VertexIndexMap, WeightMap, typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >; CentralityMap = vec_adj_list_vertex_property_map<adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >, adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >*, double, double&, vertex_centrality_t>; EdgeCentralityMap = adj_list_edge_property_map<undirected_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_centrality_t, double> >, edge_centrality_t>; IncomingMap = iterator_property_map<__gnu_cxx::__normal_iterator<std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<undirected_tag, long unsigned int> > >*, std::vector<std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<undirected_tag, long unsigned int> > >, std::allocator<std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<undirected_tag, long unsigned int> > > > > >, vec_adj_list_vertex_id_map<property<vertex_index_t, int, property<vertex_centrality_t, double> >, long unsigned int>, std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<undirected_tag, long unsigned int> > >, std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<undirected_tag, long unsigned int> > >&>; DistanceMap = iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > >, vec_adj_list_vertex_id_map<property<vertex_index_t, int, property<vertex_centrality_t, double> >, long unsigned int>, double, double&>; DependencyMap = iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > >, vec_adj_list_vertex_id_map<property<vertex_index_t, int, property<vertex_centrality_t, double> >, long unsigned int>, double, double&>; PathCountMap = iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > >, vec_adj_list_vertex_id_map<property<vertex_index_t, int, property<vertex_centrality_t, double> >, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = vec_adj_list_vertex_id_map<property<vertex_index_t, int, property<vertex_centrality_t, double> >, long unsigned int>; WeightMap = adj_list_edge_property_map<undirected_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_centrality_t, double> >, edge_weight_t>; typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits<Graph>::traversal_category = undir_adj_list_traversal_tag]’
434 | detail::graph::brandes_betweenness_centrality_impl(g, centrality,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~
435 | edge_centrality_map, incoming, distance, dependency, path_count,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
436 | vertex_index, shortest_paths);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:468:43: required from ‘void boost::detail::graph::brandes_betweenness_centrality_dispatch2(const Graph&, CentralityMap, EdgeCentralityMap, WeightMap, VertexIndexMap) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >; CentralityMap = boost::vec_adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >, boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_centrality_t>; WeightMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_weight_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>]’
468 | brandes_betweenness_centrality(g, centrality, edge_centrality_map,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
469 | make_iterator_property_map(incoming.begin(), vertex_index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
470 | make_iterator_property_map(distance.begin(), vertex_index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
471 | make_iterator_property_map(dependency.begin(), vertex_index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
472 | make_iterator_property_map(path_count.begin(), vertex_index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
473 | vertex_index, weight_map);
| ~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:517:57: required from ‘static void boost::detail::graph::brandes_betweenness_centrality_dispatch1<WeightMap>::run(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap, WeightMap) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >; CentralityMap = boost::vec_adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >, boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>; WeightMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_weight_t>]’
517 | brandes_betweenness_centrality_dispatch2(g, centrality,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~
518 | edge_centrality_map, weight_map, vertex_index);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:558:71: required from ‘void boost::brandes_betweenness_centrality(const Graph&, const bgl_named_params<T, Tag, Base>&, typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >; Param = adj_list_edge_property_map<undirected_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_centrality_t, double> >, edge_weight_t>; Tag = edge_weight_t; Rest = bgl_named_params<adj_list_edge_property_map<undirected_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_centrality_t, double> >, edge_centrality_t>, edge_centrality_t, bgl_named_params<vec_adj_list_vertex_property_map<adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >, adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >*, double, double&, vertex_centrality_t>, vertex_centrality_t, no_property> >; typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits<Graph>::traversal_category = undir_adj_list_traversal_tag]’
558 | detail::graph::brandes_betweenness_centrality_dispatch1< ew >::run(g,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
559 | choose_param(
| ~~~~~~~~~~~~~
560 | get_param(params, vertex_centrality), dummy_property_map()),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
561 | choose_param(get_param(params, edge_centrality), dummy_property_map()),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
562 | choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
563 | get_param(params, edge_weight));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
bbc.cpp:67:33: required from here
67 | brandes_betweenness_centrality(g,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
68 | centrality_map(get(vertex_centrality, g)).
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
69 | edge_centrality_map(get(edge_centrality, g)).
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
70 | weight_map(get(edge_weight, g)));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
20 | ~usage_requirements() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Assignable<TT>::~Assignable() [with TT = long unsigned int*]’
37 | ~model()
| ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:145:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
145 | BOOST_CONCEPT_USAGE(Assignable) {
| ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::EqualityComparable<long unsigned int*>]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::EqualityComparable<long unsigned int*> >]’
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable<long unsigned int*>’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator<long unsigned int*>’
502 | BOOST_concept(InputIterator,(TT))
| ^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:540:3: required from ‘struct boost::ForwardIterator<long unsigned int*>’
540 | BOOST_concept(ForwardIterator,(TT))
| ^~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator<long unsigned int*>’
568 | BOOST_concept(BidirectionalIterator,(TT))
| ^~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3: [ skipping 18 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:349:31: required from ‘void boost::detail::graph::brandes_betweenness_centrality_impl(const Graph&, CentralityMap, EdgeCentralityMap, IncomingMap, DistanceMap, DependencyMap, PathCountMap, VertexIndexMap, ShortestPaths) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >; CentralityMap = boost::vec_adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >, boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_centrality_t>; IncomingMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >*, std::vector<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >, std::allocator<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > > > > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>, std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >, std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >&>; DistanceMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>, double, double&>; DependencyMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>, double, double&>; PathCountMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>; ShortestPaths = brandes_dijkstra_shortest_paths<boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_weight_t> >]’
349 | shortest_paths(g, *s, ordered_vertices, incoming, distance,
| ~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
350 | path_count, vertex_index);
| ~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:434:55: required from ‘void boost::brandes_betweenness_centrality(const Graph&, CentralityMap, EdgeCentralityMap, IncomingMap, DistanceMap, DependencyMap, PathCountMap, VertexIndexMap, WeightMap, typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >; CentralityMap = vec_adj_list_vertex_property_map<adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >, adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >*, double, double&, vertex_centrality_t>; EdgeCentralityMap = adj_list_edge_property_map<undirected_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_centrality_t, double> >, edge_centrality_t>; IncomingMap = iterator_property_map<__gnu_cxx::__normal_iterator<std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<undirected_tag, long unsigned int> > >*, std::vector<std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<undirected_tag, long unsigned int> > >, std::allocator<std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<undirected_tag, long unsigned int> > > > > >, vec_adj_list_vertex_id_map<property<vertex_index_t, int, property<vertex_centrality_t, double> >, long unsigned int>, std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<undirected_tag, long unsigned int> > >, std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<undirected_tag, long unsigned int> > >&>; DistanceMap = iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > >, vec_adj_list_vertex_id_map<property<vertex_index_t, int, property<vertex_centrality_t, double> >, long unsigned int>, double, double&>; DependencyMap = iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > >, vec_adj_list_vertex_id_map<property<vertex_index_t, int, property<vertex_centrality_t, double> >, long unsigned int>, double, double&>; PathCountMap = iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > >, vec_adj_list_vertex_id_map<property<vertex_index_t, int, property<vertex_centrality_t, double> >, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = vec_adj_list_vertex_id_map<property<vertex_index_t, int, property<vertex_centrality_t, double> >, long unsigned int>; WeightMap = adj_list_edge_property_map<undirected_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_centrality_t, double> >, edge_weight_t>; typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits<Graph>::traversal_category = undir_adj_list_traversal_tag]’
434 | detail::graph::brandes_betweenness_centrality_impl(g, centrality,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~
435 | edge_centrality_map, incoming, distance, dependency, path_count,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
436 | vertex_index, shortest_paths);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:468:43: required from ‘void boost::detail::graph::brandes_betweenness_centrality_dispatch2(const Graph&, CentralityMap, EdgeCentralityMap, WeightMap, VertexIndexMap) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >; CentralityMap = boost::vec_adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >, boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_centrality_t>; WeightMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_weight_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>]’
468 | brandes_betweenness_centrality(g, centrality, edge_centrality_map,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
469 | make_iterator_property_map(incoming.begin(), vertex_index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
470 | make_iterator_property_map(distance.begin(), vertex_index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
471 | make_iterator_property_map(dependency.begin(), vertex_index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
472 | make_iterator_property_map(path_count.begin(), vertex_index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
473 | vertex_index, weight_map);
| ~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:517:57: required from ‘static void boost::detail::graph::brandes_betweenness_centrality_dispatch1<WeightMap>::run(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap, WeightMap) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >; CentralityMap = boost::vec_adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >, boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>; WeightMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_weight_t>]’
517 | brandes_betweenness_centrality_dispatch2(g, centrality,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~
518 | edge_centrality_map, weight_map, vertex_index);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:558:71: required from ‘void boost::brandes_betweenness_centrality(const Graph&, const bgl_named_params<T, Tag, Base>&, typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >; Param = adj_list_edge_property_map<undirected_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_centrality_t, double> >, edge_weight_t>; Tag = edge_weight_t; Rest = bgl_named_params<adj_list_edge_property_map<undirected_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_centrality_t, double> >, edge_centrality_t>, edge_centrality_t, bgl_named_params<vec_adj_list_vertex_property_map<adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >, adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >*, double, double&, vertex_centrality_t>, vertex_centrality_t, no_property> >; typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits<Graph>::traversal_category = undir_adj_list_traversal_tag]’
558 | detail::graph::brandes_betweenness_centrality_dispatch1< ew >::run(g,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
559 | choose_param(
| ~~~~~~~~~~~~~
560 | get_param(params, vertex_centrality), dummy_property_map()),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
561 | choose_param(get_param(params, edge_centrality), dummy_property_map()),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
562 | choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
563 | get_param(params, edge_weight));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
bbc.cpp:67:33: required from here
67 | brandes_betweenness_centrality(g,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
68 | centrality_map(get(vertex_centrality, g)).
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
69 | edge_centrality_map(get(edge_centrality, g)).
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
70 | weight_map(get(edge_weight, g)));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
20 | ~usage_requirements() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::EqualityComparable<TT>::~EqualityComparable() [with TT = long unsigned int*]’
37 | ~model()
| ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:233:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
233 | BOOST_CONCEPT_USAGE(EqualityComparable) {
| ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::InputIterator<long unsigned int*>]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::InputIterator<long unsigned int*> >]’
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:512:7: required from ‘struct boost::InputIterator<long unsigned int*>’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:540:3: required from ‘struct boost::ForwardIterator<long unsigned int*>’
540 | BOOST_concept(ForwardIterator,(TT))
| ^~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator<long unsigned int*>’
568 | BOOST_concept(BidirectionalIterator,(TT))
| ^~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<long unsigned int*>’
597 | BOOST_concept(RandomAccessIterator,(TT))
| ^~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3: [ skipping 17 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:349:31: required from ‘void boost::detail::graph::brandes_betweenness_centrality_impl(const Graph&, CentralityMap, EdgeCentralityMap, IncomingMap, DistanceMap, DependencyMap, PathCountMap, VertexIndexMap, ShortestPaths) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >; CentralityMap = boost::vec_adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >, boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_centrality_t>; IncomingMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >*, std::vector<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >, std::allocator<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > > > > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>, std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >, std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >&>; DistanceMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>, double, double&>; DependencyMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>, double, double&>; PathCountMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>; ShortestPaths = brandes_dijkstra_shortest_paths<boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_weight_t> >]’
349 | shortest_paths(g, *s, ordered_vertices, incoming, distance,
| ~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
350 | path_count, vertex_index);
| ~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:434:55: required from ‘void boost::brandes_betweenness_centrality(const Graph&, CentralityMap, EdgeCentralityMap, IncomingMap, DistanceMap, DependencyMap, PathCountMap, VertexIndexMap, WeightMap, typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >; CentralityMap = vec_adj_list_vertex_property_map<adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >, adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >*, double, double&, vertex_centrality_t>; EdgeCentralityMap = adj_list_edge_property_map<undirected_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_centrality_t, double> >, edge_centrality_t>; IncomingMap = iterator_property_map<__gnu_cxx::__normal_iterator<std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<undirected_tag, long unsigned int> > >*, std::vector<std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<undirected_tag, long unsigned int> > >, std::allocator<std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<undirected_tag, long unsigned int> > > > > >, vec_adj_list_vertex_id_map<property<vertex_index_t, int, property<vertex_centrality_t, double> >, long unsigned int>, std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<undirected_tag, long unsigned int> > >, std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<undirected_tag, long unsigned int> > >&>; DistanceMap = iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > >, vec_adj_list_vertex_id_map<property<vertex_index_t, int, property<vertex_centrality_t, double> >, long unsigned int>, double, double&>; DependencyMap = iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > >, vec_adj_list_vertex_id_map<property<vertex_index_t, int, property<vertex_centrality_t, double> >, long unsigned int>, double, double&>; PathCountMap = iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > >, vec_adj_list_vertex_id_map<property<vertex_index_t, int, property<vertex_centrality_t, double> >, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = vec_adj_list_vertex_id_map<property<vertex_index_t, int, property<vertex_centrality_t, double> >, long unsigned int>; WeightMap = adj_list_edge_property_map<undirected_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_centrality_t, double> >, edge_weight_t>; typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits<Graph>::traversal_category = undir_adj_list_traversal_tag]’
434 | detail::graph::brandes_betweenness_centrality_impl(g, centrality,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~
435 | edge_centrality_map, incoming, distance, dependency, path_count,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
436 | vertex_index, shortest_paths);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:468:43: required from ‘void boost::detail::graph::brandes_betweenness_centrality_dispatch2(const Graph&, CentralityMap, EdgeCentralityMap, WeightMap, VertexIndexMap) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >; CentralityMap = boost::vec_adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >, boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_centrality_t>; WeightMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_weight_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>]’
468 | brandes_betweenness_centrality(g, centrality, edge_centrality_map,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
469 | make_iterator_property_map(incoming.begin(), vertex_index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
470 | make_iterator_property_map(distance.begin(), vertex_index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
471 | make_iterator_property_map(dependency.begin(), vertex_index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
472 | make_iterator_property_map(path_count.begin(), vertex_index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
473 | vertex_index, weight_map);
| ~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:517:57: required from ‘static void boost::detail::graph::brandes_betweenness_centrality_dispatch1<WeightMap>::run(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap, WeightMap) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >; CentralityMap = boost::vec_adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >, boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>; WeightMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_weight_t>]’
517 | brandes_betweenness_centrality_dispatch2(g, centrality,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~
518 | edge_centrality_map, weight_map, vertex_index);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:558:71: required from ‘void boost::brandes_betweenness_centrality(const Graph&, const bgl_named_params<T, Tag, Base>&, typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >; Param = adj_list_edge_property_map<undirected_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_centrality_t, double> >, edge_weight_t>; Tag = edge_weight_t; Rest = bgl_named_params<adj_list_edge_property_map<undirected_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_centrality_t, double> >, edge_centrality_t>, edge_centrality_t, bgl_named_params<vec_adj_list_vertex_property_map<adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >, adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >*, double, double&, vertex_centrality_t>, vertex_centrality_t, no_property> >; typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits<Graph>::traversal_category = undir_adj_list_traversal_tag]’
558 | detail::graph::brandes_betweenness_centrality_dispatch1< ew >::run(g,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
559 | choose_param(
| ~~~~~~~~~~~~~
560 | get_param(params, vertex_centrality), dummy_property_map()),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
561 | choose_param(get_param(params, edge_centrality), dummy_property_map()),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
562 | choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
563 | get_param(params, edge_weight));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
bbc.cpp:67:33: required from here
67 | brandes_betweenness_centrality(g,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
68 | centrality_map(get(vertex_centrality, g)).
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
69 | edge_centrality_map(get(edge_centrality, g)).
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
70 | weight_map(get(edge_weight, g)));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
20 | ~usage_requirements() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::InputIterator<TT>::~InputIterator() [with TT = long unsigned int*]’
37 | ~model()
| ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:512:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
512 | BOOST_CONCEPT_USAGE(InputIterator)
| ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::ForwardIterator<long unsigned int*>]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::ForwardIterator<long unsigned int*> >]’
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:543:7: required from ‘struct boost::ForwardIterator<long unsigned int*>’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator<long unsigned int*>’
568 | BOOST_concept(BidirectionalIterator,(TT))
| ^~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<long unsigned int*>’
597 | BOOST_concept(RandomAccessIterator,(TT))
| ^~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<long unsigned int*>’
597 | BOOST_concept(RandomAccessIterator,(TT))
| ^~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: [ skipping 16 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:349:31: required from ‘void boost::detail::graph::brandes_betweenness_centrality_impl(const Graph&, CentralityMap, EdgeCentralityMap, IncomingMap, DistanceMap, DependencyMap, PathCountMap, VertexIndexMap, ShortestPaths) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >; CentralityMap = boost::vec_adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >, boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_centrality_t>; IncomingMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >*, std::vector<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >, std::allocator<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > > > > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>, std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >, std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >&>; DistanceMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>, double, double&>; DependencyMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>, double, double&>; PathCountMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>; ShortestPaths = brandes_dijkstra_shortest_paths<boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_weight_t> >]’
349 | shortest_paths(g, *s, ordered_vertices, incoming, distance,
| ~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
350 | path_count, vertex_index);
| ~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:434:55: required from ‘void boost::brandes_betweenness_centrality(const Graph&, CentralityMap, EdgeCentralityMap, IncomingMap, DistanceMap, DependencyMap, PathCountMap, VertexIndexMap, WeightMap, typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >; CentralityMap = vec_adj_list_vertex_property_map<adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >, adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >*, double, double&, vertex_centrality_t>; EdgeCentralityMap = adj_list_edge_property_map<undirected_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_centrality_t, double> >, edge_centrality_t>; IncomingMap = iterator_property_map<__gnu_cxx::__normal_iterator<std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<undirected_tag, long unsigned int> > >*, std::vector<std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<undirected_tag, long unsigned int> > >, std::allocator<std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<undirected_tag, long unsigned int> > > > > >, vec_adj_list_vertex_id_map<property<vertex_index_t, int, property<vertex_centrality_t, double> >, long unsigned int>, std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<undirected_tag, long unsigned int> > >, std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<undirected_tag, long unsigned int> > >&>; DistanceMap = iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > >, vec_adj_list_vertex_id_map<property<vertex_index_t, int, property<vertex_centrality_t, double> >, long unsigned int>, double, double&>; DependencyMap = iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > >, vec_adj_list_vertex_id_map<property<vertex_index_t, int, property<vertex_centrality_t, double> >, long unsigned int>, double, double&>; PathCountMap = iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > >, vec_adj_list_vertex_id_map<property<vertex_index_t, int, property<vertex_centrality_t, double> >, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = vec_adj_list_vertex_id_map<property<vertex_index_t, int, property<vertex_centrality_t, double> >, long unsigned int>; WeightMap = adj_list_edge_property_map<undirected_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_centrality_t, double> >, edge_weight_t>; typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits<Graph>::traversal_category = undir_adj_list_traversal_tag]’
434 | detail::graph::brandes_betweenness_centrality_impl(g, centrality,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~
435 | edge_centrality_map, incoming, distance, dependency, path_count,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
436 | vertex_index, shortest_paths);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:468:43: required from ‘void boost::detail::graph::brandes_betweenness_centrality_dispatch2(const Graph&, CentralityMap, EdgeCentralityMap, WeightMap, VertexIndexMap) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >; CentralityMap = boost::vec_adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >, boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_centrality_t>; WeightMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_weight_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>]’
468 | brandes_betweenness_centrality(g, centrality, edge_centrality_map,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
469 | make_iterator_property_map(incoming.begin(), vertex_index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
470 | make_iterator_property_map(distance.begin(), vertex_index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
471 | make_iterator_property_map(dependency.begin(), vertex_index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
472 | make_iterator_property_map(path_count.begin(), vertex_index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
473 | vertex_index, weight_map);
| ~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:517:57: required from ‘static void boost::detail::graph::brandes_betweenness_centrality_dispatch1<WeightMap>::run(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap, WeightMap) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >; CentralityMap = boost::vec_adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >, boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>; WeightMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_weight_t>]’
517 | brandes_betweenness_centrality_dispatch2(g, centrality,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~
518 | edge_centrality_map, weight_map, vertex_index);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:558:71: required from ‘void boost::brandes_betweenness_centrality(const Graph&, const bgl_named_params<T, Tag, Base>&, typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >; Param = adj_list_edge_property_map<undirected_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_centrality_t, double> >, edge_weight_t>; Tag = edge_weight_t; Rest = bgl_named_params<adj_list_edge_property_map<undirected_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_centrality_t, double> >, edge_centrality_t>, edge_centrality_t, bgl_named_params<vec_adj_list_vertex_property_map<adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >, adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >*, double, double&, vertex_centrality_t>, vertex_centrality_t, no_property> >; typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits<Graph>::traversal_category = undir_adj_list_traversal_tag]’
558 | detail::graph::brandes_betweenness_centrality_dispatch1< ew >::run(g,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
559 | choose_param(
| ~~~~~~~~~~~~~
560 | get_param(params, vertex_centrality), dummy_property_map()),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
561 | choose_param(get_param(params, edge_centrality), dummy_property_map()),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
562 | choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
563 | get_param(params, edge_weight));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
bbc.cpp:67:33: required from here
67 | brandes_betweenness_centrality(g,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
68 | centrality_map(get(vertex_centrality, g)).
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
69 | edge_centrality_map(get(edge_centrality, g)).
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
70 | weight_map(get(edge_weight, g)));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
20 | ~usage_requirements() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::ForwardIterator<TT>::~ForwardIterator() [with TT = long unsigned int*]’
37 | ~model()
| ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:543:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
543 | BOOST_CONCEPT_USAGE(ForwardIterator)
| ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::BidirectionalIterator<long unsigned int*>]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::BidirectionalIterator<long unsigned int*> >]’
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:571:7: required from ‘struct boost::BidirectionalIterator<long unsigned int*>’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<long unsigned int*>’
597 | BOOST_concept(RandomAccessIterator,(TT))
| ^~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<long unsigned int*>’
597 | BOOST_concept(RandomAccessIterator,(TT))
| ^~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::RandomAccessIteratorConcept<long unsigned int*>]’
32 | inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
| ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5: [ skipping 15 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:349:31: required from ‘void boost::detail::graph::brandes_betweenness_centrality_impl(const Graph&, CentralityMap, EdgeCentralityMap, IncomingMap, DistanceMap, DependencyMap, PathCountMap, VertexIndexMap, ShortestPaths) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >; CentralityMap = boost::vec_adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >, boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_centrality_t>; IncomingMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >*, std::vector<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >, std::allocator<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > > > > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>, std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >, std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >&>; DistanceMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>, double, double&>; DependencyMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>, double, double&>; PathCountMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>; ShortestPaths = brandes_dijkstra_shortest_paths<boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_weight_t> >]’
349 | shortest_paths(g, *s, ordered_vertices, incoming, distance,
| ~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
350 | path_count, vertex_index);
| ~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:434:55: required from ‘void boost::brandes_betweenness_centrality(const Graph&, CentralityMap, EdgeCentralityMap, IncomingMap, DistanceMap, DependencyMap, PathCountMap, VertexIndexMap, WeightMap, typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >; CentralityMap = vec_adj_list_vertex_property_map<adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >, adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >*, double, double&, vertex_centrality_t>; EdgeCentralityMap = adj_list_edge_property_map<undirected_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_centrality_t, double> >, edge_centrality_t>; IncomingMap = iterator_property_map<__gnu_cxx::__normal_iterator<std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<undirected_tag, long unsigned int> > >*, std::vector<std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<undirected_tag, long unsigned int> > >, std::allocator<std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<undirected_tag, long unsigned int> > > > > >, vec_adj_list_vertex_id_map<property<vertex_index_t, int, property<vertex_centrality_t, double> >, long unsigned int>, std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<undirected_tag, long unsigned int> > >, std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<undirected_tag, long unsigned int> > >&>; DistanceMap = iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > >, vec_adj_list_vertex_id_map<property<vertex_index_t, int, property<vertex_centrality_t, double> >, long unsigned int>, double, double&>; DependencyMap = iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > >, vec_adj_list_vertex_id_map<property<vertex_index_t, int, property<vertex_centrality_t, double> >, long unsigned int>, double, double&>; PathCountMap = iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > >, vec_adj_list_vertex_id_map<property<vertex_index_t, int, property<vertex_centrality_t, double> >, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = vec_adj_list_vertex_id_map<property<vertex_index_t, int, property<vertex_centrality_t, double> >, long unsigned int>; WeightMap = adj_list_edge_property_map<undirected_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_centrality_t, double> >, edge_weight_t>; typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits<Graph>::traversal_category = undir_adj_list_traversal_tag]’
434 | detail::graph::brandes_betweenness_centrality_impl(g, centrality,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~
435 | edge_centrality_map, incoming, distance, dependency, path_count,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
436 | vertex_index, shortest_paths);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:468:43: required from ‘void boost::detail::graph::brandes_betweenness_centrality_dispatch2(const Graph&, CentralityMap, EdgeCentralityMap, WeightMap, VertexIndexMap) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >; CentralityMap = boost::vec_adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >, boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_centrality_t>; WeightMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_weight_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>]’
468 | brandes_betweenness_centrality(g, centrality, edge_centrality_map,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
469 | make_iterator_property_map(incoming.begin(), vertex_index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
470 | make_iterator_property_map(distance.begin(), vertex_index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
471 | make_iterator_property_map(dependency.begin(), vertex_index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
472 | make_iterator_property_map(path_count.begin(), vertex_index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
473 | vertex_index, weight_map);
| ~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:517:57: required from ‘static void boost::detail::graph::brandes_betweenness_centrality_dispatch1<WeightMap>::run(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap, WeightMap) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >; CentralityMap = boost::vec_adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >, boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>; WeightMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_weight_t>]’
517 | brandes_betweenness_centrality_dispatch2(g, centrality,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~
518 | edge_centrality_map, weight_map, vertex_index);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:558:71: required from ‘void boost::brandes_betweenness_centrality(const Graph&, const bgl_named_params<T, Tag, Base>&, typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >; Param = adj_list_edge_property_map<undirected_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_centrality_t, double> >, edge_weight_t>; Tag = edge_weight_t; Rest = bgl_named_params<adj_list_edge_property_map<undirected_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_centrality_t, double> >, edge_centrality_t>, edge_centrality_t, bgl_named_params<vec_adj_list_vertex_property_map<adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >, adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >*, double, double&, vertex_centrality_t>, vertex_centrality_t, no_property> >; typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits<Graph>::traversal_category = undir_adj_list_traversal_tag]’
558 | detail::graph::brandes_betweenness_centrality_dispatch1< ew >::run(g,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
559 | choose_param(
| ~~~~~~~~~~~~~
560 | get_param(params, vertex_centrality), dummy_property_map()),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
561 | choose_param(get_param(params, edge_centrality), dummy_property_map()),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
562 | choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
563 | get_param(params, edge_weight));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
bbc.cpp:67:33: required from here
67 | brandes_betweenness_centrality(g,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
68 | centrality_map(get(vertex_centrality, g)).
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
69 | edge_centrality_map(get(edge_centrality, g)).
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
70 | weight_map(get(edge_weight, g)));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
20 | ~usage_requirements() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::BidirectionalIterator<TT>::~BidirectionalIterator() [with TT = long unsigned int*]’
37 | ~model()
| ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:571:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
571 | BOOST_CONCEPT_USAGE(BidirectionalIterator)
| ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Comparable<long unsigned int*>]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Comparable<long unsigned int*> >]’
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:253:5: required from ‘struct boost::Comparable<long unsigned int*>’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<long unsigned int*>’
597 | BOOST_concept(RandomAccessIterator,(TT))
| ^~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<long unsigned int*>’
597 | BOOST_concept(RandomAccessIterator,(TT))
| ^~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::RandomAccessIteratorConcept<long unsigned int*>]’
32 | inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
| ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5: [ skipping 15 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:349:31: required from ‘void boost::detail::graph::brandes_betweenness_centrality_impl(const Graph&, CentralityMap, EdgeCentralityMap, IncomingMap, DistanceMap, DependencyMap, PathCountMap, VertexIndexMap, ShortestPaths) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >; CentralityMap = boost::vec_adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >, boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_centrality_t>; IncomingMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >*, std::vector<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >, std::allocator<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > > > > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>, std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >, std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >&>; DistanceMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>, double, double&>; DependencyMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>, double, double&>; PathCountMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>; ShortestPaths = brandes_dijkstra_shortest_paths<boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_weight_t> >]’
349 | shortest_paths(g, *s, ordered_vertices, incoming, distance,
| ~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
350 | path_count, vertex_index);
| ~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:434:55: required from ‘void boost::brandes_betweenness_centrality(const Graph&, CentralityMap, EdgeCentralityMap, IncomingMap, DistanceMap, DependencyMap, PathCountMap, VertexIndexMap, WeightMap, typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >; CentralityMap = vec_adj_list_vertex_property_map<adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >, adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >*, double, double&, vertex_centrality_t>; EdgeCentralityMap = adj_list_edge_property_map<undirected_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_centrality_t, double> >, edge_centrality_t>; IncomingMap = iterator_property_map<__gnu_cxx::__normal_iterator<std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<undirected_tag, long unsigned int> > >*, std::vector<std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<undirected_tag, long unsigned int> > >, std::allocator<std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<undirected_tag, long unsigned int> > > > > >, vec_adj_list_vertex_id_map<property<vertex_index_t, int, property<vertex_centrality_t, double> >, long unsigned int>, std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<undirected_tag, long unsigned int> > >, std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<undirected_tag, long unsigned int> > >&>; DistanceMap = iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > >, vec_adj_list_vertex_id_map<property<vertex_index_t, int, property<vertex_centrality_t, double> >, long unsigned int>, double, double&>; DependencyMap = iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > >, vec_adj_list_vertex_id_map<property<vertex_index_t, int, property<vertex_centrality_t, double> >, long unsigned int>, double, double&>; PathCountMap = iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > >, vec_adj_list_vertex_id_map<property<vertex_index_t, int, property<vertex_centrality_t, double> >, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = vec_adj_list_vertex_id_map<property<vertex_index_t, int, property<vertex_centrality_t, double> >, long unsigned int>; WeightMap = adj_list_edge_property_map<undirected_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_centrality_t, double> >, edge_weight_t>; typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits<Graph>::traversal_category = undir_adj_list_traversal_tag]’
434 | detail::graph::brandes_betweenness_centrality_impl(g, centrality,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~
435 | edge_centrality_map, incoming, distance, dependency, path_count,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
436 | vertex_index, shortest_paths);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:468:43: required from ‘void boost::detail::graph::brandes_betweenness_centrality_dispatch2(const Graph&, CentralityMap, EdgeCentralityMap, WeightMap, VertexIndexMap) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >; CentralityMap = boost::vec_adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >, boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_centrality_t>; WeightMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_weight_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>]’
468 | brandes_betweenness_centrality(g, centrality, edge_centrality_map,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
469 | make_iterator_property_map(incoming.begin(), vertex_index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
470 | make_iterator_property_map(distance.begin(), vertex_index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
471 | make_iterator_property_map(dependency.begin(), vertex_index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
472 | make_iterator_property_map(path_count.begin(), vertex_index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
473 | vertex_index, weight_map);
| ~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:517:57: required from ‘static void boost::detail::graph::brandes_betweenness_centrality_dispatch1<WeightMap>::run(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap, WeightMap) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >; CentralityMap = boost::vec_adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >, boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>; WeightMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_weight_t>]’
517 | brandes_betweenness_centrality_dispatch2(g, centrality,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~
518 | edge_centrality_map, weight_map, vertex_index);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:558:71: required from ‘void boost::brandes_betweenness_centrality(const Graph&, const bgl_named_params<T, Tag, Base>&, typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >; Param = adj_list_edge_property_map<undirected_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_centrality_t, double> >, edge_weight_t>; Tag = edge_weight_t; Rest = bgl_named_params<adj_list_edge_property_map<undirected_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_centrality_t, double> >, edge_centrality_t>, edge_centrality_t, bgl_named_params<vec_adj_list_vertex_property_map<adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >, adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >*, double, double&, vertex_centrality_t>, vertex_centrality_t, no_property> >; typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits<Graph>::traversal_category = undir_adj_list_traversal_tag]’
558 | detail::graph::brandes_betweenness_centrality_dispatch1< ew >::run(g,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
559 | choose_param(
| ~~~~~~~~~~~~~
560 | get_param(params, vertex_centrality), dummy_property_map()),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
561 | choose_param(get_param(params, edge_centrality), dummy_property_map()),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
562 | choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
563 | get_param(params, edge_weight));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
bbc.cpp:67:33: required from here
67 | brandes_betweenness_centrality(g,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
68 | centrality_map(get(vertex_centrality, g)).
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
69 | edge_centrality_map(get(edge_centrality, g)).
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
70 | weight_map(get(edge_weight, g)));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
20 | ~usage_requirements() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Comparable<TT>::~Comparable() [with TT = long unsigned int*]’
37 | ~model()
| ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:253:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
253 | BOOST_CONCEPT_USAGE(Comparable) {
| ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::RandomAccessIterator<long unsigned int*>]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::RandomAccessIterator<long unsigned int*> >]’
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:601:7: required from ‘struct boost::RandomAccessIterator<long unsigned int*>’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<long unsigned int*>’
597 | BOOST_concept(RandomAccessIterator,(TT))
| ^~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::RandomAccessIteratorConcept<long unsigned int*>]’
32 | inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
| ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied<boost::RandomAccessIteratorConcept<long unsigned int*> >::value’
44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 14 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:349:31: required from ‘void boost::detail::graph::brandes_betweenness_centrality_impl(const Graph&, CentralityMap, EdgeCentralityMap, IncomingMap, DistanceMap, DependencyMap, PathCountMap, VertexIndexMap, ShortestPaths) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >; CentralityMap = boost::vec_adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >, boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_centrality_t>; IncomingMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >*, std::vector<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >, std::allocator<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > > > > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>, std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >, std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >&>; DistanceMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>, double, double&>; DependencyMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>, double, double&>; PathCountMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>; ShortestPaths = brandes_dijkstra_shortest_paths<boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_weight_t> >]’
349 | shortest_paths(g, *s, ordered_vertices, incoming, distance,
| ~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
350 | path_count, vertex_index);
| ~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:434:55: required from ‘void boost::brandes_betweenness_centrality(const Graph&, CentralityMap, EdgeCentralityMap, IncomingMap, DistanceMap, DependencyMap, PathCountMap, VertexIndexMap, WeightMap, typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >; CentralityMap = vec_adj_list_vertex_property_map<adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >, adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >*, double, double&, vertex_centrality_t>; EdgeCentralityMap = adj_list_edge_property_map<undirected_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_centrality_t, double> >, edge_centrality_t>; IncomingMap = iterator_property_map<__gnu_cxx::__normal_iterator<std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<undirected_tag, long unsigned int> > >*, std::vector<std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<undirected_tag, long unsigned int> > >, std::allocator<std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<undirected_tag, long unsigned int> > > > > >, vec_adj_list_vertex_id_map<property<vertex_index_t, int, property<vertex_centrality_t, double> >, long unsigned int>, std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<undirected_tag, long unsigned int> > >, std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<undirected_tag, long unsigned int> > >&>; DistanceMap = iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > >, vec_adj_list_vertex_id_map<property<vertex_index_t, int, property<vertex_centrality_t, double> >, long unsigned int>, double, double&>; DependencyMap = iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > >, vec_adj_list_vertex_id_map<property<vertex_index_t, int, property<vertex_centrality_t, double> >, long unsigned int>, double, double&>; PathCountMap = iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > >, vec_adj_list_vertex_id_map<property<vertex_index_t, int, property<vertex_centrality_t, double> >, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = vec_adj_list_vertex_id_map<property<vertex_index_t, int, property<vertex_centrality_t, double> >, long unsigned int>; WeightMap = adj_list_edge_property_map<undirected_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_centrality_t, double> >, edge_weight_t>; typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits<Graph>::traversal_category = undir_adj_list_traversal_tag]’
434 | detail::graph::brandes_betweenness_centrality_impl(g, centrality,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~
435 | edge_centrality_map, incoming, distance, dependency, path_count,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
436 | vertex_index, shortest_paths);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:468:43: required from ‘void boost::detail::graph::brandes_betweenness_centrality_dispatch2(const Graph&, CentralityMap, EdgeCentralityMap, WeightMap, VertexIndexMap) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >; CentralityMap = boost::vec_adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >, boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_centrality_t>; WeightMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_weight_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>]’
468 | brandes_betweenness_centrality(g, centrality, edge_centrality_map,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
469 | make_iterator_property_map(incoming.begin(), vertex_index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
470 | make_iterator_property_map(distance.begin(), vertex_index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
471 | make_iterator_property_map(dependency.begin(), vertex_index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
472 | make_iterator_property_map(path_count.begin(), vertex_index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
473 | vertex_index, weight_map);
| ~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:517:57: required from ‘static void boost::detail::graph::brandes_betweenness_centrality_dispatch1<WeightMap>::run(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap, WeightMap) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >; CentralityMap = boost::vec_adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >, boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>; WeightMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_weight_t>]’
517 | brandes_betweenness_centrality_dispatch2(g, centrality,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~
518 | edge_centrality_map, weight_map, vertex_index);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:558:71: required from ‘void boost::brandes_betweenness_centrality(const Graph&, const bgl_named_params<T, Tag, Base>&, typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >; Param = adj_list_edge_property_map<undirected_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_centrality_t, double> >, edge_weight_t>; Tag = edge_weight_t; Rest = bgl_named_params<adj_list_edge_property_map<undirected_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_centrality_t, double> >, edge_centrality_t>, edge_centrality_t, bgl_named_params<vec_adj_list_vertex_property_map<adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >, adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >*, double, double&, vertex_centrality_t>, vertex_centrality_t, no_property> >; typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits<Graph>::traversal_category = undir_adj_list_traversal_tag]’
558 | detail::graph::brandes_betweenness_centrality_dispatch1< ew >::run(g,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
559 | choose_param(
| ~~~~~~~~~~~~~
560 | get_param(params, vertex_centrality), dummy_property_map()),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
561 | choose_param(get_param(params, edge_centrality), dummy_property_map()),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
562 | choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
563 | get_param(params, edge_weight));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
bbc.cpp:67:33: required from here
67 | brandes_betweenness_centrality(g,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
68 | centrality_map(get(vertex_centrality, g)).
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
69 | edge_centrality_map(get(edge_centrality, g)).
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
70 | weight_map(get(edge_weight, g)));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
20 | ~usage_requirements() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::RandomAccessIterator<TT>::~RandomAccessIterator() [with TT = long unsigned int*]’
37 | ~model()
| ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:601:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
601 | BOOST_CONCEPT_USAGE(RandomAccessIterator)
| ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Convertible<boost::read_write_property_map_tag, boost::readable_property_map_tag>]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Convertible<boost::read_write_property_map_tag, boost::readable_property_map_tag> >]’
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible<boost::read_write_property_map_tag, boost::readable_property_map_tag>’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:206:3: required from ‘struct boost::ConvertibleConcept<boost::read_write_property_map_tag, boost::readable_property_map_tag>’
206 | BOOST_concept(Convertible,(X)(Y))
| ^~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::ConvertibleConcept<boost::read_write_property_map_tag, boost::readable_property_map_tag>]’
32 | inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
| ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied<boost::ConvertibleConcept<boost::read_write_property_map_tag, boost::readable_property_map_tag> >::value’
44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 22 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:349:31: required from ‘void boost::detail::graph::brandes_betweenness_centrality_impl(const Graph&, CentralityMap, EdgeCentralityMap, IncomingMap, DistanceMap, DependencyMap, PathCountMap, VertexIndexMap, ShortestPaths) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >; CentralityMap = boost::vec_adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >, boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_centrality_t>; IncomingMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >*, std::vector<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >, std::allocator<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > > > > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>, std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >, std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >&>; DistanceMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>, double, double&>; DependencyMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>, double, double&>; PathCountMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>; ShortestPaths = brandes_dijkstra_shortest_paths<boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_weight_t> >]’
349 | shortest_paths(g, *s, ordered_vertices, incoming, distance,
| ~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
350 | path_count, vertex_index);
| ~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:434:55: required from ‘void boost::brandes_betweenness_centrality(const Graph&, CentralityMap, EdgeCentralityMap, IncomingMap, DistanceMap, DependencyMap, PathCountMap, VertexIndexMap, WeightMap, typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >; CentralityMap = vec_adj_list_vertex_property_map<adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >, adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >*, double, double&, vertex_centrality_t>; EdgeCentralityMap = adj_list_edge_property_map<undirected_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_centrality_t, double> >, edge_centrality_t>; IncomingMap = iterator_property_map<__gnu_cxx::__normal_iterator<std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<undirected_tag, long unsigned int> > >*, std::vector<std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<undirected_tag, long unsigned int> > >, std::allocator<std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<undirected_tag, long unsigned int> > > > > >, vec_adj_list_vertex_id_map<property<vertex_index_t, int, property<vertex_centrality_t, double> >, long unsigned int>, std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<undirected_tag, long unsigned int> > >, std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<undirected_tag, long unsigned int> > >&>; DistanceMap = iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > >, vec_adj_list_vertex_id_map<property<vertex_index_t, int, property<vertex_centrality_t, double> >, long unsigned int>, double, double&>; DependencyMap = iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > >, vec_adj_list_vertex_id_map<property<vertex_index_t, int, property<vertex_centrality_t, double> >, long unsigned int>, double, double&>; PathCountMap = iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > >, vec_adj_list_vertex_id_map<property<vertex_index_t, int, property<vertex_centrality_t, double> >, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = vec_adj_list_vertex_id_map<property<vertex_index_t, int, property<vertex_centrality_t, double> >, long unsigned int>; WeightMap = adj_list_edge_property_map<undirected_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_centrality_t, double> >, edge_weight_t>; typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits<Graph>::traversal_category = undir_adj_list_traversal_tag]’
434 | detail::graph::brandes_betweenness_centrality_impl(g, centrality,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~
435 | edge_centrality_map, incoming, distance, dependency, path_count,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
436 | vertex_index, shortest_paths);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:468:43: required from ‘void boost::detail::graph::brandes_betweenness_centrality_dispatch2(const Graph&, CentralityMap, EdgeCentralityMap, WeightMap, VertexIndexMap) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >; CentralityMap = boost::vec_adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >, boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_centrality_t>; WeightMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_weight_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>]’
468 | brandes_betweenness_centrality(g, centrality, edge_centrality_map,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
469 | make_iterator_property_map(incoming.begin(), vertex_index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
470 | make_iterator_property_map(distance.begin(), vertex_index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
471 | make_iterator_property_map(dependency.begin(), vertex_index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
472 | make_iterator_property_map(path_count.begin(), vertex_index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
473 | vertex_index, weight_map);
| ~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:517:57: required from ‘static void boost::detail::graph::brandes_betweenness_centrality_dispatch1<WeightMap>::run(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap, WeightMap) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >; CentralityMap = boost::vec_adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >, boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>; WeightMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_weight_t>]’
517 | brandes_betweenness_centrality_dispatch2(g, centrality,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~
518 | edge_centrality_map, weight_map, vertex_index);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:558:71: required from ‘void boost::brandes_betweenness_centrality(const Graph&, const bgl_named_params<T, Tag, Base>&, typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >; Param = adj_list_edge_property_map<undirected_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_centrality_t, double> >, edge_weight_t>; Tag = edge_weight_t; Rest = bgl_named_params<adj_list_edge_property_map<undirected_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_centrality_t, double> >, edge_centrality_t>, edge_centrality_t, bgl_named_params<vec_adj_list_vertex_property_map<adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >, adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >*, double, double&, vertex_centrality_t>, vertex_centrality_t, no_property> >; typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits<Graph>::traversal_category = undir_adj_list_traversal_tag]’
558 | detail::graph::brandes_betweenness_centrality_dispatch1< ew >::run(g,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
559 | choose_param(
| ~~~~~~~~~~~~~
560 | get_param(params, vertex_centrality), dummy_property_map()),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
561 | choose_param(get_param(params, edge_centrality), dummy_property_map()),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
562 | choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
563 | get_param(params, edge_weight));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
bbc.cpp:67:33: required from here
67 | brandes_betweenness_centrality(g,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
68 | centrality_map(get(vertex_centrality, g)).
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
69 | edge_centrality_map(get(edge_centrality, g)).
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
70 | weight_map(get(edge_weight, g)));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
20 | ~usage_requirements() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible<X, Y>::~Convertible() [with X = boost::read_write_property_map_tag; Y = boost::readable_property_map_tag]’
37 | ~model()
| ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
208 | BOOST_CONCEPT_USAGE(Convertible) {
| ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Convertible<boost::read_write_property_map_tag, boost::writable_property_map_tag>]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Convertible<boost::read_write_property_map_tag, boost::writable_property_map_tag> >]’
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible<boost::read_write_property_map_tag, boost::writable_property_map_tag>’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:206:3: required from ‘struct boost::ConvertibleConcept<boost::read_write_property_map_tag, boost::writable_property_map_tag>’
206 | BOOST_concept(Convertible,(X)(Y))
| ^~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::ConvertibleConcept<boost::read_write_property_map_tag, boost::writable_property_map_tag>]’
32 | inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
| ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied<boost::ConvertibleConcept<boost::read_write_property_map_tag, boost::writable_property_map_tag> >::value’
44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 22 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:349:31: required from ‘void boost::detail::graph::brandes_betweenness_centrality_impl(const Graph&, CentralityMap, EdgeCentralityMap, IncomingMap, DistanceMap, DependencyMap, PathCountMap, VertexIndexMap, ShortestPaths) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >; CentralityMap = boost::vec_adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >, boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_centrality_t>; IncomingMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >*, std::vector<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >, std::allocator<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > > > > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>, std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >, std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >&>; DistanceMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>, double, double&>; DependencyMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>, double, double&>; PathCountMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>; ShortestPaths = brandes_dijkstra_shortest_paths<boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_weight_t> >]’
349 | shortest_paths(g, *s, ordered_vertices, incoming, distance,
| ~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
350 | path_count, vertex_index);
| ~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:434:55: required from ‘void boost::brandes_betweenness_centrality(const Graph&, CentralityMap, EdgeCentralityMap, IncomingMap, DistanceMap, DependencyMap, PathCountMap, VertexIndexMap, WeightMap, typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >; CentralityMap = vec_adj_list_vertex_property_map<adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >, adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >*, double, double&, vertex_centrality_t>; EdgeCentralityMap = adj_list_edge_property_map<undirected_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_centrality_t, double> >, edge_centrality_t>; IncomingMap = iterator_property_map<__gnu_cxx::__normal_iterator<std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<undirected_tag, long unsigned int> > >*, std::vector<std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<undirected_tag, long unsigned int> > >, std::allocator<std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<undirected_tag, long unsigned int> > > > > >, vec_adj_list_vertex_id_map<property<vertex_index_t, int, property<vertex_centrality_t, double> >, long unsigned int>, std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<undirected_tag, long unsigned int> > >, std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<undirected_tag, long unsigned int> > >&>; DistanceMap = iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > >, vec_adj_list_vertex_id_map<property<vertex_index_t, int, property<vertex_centrality_t, double> >, long unsigned int>, double, double&>; DependencyMap = iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > >, vec_adj_list_vertex_id_map<property<vertex_index_t, int, property<vertex_centrality_t, double> >, long unsigned int>, double, double&>; PathCountMap = iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > >, vec_adj_list_vertex_id_map<property<vertex_index_t, int, property<vertex_centrality_t, double> >, long unsigned int>, long unsigned int, long unsigned int&>; VertexIndexMap = vec_adj_list_vertex_id_map<property<vertex_index_t, int, property<vertex_centrality_t, double> >, long unsigned int>; WeightMap = adj_list_edge_property_map<undirected_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_centrality_t, double> >, edge_weight_t>; typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits<Graph>::traversal_category = undir_adj_list_traversal_tag]’
434 | detail::graph::brandes_betweenness_centrality_impl(g, centrality,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~
435 | edge_centrality_map, incoming, distance, dependency, path_count,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
436 | vertex_index, shortest_paths);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:468:43: required from ‘void boost::detail::graph::brandes_betweenness_centrality_dispatch2(const Graph&, CentralityMap, EdgeCentralityMap, WeightMap, VertexIndexMap) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >; CentralityMap = boost::vec_adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >, boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_centrality_t>; WeightMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_weight_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>]’
468 | brandes_betweenness_centrality(g, centrality, edge_centrality_map,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
469 | make_iterator_property_map(incoming.begin(), vertex_index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
470 | make_iterator_property_map(distance.begin(), vertex_index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
471 | make_iterator_property_map(dependency.begin(), vertex_index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
472 | make_iterator_property_map(path_count.begin(), vertex_index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
473 | vertex_index, weight_map);
| ~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:517:57: required from ‘static void boost::detail::graph::brandes_betweenness_centrality_dispatch1<WeightMap>::run(const Graph&, CentralityMap, EdgeCentralityMap, VertexIndexMap, WeightMap) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >; CentralityMap = boost::vec_adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >, boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS, boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> > >*, double, double&, boost::vertex_centrality_t>; EdgeCentralityMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_centrality_t>; VertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_index_t, int, boost::property<boost::vertex_centrality_t, double> >, long unsigned int>; WeightMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::property<boost::edge_centrality_t, double> >, boost::edge_weight_t>]’
517 | brandes_betweenness_centrality_dispatch2(g, centrality,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~
518 | edge_centrality_map, weight_map, vertex_index);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/betweenness_centrality.hpp:558:71: required from ‘void boost::brandes_betweenness_centrality(const Graph&, const bgl_named_params<T, Tag, Base>&, typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >; Param = adj_list_edge_property_map<undirected_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_centrality_t, double> >, edge_weight_t>; Tag = edge_weight_t; Rest = bgl_named_params<adj_list_edge_property_map<undirected_tag, double, double&, long unsigned int, property<edge_weight_t, double, property<edge_centrality_t, double> >, edge_centrality_t>, edge_centrality_t, bgl_named_params<vec_adj_list_vertex_property_map<adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >, adjacency_list<vecS, vecS, undirectedS, property<vertex_index_t, int, property<vertex_centrality_t, double> >, property<edge_weight_t, double, property<edge_centrality_t, double> > >*, double, double&, vertex_centrality_t>, vertex_centrality_t, no_property> >; typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits<Graph>::traversal_category = undir_adj_list_traversal_tag]’
558 | detail::graph::brandes_betweenness_centrality_dispatch1< ew >::run(g,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
559 | choose_param(
| ~~~~~~~~~~~~~
560 | get_param(params, vertex_centrality), dummy_property_map()),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
561 | choose_param(get_param(params, edge_centrality), dummy_property_map()),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
562 | choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
563 | get_param(params, edge_weight));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
bbc.cpp:67:33: required from here
67 | brandes_betweenness_centrality(g,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
68 | centrality_map(get(vertex_centrality, g)).
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
69 | edge_centrality_map(get(edge_centrality, g)).
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
70 | weight_map(get(edge_weight, g)));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
20 | ~usage_requirements() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible<X, Y>::~Convertible() [with X = boost::read_write_property_map_tag; Y = boost::writable_property_map_tag]’
37 | ~model()
| ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
208 | BOOST_CONCEPT_USAGE(Convertible) {
| ^~~~~~~~~~~~~~~~~~~
/opt/ohpc/pub/compiler/gcc/14.2.0/bin/aarch64-unknown-linux-gnu-g++ -std=gnu++17 -I"/home/biocbuild/R/R/include" -DNDEBUG -I'/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include' -I/usr/local/include -fPIC -g -O2 -Wall -Werror=format-security -DR_NO_REMAP -c cliques.cpp -o cliques.o
In file included from cliques.cpp:1:
RBGL.hpp:41:9: warning: "R_NO_REMAP" redefined
41 | #define R_NO_REMAP
| ^~~~~~~~~~
<command-line>: note: this is the location of the previous definition
In file included from /home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:22,
from RBGL.hpp:17:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/mpl/assert.hpp:194:21: warning: unnecessary parentheses in declaration of ‘assert_arg’ [-Wparentheses]
194 | failed ************ (Pred::************
| ^~~~~~~~~~~~~~~~~~~
195 | assert_arg( void (*)(Pred), typename assert_arg_pred<Pred>::type )
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
196 | );
| ~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/mpl/assert.hpp:194:21: note: remove parentheses
194 | failed ************ (Pred::************
| ^~~~~~~~~~~~~~~~~~~
| -
195 | assert_arg( void (*)(Pred), typename assert_arg_pred<Pred>::type )
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
196 | );
| ~
| -
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/mpl/assert.hpp:199:21: warning: unnecessary parentheses in declaration of ‘assert_not_arg’ [-Wparentheses]
199 | failed ************ (boost::mpl::not_<Pred>::************
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
200 | assert_not_arg( void (*)(Pred), typename assert_arg_pred_not<Pred>::type )
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
201 | );
| ~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/mpl/assert.hpp:199:21: note: remove parentheses
199 | failed ************ (boost::mpl::not_<Pred>::************
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
| -
200 | assert_not_arg( void (*)(Pred), typename assert_arg_pred_not<Pred>::type )
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
201 | );
| ~
| -
In file included from /home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/smart_ptr/shared_ptr.hpp:17,
from /home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/vector_property_map.hpp:14,
from /home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:598:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/smart_ptr/detail/shared_count.hpp:326:33: warning: ‘template<class> class std::auto_ptr’ is deprecated: use 'std::unique_ptr' instead [-Wdeprecated-declarations]
326 | explicit shared_count( std::auto_ptr<Y> & r ): pi_( new sp_counted_impl_p<Y>( r.get() ) )
| ^~~~~~~~
In file included from /opt/ohpc/pub/compiler/gcc/14.2.0/include/c++/14.2.0/memory:78,
from /home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/smart_ptr/detail/sp_counted_impl.hpp:35,
from /home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/smart_ptr/detail/shared_count.hpp:23:
/opt/ohpc/pub/compiler/gcc/14.2.0/include/c++/14.2.0/bits/unique_ptr.h:59:28: note: declared here
59 | template<typename> class auto_ptr;
| ^~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/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()
| ^~~~~~~~
/opt/ohpc/pub/compiler/gcc/14.2.0/include/c++/14.2.0/bits/unique_ptr.h:59:28: note: declared here
59 | template<typename> class auto_ptr;
| ^~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/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()
| ^~~~~~~~
/opt/ohpc/pub/compiler/gcc/14.2.0/include/c++/14.2.0/bits/unique_ptr.h:59:28: note: declared here
59 | template<typename> class auto_ptr;
| ^~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/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 )
| ^~~~~~~~
/opt/ohpc/pub/compiler/gcc/14.2.0/include/c++/14.2.0/bits/unique_ptr.h:59:28: note: declared here
59 | template<typename> class auto_ptr;
| ^~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/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 )
| ^~~~~~~~
/opt/ohpc/pub/compiler/gcc/14.2.0/include/c++/14.2.0/bits/unique_ptr.h:59:28: note: declared here
59 | template<typename> class auto_ptr;
| ^~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/smart_ptr/shared_ptr.hpp: In member function ‘boost::shared_ptr<T>& boost::shared_ptr<T>::operator=(std::auto_ptr<_Up>&&)’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/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 );
| ^~~~~~~~
/opt/ohpc/pub/compiler/gcc/14.2.0/include/c++/14.2.0/bits/unique_ptr.h:59:28: note: declared here
59 | template<typename> class auto_ptr;
| ^~~~~~~~
In file included from /home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/scoped_ptr.hpp:13,
from /home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/adjacency_list.hpp:22,
from RBGL.hpp:38:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/smart_ptr/scoped_ptr.hpp: At global scope:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/smart_ptr/scoped_ptr.hpp:75:31: warning: ‘template<class> class std::auto_ptr’ is deprecated: use 'std::unique_ptr' instead [-Wdeprecated-declarations]
75 | explicit scoped_ptr( std::auto_ptr<T> p ) noexcept : px( p.release() )
| ^~~~~~~~
/opt/ohpc/pub/compiler/gcc/14.2.0/include/c++/14.2.0/bits/unique_ptr.h:59:28: note: declared here
59 | template<typename> class auto_ptr;
| ^~~~~~~~
/opt/ohpc/pub/compiler/gcc/14.2.0/bin/aarch64-unknown-linux-gnu-g++ -std=gnu++17 -I"/home/biocbuild/R/R/include" -DNDEBUG -I'/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include' -I/usr/local/include -fPIC -g -O2 -Wall -Werror=format-security -DR_NO_REMAP -c clusteringCoef.cpp -o clusteringCoef.o
In file included from clusteringCoef.cpp:1:
RBGL.hpp:41:9: warning: "R_NO_REMAP" redefined
41 | #define R_NO_REMAP
| ^~~~~~~~~~
<command-line>: note: this is the location of the previous definition
In file included from /home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:22,
from RBGL.hpp:17:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/mpl/assert.hpp:194:21: warning: unnecessary parentheses in declaration of ‘assert_arg’ [-Wparentheses]
194 | failed ************ (Pred::************
| ^~~~~~~~~~~~~~~~~~~
195 | assert_arg( void (*)(Pred), typename assert_arg_pred<Pred>::type )
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
196 | );
| ~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/mpl/assert.hpp:194:21: note: remove parentheses
194 | failed ************ (Pred::************
| ^~~~~~~~~~~~~~~~~~~
| -
195 | assert_arg( void (*)(Pred), typename assert_arg_pred<Pred>::type )
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
196 | );
| ~
| -
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/mpl/assert.hpp:199:21: warning: unnecessary parentheses in declaration of ‘assert_not_arg’ [-Wparentheses]
199 | failed ************ (boost::mpl::not_<Pred>::************
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
200 | assert_not_arg( void (*)(Pred), typename assert_arg_pred_not<Pred>::type )
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
201 | );
| ~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/mpl/assert.hpp:199:21: note: remove parentheses
199 | failed ************ (boost::mpl::not_<Pred>::************
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
| -
200 | assert_not_arg( void (*)(Pred), typename assert_arg_pred_not<Pred>::type )
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
201 | );
| ~
| -
In file included from /home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/smart_ptr/shared_ptr.hpp:17,
from /home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/vector_property_map.hpp:14,
from /home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:598:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/smart_ptr/detail/shared_count.hpp:326:33: warning: ‘template<class> class std::auto_ptr’ is deprecated: use 'std::unique_ptr' instead [-Wdeprecated-declarations]
326 | explicit shared_count( std::auto_ptr<Y> & r ): pi_( new sp_counted_impl_p<Y>( r.get() ) )
| ^~~~~~~~
In file included from /opt/ohpc/pub/compiler/gcc/14.2.0/include/c++/14.2.0/memory:78,
from /home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/smart_ptr/detail/sp_counted_impl.hpp:35,
from /home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/smart_ptr/detail/shared_count.hpp:23:
/opt/ohpc/pub/compiler/gcc/14.2.0/include/c++/14.2.0/bits/unique_ptr.h:59:28: note: declared here
59 | template<typename> class auto_ptr;
| ^~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/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()
| ^~~~~~~~
/opt/ohpc/pub/compiler/gcc/14.2.0/include/c++/14.2.0/bits/unique_ptr.h:59:28: note: declared here
59 | template<typename> class auto_ptr;
| ^~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/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()
| ^~~~~~~~
/opt/ohpc/pub/compiler/gcc/14.2.0/include/c++/14.2.0/bits/unique_ptr.h:59:28: note: declared here
59 | template<typename> class auto_ptr;
| ^~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/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 )
| ^~~~~~~~
/opt/ohpc/pub/compiler/gcc/14.2.0/include/c++/14.2.0/bits/unique_ptr.h:59:28: note: declared here
59 | template<typename> class auto_ptr;
| ^~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/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 )
| ^~~~~~~~
/opt/ohpc/pub/compiler/gcc/14.2.0/include/c++/14.2.0/bits/unique_ptr.h:59:28: note: declared here
59 | template<typename> class auto_ptr;
| ^~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/smart_ptr/shared_ptr.hpp: In member function ‘boost::shared_ptr<T>& boost::shared_ptr<T>::operator=(std::auto_ptr<_Up>&&)’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/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 );
| ^~~~~~~~
/opt/ohpc/pub/compiler/gcc/14.2.0/include/c++/14.2.0/bits/unique_ptr.h:59:28: note: declared here
59 | template<typename> class auto_ptr;
| ^~~~~~~~
In file included from /home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/scoped_ptr.hpp:13,
from /home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/adjacency_list.hpp:22,
from RBGL.hpp:38:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/smart_ptr/scoped_ptr.hpp: At global scope:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/smart_ptr/scoped_ptr.hpp:75:31: warning: ‘template<class> class std::auto_ptr’ is deprecated: use 'std::unique_ptr' instead [-Wdeprecated-declarations]
75 | explicit scoped_ptr( std::auto_ptr<T> p ) noexcept : px( p.release() )
| ^~~~~~~~
/opt/ohpc/pub/compiler/gcc/14.2.0/include/c++/14.2.0/bits/unique_ptr.h:59:28: note: declared here
59 | template<typename> class auto_ptr;
| ^~~~~~~~
/opt/ohpc/pub/compiler/gcc/14.2.0/bin/aarch64-unknown-linux-gnu-g++ -std=gnu++17 -I"/home/biocbuild/R/R/include" -DNDEBUG -I'/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include' -I/usr/local/include -fPIC -g -O2 -Wall -Werror=format-security -DR_NO_REMAP -c dominatorTree.cpp -o dominatorTree.o
In file included from dominatorTree.cpp:1:
RBGL.hpp:41:9: warning: "R_NO_REMAP" redefined
41 | #define R_NO_REMAP
| ^~~~~~~~~~
<command-line>: note: this is the location of the previous definition
In file included from /home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:22,
from RBGL.hpp:17:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/mpl/assert.hpp:194:21: warning: unnecessary parentheses in declaration of ‘assert_arg’ [-Wparentheses]
194 | failed ************ (Pred::************
| ^~~~~~~~~~~~~~~~~~~
195 | assert_arg( void (*)(Pred), typename assert_arg_pred<Pred>::type )
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
196 | );
| ~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/mpl/assert.hpp:194:21: note: remove parentheses
194 | failed ************ (Pred::************
| ^~~~~~~~~~~~~~~~~~~
| -
195 | assert_arg( void (*)(Pred), typename assert_arg_pred<Pred>::type )
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
196 | );
| ~
| -
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/mpl/assert.hpp:199:21: warning: unnecessary parentheses in declaration of ‘assert_not_arg’ [-Wparentheses]
199 | failed ************ (boost::mpl::not_<Pred>::************
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
200 | assert_not_arg( void (*)(Pred), typename assert_arg_pred_not<Pred>::type )
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
201 | );
| ~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/mpl/assert.hpp:199:21: note: remove parentheses
199 | failed ************ (boost::mpl::not_<Pred>::************
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
| -
200 | assert_not_arg( void (*)(Pred), typename assert_arg_pred_not<Pred>::type )
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
201 | );
| ~
| -
In file included from /home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/smart_ptr/shared_ptr.hpp:17,
from /home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/vector_property_map.hpp:14,
from /home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:598:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/smart_ptr/detail/shared_count.hpp:326:33: warning: ‘template<class> class std::auto_ptr’ is deprecated: use 'std::unique_ptr' instead [-Wdeprecated-declarations]
326 | explicit shared_count( std::auto_ptr<Y> & r ): pi_( new sp_counted_impl_p<Y>( r.get() ) )
| ^~~~~~~~
In file included from /opt/ohpc/pub/compiler/gcc/14.2.0/include/c++/14.2.0/memory:78,
from /home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/smart_ptr/detail/sp_counted_impl.hpp:35,
from /home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/smart_ptr/detail/shared_count.hpp:23:
/opt/ohpc/pub/compiler/gcc/14.2.0/include/c++/14.2.0/bits/unique_ptr.h:59:28: note: declared here
59 | template<typename> class auto_ptr;
| ^~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/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()
| ^~~~~~~~
/opt/ohpc/pub/compiler/gcc/14.2.0/include/c++/14.2.0/bits/unique_ptr.h:59:28: note: declared here
59 | template<typename> class auto_ptr;
| ^~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/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()
| ^~~~~~~~
/opt/ohpc/pub/compiler/gcc/14.2.0/include/c++/14.2.0/bits/unique_ptr.h:59:28: note: declared here
59 | template<typename> class auto_ptr;
| ^~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/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 )
| ^~~~~~~~
/opt/ohpc/pub/compiler/gcc/14.2.0/include/c++/14.2.0/bits/unique_ptr.h:59:28: note: declared here
59 | template<typename> class auto_ptr;
| ^~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/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 )
| ^~~~~~~~
/opt/ohpc/pub/compiler/gcc/14.2.0/include/c++/14.2.0/bits/unique_ptr.h:59:28: note: declared here
59 | template<typename> class auto_ptr;
| ^~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/smart_ptr/shared_ptr.hpp: In member function ‘boost::shared_ptr<T>& boost::shared_ptr<T>::operator=(std::auto_ptr<_Up>&&)’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/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 );
| ^~~~~~~~
/opt/ohpc/pub/compiler/gcc/14.2.0/include/c++/14.2.0/bits/unique_ptr.h:59:28: note: declared here
59 | template<typename> class auto_ptr;
| ^~~~~~~~
In file included from /home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/scoped_ptr.hpp:13,
from /home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/adjacency_list.hpp:22,
from RBGL.hpp:38:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/smart_ptr/scoped_ptr.hpp: At global scope:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/smart_ptr/scoped_ptr.hpp:75:31: warning: ‘template<class> class std::auto_ptr’ is deprecated: use 'std::unique_ptr' instead [-Wdeprecated-declarations]
75 | explicit scoped_ptr( std::auto_ptr<T> p ) noexcept : px( p.release() )
| ^~~~~~~~
/opt/ohpc/pub/compiler/gcc/14.2.0/include/c++/14.2.0/bits/unique_ptr.h:59:28: note: declared here
59 | template<typename> class auto_ptr;
| ^~~~~~~~
In file included from /home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/assert.hpp:35,
from /home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:19:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/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<void**, std::vector<void*> > > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:145:5: required from ‘struct boost::Assignable<__gnu_cxx::__normal_iterator<void**, std::vector<void*> > >’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator<__gnu_cxx::__normal_iterator<void**, std::vector<void*> > >’
502 | BOOST_concept(InputIterator,(TT))
| ^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:540:3: required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator<void**, std::vector<void*> > >’
540 | BOOST_concept(ForwardIterator,(TT))
| ^~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator<void**, std::vector<void*> > >’
568 | BOOST_concept(BidirectionalIterator,(TT))
| ^~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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<void**, std::vector<void*> > >]’
32 | inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
| ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied<boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<void**, std::vector<void*> > > >::value’
44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied<boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<void**, std::vector<void*> > > >’
45 | typedef boost::integral_constant<bool, value> type;
| ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_<void (*)(boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<void**, std::vector<void*> > >)>’
72 | struct requirement_<void(*)(Model)>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map<RAIter, ID, typename std::iterator_traits< <template-parameter-1-1> >::value_type, typename std::iterator_traits< <template-parameter-1-1> >::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = __gnu_cxx::__normal_iterator<void**, std::vector<void*> >; ID = adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, int&, vertex_index_t>; typename std::iterator_traits< <template-parameter-1-1> >::value_type = void*; typename std::iterator_traits< <template-parameter-1-1> >::reference = void*&]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
dominatorTree.cpp:44:40: required from here
44 | make_iterator_property_map(domTreePredVector.begin(), v1_index_map);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
In file included from /home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:31,
from /home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:20:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/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<void**, std::vector<void*> > >]’
20 | ~usage_requirements() { ((Model*)0)->~Model(); }
| ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/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<void**, std::vector<void*> > > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable<__gnu_cxx::__normal_iterator<void**, std::vector<void*> > >’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator<__gnu_cxx::__normal_iterator<void**, std::vector<void*> > >’
502 | BOOST_concept(InputIterator,(TT))
| ^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:540:3: required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator<void**, std::vector<void*> > >’
540 | BOOST_concept(ForwardIterator,(TT))
| ^~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator<void**, std::vector<void*> > >’
568 | BOOST_concept(BidirectionalIterator,(TT))
| ^~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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<void**, std::vector<void*> > >]’
32 | inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
| ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied<boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<void**, std::vector<void*> > > >::value’
44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied<boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<void**, std::vector<void*> > > >’
45 | typedef boost::integral_constant<bool, value> type;
| ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_<void (*)(boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<void**, std::vector<void*> > >)>’
72 | struct requirement_<void(*)(Model)>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map<RAIter, ID, typename std::iterator_traits< <template-parameter-1-1> >::value_type, typename std::iterator_traits< <template-parameter-1-1> >::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = __gnu_cxx::__normal_iterator<void**, std::vector<void*> >; ID = adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, int&, vertex_index_t>; typename std::iterator_traits< <template-parameter-1-1> >::value_type = void*; typename std::iterator_traits< <template-parameter-1-1> >::reference = void*&]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
dominatorTree.cpp:44:40: required from here
44 | make_iterator_property_map(domTreePredVector.begin(), v1_index_map);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/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<void**, std::vector<void*> > >]’
20 | ~usage_requirements() { ((Model*)0)->~Model(); }
| ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/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<void**, std::vector<void*> > > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:512:7: required from ‘struct boost::InputIterator<__gnu_cxx::__normal_iterator<void**, std::vector<void*> > >’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:540:3: required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator<void**, std::vector<void*> > >’
540 | BOOST_concept(ForwardIterator,(TT))
| ^~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator<void**, std::vector<void*> > >’
568 | BOOST_concept(BidirectionalIterator,(TT))
| ^~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator<void**, std::vector<void*> > >’
597 | BOOST_concept(RandomAccessIterator,(TT))
| ^~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<void**, std::vector<void*> > >’
597 | BOOST_concept(RandomAccessIterator,(TT))
| ^~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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<void**, std::vector<void*> > >]’
32 | inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
| ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied<boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<void**, std::vector<void*> > > >::value’
44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied<boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<void**, std::vector<void*> > > >’
45 | typedef boost::integral_constant<bool, value> type;
| ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_<void (*)(boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<void**, std::vector<void*> > >)>’
72 | struct requirement_<void(*)(Model)>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map<RAIter, ID, typename std::iterator_traits< <template-parameter-1-1> >::value_type, typename std::iterator_traits< <template-parameter-1-1> >::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = __gnu_cxx::__normal_iterator<void**, std::vector<void*> >; ID = adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, int&, vertex_index_t>; typename std::iterator_traits< <template-parameter-1-1> >::value_type = void*; typename std::iterator_traits< <template-parameter-1-1> >::reference = void*&]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
dominatorTree.cpp:44:40: required from here
44 | make_iterator_property_map(domTreePredVector.begin(), v1_index_map);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/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<void**, std::vector<void*> > >]’
20 | ~usage_requirements() { ((Model*)0)->~Model(); }
| ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/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<void**, std::vector<void*> > > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:543:7: required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator<void**, std::vector<void*> > >’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator<void**, std::vector<void*> > >’
568 | BOOST_concept(BidirectionalIterator,(TT))
| ^~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator<void**, std::vector<void*> > >’
597 | BOOST_concept(RandomAccessIterator,(TT))
| ^~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<void**, std::vector<void*> > >’
597 | BOOST_concept(RandomAccessIterator,(TT))
| ^~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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<void**, std::vector<void*> > >]’
32 | inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
| ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied<boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<void**, std::vector<void*> > > >::value’
44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied<boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<void**, std::vector<void*> > > >’
45 | typedef boost::integral_constant<bool, value> type;
| ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_<void (*)(boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<void**, std::vector<void*> > >)>’
72 | struct requirement_<void(*)(Model)>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map<RAIter, ID, typename std::iterator_traits< <template-parameter-1-1> >::value_type, typename std::iterator_traits< <template-parameter-1-1> >::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = __gnu_cxx::__normal_iterator<void**, std::vector<void*> >; ID = adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, int&, vertex_index_t>; typename std::iterator_traits< <template-parameter-1-1> >::value_type = void*; typename std::iterator_traits< <template-parameter-1-1> >::reference = void*&]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
dominatorTree.cpp:44:40: required from here
44 | make_iterator_property_map(domTreePredVector.begin(), v1_index_map);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/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<void**, std::vector<void*> > >]’
20 | ~usage_requirements() { ((Model*)0)->~Model(); }
| ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/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<void**, std::vector<void*> > > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:571:7: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator<void**, std::vector<void*> > >’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator<void**, std::vector<void*> > >’
597 | BOOST_concept(RandomAccessIterator,(TT))
| ^~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<void**, std::vector<void*> > >’
597 | BOOST_concept(RandomAccessIterator,(TT))
| ^~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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<void**, std::vector<void*> > >]’
32 | inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
| ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied<boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<void**, std::vector<void*> > > >::value’
44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied<boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<void**, std::vector<void*> > > >’
45 | typedef boost::integral_constant<bool, value> type;
| ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_<void (*)(boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<void**, std::vector<void*> > >)>’
72 | struct requirement_<void(*)(Model)>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map<RAIter, ID, typename std::iterator_traits< <template-parameter-1-1> >::value_type, typename std::iterator_traits< <template-parameter-1-1> >::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = __gnu_cxx::__normal_iterator<void**, std::vector<void*> >; ID = adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, int&, vertex_index_t>; typename std::iterator_traits< <template-parameter-1-1> >::value_type = void*; typename std::iterator_traits< <template-parameter-1-1> >::reference = void*&]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
dominatorTree.cpp:44:40: required from here
44 | make_iterator_property_map(domTreePredVector.begin(), v1_index_map);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/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<void**, std::vector<void*> > >]’
20 | ~usage_requirements() { ((Model*)0)->~Model(); }
| ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/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<void**, std::vector<void*> > > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:253:5: required from ‘struct boost::Comparable<__gnu_cxx::__normal_iterator<void**, std::vector<void*> > >’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator<void**, std::vector<void*> > >’
597 | BOOST_concept(RandomAccessIterator,(TT))
| ^~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<void**, std::vector<void*> > >’
597 | BOOST_concept(RandomAccessIterator,(TT))
| ^~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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<void**, std::vector<void*> > >]’
32 | inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
| ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied<boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<void**, std::vector<void*> > > >::value’
44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied<boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<void**, std::vector<void*> > > >’
45 | typedef boost::integral_constant<bool, value> type;
| ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_<void (*)(boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<void**, std::vector<void*> > >)>’
72 | struct requirement_<void(*)(Model)>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map<RAIter, ID, typename std::iterator_traits< <template-parameter-1-1> >::value_type, typename std::iterator_traits< <template-parameter-1-1> >::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = __gnu_cxx::__normal_iterator<void**, std::vector<void*> >; ID = adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, int&, vertex_index_t>; typename std::iterator_traits< <template-parameter-1-1> >::value_type = void*; typename std::iterator_traits< <template-parameter-1-1> >::reference = void*&]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
dominatorTree.cpp:44:40: required from here
44 | make_iterator_property_map(domTreePredVector.begin(), v1_index_map);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/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<void**, std::vector<void*> > >]’
20 | ~usage_requirements() { ((Model*)0)->~Model(); }
| ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/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<void**, std::vector<void*> > > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:601:7: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator<void**, std::vector<void*> > >’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<void**, std::vector<void*> > >’
597 | BOOST_concept(RandomAccessIterator,(TT))
| ^~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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<void**, std::vector<void*> > >]’
32 | inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
| ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied<boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<void**, std::vector<void*> > > >::value’
44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied<boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<void**, std::vector<void*> > > >’
45 | typedef boost::integral_constant<bool, value> type;
| ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_<void (*)(boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<void**, std::vector<void*> > >)>’
72 | struct requirement_<void(*)(Model)>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map<RAIter, ID, typename std::iterator_traits< <template-parameter-1-1> >::value_type, typename std::iterator_traits< <template-parameter-1-1> >::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = __gnu_cxx::__normal_iterator<void**, std::vector<void*> >; ID = adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, int&, vertex_index_t>; typename std::iterator_traits< <template-parameter-1-1> >::value_type = void*; typename std::iterator_traits< <template-parameter-1-1> >::reference = void*&]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
dominatorTree.cpp:44:40: required from here
44 | make_iterator_property_map(domTreePredVector.begin(), v1_index_map);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/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<void**, std::vector<void*> > >]’
20 | ~usage_requirements() { ((Model*)0)->~Model(); }
| ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/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<void**, std::vector<void*> > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map<RAIter, ID, typename std::iterator_traits< <template-parameter-1-1> >::value_type, typename std::iterator_traits< <template-parameter-1-1> >::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = __gnu_cxx::__normal_iterator<void**, std::vector<void*> >; ID = adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, int&, vertex_index_t>; typename std::iterator_traits< <template-parameter-1-1> >::value_type = void*; typename std::iterator_traits< <template-parameter-1-1> >::reference = void*&]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
dominatorTree.cpp:44:40: required from here
44 | make_iterator_property_map(domTreePredVector.begin(), v1_index_map);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
In file included from /home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/preprocessor/repetition/enum_binary_params.hpp:15,
from /home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/utility/base_from_member.hpp:15,
from /home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/utility.hpp:15,
from RBGL.hpp:16:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:17: note: in a call to non-static member function ‘boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<void**, std::vector<void*> > >::~RandomAccessIteratorConcept()’
597 | BOOST_concept(RandomAccessIterator,(TT))
| ^~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/preprocessor/cat.hpp:29:34: note: in definition of macro ‘BOOST_PP_CAT_I’
29 | # define BOOST_PP_CAT_I(a, b) a ## b
| ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/concept_def.hpp:23:12: note: in expansion of macro ‘BOOST_PP_CAT’
23 | struct BOOST_PP_CAT(name,Concept) \
| ^~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3: note: in expansion of macro ‘BOOST_concept’
597 | BOOST_concept(RandomAccessIterator,(TT))
| ^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Assignable<__gnu_cxx::__normal_iterator<void**, std::vector<void*> > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/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<void**, std::vector<void*> > > >]’
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:145:5: required from ‘struct boost::Assignable<__gnu_cxx::__normal_iterator<void**, std::vector<void*> > >’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator<__gnu_cxx::__normal_iterator<void**, std::vector<void*> > >’
502 | BOOST_concept(InputIterator,(TT))
| ^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:540:3: required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator<void**, std::vector<void*> > >’
540 | BOOST_concept(ForwardIterator,(TT))
| ^~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator<void**, std::vector<void*> > >’
568 | BOOST_concept(BidirectionalIterator,(TT))
| ^~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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<void**, std::vector<void*> > >]’
32 | inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
| ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied<boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<void**, std::vector<void*> > > >::value’
44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied<boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<void**, std::vector<void*> > > >’
45 | typedef boost::integral_constant<bool, value> type;
| ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_<void (*)(boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<void**, std::vector<void*> > >)>’
72 | struct requirement_<void(*)(Model)>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map<RAIter, ID, typename std::iterator_traits< <template-parameter-1-1> >::value_type, typename std::iterator_traits< <template-parameter-1-1> >::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = __gnu_cxx::__normal_iterator<void**, std::vector<void*> >; ID = adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, int&, vertex_index_t>; typename std::iterator_traits< <template-parameter-1-1> >::value_type = void*; typename std::iterator_traits< <template-parameter-1-1> >::reference = void*&]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
dominatorTree.cpp:44:40: required from here
44 | make_iterator_property_map(domTreePredVector.begin(), v1_index_map);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
20 | ~usage_requirements() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/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<void**, std::vector<void*> >]’
37 | ~model()
| ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:145:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
145 | BOOST_CONCEPT_USAGE(Assignable) {
| ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::EqualityComparable<__gnu_cxx::__normal_iterator<void**, std::vector<void*> > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/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<void**, std::vector<void*> > > >]’
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable<__gnu_cxx::__normal_iterator<void**, std::vector<void*> > >’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator<__gnu_cxx::__normal_iterator<void**, std::vector<void*> > >’
502 | BOOST_concept(InputIterator,(TT))
| ^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:540:3: required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator<void**, std::vector<void*> > >’
540 | BOOST_concept(ForwardIterator,(TT))
| ^~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator<void**, std::vector<void*> > >’
568 | BOOST_concept(BidirectionalIterator,(TT))
| ^~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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<void**, std::vector<void*> > >]’
32 | inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
| ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied<boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<void**, std::vector<void*> > > >::value’
44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied<boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<void**, std::vector<void*> > > >’
45 | typedef boost::integral_constant<bool, value> type;
| ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_<void (*)(boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<void**, std::vector<void*> > >)>’
72 | struct requirement_<void(*)(Model)>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map<RAIter, ID, typename std::iterator_traits< <template-parameter-1-1> >::value_type, typename std::iterator_traits< <template-parameter-1-1> >::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = __gnu_cxx::__normal_iterator<void**, std::vector<void*> >; ID = adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, int&, vertex_index_t>; typename std::iterator_traits< <template-parameter-1-1> >::value_type = void*; typename std::iterator_traits< <template-parameter-1-1> >::reference = void*&]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
dominatorTree.cpp:44:40: required from here
44 | make_iterator_property_map(domTreePredVector.begin(), v1_index_map);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
20 | ~usage_requirements() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/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<void**, std::vector<void*> >]’
37 | ~model()
| ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:233:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
233 | BOOST_CONCEPT_USAGE(EqualityComparable) {
| ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::InputIterator<__gnu_cxx::__normal_iterator<void**, std::vector<void*> > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/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<void**, std::vector<void*> > > >]’
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:512:7: required from ‘struct boost::InputIterator<__gnu_cxx::__normal_iterator<void**, std::vector<void*> > >’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:540:3: required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator<void**, std::vector<void*> > >’
540 | BOOST_concept(ForwardIterator,(TT))
| ^~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator<void**, std::vector<void*> > >’
568 | BOOST_concept(BidirectionalIterator,(TT))
| ^~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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<void**, std::vector<void*> > >]’
32 | inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
| ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied<boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<void**, std::vector<void*> > > >::value’
44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied<boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<void**, std::vector<void*> > > >’
45 | typedef boost::integral_constant<bool, value> type;
| ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_<void (*)(boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<void**, std::vector<void*> > >)>’
72 | struct requirement_<void(*)(Model)>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map<RAIter, ID, typename std::iterator_traits< <template-parameter-1-1> >::value_type, typename std::iterator_traits< <template-parameter-1-1> >::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = __gnu_cxx::__normal_iterator<void**, std::vector<void*> >; ID = adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, int&, vertex_index_t>; typename std::iterator_traits< <template-parameter-1-1> >::value_type = void*; typename std::iterator_traits< <template-parameter-1-1> >::reference = void*&]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
dominatorTree.cpp:44:40: required from here
44 | make_iterator_property_map(domTreePredVector.begin(), v1_index_map);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
20 | ~usage_requirements() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/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<void**, std::vector<void*> >]’
37 | ~model()
| ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:512:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
512 | BOOST_CONCEPT_USAGE(InputIterator)
| ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::ForwardIterator<__gnu_cxx::__normal_iterator<void**, std::vector<void*> > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/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<void**, std::vector<void*> > > >]’
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:543:7: required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator<void**, std::vector<void*> > >’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator<void**, std::vector<void*> > >’
568 | BOOST_concept(BidirectionalIterator,(TT))
| ^~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator<void**, std::vector<void*> > >’
597 | BOOST_concept(RandomAccessIterator,(TT))
| ^~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<void**, std::vector<void*> > >’
597 | BOOST_concept(RandomAccessIterator,(TT))
| ^~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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<void**, std::vector<void*> > >]’
32 | inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
| ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied<boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<void**, std::vector<void*> > > >::value’
44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied<boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<void**, std::vector<void*> > > >’
45 | typedef boost::integral_constant<bool, value> type;
| ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_<void (*)(boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<void**, std::vector<void*> > >)>’
72 | struct requirement_<void(*)(Model)>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map<RAIter, ID, typename std::iterator_traits< <template-parameter-1-1> >::value_type, typename std::iterator_traits< <template-parameter-1-1> >::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = __gnu_cxx::__normal_iterator<void**, std::vector<void*> >; ID = adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, int&, vertex_index_t>; typename std::iterator_traits< <template-parameter-1-1> >::value_type = void*; typename std::iterator_traits< <template-parameter-1-1> >::reference = void*&]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
dominatorTree.cpp:44:40: required from here
44 | make_iterator_property_map(domTreePredVector.begin(), v1_index_map);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
20 | ~usage_requirements() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/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<void**, std::vector<void*> >]’
37 | ~model()
| ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:543:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
543 | BOOST_CONCEPT_USAGE(ForwardIterator)
| ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::BidirectionalIterator<__gnu_cxx::__normal_iterator<void**, std::vector<void*> > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/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<void**, std::vector<void*> > > >]’
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:571:7: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator<void**, std::vector<void*> > >’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator<void**, std::vector<void*> > >’
597 | BOOST_concept(RandomAccessIterator,(TT))
| ^~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<void**, std::vector<void*> > >’
597 | BOOST_concept(RandomAccessIterator,(TT))
| ^~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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<void**, std::vector<void*> > >]’
32 | inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
| ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied<boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<void**, std::vector<void*> > > >::value’
44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied<boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<void**, std::vector<void*> > > >’
45 | typedef boost::integral_constant<bool, value> type;
| ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_<void (*)(boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<void**, std::vector<void*> > >)>’
72 | struct requirement_<void(*)(Model)>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map<RAIter, ID, typename std::iterator_traits< <template-parameter-1-1> >::value_type, typename std::iterator_traits< <template-parameter-1-1> >::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = __gnu_cxx::__normal_iterator<void**, std::vector<void*> >; ID = adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, int&, vertex_index_t>; typename std::iterator_traits< <template-parameter-1-1> >::value_type = void*; typename std::iterator_traits< <template-parameter-1-1> >::reference = void*&]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
dominatorTree.cpp:44:40: required from here
44 | make_iterator_property_map(domTreePredVector.begin(), v1_index_map);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
20 | ~usage_requirements() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/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<void**, std::vector<void*> >]’
37 | ~model()
| ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:571:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
571 | BOOST_CONCEPT_USAGE(BidirectionalIterator)
| ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Comparable<__gnu_cxx::__normal_iterator<void**, std::vector<void*> > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/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<void**, std::vector<void*> > > >]’
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:253:5: required from ‘struct boost::Comparable<__gnu_cxx::__normal_iterator<void**, std::vector<void*> > >’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator<void**, std::vector<void*> > >’
597 | BOOST_concept(RandomAccessIterator,(TT))
| ^~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<void**, std::vector<void*> > >’
597 | BOOST_concept(RandomAccessIterator,(TT))
| ^~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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<void**, std::vector<void*> > >]’
32 | inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
| ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied<boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<void**, std::vector<void*> > > >::value’
44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied<boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<void**, std::vector<void*> > > >’
45 | typedef boost::integral_constant<bool, value> type;
| ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_<void (*)(boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<void**, std::vector<void*> > >)>’
72 | struct requirement_<void(*)(Model)>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map<RAIter, ID, typename std::iterator_traits< <template-parameter-1-1> >::value_type, typename std::iterator_traits< <template-parameter-1-1> >::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = __gnu_cxx::__normal_iterator<void**, std::vector<void*> >; ID = adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, int&, vertex_index_t>; typename std::iterator_traits< <template-parameter-1-1> >::value_type = void*; typename std::iterator_traits< <template-parameter-1-1> >::reference = void*&]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
dominatorTree.cpp:44:40: required from here
44 | make_iterator_property_map(domTreePredVector.begin(), v1_index_map);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
20 | ~usage_requirements() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/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<void**, std::vector<void*> >]’
37 | ~model()
| ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:253:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
253 | BOOST_CONCEPT_USAGE(Comparable) {
| ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::RandomAccessIterator<__gnu_cxx::__normal_iterator<void**, std::vector<void*> > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/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<void**, std::vector<void*> > > >]’
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:601:7: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator<void**, std::vector<void*> > >’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<void**, std::vector<void*> > >’
597 | BOOST_concept(RandomAccessIterator,(TT))
| ^~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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<void**, std::vector<void*> > >]’
32 | inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
| ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied<boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<void**, std::vector<void*> > > >::value’
44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied<boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<void**, std::vector<void*> > > >’
45 | typedef boost::integral_constant<bool, value> type;
| ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_<void (*)(boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<void**, std::vector<void*> > >)>’
72 | struct requirement_<void(*)(Model)>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map<RAIter, ID, typename std::iterator_traits< <template-parameter-1-1> >::value_type, typename std::iterator_traits< <template-parameter-1-1> >::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = __gnu_cxx::__normal_iterator<void**, std::vector<void*> >; ID = adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, int&, vertex_index_t>; typename std::iterator_traits< <template-parameter-1-1> >::value_type = void*; typename std::iterator_traits< <template-parameter-1-1> >::reference = void*&]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
dominatorTree.cpp:44:40: required from here
44 | make_iterator_property_map(domTreePredVector.begin(), v1_index_map);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
20 | ~usage_requirements() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/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<void**, std::vector<void*> >]’
37 | ~model()
| ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:601:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
601 | BOOST_CONCEPT_USAGE(RandomAccessIterator)
| ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Assignable<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > > > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:145:5: required from ‘struct boost::Assignable<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > > >’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > > >’
502 | BOOST_concept(InputIterator,(TT))
| ^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:540:3: required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > > >’
540 | BOOST_concept(ForwardIterator,(TT))
| ^~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > > >’
568 | BOOST_concept(BidirectionalIterator,(TT))
| ^~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > > >’
597 | BOOST_concept(RandomAccessIterator,(TT))
| ^~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied<boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > > > >::value’
44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied<boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > > > >’
45 | typedef boost::integral_constant<bool, value> type;
| ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_<void (*)(boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > > >)>’
72 | struct requirement_<void(*)(Model)>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map<RAIter, ID, typename std::iterator_traits< <template-parameter-1-1> >::value_type, typename std::iterator_traits< <template-parameter-1-1> >::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = __gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > >; ID = adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; typename std::iterator_traits< <template-parameter-1-1> >::value_type = long unsigned int; typename std::iterator_traits< <template-parameter-1-1> >::reference = long unsigned int&]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dominator_tree.hpp:351:48: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename graph_traits<Graph>::vertex_descriptor&, DomTreePredMap) [with Graph = adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >; DomTreePredMap = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, int&, vertex_index_t> >; typename graph_traits<Graph>::vertex_descriptor = void*]’
351 | TimeMap dfnumMap(make_iterator_property_map(dfnum.begin(), indexMap));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~
dominatorTree.cpp:46:36: required from here
46 | lengauer_tarjan_dominator_tree(g, vertex(v, g), domTreePredMap);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Assignable<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > > >]’
20 | ~usage_requirements() { ((Model*)0)->~Model(); }
| ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::EqualityComparable<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > > > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > > >’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > > >’
502 | BOOST_concept(InputIterator,(TT))
| ^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:540:3: required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > > >’
540 | BOOST_concept(ForwardIterator,(TT))
| ^~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > > >’
568 | BOOST_concept(BidirectionalIterator,(TT))
| ^~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > > >’
597 | BOOST_concept(RandomAccessIterator,(TT))
| ^~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied<boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > > > >::value’
44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied<boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > > > >’
45 | typedef boost::integral_constant<bool, value> type;
| ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_<void (*)(boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > > >)>’
72 | struct requirement_<void(*)(Model)>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map<RAIter, ID, typename std::iterator_traits< <template-parameter-1-1> >::value_type, typename std::iterator_traits< <template-parameter-1-1> >::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = __gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > >; ID = adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; typename std::iterator_traits< <template-parameter-1-1> >::value_type = long unsigned int; typename std::iterator_traits< <template-parameter-1-1> >::reference = long unsigned int&]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dominator_tree.hpp:351:48: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename graph_traits<Graph>::vertex_descriptor&, DomTreePredMap) [with Graph = adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >; DomTreePredMap = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, int&, vertex_index_t> >; typename graph_traits<Graph>::vertex_descriptor = void*]’
351 | TimeMap dfnumMap(make_iterator_property_map(dfnum.begin(), indexMap));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~
dominatorTree.cpp:46:36: required from here
46 | lengauer_tarjan_dominator_tree(g, vertex(v, g), domTreePredMap);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::EqualityComparable<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > > >]’
20 | ~usage_requirements() { ((Model*)0)->~Model(); }
| ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::InputIterator<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > > > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:512:7: required from ‘struct boost::InputIterator<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > > >’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:540:3: required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > > >’
540 | BOOST_concept(ForwardIterator,(TT))
| ^~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > > >’
568 | BOOST_concept(BidirectionalIterator,(TT))
| ^~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > > >’
597 | BOOST_concept(RandomAccessIterator,(TT))
| ^~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied<boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > > > >::value’
44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied<boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > > > >’
45 | typedef boost::integral_constant<bool, value> type;
| ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_<void (*)(boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > > >)>’
72 | struct requirement_<void(*)(Model)>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map<RAIter, ID, typename std::iterator_traits< <template-parameter-1-1> >::value_type, typename std::iterator_traits< <template-parameter-1-1> >::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = __gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > >; ID = adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; typename std::iterator_traits< <template-parameter-1-1> >::value_type = long unsigned int; typename std::iterator_traits< <template-parameter-1-1> >::reference = long unsigned int&]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dominator_tree.hpp:351:48: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename graph_traits<Graph>::vertex_descriptor&, DomTreePredMap) [with Graph = adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >; DomTreePredMap = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, int&, vertex_index_t> >; typename graph_traits<Graph>::vertex_descriptor = void*]’
351 | TimeMap dfnumMap(make_iterator_property_map(dfnum.begin(), indexMap));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~
dominatorTree.cpp:46:36: required from here
46 | lengauer_tarjan_dominator_tree(g, vertex(v, g), domTreePredMap);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::InputIterator<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > > >]’
20 | ~usage_requirements() { ((Model*)0)->~Model(); }
| ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::ForwardIterator<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > > > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:543:7: required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > > >’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > > >’
568 | BOOST_concept(BidirectionalIterator,(TT))
| ^~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > > >’
597 | BOOST_concept(RandomAccessIterator,(TT))
| ^~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > > >’
597 | BOOST_concept(RandomAccessIterator,(TT))
| ^~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > > >]’
32 | inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
| ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied<boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > > > >::value’
44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied<boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > > > >’
45 | typedef boost::integral_constant<bool, value> type;
| ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_<void (*)(boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > > >)>’
72 | struct requirement_<void(*)(Model)>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map<RAIter, ID, typename std::iterator_traits< <template-parameter-1-1> >::value_type, typename std::iterator_traits< <template-parameter-1-1> >::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = __gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > >; ID = adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; typename std::iterator_traits< <template-parameter-1-1> >::value_type = long unsigned int; typename std::iterator_traits< <template-parameter-1-1> >::reference = long unsigned int&]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dominator_tree.hpp:351:48: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename graph_traits<Graph>::vertex_descriptor&, DomTreePredMap) [with Graph = adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >; DomTreePredMap = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, int&, vertex_index_t> >; typename graph_traits<Graph>::vertex_descriptor = void*]’
351 | TimeMap dfnumMap(make_iterator_property_map(dfnum.begin(), indexMap));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~
dominatorTree.cpp:46:36: required from here
46 | lengauer_tarjan_dominator_tree(g, vertex(v, g), domTreePredMap);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::ForwardIterator<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > > >]’
20 | ~usage_requirements() { ((Model*)0)->~Model(); }
| ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::BidirectionalIterator<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > > > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:571:7: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > > >’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > > >’
597 | BOOST_concept(RandomAccessIterator,(TT))
| ^~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > > >’
597 | BOOST_concept(RandomAccessIterator,(TT))
| ^~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > > >]’
32 | inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
| ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied<boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > > > >::value’
44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied<boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > > > >’
45 | typedef boost::integral_constant<bool, value> type;
| ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_<void (*)(boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > > >)>’
72 | struct requirement_<void(*)(Model)>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map<RAIter, ID, typename std::iterator_traits< <template-parameter-1-1> >::value_type, typename std::iterator_traits< <template-parameter-1-1> >::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = __gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > >; ID = adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; typename std::iterator_traits< <template-parameter-1-1> >::value_type = long unsigned int; typename std::iterator_traits< <template-parameter-1-1> >::reference = long unsigned int&]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dominator_tree.hpp:351:48: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename graph_traits<Graph>::vertex_descriptor&, DomTreePredMap) [with Graph = adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >; DomTreePredMap = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, int&, vertex_index_t> >; typename graph_traits<Graph>::vertex_descriptor = void*]’
351 | TimeMap dfnumMap(make_iterator_property_map(dfnum.begin(), indexMap));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~
dominatorTree.cpp:46:36: required from here
46 | lengauer_tarjan_dominator_tree(g, vertex(v, g), domTreePredMap);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::BidirectionalIterator<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > > >]’
20 | ~usage_requirements() { ((Model*)0)->~Model(); }
| ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Comparable<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > > > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:253:5: required from ‘struct boost::Comparable<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > > >’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > > >’
597 | BOOST_concept(RandomAccessIterator,(TT))
| ^~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > > >’
597 | BOOST_concept(RandomAccessIterator,(TT))
| ^~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > > >]’
32 | inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
| ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied<boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > > > >::value’
44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied<boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > > > >’
45 | typedef boost::integral_constant<bool, value> type;
| ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_<void (*)(boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > > >)>’
72 | struct requirement_<void(*)(Model)>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map<RAIter, ID, typename std::iterator_traits< <template-parameter-1-1> >::value_type, typename std::iterator_traits< <template-parameter-1-1> >::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = __gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > >; ID = adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; typename std::iterator_traits< <template-parameter-1-1> >::value_type = long unsigned int; typename std::iterator_traits< <template-parameter-1-1> >::reference = long unsigned int&]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dominator_tree.hpp:351:48: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename graph_traits<Graph>::vertex_descriptor&, DomTreePredMap) [with Graph = adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >; DomTreePredMap = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, int&, vertex_index_t> >; typename graph_traits<Graph>::vertex_descriptor = void*]’
351 | TimeMap dfnumMap(make_iterator_property_map(dfnum.begin(), indexMap));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~
dominatorTree.cpp:46:36: required from here
46 | lengauer_tarjan_dominator_tree(g, vertex(v, g), domTreePredMap);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Comparable<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > > >]’
20 | ~usage_requirements() { ((Model*)0)->~Model(); }
| ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::RandomAccessIterator<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > > > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:601:7: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > > >’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > > >’
597 | BOOST_concept(RandomAccessIterator,(TT))
| ^~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > > >]’
32 | inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
| ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied<boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > > > >::value’
44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied<boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > > > >’
45 | typedef boost::integral_constant<bool, value> type;
| ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_<void (*)(boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > > >)>’
72 | struct requirement_<void(*)(Model)>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map<RAIter, ID, typename std::iterator_traits< <template-parameter-1-1> >::value_type, typename std::iterator_traits< <template-parameter-1-1> >::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = __gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > >; ID = adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; typename std::iterator_traits< <template-parameter-1-1> >::value_type = long unsigned int; typename std::iterator_traits< <template-parameter-1-1> >::reference = long unsigned int&]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dominator_tree.hpp:351:48: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename graph_traits<Graph>::vertex_descriptor&, DomTreePredMap) [with Graph = adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >; DomTreePredMap = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, int&, vertex_index_t> >; typename graph_traits<Graph>::vertex_descriptor = void*]’
351 | TimeMap dfnumMap(make_iterator_property_map(dfnum.begin(), indexMap));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~
dominatorTree.cpp:46:36: required from here
46 | lengauer_tarjan_dominator_tree(g, vertex(v, g), domTreePredMap);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::RandomAccessIterator<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > > >]’
20 | ~usage_requirements() { ((Model*)0)->~Model(); }
| ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map<RAIter, ID, typename std::iterator_traits< <template-parameter-1-1> >::value_type, typename std::iterator_traits< <template-parameter-1-1> >::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = __gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > >; ID = adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; typename std::iterator_traits< <template-parameter-1-1> >::value_type = long unsigned int; typename std::iterator_traits< <template-parameter-1-1> >::reference = long unsigned int&]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dominator_tree.hpp:351:48: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename graph_traits<Graph>::vertex_descriptor&, DomTreePredMap) [with Graph = adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >; DomTreePredMap = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, int&, vertex_index_t> >; typename graph_traits<Graph>::vertex_descriptor = void*]’
351 | TimeMap dfnumMap(make_iterator_property_map(dfnum.begin(), indexMap));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~
dominatorTree.cpp:46:36: required from here
46 | lengauer_tarjan_dominator_tree(g, vertex(v, g), domTreePredMap);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:17: note: in a call to non-static member function ‘boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > > >::~RandomAccessIteratorConcept()’
597 | BOOST_concept(RandomAccessIterator,(TT))
| ^~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/preprocessor/cat.hpp:29:34: note: in definition of macro ‘BOOST_PP_CAT_I’
29 | # define BOOST_PP_CAT_I(a, b) a ## b
| ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/concept_def.hpp:23:12: note: in expansion of macro ‘BOOST_PP_CAT’
23 | struct BOOST_PP_CAT(name,Concept) \
| ^~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3: note: in expansion of macro ‘BOOST_concept’
597 | BOOST_concept(RandomAccessIterator,(TT))
| ^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/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::bidirectionalS, boost::property<boost::vertex_index_t, int> > > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:66:5: required from ‘struct boost::concepts::Graph<boost::adjacency_list<boost::vecS, boost::listS, boost::bidirectionalS, boost::property<boost::vertex_index_t, int> > >’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:75:1: required from ‘struct boost::concepts::IncidenceGraph<boost::adjacency_list<boost::vecS, boost::listS, boost::bidirectionalS, boost::property<boost::vertex_index_t, int> > >’
75 | BOOST_concept(IncidenceGraph, (G)) : Graph< G >
| ^~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:118:1: required from ‘struct boost::concepts::BidirectionalGraph<boost::adjacency_list<boost::vecS, boost::listS, boost::bidirectionalS, boost::property<boost::vertex_index_t, int> > >’
118 | BOOST_concept(BidirectionalGraph, (G)) : IncidenceGraph< G >
| ^~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:118:1: required from ‘struct boost::concepts::BidirectionalGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::bidirectionalS, boost::property<boost::vertex_index_t, int> > >’
118 | BOOST_concept(BidirectionalGraph, (G)) : IncidenceGraph< G >
| ^~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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::BidirectionalGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::bidirectionalS, boost::property<boost::vertex_index_t, int> > >]’
32 | inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
| ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied<boost::concepts::BidirectionalGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::bidirectionalS, boost::property<boost::vertex_index_t, int> > > >::value’
44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied<boost::concepts::BidirectionalGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::bidirectionalS, boost::property<boost::vertex_index_t, int> > > >’
45 | typedef boost::integral_constant<bool, value> type;
| ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_<void (*)(boost::concepts::BidirectionalGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::bidirectionalS, boost::property<boost::vertex_index_t, int> > >)>’
72 | struct requirement_<void(*)(Model)>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dominator_tree.hpp:245:5: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename graph_traits<Graph>::vertex_descriptor&, const IndexMap&, TimeMap, PredMap, VertexVector&, DomTreePredMap) [with Graph = adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >; IndexMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; TimeMap = iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>, long unsigned int, long unsigned int&>; PredMap = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>, void*, void*&>; VertexVector = std::vector<void*>; DomTreePredMap = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, int&, vertex_index_t> >; typename graph_traits<Graph>::vertex_descriptor = void*]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dominator_tree.hpp:360:35: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename graph_traits<Graph>::vertex_descriptor&, DomTreePredMap) [with Graph = adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >; DomTreePredMap = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, int&, vertex_index_t> >; typename graph_traits<Graph>::vertex_descriptor = void*]’
360 | lengauer_tarjan_dominator_tree(g, entry, indexMap, dfnumMap, parentMap,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
361 | verticesByDFNum, domTreePredMap);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
dominatorTree.cpp:46:36: required from here
46 | lengauer_tarjan_dominator_tree(g, vertex(v, g), domTreePredMap);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/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::bidirectionalS, boost::property<boost::vertex_index_t, int> > >]’
20 | ~usage_requirements() { ((Model*)0)->~Model(); }
| ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/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::bidirectionalS, boost::property<boost::vertex_index_t, int> > > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:87:5: required from ‘struct boost::concepts::IncidenceGraph<boost::adjacency_list<boost::vecS, boost::listS, boost::bidirectionalS, boost::property<boost::vertex_index_t, int> > >’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:118:1: required from ‘struct boost::concepts::BidirectionalGraph<boost::adjacency_list<boost::vecS, boost::listS, boost::bidirectionalS, boost::property<boost::vertex_index_t, int> > >’
118 | BOOST_concept(BidirectionalGraph, (G)) : IncidenceGraph< G >
| ^~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:118:1: required from ‘struct boost::concepts::BidirectionalGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::bidirectionalS, boost::property<boost::vertex_index_t, int> > >’
118 | BOOST_concept(BidirectionalGraph, (G)) : IncidenceGraph< G >
| ^~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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::BidirectionalGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::bidirectionalS, boost::property<boost::vertex_index_t, int> > >]’
32 | inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
| ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied<boost::concepts::BidirectionalGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::bidirectionalS, boost::property<boost::vertex_index_t, int> > > >::value’
44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied<boost::concepts::BidirectionalGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::bidirectionalS, boost::property<boost::vertex_index_t, int> > > >’
45 | typedef boost::integral_constant<bool, value> type;
| ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_<void (*)(boost::concepts::BidirectionalGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::bidirectionalS, boost::property<boost::vertex_index_t, int> > >)>’
72 | struct requirement_<void(*)(Model)>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dominator_tree.hpp:245:5: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename graph_traits<Graph>::vertex_descriptor&, const IndexMap&, TimeMap, PredMap, VertexVector&, DomTreePredMap) [with Graph = adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >; IndexMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; TimeMap = iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>, long unsigned int, long unsigned int&>; PredMap = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>, void*, void*&>; VertexVector = std::vector<void*>; DomTreePredMap = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, int&, vertex_index_t> >; typename graph_traits<Graph>::vertex_descriptor = void*]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dominator_tree.hpp:360:35: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename graph_traits<Graph>::vertex_descriptor&, DomTreePredMap) [with Graph = adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >; DomTreePredMap = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, int&, vertex_index_t> >; typename graph_traits<Graph>::vertex_descriptor = void*]’
360 | lengauer_tarjan_dominator_tree(g, entry, indexMap, dfnumMap, parentMap,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
361 | verticesByDFNum, domTreePredMap);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
dominatorTree.cpp:46:36: required from here
46 | lengauer_tarjan_dominator_tree(g, vertex(v, g), domTreePredMap);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/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::bidirectionalS, boost::property<boost::vertex_index_t, int> > >]’
20 | ~usage_requirements() { ((Model*)0)->~Model(); }
| ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/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::BidirectionalGraph<boost::adjacency_list<boost::vecS, boost::listS, boost::bidirectionalS, boost::property<boost::vertex_index_t, int> > > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:123:5: required from ‘struct boost::concepts::BidirectionalGraph<boost::adjacency_list<boost::vecS, boost::listS, boost::bidirectionalS, boost::property<boost::vertex_index_t, int> > >’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:118:1: required from ‘struct boost::concepts::BidirectionalGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::bidirectionalS, boost::property<boost::vertex_index_t, int> > >’
118 | BOOST_concept(BidirectionalGraph, (G)) : IncidenceGraph< G >
| ^~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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::BidirectionalGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::bidirectionalS, boost::property<boost::vertex_index_t, int> > >]’
32 | inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
| ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied<boost::concepts::BidirectionalGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::bidirectionalS, boost::property<boost::vertex_index_t, int> > > >::value’
44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied<boost::concepts::BidirectionalGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::bidirectionalS, boost::property<boost::vertex_index_t, int> > > >’
45 | typedef boost::integral_constant<bool, value> type;
| ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_<void (*)(boost::concepts::BidirectionalGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::bidirectionalS, boost::property<boost::vertex_index_t, int> > >)>’
72 | struct requirement_<void(*)(Model)>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dominator_tree.hpp:245:5: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename graph_traits<Graph>::vertex_descriptor&, const IndexMap&, TimeMap, PredMap, VertexVector&, DomTreePredMap) [with Graph = adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >; IndexMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; TimeMap = iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>, long unsigned int, long unsigned int&>; PredMap = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>, void*, void*&>; VertexVector = std::vector<void*>; DomTreePredMap = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, int&, vertex_index_t> >; typename graph_traits<Graph>::vertex_descriptor = void*]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dominator_tree.hpp:360:35: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename graph_traits<Graph>::vertex_descriptor&, DomTreePredMap) [with Graph = adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >; DomTreePredMap = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, int&, vertex_index_t> >; typename graph_traits<Graph>::vertex_descriptor = void*]’
360 | lengauer_tarjan_dominator_tree(g, entry, indexMap, dfnumMap, parentMap,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
361 | verticesByDFNum, domTreePredMap);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
dominatorTree.cpp:46:36: required from here
46 | lengauer_tarjan_dominator_tree(g, vertex(v, g), domTreePredMap);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/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::BidirectionalGraph<boost::adjacency_list<boost::vecS, boost::listS, boost::bidirectionalS, boost::property<boost::vertex_index_t, int> > >]’
20 | ~usage_requirements() { ((Model*)0)->~Model(); }
| ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::BidirectionalGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::bidirectionalS, boost::property<boost::vertex_index_t, int> > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dominator_tree.hpp:245:5: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename graph_traits<Graph>::vertex_descriptor&, const IndexMap&, TimeMap, PredMap, VertexVector&, DomTreePredMap) [with Graph = adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >; IndexMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; TimeMap = iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>, long unsigned int, long unsigned int&>; PredMap = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>, void*, void*&>; VertexVector = std::vector<void*>; DomTreePredMap = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, int&, vertex_index_t> >; typename graph_traits<Graph>::vertex_descriptor = void*]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dominator_tree.hpp:360:35: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename graph_traits<Graph>::vertex_descriptor&, DomTreePredMap) [with Graph = adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >; DomTreePredMap = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, int&, vertex_index_t> >; typename graph_traits<Graph>::vertex_descriptor = void*]’
360 | lengauer_tarjan_dominator_tree(g, entry, indexMap, dfnumMap, parentMap,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
361 | verticesByDFNum, domTreePredMap);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
dominatorTree.cpp:46:36: required from here
46 | lengauer_tarjan_dominator_tree(g, vertex(v, g), domTreePredMap);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:118:15: note: in a call to non-static member function ‘boost::concepts::BidirectionalGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::bidirectionalS, boost::property<boost::vertex_index_t, int> > >::~BidirectionalGraphConcept()’
118 | BOOST_concept(BidirectionalGraph, (G)) : IncidenceGraph< G >
| ^~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/preprocessor/cat.hpp:29:34: note: in definition of macro ‘BOOST_PP_CAT_I’
29 | # define BOOST_PP_CAT_I(a, b) a ## b
| ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/concept_def.hpp:23:12: note: in expansion of macro ‘BOOST_PP_CAT’
23 | struct BOOST_PP_CAT(name,Concept) \
| ^~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:118:1: note: in expansion of macro ‘BOOST_concept’
118 | BOOST_concept(BidirectionalGraph, (G)) : IncidenceGraph< G >
| ^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Convertible<std::random_access_iterator_tag, std::random_access_iterator_tag> >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/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> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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);
| ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/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) );
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/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;
| ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/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)>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:603:11: required from ‘boost::RandomAccessIterator<TT>::~RandomAccessIterator() [with TT = __gnu_cxx::__normal_iterator<void**, std::vector<void*> >]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3: required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<void**, std::vector<void*> > >]’
597 | BOOST_concept(RandomAccessIterator,(TT))
| ^~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map<RAIter, ID, typename std::iterator_traits< <template-parameter-1-1> >::value_type, typename std::iterator_traits< <template-parameter-1-1> >::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = __gnu_cxx::__normal_iterator<void**, std::vector<void*> >; ID = adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, int&, vertex_index_t>; typename std::iterator_traits< <template-parameter-1-1> >::value_type = void*; typename std::iterator_traits< <template-parameter-1-1> >::reference = void*&]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
dominatorTree.cpp:44:40: required from here
44 | make_iterator_property_map(domTreePredVector.begin(), v1_index_map);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Convertible<std::random_access_iterator_tag, std::random_access_iterator_tag>]’
20 | ~usage_requirements() { ((Model*)0)->~Model(); }
| ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::Convertible<std::random_access_iterator_tag, std::random_access_iterator_tag>]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:603:11: required from ‘boost::RandomAccessIterator<TT>::~RandomAccessIterator() [with TT = __gnu_cxx::__normal_iterator<void**, std::vector<void*> >]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3: required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<void**, std::vector<void*> > >]’
597 | BOOST_concept(RandomAccessIterator,(TT))
| ^~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map<RAIter, ID, typename std::iterator_traits< <template-parameter-1-1> >::value_type, typename std::iterator_traits< <template-parameter-1-1> >::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = __gnu_cxx::__normal_iterator<void**, std::vector<void*> >; ID = adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, int&, vertex_index_t>; typename std::iterator_traits< <template-parameter-1-1> >::value_type = void*; typename std::iterator_traits< <template-parameter-1-1> >::reference = void*&]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
dominatorTree.cpp:44:40: required from here
44 | make_iterator_property_map(domTreePredVector.begin(), v1_index_map);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible<X, Y>::~Convertible() [with X = std::random_access_iterator_tag; Y = std::random_access_iterator_tag]’
37 | ~model()
| ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
208 | BOOST_CONCEPT_USAGE(Convertible) {
| ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Assignable<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Assignable<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > > > >]’
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:145:5: required from ‘struct boost::Assignable<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > > >’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > > >’
502 | BOOST_concept(InputIterator,(TT))
| ^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:540:3: required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > > >’
540 | BOOST_concept(ForwardIterator,(TT))
| ^~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > > >’
568 | BOOST_concept(BidirectionalIterator,(TT))
| ^~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied<boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > > > >::value’
44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied<boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > > > >’
45 | typedef boost::integral_constant<bool, value> type;
| ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_<void (*)(boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > > >)>’
72 | struct requirement_<void(*)(Model)>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map<RAIter, ID, typename std::iterator_traits< <template-parameter-1-1> >::value_type, typename std::iterator_traits< <template-parameter-1-1> >::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = __gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > >; ID = adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; typename std::iterator_traits< <template-parameter-1-1> >::value_type = long unsigned int; typename std::iterator_traits< <template-parameter-1-1> >::reference = long unsigned int&]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dominator_tree.hpp:351:48: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename graph_traits<Graph>::vertex_descriptor&, DomTreePredMap) [with Graph = adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >; DomTreePredMap = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, int&, vertex_index_t> >; typename graph_traits<Graph>::vertex_descriptor = void*]’
351 | TimeMap dfnumMap(make_iterator_property_map(dfnum.begin(), indexMap));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~
dominatorTree.cpp:46:36: required from here
46 | lengauer_tarjan_dominator_tree(g, vertex(v, g), domTreePredMap);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
20 | ~usage_requirements() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Assignable<TT>::~Assignable() [with TT = __gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > >]’
37 | ~model()
| ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:145:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
145 | BOOST_CONCEPT_USAGE(Assignable) {
| ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::EqualityComparable<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::EqualityComparable<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > > > >]’
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > > >’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > > >’
502 | BOOST_concept(InputIterator,(TT))
| ^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:540:3: required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > > >’
540 | BOOST_concept(ForwardIterator,(TT))
| ^~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > > >’
568 | BOOST_concept(BidirectionalIterator,(TT))
| ^~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied<boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > > > >::value’
44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied<boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > > > >’
45 | typedef boost::integral_constant<bool, value> type;
| ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_<void (*)(boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > > >)>’
72 | struct requirement_<void(*)(Model)>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map<RAIter, ID, typename std::iterator_traits< <template-parameter-1-1> >::value_type, typename std::iterator_traits< <template-parameter-1-1> >::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = __gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > >; ID = adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; typename std::iterator_traits< <template-parameter-1-1> >::value_type = long unsigned int; typename std::iterator_traits< <template-parameter-1-1> >::reference = long unsigned int&]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dominator_tree.hpp:351:48: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename graph_traits<Graph>::vertex_descriptor&, DomTreePredMap) [with Graph = adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >; DomTreePredMap = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, int&, vertex_index_t> >; typename graph_traits<Graph>::vertex_descriptor = void*]’
351 | TimeMap dfnumMap(make_iterator_property_map(dfnum.begin(), indexMap));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~
dominatorTree.cpp:46:36: required from here
46 | lengauer_tarjan_dominator_tree(g, vertex(v, g), domTreePredMap);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
20 | ~usage_requirements() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::EqualityComparable<TT>::~EqualityComparable() [with TT = __gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > >]’
37 | ~model()
| ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:233:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
233 | BOOST_CONCEPT_USAGE(EqualityComparable) {
| ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::InputIterator<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::InputIterator<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > > > >]’
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:512:7: required from ‘struct boost::InputIterator<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > > >’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:540:3: required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > > >’
540 | BOOST_concept(ForwardIterator,(TT))
| ^~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > > >’
568 | BOOST_concept(BidirectionalIterator,(TT))
| ^~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > > >’
597 | BOOST_concept(RandomAccessIterator,(TT))
| ^~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied<boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > > > >::value’
44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied<boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > > > >’
45 | typedef boost::integral_constant<bool, value> type;
| ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_<void (*)(boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > > >)>’
72 | struct requirement_<void(*)(Model)>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map<RAIter, ID, typename std::iterator_traits< <template-parameter-1-1> >::value_type, typename std::iterator_traits< <template-parameter-1-1> >::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = __gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > >; ID = adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; typename std::iterator_traits< <template-parameter-1-1> >::value_type = long unsigned int; typename std::iterator_traits< <template-parameter-1-1> >::reference = long unsigned int&]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dominator_tree.hpp:351:48: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename graph_traits<Graph>::vertex_descriptor&, DomTreePredMap) [with Graph = adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >; DomTreePredMap = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, int&, vertex_index_t> >; typename graph_traits<Graph>::vertex_descriptor = void*]’
351 | TimeMap dfnumMap(make_iterator_property_map(dfnum.begin(), indexMap));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~
dominatorTree.cpp:46:36: required from here
46 | lengauer_tarjan_dominator_tree(g, vertex(v, g), domTreePredMap);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
20 | ~usage_requirements() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::InputIterator<TT>::~InputIterator() [with TT = __gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > >]’
37 | ~model()
| ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:512:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
512 | BOOST_CONCEPT_USAGE(InputIterator)
| ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::ForwardIterator<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::ForwardIterator<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > > > >]’
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:543:7: required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > > >’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > > >’
568 | BOOST_concept(BidirectionalIterator,(TT))
| ^~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > > >’
597 | BOOST_concept(RandomAccessIterator,(TT))
| ^~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied<boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > > > >::value’
44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied<boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > > > >’
45 | typedef boost::integral_constant<bool, value> type;
| ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_<void (*)(boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > > >)>’
72 | struct requirement_<void(*)(Model)>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map<RAIter, ID, typename std::iterator_traits< <template-parameter-1-1> >::value_type, typename std::iterator_traits< <template-parameter-1-1> >::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = __gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > >; ID = adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; typename std::iterator_traits< <template-parameter-1-1> >::value_type = long unsigned int; typename std::iterator_traits< <template-parameter-1-1> >::reference = long unsigned int&]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dominator_tree.hpp:351:48: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename graph_traits<Graph>::vertex_descriptor&, DomTreePredMap) [with Graph = adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >; DomTreePredMap = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, int&, vertex_index_t> >; typename graph_traits<Graph>::vertex_descriptor = void*]’
351 | TimeMap dfnumMap(make_iterator_property_map(dfnum.begin(), indexMap));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~
dominatorTree.cpp:46:36: required from here
46 | lengauer_tarjan_dominator_tree(g, vertex(v, g), domTreePredMap);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
20 | ~usage_requirements() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::ForwardIterator<TT>::~ForwardIterator() [with TT = __gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > >]’
37 | ~model()
| ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:543:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
543 | BOOST_CONCEPT_USAGE(ForwardIterator)
| ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::BidirectionalIterator<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::BidirectionalIterator<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > > > >]’
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:571:7: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > > >’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > > >’
597 | BOOST_concept(RandomAccessIterator,(TT))
| ^~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > > >’
597 | BOOST_concept(RandomAccessIterator,(TT))
| ^~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > > >]’
32 | inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
| ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied<boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > > > >::value’
44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied<boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > > > >’
45 | typedef boost::integral_constant<bool, value> type;
| ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_<void (*)(boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > > >)>’
72 | struct requirement_<void(*)(Model)>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map<RAIter, ID, typename std::iterator_traits< <template-parameter-1-1> >::value_type, typename std::iterator_traits< <template-parameter-1-1> >::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = __gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > >; ID = adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; typename std::iterator_traits< <template-parameter-1-1> >::value_type = long unsigned int; typename std::iterator_traits< <template-parameter-1-1> >::reference = long unsigned int&]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dominator_tree.hpp:351:48: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename graph_traits<Graph>::vertex_descriptor&, DomTreePredMap) [with Graph = adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >; DomTreePredMap = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, int&, vertex_index_t> >; typename graph_traits<Graph>::vertex_descriptor = void*]’
351 | TimeMap dfnumMap(make_iterator_property_map(dfnum.begin(), indexMap));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~
dominatorTree.cpp:46:36: required from here
46 | lengauer_tarjan_dominator_tree(g, vertex(v, g), domTreePredMap);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
20 | ~usage_requirements() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::BidirectionalIterator<TT>::~BidirectionalIterator() [with TT = __gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > >]’
37 | ~model()
| ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:571:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
571 | BOOST_CONCEPT_USAGE(BidirectionalIterator)
| ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Comparable<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Comparable<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > > > >]’
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:253:5: required from ‘struct boost::Comparable<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > > >’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > > >’
597 | BOOST_concept(RandomAccessIterator,(TT))
| ^~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > > >’
597 | BOOST_concept(RandomAccessIterator,(TT))
| ^~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > > >]’
32 | inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
| ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied<boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > > > >::value’
44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied<boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > > > >’
45 | typedef boost::integral_constant<bool, value> type;
| ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_<void (*)(boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > > >)>’
72 | struct requirement_<void(*)(Model)>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map<RAIter, ID, typename std::iterator_traits< <template-parameter-1-1> >::value_type, typename std::iterator_traits< <template-parameter-1-1> >::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = __gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > >; ID = adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; typename std::iterator_traits< <template-parameter-1-1> >::value_type = long unsigned int; typename std::iterator_traits< <template-parameter-1-1> >::reference = long unsigned int&]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dominator_tree.hpp:351:48: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename graph_traits<Graph>::vertex_descriptor&, DomTreePredMap) [with Graph = adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >; DomTreePredMap = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, int&, vertex_index_t> >; typename graph_traits<Graph>::vertex_descriptor = void*]’
351 | TimeMap dfnumMap(make_iterator_property_map(dfnum.begin(), indexMap));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~
dominatorTree.cpp:46:36: required from here
46 | lengauer_tarjan_dominator_tree(g, vertex(v, g), domTreePredMap);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
20 | ~usage_requirements() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Comparable<TT>::~Comparable() [with TT = __gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > >]’
37 | ~model()
| ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:253:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
253 | BOOST_CONCEPT_USAGE(Comparable) {
| ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::RandomAccessIterator<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::RandomAccessIterator<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > > > >]’
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:601:7: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > > >’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > > >’
597 | BOOST_concept(RandomAccessIterator,(TT))
| ^~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > > >]’
32 | inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
| ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied<boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > > > >::value’
44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied<boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > > > >’
45 | typedef boost::integral_constant<bool, value> type;
| ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_<void (*)(boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > > >)>’
72 | struct requirement_<void(*)(Model)>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map<RAIter, ID, typename std::iterator_traits< <template-parameter-1-1> >::value_type, typename std::iterator_traits< <template-parameter-1-1> >::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = __gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > >; ID = adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; typename std::iterator_traits< <template-parameter-1-1> >::value_type = long unsigned int; typename std::iterator_traits< <template-parameter-1-1> >::reference = long unsigned int&]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dominator_tree.hpp:351:48: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename graph_traits<Graph>::vertex_descriptor&, DomTreePredMap) [with Graph = adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >; DomTreePredMap = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, int&, vertex_index_t> >; typename graph_traits<Graph>::vertex_descriptor = void*]’
351 | TimeMap dfnumMap(make_iterator_property_map(dfnum.begin(), indexMap));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~
dominatorTree.cpp:46:36: required from here
46 | lengauer_tarjan_dominator_tree(g, vertex(v, g), domTreePredMap);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
20 | ~usage_requirements() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::RandomAccessIterator<TT>::~RandomAccessIterator() [with TT = __gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > >]’
37 | ~model()
| ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:601:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
601 | BOOST_CONCEPT_USAGE(RandomAccessIterator)
| ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/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::bidirectionalS, boost::property<boost::vertex_index_t, int> > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/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::bidirectionalS, boost::property<boost::vertex_index_t, int> > > >]’
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:66:5: required from ‘struct boost::concepts::Graph<boost::adjacency_list<boost::vecS, boost::listS, boost::bidirectionalS, boost::property<boost::vertex_index_t, int> > >’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:75:1: required from ‘struct boost::concepts::IncidenceGraph<boost::adjacency_list<boost::vecS, boost::listS, boost::bidirectionalS, boost::property<boost::vertex_index_t, int> > >’
75 | BOOST_concept(IncidenceGraph, (G)) : Graph< G >
| ^~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:118:1: required from ‘struct boost::concepts::BidirectionalGraph<boost::adjacency_list<boost::vecS, boost::listS, boost::bidirectionalS, boost::property<boost::vertex_index_t, int> > >’
118 | BOOST_concept(BidirectionalGraph, (G)) : IncidenceGraph< G >
| ^~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:118:1: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied<boost::concepts::BidirectionalGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::bidirectionalS, boost::property<boost::vertex_index_t, int> > > >::value’
44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied<boost::concepts::BidirectionalGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::bidirectionalS, boost::property<boost::vertex_index_t, int> > > >’
45 | typedef boost::integral_constant<bool, value> type;
| ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_<void (*)(boost::concepts::BidirectionalGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::bidirectionalS, boost::property<boost::vertex_index_t, int> > >)>’
72 | struct requirement_<void(*)(Model)>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dominator_tree.hpp:245:5: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename graph_traits<Graph>::vertex_descriptor&, const IndexMap&, TimeMap, PredMap, VertexVector&, DomTreePredMap) [with Graph = adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >; IndexMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; TimeMap = iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>, long unsigned int, long unsigned int&>; PredMap = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>, void*, void*&>; VertexVector = std::vector<void*>; DomTreePredMap = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, int&, vertex_index_t> >; typename graph_traits<Graph>::vertex_descriptor = void*]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dominator_tree.hpp:360:35: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename graph_traits<Graph>::vertex_descriptor&, DomTreePredMap) [with Graph = adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >; DomTreePredMap = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, int&, vertex_index_t> >; typename graph_traits<Graph>::vertex_descriptor = void*]’
360 | lengauer_tarjan_dominator_tree(g, entry, indexMap, dfnumMap, parentMap,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
361 | verticesByDFNum, domTreePredMap);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
dominatorTree.cpp:46:36: required from here
46 | lengauer_tarjan_dominator_tree(g, vertex(v, g), domTreePredMap);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
20 | ~usage_requirements() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/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::bidirectionalS, boost::property<boost::vertex_index_t, int> >]’
37 | ~model()
| ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:66:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
66 | BOOST_CONCEPT_USAGE(Graph)
| ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/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::bidirectionalS, boost::property<boost::vertex_index_t, int> > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/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::bidirectionalS, boost::property<boost::vertex_index_t, int> > > >]’
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:87:5: required from ‘struct boost::concepts::IncidenceGraph<boost::adjacency_list<boost::vecS, boost::listS, boost::bidirectionalS, boost::property<boost::vertex_index_t, int> > >’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:118:1: required from ‘struct boost::concepts::BidirectionalGraph<boost::adjacency_list<boost::vecS, boost::listS, boost::bidirectionalS, boost::property<boost::vertex_index_t, int> > >’
118 | BOOST_concept(BidirectionalGraph, (G)) : IncidenceGraph< G >
| ^~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:118:1: required from ‘struct boost::concepts::BidirectionalGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::bidirectionalS, boost::property<boost::vertex_index_t, int> > >’
118 | BOOST_concept(BidirectionalGraph, (G)) : IncidenceGraph< G >
| ^~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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::BidirectionalGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::bidirectionalS, boost::property<boost::vertex_index_t, int> > >]’
32 | inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
| ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied<boost::concepts::BidirectionalGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::bidirectionalS, boost::property<boost::vertex_index_t, int> > > >::value’
44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied<boost::concepts::BidirectionalGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::bidirectionalS, boost::property<boost::vertex_index_t, int> > > >’
45 | typedef boost::integral_constant<bool, value> type;
| ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_<void (*)(boost::concepts::BidirectionalGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::bidirectionalS, boost::property<boost::vertex_index_t, int> > >)>’
72 | struct requirement_<void(*)(Model)>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dominator_tree.hpp:245:5: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename graph_traits<Graph>::vertex_descriptor&, const IndexMap&, TimeMap, PredMap, VertexVector&, DomTreePredMap) [with Graph = adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >; IndexMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; TimeMap = iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>, long unsigned int, long unsigned int&>; PredMap = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>, void*, void*&>; VertexVector = std::vector<void*>; DomTreePredMap = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, int&, vertex_index_t> >; typename graph_traits<Graph>::vertex_descriptor = void*]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dominator_tree.hpp:360:35: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename graph_traits<Graph>::vertex_descriptor&, DomTreePredMap) [with Graph = adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >; DomTreePredMap = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, int&, vertex_index_t> >; typename graph_traits<Graph>::vertex_descriptor = void*]’
360 | lengauer_tarjan_dominator_tree(g, entry, indexMap, dfnumMap, parentMap,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
361 | verticesByDFNum, domTreePredMap);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
dominatorTree.cpp:46:36: required from here
46 | lengauer_tarjan_dominator_tree(g, vertex(v, g), domTreePredMap);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
20 | ~usage_requirements() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/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::bidirectionalS, boost::property<boost::vertex_index_t, int> >]’
37 | ~model()
| ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:87:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
87 | BOOST_CONCEPT_USAGE(IncidenceGraph)
| ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::concepts::BidirectionalGraph<boost::adjacency_list<boost::vecS, boost::listS, boost::bidirectionalS, boost::property<boost::vertex_index_t, int> > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/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::BidirectionalGraph<boost::adjacency_list<boost::vecS, boost::listS, boost::bidirectionalS, boost::property<boost::vertex_index_t, int> > > >]’
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:123:5: required from ‘struct boost::concepts::BidirectionalGraph<boost::adjacency_list<boost::vecS, boost::listS, boost::bidirectionalS, boost::property<boost::vertex_index_t, int> > >’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:118:1: required from ‘struct boost::concepts::BidirectionalGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::bidirectionalS, boost::property<boost::vertex_index_t, int> > >’
118 | BOOST_concept(BidirectionalGraph, (G)) : IncidenceGraph< G >
| ^~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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::BidirectionalGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::bidirectionalS, boost::property<boost::vertex_index_t, int> > >]’
32 | inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
| ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied<boost::concepts::BidirectionalGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::bidirectionalS, boost::property<boost::vertex_index_t, int> > > >::value’
44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied<boost::concepts::BidirectionalGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::bidirectionalS, boost::property<boost::vertex_index_t, int> > > >’
45 | typedef boost::integral_constant<bool, value> type;
| ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_<void (*)(boost::concepts::BidirectionalGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::bidirectionalS, boost::property<boost::vertex_index_t, int> > >)>’
72 | struct requirement_<void(*)(Model)>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dominator_tree.hpp:245:5: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename graph_traits<Graph>::vertex_descriptor&, const IndexMap&, TimeMap, PredMap, VertexVector&, DomTreePredMap) [with Graph = adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >; IndexMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; TimeMap = iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>, long unsigned int, long unsigned int&>; PredMap = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>, void*, void*&>; VertexVector = std::vector<void*>; DomTreePredMap = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, int&, vertex_index_t> >; typename graph_traits<Graph>::vertex_descriptor = void*]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dominator_tree.hpp:360:35: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename graph_traits<Graph>::vertex_descriptor&, DomTreePredMap) [with Graph = adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >; DomTreePredMap = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, int&, vertex_index_t> >; typename graph_traits<Graph>::vertex_descriptor = void*]’
360 | lengauer_tarjan_dominator_tree(g, entry, indexMap, dfnumMap, parentMap,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
361 | verticesByDFNum, domTreePredMap);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
dominatorTree.cpp:46:36: required from here
46 | lengauer_tarjan_dominator_tree(g, vertex(v, g), domTreePredMap);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
20 | ~usage_requirements() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::concepts::BidirectionalGraph<G>::~BidirectionalGraph() [with G = boost::adjacency_list<boost::vecS, boost::listS, boost::bidirectionalS, boost::property<boost::vertex_index_t, int> >]’
37 | ~model()
| ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:123:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
123 | BOOST_CONCEPT_USAGE(BidirectionalGraph)
| ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/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<boost::default_color_type*, std::vector<boost::default_color_type> > > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:145:5: required from ‘struct boost::Assignable<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> > >’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> > >’
502 | BOOST_concept(InputIterator,(TT))
| ^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:540:3: required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> > >’
540 | BOOST_concept(ForwardIterator,(TT))
| ^~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> > >’
568 | BOOST_concept(BidirectionalIterator,(TT))
| ^~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> > >’
597 | BOOST_concept(RandomAccessIterator,(TT))
| ^~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied<boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> > > >’
45 | typedef boost::integral_constant<bool, value> type;
| ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_<void (*)(boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> > >)>’
72 | struct requirement_<void(*)(Model)>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map<RAIter, ID, typename std::iterator_traits< <template-parameter-1-1> >::value_type, typename std::iterator_traits< <template-parameter-1-1> >::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = __gnu_cxx::__normal_iterator<default_color_type*, std::vector<default_color_type> >; ID = adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; typename std::iterator_traits< <template-parameter-1-1> >::value_type = default_color_type; typename std::iterator_traits< <template-parameter-1-1> >::reference = default_color_type&]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dominator_tree.hpp:314:35: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename graph_traits<Graph>::vertex_descriptor&, const IndexMap&, TimeMap, PredMap, VertexVector&, DomTreePredMap) [with Graph = adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >; IndexMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; TimeMap = iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>, long unsigned int, long unsigned int&>; PredMap = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>, void*, void*&>; VertexVector = std::vector<void*>; DomTreePredMap = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, int&, vertex_index_t> >; typename graph_traits<Graph>::vertex_descriptor = void*]’
314 | make_iterator_property_map(colors.begin(), indexMap));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dominator_tree.hpp:360:35: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename graph_traits<Graph>::vertex_descriptor&, DomTreePredMap) [with Graph = adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >; DomTreePredMap = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, int&, vertex_index_t> >; typename graph_traits<Graph>::vertex_descriptor = void*]’
360 | lengauer_tarjan_dominator_tree(g, entry, indexMap, dfnumMap, parentMap,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
361 | verticesByDFNum, domTreePredMap);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
dominatorTree.cpp:46:36: required from here
46 | lengauer_tarjan_dominator_tree(g, vertex(v, g), domTreePredMap);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/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<boost::default_color_type*, std::vector<boost::default_color_type> > >]’
20 | ~usage_requirements() { ((Model*)0)->~Model(); }
| ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/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<boost::default_color_type*, std::vector<boost::default_color_type> > > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> > >’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> > >’
502 | BOOST_concept(InputIterator,(TT))
| ^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:540:3: required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> > >’
540 | BOOST_concept(ForwardIterator,(TT))
| ^~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> > >’
568 | BOOST_concept(BidirectionalIterator,(TT))
| ^~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> > >’
597 | BOOST_concept(RandomAccessIterator,(TT))
| ^~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied<boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> > > >’
45 | typedef boost::integral_constant<bool, value> type;
| ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_<void (*)(boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> > >)>’
72 | struct requirement_<void(*)(Model)>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map<RAIter, ID, typename std::iterator_traits< <template-parameter-1-1> >::value_type, typename std::iterator_traits< <template-parameter-1-1> >::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = __gnu_cxx::__normal_iterator<default_color_type*, std::vector<default_color_type> >; ID = adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; typename std::iterator_traits< <template-parameter-1-1> >::value_type = default_color_type; typename std::iterator_traits< <template-parameter-1-1> >::reference = default_color_type&]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dominator_tree.hpp:314:35: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename graph_traits<Graph>::vertex_descriptor&, const IndexMap&, TimeMap, PredMap, VertexVector&, DomTreePredMap) [with Graph = adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >; IndexMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; TimeMap = iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>, long unsigned int, long unsigned int&>; PredMap = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>, void*, void*&>; VertexVector = std::vector<void*>; DomTreePredMap = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, int&, vertex_index_t> >; typename graph_traits<Graph>::vertex_descriptor = void*]’
314 | make_iterator_property_map(colors.begin(), indexMap));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dominator_tree.hpp:360:35: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename graph_traits<Graph>::vertex_descriptor&, DomTreePredMap) [with Graph = adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >; DomTreePredMap = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, int&, vertex_index_t> >; typename graph_traits<Graph>::vertex_descriptor = void*]’
360 | lengauer_tarjan_dominator_tree(g, entry, indexMap, dfnumMap, parentMap,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
361 | verticesByDFNum, domTreePredMap);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
dominatorTree.cpp:46:36: required from here
46 | lengauer_tarjan_dominator_tree(g, vertex(v, g), domTreePredMap);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/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<boost::default_color_type*, std::vector<boost::default_color_type> > >]’
20 | ~usage_requirements() { ((Model*)0)->~Model(); }
| ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/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<boost::default_color_type*, std::vector<boost::default_color_type> > > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:512:7: required from ‘struct boost::InputIterator<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> > >’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:540:3: required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> > >’
540 | BOOST_concept(ForwardIterator,(TT))
| ^~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> > >’
568 | BOOST_concept(BidirectionalIterator,(TT))
| ^~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> > >’
597 | BOOST_concept(RandomAccessIterator,(TT))
| ^~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> > >’
597 | BOOST_concept(RandomAccessIterator,(TT))
| ^~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied<boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> > > >’
45 | typedef boost::integral_constant<bool, value> type;
| ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_<void (*)(boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> > >)>’
72 | struct requirement_<void(*)(Model)>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map<RAIter, ID, typename std::iterator_traits< <template-parameter-1-1> >::value_type, typename std::iterator_traits< <template-parameter-1-1> >::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = __gnu_cxx::__normal_iterator<default_color_type*, std::vector<default_color_type> >; ID = adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; typename std::iterator_traits< <template-parameter-1-1> >::value_type = default_color_type; typename std::iterator_traits< <template-parameter-1-1> >::reference = default_color_type&]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dominator_tree.hpp:314:35: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename graph_traits<Graph>::vertex_descriptor&, const IndexMap&, TimeMap, PredMap, VertexVector&, DomTreePredMap) [with Graph = adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >; IndexMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; TimeMap = iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>, long unsigned int, long unsigned int&>; PredMap = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>, void*, void*&>; VertexVector = std::vector<void*>; DomTreePredMap = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, int&, vertex_index_t> >; typename graph_traits<Graph>::vertex_descriptor = void*]’
314 | make_iterator_property_map(colors.begin(), indexMap));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dominator_tree.hpp:360:35: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename graph_traits<Graph>::vertex_descriptor&, DomTreePredMap) [with Graph = adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >; DomTreePredMap = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, int&, vertex_index_t> >; typename graph_traits<Graph>::vertex_descriptor = void*]’
360 | lengauer_tarjan_dominator_tree(g, entry, indexMap, dfnumMap, parentMap,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
361 | verticesByDFNum, domTreePredMap);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
dominatorTree.cpp:46:36: required from here
46 | lengauer_tarjan_dominator_tree(g, vertex(v, g), domTreePredMap);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/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<boost::default_color_type*, std::vector<boost::default_color_type> > >]’
20 | ~usage_requirements() { ((Model*)0)->~Model(); }
| ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/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<boost::default_color_type*, std::vector<boost::default_color_type> > > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:543:7: required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> > >’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> > >’
568 | BOOST_concept(BidirectionalIterator,(TT))
| ^~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> > >’
597 | BOOST_concept(RandomAccessIterator,(TT))
| ^~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> > >’
597 | BOOST_concept(RandomAccessIterator,(TT))
| ^~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied<boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> > > >’
45 | typedef boost::integral_constant<bool, value> type;
| ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_<void (*)(boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> > >)>’
72 | struct requirement_<void(*)(Model)>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map<RAIter, ID, typename std::iterator_traits< <template-parameter-1-1> >::value_type, typename std::iterator_traits< <template-parameter-1-1> >::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = __gnu_cxx::__normal_iterator<default_color_type*, std::vector<default_color_type> >; ID = adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; typename std::iterator_traits< <template-parameter-1-1> >::value_type = default_color_type; typename std::iterator_traits< <template-parameter-1-1> >::reference = default_color_type&]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dominator_tree.hpp:314:35: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename graph_traits<Graph>::vertex_descriptor&, const IndexMap&, TimeMap, PredMap, VertexVector&, DomTreePredMap) [with Graph = adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >; IndexMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; TimeMap = iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>, long unsigned int, long unsigned int&>; PredMap = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>, void*, void*&>; VertexVector = std::vector<void*>; DomTreePredMap = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, int&, vertex_index_t> >; typename graph_traits<Graph>::vertex_descriptor = void*]’
314 | make_iterator_property_map(colors.begin(), indexMap));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dominator_tree.hpp:360:35: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename graph_traits<Graph>::vertex_descriptor&, DomTreePredMap) [with Graph = adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >; DomTreePredMap = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, int&, vertex_index_t> >; typename graph_traits<Graph>::vertex_descriptor = void*]’
360 | lengauer_tarjan_dominator_tree(g, entry, indexMap, dfnumMap, parentMap,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
361 | verticesByDFNum, domTreePredMap);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
dominatorTree.cpp:46:36: required from here
46 | lengauer_tarjan_dominator_tree(g, vertex(v, g), domTreePredMap);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/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<boost::default_color_type*, std::vector<boost::default_color_type> > >]’
20 | ~usage_requirements() { ((Model*)0)->~Model(); }
| ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/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<boost::default_color_type*, std::vector<boost::default_color_type> > > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:571:7: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> > >’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> > >’
597 | BOOST_concept(RandomAccessIterator,(TT))
| ^~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> > >’
597 | BOOST_concept(RandomAccessIterator,(TT))
| ^~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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<boost::default_color_type*, std::vector<boost::default_color_type> > >]’
32 | inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
| ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied<boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> > > >::value’
44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied<boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> > > >’
45 | typedef boost::integral_constant<bool, value> type;
| ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_<void (*)(boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> > >)>’
72 | struct requirement_<void(*)(Model)>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map<RAIter, ID, typename std::iterator_traits< <template-parameter-1-1> >::value_type, typename std::iterator_traits< <template-parameter-1-1> >::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = __gnu_cxx::__normal_iterator<default_color_type*, std::vector<default_color_type> >; ID = adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; typename std::iterator_traits< <template-parameter-1-1> >::value_type = default_color_type; typename std::iterator_traits< <template-parameter-1-1> >::reference = default_color_type&]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dominator_tree.hpp:314:35: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename graph_traits<Graph>::vertex_descriptor&, const IndexMap&, TimeMap, PredMap, VertexVector&, DomTreePredMap) [with Graph = adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >; IndexMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; TimeMap = iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>, long unsigned int, long unsigned int&>; PredMap = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>, void*, void*&>; VertexVector = std::vector<void*>; DomTreePredMap = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, int&, vertex_index_t> >; typename graph_traits<Graph>::vertex_descriptor = void*]’
314 | make_iterator_property_map(colors.begin(), indexMap));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dominator_tree.hpp:360:35: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename graph_traits<Graph>::vertex_descriptor&, DomTreePredMap) [with Graph = adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >; DomTreePredMap = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, int&, vertex_index_t> >; typename graph_traits<Graph>::vertex_descriptor = void*]’
360 | lengauer_tarjan_dominator_tree(g, entry, indexMap, dfnumMap, parentMap,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
361 | verticesByDFNum, domTreePredMap);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
dominatorTree.cpp:46:36: required from here
46 | lengauer_tarjan_dominator_tree(g, vertex(v, g), domTreePredMap);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/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<boost::default_color_type*, std::vector<boost::default_color_type> > >]’
20 | ~usage_requirements() { ((Model*)0)->~Model(); }
| ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/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<boost::default_color_type*, std::vector<boost::default_color_type> > > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:253:5: required from ‘struct boost::Comparable<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> > >’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> > >’
597 | BOOST_concept(RandomAccessIterator,(TT))
| ^~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> > >’
597 | BOOST_concept(RandomAccessIterator,(TT))
| ^~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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<boost::default_color_type*, std::vector<boost::default_color_type> > >]’
32 | inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
| ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied<boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> > > >::value’
44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied<boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> > > >’
45 | typedef boost::integral_constant<bool, value> type;
| ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_<void (*)(boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> > >)>’
72 | struct requirement_<void(*)(Model)>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map<RAIter, ID, typename std::iterator_traits< <template-parameter-1-1> >::value_type, typename std::iterator_traits< <template-parameter-1-1> >::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = __gnu_cxx::__normal_iterator<default_color_type*, std::vector<default_color_type> >; ID = adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; typename std::iterator_traits< <template-parameter-1-1> >::value_type = default_color_type; typename std::iterator_traits< <template-parameter-1-1> >::reference = default_color_type&]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dominator_tree.hpp:314:35: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename graph_traits<Graph>::vertex_descriptor&, const IndexMap&, TimeMap, PredMap, VertexVector&, DomTreePredMap) [with Graph = adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >; IndexMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; TimeMap = iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>, long unsigned int, long unsigned int&>; PredMap = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>, void*, void*&>; VertexVector = std::vector<void*>; DomTreePredMap = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, int&, vertex_index_t> >; typename graph_traits<Graph>::vertex_descriptor = void*]’
314 | make_iterator_property_map(colors.begin(), indexMap));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dominator_tree.hpp:360:35: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename graph_traits<Graph>::vertex_descriptor&, DomTreePredMap) [with Graph = adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >; DomTreePredMap = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, int&, vertex_index_t> >; typename graph_traits<Graph>::vertex_descriptor = void*]’
360 | lengauer_tarjan_dominator_tree(g, entry, indexMap, dfnumMap, parentMap,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
361 | verticesByDFNum, domTreePredMap);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
dominatorTree.cpp:46:36: required from here
46 | lengauer_tarjan_dominator_tree(g, vertex(v, g), domTreePredMap);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/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<boost::default_color_type*, std::vector<boost::default_color_type> > >]’
20 | ~usage_requirements() { ((Model*)0)->~Model(); }
| ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/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<boost::default_color_type*, std::vector<boost::default_color_type> > > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:601:7: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> > >’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> > >’
597 | BOOST_concept(RandomAccessIterator,(TT))
| ^~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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<boost::default_color_type*, std::vector<boost::default_color_type> > >]’
32 | inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
| ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied<boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> > > >::value’
44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied<boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> > > >’
45 | typedef boost::integral_constant<bool, value> type;
| ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_<void (*)(boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> > >)>’
72 | struct requirement_<void(*)(Model)>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map<RAIter, ID, typename std::iterator_traits< <template-parameter-1-1> >::value_type, typename std::iterator_traits< <template-parameter-1-1> >::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = __gnu_cxx::__normal_iterator<default_color_type*, std::vector<default_color_type> >; ID = adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; typename std::iterator_traits< <template-parameter-1-1> >::value_type = default_color_type; typename std::iterator_traits< <template-parameter-1-1> >::reference = default_color_type&]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dominator_tree.hpp:314:35: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename graph_traits<Graph>::vertex_descriptor&, const IndexMap&, TimeMap, PredMap, VertexVector&, DomTreePredMap) [with Graph = adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >; IndexMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; TimeMap = iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>, long unsigned int, long unsigned int&>; PredMap = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>, void*, void*&>; VertexVector = std::vector<void*>; DomTreePredMap = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, int&, vertex_index_t> >; typename graph_traits<Graph>::vertex_descriptor = void*]’
314 | make_iterator_property_map(colors.begin(), indexMap));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dominator_tree.hpp:360:35: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename graph_traits<Graph>::vertex_descriptor&, DomTreePredMap) [with Graph = adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >; DomTreePredMap = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, int&, vertex_index_t> >; typename graph_traits<Graph>::vertex_descriptor = void*]’
360 | lengauer_tarjan_dominator_tree(g, entry, indexMap, dfnumMap, parentMap,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
361 | verticesByDFNum, domTreePredMap);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
dominatorTree.cpp:46:36: required from here
46 | lengauer_tarjan_dominator_tree(g, vertex(v, g), domTreePredMap);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/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<boost::default_color_type*, std::vector<boost::default_color_type> > >]’
20 | ~usage_requirements() { ((Model*)0)->~Model(); }
| ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/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<boost::default_color_type*, std::vector<boost::default_color_type> > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map<RAIter, ID, typename std::iterator_traits< <template-parameter-1-1> >::value_type, typename std::iterator_traits< <template-parameter-1-1> >::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = __gnu_cxx::__normal_iterator<default_color_type*, std::vector<default_color_type> >; ID = adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; typename std::iterator_traits< <template-parameter-1-1> >::value_type = default_color_type; typename std::iterator_traits< <template-parameter-1-1> >::reference = default_color_type&]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dominator_tree.hpp:314:35: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename graph_traits<Graph>::vertex_descriptor&, const IndexMap&, TimeMap, PredMap, VertexVector&, DomTreePredMap) [with Graph = adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >; IndexMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; TimeMap = iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>, long unsigned int, long unsigned int&>; PredMap = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>, void*, void*&>; VertexVector = std::vector<void*>; DomTreePredMap = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, int&, vertex_index_t> >; typename graph_traits<Graph>::vertex_descriptor = void*]’
314 | make_iterator_property_map(colors.begin(), indexMap));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dominator_tree.hpp:360:35: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename graph_traits<Graph>::vertex_descriptor&, DomTreePredMap) [with Graph = adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >; DomTreePredMap = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, int&, vertex_index_t> >; typename graph_traits<Graph>::vertex_descriptor = void*]’
360 | lengauer_tarjan_dominator_tree(g, entry, indexMap, dfnumMap, parentMap,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
361 | verticesByDFNum, domTreePredMap);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
dominatorTree.cpp:46:36: required from here
46 | lengauer_tarjan_dominator_tree(g, vertex(v, g), domTreePredMap);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:17: note: in a call to non-static member function ‘boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> > >::~RandomAccessIteratorConcept()’
597 | BOOST_concept(RandomAccessIterator,(TT))
| ^~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/preprocessor/cat.hpp:29:34: note: in definition of macro ‘BOOST_PP_CAT_I’
29 | # define BOOST_PP_CAT_I(a, b) a ## b
| ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/concept_def.hpp:23:12: note: in expansion of macro ‘BOOST_PP_CAT’
23 | struct BOOST_PP_CAT(name,Concept) \
| ^~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3: note: in expansion of macro ‘BOOST_concept’
597 | BOOST_concept(RandomAccessIterator,(TT))
| ^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::SignedInteger<long int>]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:514:9: required from ‘boost::InputIterator<TT>::~InputIterator() [with TT = __gnu_cxx::__normal_iterator<void**, std::vector<void*> >]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: required from ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::InputIterator<__gnu_cxx::__normal_iterator<void**, std::vector<void*> > >]’
20 | ~usage_requirements() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/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<void**, std::vector<void*> > > >]’
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:512:7: required from ‘struct boost::InputIterator<__gnu_cxx::__normal_iterator<void**, std::vector<void*> > >’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:540:3: required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator<void**, std::vector<void*> > >’
540 | BOOST_concept(ForwardIterator,(TT))
| ^~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:568:3: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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<void**, std::vector<void*> > >]’
32 | inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
| ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied<boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<void**, std::vector<void*> > > >::value’
44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied<boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<void**, std::vector<void*> > > >’
45 | typedef boost::integral_constant<bool, value> type;
| ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_<void (*)(boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<void**, std::vector<void*> > >)>’
72 | struct requirement_<void(*)(Model)>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map<RAIter, ID, typename std::iterator_traits< <template-parameter-1-1> >::value_type, typename std::iterator_traits< <template-parameter-1-1> >::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = __gnu_cxx::__normal_iterator<void**, std::vector<void*> >; ID = adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, int&, vertex_index_t>; typename std::iterator_traits< <template-parameter-1-1> >::value_type = void*; typename std::iterator_traits< <template-parameter-1-1> >::reference = void*&]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
dominatorTree.cpp:44:40: required from here
44 | make_iterator_property_map(domTreePredVector.begin(), v1_index_map);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:107:22: note: in a call to non-static member function ‘boost::SignedInteger<long int>::~SignedInteger()’
107 | template <> struct SignedInteger<long> {};
| ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Convertible<std::random_access_iterator_tag, std::input_iterator_tag> >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/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> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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);
| ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/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) );
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/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;
| ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/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)>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:515:9: [ skipping 8 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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<void**, std::vector<void*> > >]’
32 | inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
| ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied<boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<void**, std::vector<void*> > > >::value’
44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied<boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<void**, std::vector<void*> > > >’
45 | typedef boost::integral_constant<bool, value> type;
| ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_<void (*)(boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<void**, std::vector<void*> > >)>’
72 | struct requirement_<void(*)(Model)>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map<RAIter, ID, typename std::iterator_traits< <template-parameter-1-1> >::value_type, typename std::iterator_traits< <template-parameter-1-1> >::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = __gnu_cxx::__normal_iterator<void**, std::vector<void*> >; ID = adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, int&, vertex_index_t>; typename std::iterator_traits< <template-parameter-1-1> >::value_type = void*; typename std::iterator_traits< <template-parameter-1-1> >::reference = void*&]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
dominatorTree.cpp:44:40: required from here
44 | make_iterator_property_map(domTreePredVector.begin(), v1_index_map);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Convertible<std::random_access_iterator_tag, std::input_iterator_tag>]’
20 | ~usage_requirements() { ((Model*)0)->~Model(); }
| ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::Convertible<std::random_access_iterator_tag, std::input_iterator_tag>]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:515:9: required from ‘boost::InputIterator<TT>::~InputIterator() [with TT = __gnu_cxx::__normal_iterator<void**, std::vector<void*> >]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: required from ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::InputIterator<__gnu_cxx::__normal_iterator<void**, std::vector<void*> > >]’
20 | ~usage_requirements() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/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<void**, std::vector<void*> > > >]’
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:512:7: required from ‘struct boost::InputIterator<__gnu_cxx::__normal_iterator<void**, std::vector<void*> > >’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:540:3: required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator<void**, std::vector<void*> > >’
540 | BOOST_concept(ForwardIterator,(TT))
| ^~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:568:3: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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<void**, std::vector<void*> > >]’
32 | inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
| ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied<boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<void**, std::vector<void*> > > >::value’
44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied<boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<void**, std::vector<void*> > > >’
45 | typedef boost::integral_constant<bool, value> type;
| ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_<void (*)(boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<void**, std::vector<void*> > >)>’
72 | struct requirement_<void(*)(Model)>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map<RAIter, ID, typename std::iterator_traits< <template-parameter-1-1> >::value_type, typename std::iterator_traits< <template-parameter-1-1> >::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = __gnu_cxx::__normal_iterator<void**, std::vector<void*> >; ID = adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, int&, vertex_index_t>; typename std::iterator_traits< <template-parameter-1-1> >::value_type = void*; typename std::iterator_traits< <template-parameter-1-1> >::reference = void*&]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
dominatorTree.cpp:44:40: required from here
44 | make_iterator_property_map(domTreePredVector.begin(), v1_index_map);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible<X, Y>::~Convertible() [with X = std::random_access_iterator_tag; Y = std::input_iterator_tag]’
37 | ~model()
| ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
208 | BOOST_CONCEPT_USAGE(Convertible) {
| ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Convertible<std::random_access_iterator_tag, std::forward_iterator_tag> >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/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> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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);
| ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/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) );
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/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;
| ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/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)>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:545:11: [ skipping 7 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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<void**, std::vector<void*> > >]’
32 | inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
| ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied<boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<void**, std::vector<void*> > > >::value’
44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied<boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<void**, std::vector<void*> > > >’
45 | typedef boost::integral_constant<bool, value> type;
| ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_<void (*)(boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<void**, std::vector<void*> > >)>’
72 | struct requirement_<void(*)(Model)>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map<RAIter, ID, typename std::iterator_traits< <template-parameter-1-1> >::value_type, typename std::iterator_traits< <template-parameter-1-1> >::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = __gnu_cxx::__normal_iterator<void**, std::vector<void*> >; ID = adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, int&, vertex_index_t>; typename std::iterator_traits< <template-parameter-1-1> >::value_type = void*; typename std::iterator_traits< <template-parameter-1-1> >::reference = void*&]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
dominatorTree.cpp:44:40: required from here
44 | make_iterator_property_map(domTreePredVector.begin(), v1_index_map);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Convertible<std::random_access_iterator_tag, std::forward_iterator_tag>]’
20 | ~usage_requirements() { ((Model*)0)->~Model(); }
| ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::Convertible<std::random_access_iterator_tag, std::forward_iterator_tag>]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:545:11: required from ‘boost::ForwardIterator<TT>::~ForwardIterator() [with TT = __gnu_cxx::__normal_iterator<void**, std::vector<void*> >]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: required from ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::ForwardIterator<__gnu_cxx::__normal_iterator<void**, std::vector<void*> > >]’
20 | ~usage_requirements() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/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<void**, std::vector<void*> > > >]’
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:543:7: required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator<void**, std::vector<void*> > >’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator<void**, std::vector<void*> > >’
568 | BOOST_concept(BidirectionalIterator,(TT))
| ^~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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<void**, std::vector<void*> > >]’
32 | inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
| ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied<boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<void**, std::vector<void*> > > >::value’
44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied<boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<void**, std::vector<void*> > > >’
45 | typedef boost::integral_constant<bool, value> type;
| ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_<void (*)(boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<void**, std::vector<void*> > >)>’
72 | struct requirement_<void(*)(Model)>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map<RAIter, ID, typename std::iterator_traits< <template-parameter-1-1> >::value_type, typename std::iterator_traits< <template-parameter-1-1> >::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = __gnu_cxx::__normal_iterator<void**, std::vector<void*> >; ID = adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, int&, vertex_index_t>; typename std::iterator_traits< <template-parameter-1-1> >::value_type = void*; typename std::iterator_traits< <template-parameter-1-1> >::reference = void*&]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
dominatorTree.cpp:44:40: required from here
44 | make_iterator_property_map(domTreePredVector.begin(), v1_index_map);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible<X, Y>::~Convertible() [with X = std::random_access_iterator_tag; Y = std::forward_iterator_tag]’
37 | ~model()
| ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
208 | BOOST_CONCEPT_USAGE(Convertible) {
| ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Convertible<std::random_access_iterator_tag, std::bidirectional_iterator_tag> >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/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> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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);
| ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/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) );
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/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;
| ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/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)>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:573:11: [ skipping 6 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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<void**, std::vector<void*> > >]’
32 | inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
| ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied<boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<void**, std::vector<void*> > > >::value’
44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied<boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<void**, std::vector<void*> > > >’
45 | typedef boost::integral_constant<bool, value> type;
| ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_<void (*)(boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<void**, std::vector<void*> > >)>’
72 | struct requirement_<void(*)(Model)>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map<RAIter, ID, typename std::iterator_traits< <template-parameter-1-1> >::value_type, typename std::iterator_traits< <template-parameter-1-1> >::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = __gnu_cxx::__normal_iterator<void**, std::vector<void*> >; ID = adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, int&, vertex_index_t>; typename std::iterator_traits< <template-parameter-1-1> >::value_type = void*; typename std::iterator_traits< <template-parameter-1-1> >::reference = void*&]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
dominatorTree.cpp:44:40: required from here
44 | make_iterator_property_map(domTreePredVector.begin(), v1_index_map);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Convertible<std::random_access_iterator_tag, std::bidirectional_iterator_tag>]’
20 | ~usage_requirements() { ((Model*)0)->~Model(); }
| ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::Convertible<std::random_access_iterator_tag, std::bidirectional_iterator_tag>]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:573:11: required from ‘boost::BidirectionalIterator<TT>::~BidirectionalIterator() [with TT = __gnu_cxx::__normal_iterator<void**, std::vector<void*> >]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: required from ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::BidirectionalIterator<__gnu_cxx::__normal_iterator<void**, std::vector<void*> > >]’
20 | ~usage_requirements() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/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<void**, std::vector<void*> > > >]’
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:571:7: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator<void**, std::vector<void*> > >’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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<void**, std::vector<void*> > >]’
32 | inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
| ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied<boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<void**, std::vector<void*> > > >::value’
44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied<boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<void**, std::vector<void*> > > >’
45 | typedef boost::integral_constant<bool, value> type;
| ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_<void (*)(boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<void**, std::vector<void*> > >)>’
72 | struct requirement_<void(*)(Model)>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map<RAIter, ID, typename std::iterator_traits< <template-parameter-1-1> >::value_type, typename std::iterator_traits< <template-parameter-1-1> >::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = __gnu_cxx::__normal_iterator<void**, std::vector<void*> >; ID = adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, int&, vertex_index_t>; typename std::iterator_traits< <template-parameter-1-1> >::value_type = void*; typename std::iterator_traits< <template-parameter-1-1> >::reference = void*&]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
dominatorTree.cpp:44:40: required from here
44 | make_iterator_property_map(domTreePredVector.begin(), v1_index_map);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible<X, Y>::~Convertible() [with X = std::random_access_iterator_tag; Y = std::bidirectional_iterator_tag]’
37 | ~model()
| ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
208 | BOOST_CONCEPT_USAGE(Convertible) {
| ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Convertible<std::random_access_iterator_tag, std::random_access_iterator_tag>]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/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(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/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> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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);
| ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/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) );
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/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;
| ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/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)>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:603:11: required from ‘boost::RandomAccessIterator<TT>::~RandomAccessIterator() [with TT = __gnu_cxx::__normal_iterator<void**, std::vector<void*> >]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3: required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<void**, std::vector<void*> > >]’
597 | BOOST_concept(RandomAccessIterator,(TT))
| ^~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map<RAIter, ID, typename std::iterator_traits< <template-parameter-1-1> >::value_type, typename std::iterator_traits< <template-parameter-1-1> >::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = __gnu_cxx::__normal_iterator<void**, std::vector<void*> >; ID = adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, int&, vertex_index_t>; typename std::iterator_traits< <template-parameter-1-1> >::value_type = void*; typename std::iterator_traits< <template-parameter-1-1> >::reference = void*&]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
dominatorTree.cpp:44:40: required from here
44 | make_iterator_property_map(domTreePredVector.begin(), v1_index_map);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
20 | ~usage_requirements() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible<X, Y>::~Convertible() [with X = std::random_access_iterator_tag; Y = std::random_access_iterator_tag]’
37 | ~model()
| ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
208 | BOOST_CONCEPT_USAGE(Convertible) {
| ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/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::in_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property>*, std::vector<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property>, std::allocator<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl<boost::bidirectional_tag, void*>, long int> > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:52:50: required from ‘struct boost::concepts::MultiPassInputIterator<boost::detail::in_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property>*, std::vector<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property>, std::allocator<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl<boost::bidirectional_tag, void*>, long int> >’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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::in_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property>*, std::vector<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property>, std::allocator<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl<boost::bidirectional_tag, void*>, long int> >]’
32 | inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
| ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied<boost::concepts::MultiPassInputIterator<boost::detail::in_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property>*, std::vector<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property>, std::allocator<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl<boost::bidirectional_tag, void*>, long int> > >::value’
44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied<boost::concepts::MultiPassInputIterator<boost::detail::in_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property>*, std::vector<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property>, std::allocator<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl<boost::bidirectional_tag, void*>, long int> > >’
45 | typedef boost::integral_constant<bool, value> type;
| ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_<void (*)(boost::concepts::MultiPassInputIterator<boost::detail::in_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property>*, std::vector<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property>, std::allocator<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl<boost::bidirectional_tag, void*>, long int> >)>’
72 | struct requirement_<void(*)(Model)>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:125:9: required from ‘boost::concepts::BidirectionalGraph<G>::~BidirectionalGraph() [with G = boost::adjacency_list<boost::vecS, boost::listS, boost::bidirectionalS, boost::property<boost::vertex_index_t, int> >]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:118:1: required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::BidirectionalGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::bidirectionalS, boost::property<boost::vertex_index_t, int> > >]’
118 | BOOST_concept(BidirectionalGraph, (G)) : IncidenceGraph< G >
| ^~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dominator_tree.hpp:245:5: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename graph_traits<Graph>::vertex_descriptor&, const IndexMap&, TimeMap, PredMap, VertexVector&, DomTreePredMap) [with Graph = adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >; IndexMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; TimeMap = iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>, long unsigned int, long unsigned int&>; PredMap = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>, void*, void*&>; VertexVector = std::vector<void*>; DomTreePredMap = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, int&, vertex_index_t> >; typename graph_traits<Graph>::vertex_descriptor = void*]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dominator_tree.hpp:360:35: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename graph_traits<Graph>::vertex_descriptor&, DomTreePredMap) [with Graph = adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >; DomTreePredMap = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, int&, vertex_index_t> >; typename graph_traits<Graph>::vertex_descriptor = void*]’
360 | lengauer_tarjan_dominator_tree(g, entry, indexMap, dfnumMap, parentMap,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
361 | verticesByDFNum, domTreePredMap);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
dominatorTree.cpp:46:36: required from here
46 | lengauer_tarjan_dominator_tree(g, vertex(v, g), domTreePredMap);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/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::in_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property>*, std::vector<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property>, std::allocator<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl<boost::bidirectional_tag, void*>, long int> >]’
20 | ~usage_requirements() { ((Model*)0)->~Model(); }
| ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/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::in_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property>*, std::vector<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property>, std::allocator<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl<boost::bidirectional_tag, void*>, long int> >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:125:9: required from ‘boost::concepts::BidirectionalGraph<G>::~BidirectionalGraph() [with G = boost::adjacency_list<boost::vecS, boost::listS, boost::bidirectionalS, boost::property<boost::vertex_index_t, int> >]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:118:1: required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::BidirectionalGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::bidirectionalS, boost::property<boost::vertex_index_t, int> > >]’
118 | BOOST_concept(BidirectionalGraph, (G)) : IncidenceGraph< G >
| ^~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dominator_tree.hpp:245:5: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename graph_traits<Graph>::vertex_descriptor&, const IndexMap&, TimeMap, PredMap, VertexVector&, DomTreePredMap) [with Graph = adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >; IndexMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; TimeMap = iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>, long unsigned int, long unsigned int&>; PredMap = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>, void*, void*&>; VertexVector = std::vector<void*>; DomTreePredMap = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, int&, vertex_index_t> >; typename graph_traits<Graph>::vertex_descriptor = void*]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dominator_tree.hpp:360:35: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename graph_traits<Graph>::vertex_descriptor&, DomTreePredMap) [with Graph = adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >; DomTreePredMap = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, int&, vertex_index_t> >; typename graph_traits<Graph>::vertex_descriptor = void*]’
360 | lengauer_tarjan_dominator_tree(g, entry, indexMap, dfnumMap, parentMap,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
361 | verticesByDFNum, domTreePredMap);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
dominatorTree.cpp:46:36: required from here
46 | lengauer_tarjan_dominator_tree(g, vertex(v, g), domTreePredMap);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/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::in_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property>*, std::vector<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property>, std::allocator<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl<boost::bidirectional_tag, void*>, long int>]’
37 | ~model()
| ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:52:50: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
52 | BOOST_concept(MultiPassInputIterator, (T)) { BOOST_CONCEPT_USAGE(
| ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/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::bidir_adj_list_traversal_tag, boost::bidirectional_graph_tag> >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible<boost::bidir_adj_list_traversal_tag, boost::bidirectional_graph_tag>’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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::bidir_adj_list_traversal_tag, boost::bidirectional_graph_tag>]’
32 | inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
| ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied<boost::Convertible<boost::bidir_adj_list_traversal_tag, boost::bidirectional_graph_tag> >::value’
44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied<boost::Convertible<boost::bidir_adj_list_traversal_tag, boost::bidirectional_graph_tag> >’
45 | typedef boost::integral_constant<bool, value> type;
| ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_<void (*)(boost::Convertible<boost::bidir_adj_list_traversal_tag, boost::bidirectional_graph_tag>)>’
72 | struct requirement_<void(*)(Model)>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:126:9: required from ‘boost::concepts::BidirectionalGraph<G>::~BidirectionalGraph() [with G = boost::adjacency_list<boost::vecS, boost::listS, boost::bidirectionalS, boost::property<boost::vertex_index_t, int> >]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:118:1: required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::BidirectionalGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::bidirectionalS, boost::property<boost::vertex_index_t, int> > >]’
118 | BOOST_concept(BidirectionalGraph, (G)) : IncidenceGraph< G >
| ^~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dominator_tree.hpp:245:5: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename graph_traits<Graph>::vertex_descriptor&, const IndexMap&, TimeMap, PredMap, VertexVector&, DomTreePredMap) [with Graph = adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >; IndexMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; TimeMap = iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>, long unsigned int, long unsigned int&>; PredMap = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>, void*, void*&>; VertexVector = std::vector<void*>; DomTreePredMap = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, int&, vertex_index_t> >; typename graph_traits<Graph>::vertex_descriptor = void*]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dominator_tree.hpp:360:35: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename graph_traits<Graph>::vertex_descriptor&, DomTreePredMap) [with Graph = adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >; DomTreePredMap = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, int&, vertex_index_t> >; typename graph_traits<Graph>::vertex_descriptor = void*]’
360 | lengauer_tarjan_dominator_tree(g, entry, indexMap, dfnumMap, parentMap,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
361 | verticesByDFNum, domTreePredMap);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
dominatorTree.cpp:46:36: required from here
46 | lengauer_tarjan_dominator_tree(g, vertex(v, g), domTreePredMap);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/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::bidir_adj_list_traversal_tag, boost::bidirectional_graph_tag>]’
20 | ~usage_requirements() { ((Model*)0)->~Model(); }
| ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/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::bidir_adj_list_traversal_tag, boost::bidirectional_graph_tag>]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:126:9: required from ‘boost::concepts::BidirectionalGraph<G>::~BidirectionalGraph() [with G = boost::adjacency_list<boost::vecS, boost::listS, boost::bidirectionalS, boost::property<boost::vertex_index_t, int> >]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:118:1: required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::BidirectionalGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::bidirectionalS, boost::property<boost::vertex_index_t, int> > >]’
118 | BOOST_concept(BidirectionalGraph, (G)) : IncidenceGraph< G >
| ^~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dominator_tree.hpp:245:5: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename graph_traits<Graph>::vertex_descriptor&, const IndexMap&, TimeMap, PredMap, VertexVector&, DomTreePredMap) [with Graph = adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >; IndexMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; TimeMap = iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>, long unsigned int, long unsigned int&>; PredMap = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>, void*, void*&>; VertexVector = std::vector<void*>; DomTreePredMap = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, int&, vertex_index_t> >; typename graph_traits<Graph>::vertex_descriptor = void*]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dominator_tree.hpp:360:35: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename graph_traits<Graph>::vertex_descriptor&, DomTreePredMap) [with Graph = adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >; DomTreePredMap = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, int&, vertex_index_t> >; typename graph_traits<Graph>::vertex_descriptor = void*]’
360 | lengauer_tarjan_dominator_tree(g, entry, indexMap, dfnumMap, parentMap,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
361 | verticesByDFNum, domTreePredMap);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
dominatorTree.cpp:46:36: required from here
46 | lengauer_tarjan_dominator_tree(g, vertex(v, g), domTreePredMap);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/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::bidir_adj_list_traversal_tag; Y = boost::bidirectional_graph_tag]’
37 | ~model()
| ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
208 | BOOST_CONCEPT_USAGE(Convertible) {
| ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Assignable<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/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<boost::default_color_type*, std::vector<boost::default_color_type> > > >]’
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:145:5: required from ‘struct boost::Assignable<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> > >’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> > >’
502 | BOOST_concept(InputIterator,(TT))
| ^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:540:3: required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> > >’
540 | BOOST_concept(ForwardIterator,(TT))
| ^~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> > >’
568 | BOOST_concept(BidirectionalIterator,(TT))
| ^~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3: [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied<boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> > > >’
45 | typedef boost::integral_constant<bool, value> type;
| ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_<void (*)(boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> > >)>’
72 | struct requirement_<void(*)(Model)>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map<RAIter, ID, typename std::iterator_traits< <template-parameter-1-1> >::value_type, typename std::iterator_traits< <template-parameter-1-1> >::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = __gnu_cxx::__normal_iterator<default_color_type*, std::vector<default_color_type> >; ID = adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; typename std::iterator_traits< <template-parameter-1-1> >::value_type = default_color_type; typename std::iterator_traits< <template-parameter-1-1> >::reference = default_color_type&]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dominator_tree.hpp:314:35: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename graph_traits<Graph>::vertex_descriptor&, const IndexMap&, TimeMap, PredMap, VertexVector&, DomTreePredMap) [with Graph = adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >; IndexMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; TimeMap = iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>, long unsigned int, long unsigned int&>; PredMap = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>, void*, void*&>; VertexVector = std::vector<void*>; DomTreePredMap = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, int&, vertex_index_t> >; typename graph_traits<Graph>::vertex_descriptor = void*]’
314 | make_iterator_property_map(colors.begin(), indexMap));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dominator_tree.hpp:360:35: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename graph_traits<Graph>::vertex_descriptor&, DomTreePredMap) [with Graph = adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >; DomTreePredMap = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, int&, vertex_index_t> >; typename graph_traits<Graph>::vertex_descriptor = void*]’
360 | lengauer_tarjan_dominator_tree(g, entry, indexMap, dfnumMap, parentMap,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
361 | verticesByDFNum, domTreePredMap);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
dominatorTree.cpp:46:36: required from here
46 | lengauer_tarjan_dominator_tree(g, vertex(v, g), domTreePredMap);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
20 | ~usage_requirements() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/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<boost::default_color_type*, std::vector<boost::default_color_type> >]’
37 | ~model()
| ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:145:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
145 | BOOST_CONCEPT_USAGE(Assignable) {
| ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::EqualityComparable<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/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<boost::default_color_type*, std::vector<boost::default_color_type> > > >]’
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> > >’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> > >’
502 | BOOST_concept(InputIterator,(TT))
| ^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:540:3: required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> > >’
540 | BOOST_concept(ForwardIterator,(TT))
| ^~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> > >’
568 | BOOST_concept(BidirectionalIterator,(TT))
| ^~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3: [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied<boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> > > >’
45 | typedef boost::integral_constant<bool, value> type;
| ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_<void (*)(boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> > >)>’
72 | struct requirement_<void(*)(Model)>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map<RAIter, ID, typename std::iterator_traits< <template-parameter-1-1> >::value_type, typename std::iterator_traits< <template-parameter-1-1> >::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = __gnu_cxx::__normal_iterator<default_color_type*, std::vector<default_color_type> >; ID = adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; typename std::iterator_traits< <template-parameter-1-1> >::value_type = default_color_type; typename std::iterator_traits< <template-parameter-1-1> >::reference = default_color_type&]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dominator_tree.hpp:314:35: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename graph_traits<Graph>::vertex_descriptor&, const IndexMap&, TimeMap, PredMap, VertexVector&, DomTreePredMap) [with Graph = adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >; IndexMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; TimeMap = iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>, long unsigned int, long unsigned int&>; PredMap = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>, void*, void*&>; VertexVector = std::vector<void*>; DomTreePredMap = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, int&, vertex_index_t> >; typename graph_traits<Graph>::vertex_descriptor = void*]’
314 | make_iterator_property_map(colors.begin(), indexMap));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dominator_tree.hpp:360:35: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename graph_traits<Graph>::vertex_descriptor&, DomTreePredMap) [with Graph = adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >; DomTreePredMap = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, int&, vertex_index_t> >; typename graph_traits<Graph>::vertex_descriptor = void*]’
360 | lengauer_tarjan_dominator_tree(g, entry, indexMap, dfnumMap, parentMap,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
361 | verticesByDFNum, domTreePredMap);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
dominatorTree.cpp:46:36: required from here
46 | lengauer_tarjan_dominator_tree(g, vertex(v, g), domTreePredMap);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
20 | ~usage_requirements() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/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<boost::default_color_type*, std::vector<boost::default_color_type> >]’
37 | ~model()
| ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:233:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
233 | BOOST_CONCEPT_USAGE(EqualityComparable) {
| ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::InputIterator<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/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<boost::default_color_type*, std::vector<boost::default_color_type> > > >]’
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:512:7: required from ‘struct boost::InputIterator<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> > >’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:540:3: required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> > >’
540 | BOOST_concept(ForwardIterator,(TT))
| ^~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> > >’
568 | BOOST_concept(BidirectionalIterator,(TT))
| ^~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> > >’
597 | BOOST_concept(RandomAccessIterator,(TT))
| ^~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied<boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> > > >’
45 | typedef boost::integral_constant<bool, value> type;
| ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_<void (*)(boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> > >)>’
72 | struct requirement_<void(*)(Model)>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map<RAIter, ID, typename std::iterator_traits< <template-parameter-1-1> >::value_type, typename std::iterator_traits< <template-parameter-1-1> >::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = __gnu_cxx::__normal_iterator<default_color_type*, std::vector<default_color_type> >; ID = adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; typename std::iterator_traits< <template-parameter-1-1> >::value_type = default_color_type; typename std::iterator_traits< <template-parameter-1-1> >::reference = default_color_type&]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dominator_tree.hpp:314:35: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename graph_traits<Graph>::vertex_descriptor&, const IndexMap&, TimeMap, PredMap, VertexVector&, DomTreePredMap) [with Graph = adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >; IndexMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; TimeMap = iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>, long unsigned int, long unsigned int&>; PredMap = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>, void*, void*&>; VertexVector = std::vector<void*>; DomTreePredMap = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, int&, vertex_index_t> >; typename graph_traits<Graph>::vertex_descriptor = void*]’
314 | make_iterator_property_map(colors.begin(), indexMap));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dominator_tree.hpp:360:35: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename graph_traits<Graph>::vertex_descriptor&, DomTreePredMap) [with Graph = adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >; DomTreePredMap = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, int&, vertex_index_t> >; typename graph_traits<Graph>::vertex_descriptor = void*]’
360 | lengauer_tarjan_dominator_tree(g, entry, indexMap, dfnumMap, parentMap,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
361 | verticesByDFNum, domTreePredMap);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
dominatorTree.cpp:46:36: required from here
46 | lengauer_tarjan_dominator_tree(g, vertex(v, g), domTreePredMap);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
20 | ~usage_requirements() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/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<boost::default_color_type*, std::vector<boost::default_color_type> >]’
37 | ~model()
| ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:512:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
512 | BOOST_CONCEPT_USAGE(InputIterator)
| ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::ForwardIterator<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/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<boost::default_color_type*, std::vector<boost::default_color_type> > > >]’
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:543:7: required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> > >’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> > >’
568 | BOOST_concept(BidirectionalIterator,(TT))
| ^~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> > >’
597 | BOOST_concept(RandomAccessIterator,(TT))
| ^~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> > >’
597 | BOOST_concept(RandomAccessIterator,(TT))
| ^~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied<boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> > > >’
45 | typedef boost::integral_constant<bool, value> type;
| ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_<void (*)(boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> > >)>’
72 | struct requirement_<void(*)(Model)>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map<RAIter, ID, typename std::iterator_traits< <template-parameter-1-1> >::value_type, typename std::iterator_traits< <template-parameter-1-1> >::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = __gnu_cxx::__normal_iterator<default_color_type*, std::vector<default_color_type> >; ID = adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; typename std::iterator_traits< <template-parameter-1-1> >::value_type = default_color_type; typename std::iterator_traits< <template-parameter-1-1> >::reference = default_color_type&]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dominator_tree.hpp:314:35: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename graph_traits<Graph>::vertex_descriptor&, const IndexMap&, TimeMap, PredMap, VertexVector&, DomTreePredMap) [with Graph = adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >; IndexMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; TimeMap = iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>, long unsigned int, long unsigned int&>; PredMap = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>, void*, void*&>; VertexVector = std::vector<void*>; DomTreePredMap = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, int&, vertex_index_t> >; typename graph_traits<Graph>::vertex_descriptor = void*]’
314 | make_iterator_property_map(colors.begin(), indexMap));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dominator_tree.hpp:360:35: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename graph_traits<Graph>::vertex_descriptor&, DomTreePredMap) [with Graph = adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >; DomTreePredMap = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, int&, vertex_index_t> >; typename graph_traits<Graph>::vertex_descriptor = void*]’
360 | lengauer_tarjan_dominator_tree(g, entry, indexMap, dfnumMap, parentMap,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
361 | verticesByDFNum, domTreePredMap);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
dominatorTree.cpp:46:36: required from here
46 | lengauer_tarjan_dominator_tree(g, vertex(v, g), domTreePredMap);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
20 | ~usage_requirements() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/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<boost::default_color_type*, std::vector<boost::default_color_type> >]’
37 | ~model()
| ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:543:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
543 | BOOST_CONCEPT_USAGE(ForwardIterator)
| ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::BidirectionalIterator<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/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<boost::default_color_type*, std::vector<boost::default_color_type> > > >]’
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:571:7: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> > >’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> > >’
597 | BOOST_concept(RandomAccessIterator,(TT))
| ^~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> > >’
597 | BOOST_concept(RandomAccessIterator,(TT))
| ^~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied<boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> > > >’
45 | typedef boost::integral_constant<bool, value> type;
| ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_<void (*)(boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> > >)>’
72 | struct requirement_<void(*)(Model)>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map<RAIter, ID, typename std::iterator_traits< <template-parameter-1-1> >::value_type, typename std::iterator_traits< <template-parameter-1-1> >::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = __gnu_cxx::__normal_iterator<default_color_type*, std::vector<default_color_type> >; ID = adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; typename std::iterator_traits< <template-parameter-1-1> >::value_type = default_color_type; typename std::iterator_traits< <template-parameter-1-1> >::reference = default_color_type&]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dominator_tree.hpp:314:35: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename graph_traits<Graph>::vertex_descriptor&, const IndexMap&, TimeMap, PredMap, VertexVector&, DomTreePredMap) [with Graph = adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >; IndexMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; TimeMap = iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>, long unsigned int, long unsigned int&>; PredMap = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>, void*, void*&>; VertexVector = std::vector<void*>; DomTreePredMap = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, int&, vertex_index_t> >; typename graph_traits<Graph>::vertex_descriptor = void*]’
314 | make_iterator_property_map(colors.begin(), indexMap));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dominator_tree.hpp:360:35: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename graph_traits<Graph>::vertex_descriptor&, DomTreePredMap) [with Graph = adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >; DomTreePredMap = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, int&, vertex_index_t> >; typename graph_traits<Graph>::vertex_descriptor = void*]’
360 | lengauer_tarjan_dominator_tree(g, entry, indexMap, dfnumMap, parentMap,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
361 | verticesByDFNum, domTreePredMap);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
dominatorTree.cpp:46:36: required from here
46 | lengauer_tarjan_dominator_tree(g, vertex(v, g), domTreePredMap);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
20 | ~usage_requirements() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/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<boost::default_color_type*, std::vector<boost::default_color_type> >]’
37 | ~model()
| ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:571:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
571 | BOOST_CONCEPT_USAGE(BidirectionalIterator)
| ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Comparable<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/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<boost::default_color_type*, std::vector<boost::default_color_type> > > >]’
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:253:5: required from ‘struct boost::Comparable<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> > >’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> > >’
597 | BOOST_concept(RandomAccessIterator,(TT))
| ^~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> > >’
597 | BOOST_concept(RandomAccessIterator,(TT))
| ^~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied<boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> > > >’
45 | typedef boost::integral_constant<bool, value> type;
| ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_<void (*)(boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> > >)>’
72 | struct requirement_<void(*)(Model)>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map<RAIter, ID, typename std::iterator_traits< <template-parameter-1-1> >::value_type, typename std::iterator_traits< <template-parameter-1-1> >::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = __gnu_cxx::__normal_iterator<default_color_type*, std::vector<default_color_type> >; ID = adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; typename std::iterator_traits< <template-parameter-1-1> >::value_type = default_color_type; typename std::iterator_traits< <template-parameter-1-1> >::reference = default_color_type&]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dominator_tree.hpp:314:35: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename graph_traits<Graph>::vertex_descriptor&, const IndexMap&, TimeMap, PredMap, VertexVector&, DomTreePredMap) [with Graph = adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >; IndexMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; TimeMap = iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>, long unsigned int, long unsigned int&>; PredMap = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>, void*, void*&>; VertexVector = std::vector<void*>; DomTreePredMap = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, int&, vertex_index_t> >; typename graph_traits<Graph>::vertex_descriptor = void*]’
314 | make_iterator_property_map(colors.begin(), indexMap));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dominator_tree.hpp:360:35: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename graph_traits<Graph>::vertex_descriptor&, DomTreePredMap) [with Graph = adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >; DomTreePredMap = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, int&, vertex_index_t> >; typename graph_traits<Graph>::vertex_descriptor = void*]’
360 | lengauer_tarjan_dominator_tree(g, entry, indexMap, dfnumMap, parentMap,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
361 | verticesByDFNum, domTreePredMap);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
dominatorTree.cpp:46:36: required from here
46 | lengauer_tarjan_dominator_tree(g, vertex(v, g), domTreePredMap);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
20 | ~usage_requirements() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/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<boost::default_color_type*, std::vector<boost::default_color_type> >]’
37 | ~model()
| ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:253:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
253 | BOOST_CONCEPT_USAGE(Comparable) {
| ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::RandomAccessIterator<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/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<boost::default_color_type*, std::vector<boost::default_color_type> > > >]’
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:601:7: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> > >’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> > >’
597 | BOOST_concept(RandomAccessIterator,(TT))
| ^~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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<boost::default_color_type*, std::vector<boost::default_color_type> > >]’
32 | inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
| ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied<boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> > > >::value’
44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied<boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> > > >’
45 | typedef boost::integral_constant<bool, value> type;
| ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_<void (*)(boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> > >)>’
72 | struct requirement_<void(*)(Model)>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map<RAIter, ID, typename std::iterator_traits< <template-parameter-1-1> >::value_type, typename std::iterator_traits< <template-parameter-1-1> >::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = __gnu_cxx::__normal_iterator<default_color_type*, std::vector<default_color_type> >; ID = adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; typename std::iterator_traits< <template-parameter-1-1> >::value_type = default_color_type; typename std::iterator_traits< <template-parameter-1-1> >::reference = default_color_type&]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dominator_tree.hpp:314:35: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename graph_traits<Graph>::vertex_descriptor&, const IndexMap&, TimeMap, PredMap, VertexVector&, DomTreePredMap) [with Graph = adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >; IndexMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; TimeMap = iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>, long unsigned int, long unsigned int&>; PredMap = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>, void*, void*&>; VertexVector = std::vector<void*>; DomTreePredMap = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, int&, vertex_index_t> >; typename graph_traits<Graph>::vertex_descriptor = void*]’
314 | make_iterator_property_map(colors.begin(), indexMap));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dominator_tree.hpp:360:35: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename graph_traits<Graph>::vertex_descriptor&, DomTreePredMap) [with Graph = adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >; DomTreePredMap = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, int&, vertex_index_t> >; typename graph_traits<Graph>::vertex_descriptor = void*]’
360 | lengauer_tarjan_dominator_tree(g, entry, indexMap, dfnumMap, parentMap,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
361 | verticesByDFNum, domTreePredMap);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
dominatorTree.cpp:46:36: required from here
46 | lengauer_tarjan_dominator_tree(g, vertex(v, g), domTreePredMap);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
20 | ~usage_requirements() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/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<boost::default_color_type*, std::vector<boost::default_color_type> >]’
37 | ~model()
| ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:601:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
601 | BOOST_CONCEPT_USAGE(RandomAccessIterator)
| ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/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::bidirectionalS, boost::property<boost::vertex_index_t, int> > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:129:9: required from ‘void boost::detail::depth_first_visit_impl(const IncidenceGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, DFSVisitor&, ColorMap, TerminatorFunc) [with IncidenceGraph = boost::adjacency_list<boost::vecS, boost::listS, boost::bidirectionalS, boost::property<boost::vertex_index_t, int> >; DFSVisitor = boost::dfs_visitor<std::pair<boost::predecessor_recorder<boost::iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::bidirectionalS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t>, void*, void*&>, boost::on_tree_edge>, time_stamper_with_vertex_vector<boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::bidirectionalS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t>, long unsigned int, long unsigned int&>, std::vector<void*>, long unsigned int, boost::on_discover_vertex> > >; ColorMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::bidirectionalS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t>, boost::default_color_type, boost::default_color_type&>; TerminatorFunc = nontruth2; typename boost::graph_traits<Graph>::vertex_descriptor = void*]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:417:35: required from ‘void boost::depth_first_visit(const IncidenceGraph&, typename graph_traits<Graph>::vertex_descriptor, DFSVisitor, ColorMap) [with IncidenceGraph = adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >; DFSVisitor = dfs_visitor<std::pair<predecessor_recorder<iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>, void*, void*&>, on_tree_edge>, detail::time_stamper_with_vertex_vector<iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>, long unsigned int, long unsigned int&>, std::vector<void*>, long unsigned int, on_discover_vertex> > >; ColorMap = iterator_property_map<__gnu_cxx::__normal_iterator<default_color_type*, std::vector<default_color_type> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>, default_color_type, default_color_type&>; typename graph_traits<Graph>::vertex_descriptor = void*]’
417 | detail::depth_first_visit_impl(g, u, vis, color, detail::nontruth2());
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dominator_tree.hpp:309:22: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename graph_traits<Graph>::vertex_descriptor&, const IndexMap&, TimeMap, PredMap, VertexVector&, DomTreePredMap) [with Graph = adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >; IndexMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; TimeMap = iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>, long unsigned int, long unsigned int&>; PredMap = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>, void*, void*&>; VertexVector = std::vector<void*>; DomTreePredMap = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, int&, vertex_index_t> >; typename graph_traits<Graph>::vertex_descriptor = void*]’
309 | depth_first_visit(g, entry,
| ~~~~~~~~~~~~~~~~~^~~~~~~~~~
310 | make_dfs_visitor(
| ~~~~~~~~~~~~~~~~~
311 | make_pair(record_predecessors(parentMap, on_tree_edge()),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
312 | detail::stamp_times_with_vertex_vector(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
313 | dfnumMap, verticesByDFNum, time, on_discover_vertex()))),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
314 | make_iterator_property_map(colors.begin(), indexMap));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dominator_tree.hpp:360:35: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename graph_traits<Graph>::vertex_descriptor&, DomTreePredMap) [with Graph = adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >; DomTreePredMap = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, int&, vertex_index_t> >; typename graph_traits<Graph>::vertex_descriptor = void*]’
360 | lengauer_tarjan_dominator_tree(g, entry, indexMap, dfnumMap, parentMap,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
361 | verticesByDFNum, domTreePredMap);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
dominatorTree.cpp:46:36: required from here
46 | lengauer_tarjan_dominator_tree(g, vertex(v, g), domTreePredMap);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/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::bidirectionalS, boost::property<boost::vertex_index_t, int> > >::~IncidenceGraphConcept()’
75 | BOOST_concept(IncidenceGraph, (G)) : Graph< G >
| ^~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/preprocessor/cat.hpp:29:34: note: in definition of macro ‘BOOST_PP_CAT_I’
29 | # define BOOST_PP_CAT_I(a, b) a ## b
| ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/concept_def.hpp:23:12: note: in expansion of macro ‘BOOST_PP_CAT’
23 | struct BOOST_PP_CAT(name,Concept) \
| ^~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:75:1: note: in expansion of macro ‘BOOST_concept’
75 | BOOST_concept(IncidenceGraph, (G)) : Graph< G >
| ^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::constraint<Model>::failed() [with Model = boost::DFSVisitorConcept<boost::dfs_visitor<std::pair<boost::predecessor_recorder<boost::iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::bidirectionalS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t>, void*, void*&>, boost::on_tree_edge>, boost::detail::time_stamper_with_vertex_vector<boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::bidirectionalS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t>, long unsigned int, long unsigned int&>, std::vector<void*>, long unsigned int, boost::on_discover_vertex> > >, boost::adjacency_list<boost::vecS, boost::listS, boost::bidirectionalS, boost::property<boost::vertex_index_t, int> > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:130:9: required from ‘void boost::detail::depth_first_visit_impl(const IncidenceGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, DFSVisitor&, ColorMap, TerminatorFunc) [with IncidenceGraph = boost::adjacency_list<boost::vecS, boost::listS, boost::bidirectionalS, boost::property<boost::vertex_index_t, int> >; DFSVisitor = boost::dfs_visitor<std::pair<boost::predecessor_recorder<boost::iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::bidirectionalS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t>, void*, void*&>, boost::on_tree_edge>, time_stamper_with_vertex_vector<boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::bidirectionalS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t>, long unsigned int, long unsigned int&>, std::vector<void*>, long unsigned int, boost::on_discover_vertex> > >; ColorMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::bidirectionalS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t>, boost::default_color_type, boost::default_color_type&>; TerminatorFunc = nontruth2; typename boost::graph_traits<Graph>::vertex_descriptor = void*]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:417:35: required from ‘void boost::depth_first_visit(const IncidenceGraph&, typename graph_traits<Graph>::vertex_descriptor, DFSVisitor, ColorMap) [with IncidenceGraph = adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >; DFSVisitor = dfs_visitor<std::pair<predecessor_recorder<iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>, void*, void*&>, on_tree_edge>, detail::time_stamper_with_vertex_vector<iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>, long unsigned int, long unsigned int&>, std::vector<void*>, long unsigned int, on_discover_vertex> > >; ColorMap = iterator_property_map<__gnu_cxx::__normal_iterator<default_color_type*, std::vector<default_color_type> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>, default_color_type, default_color_type&>; typename graph_traits<Graph>::vertex_descriptor = void*]’
417 | detail::depth_first_visit_impl(g, u, vis, color, detail::nontruth2());
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dominator_tree.hpp:309:22: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename graph_traits<Graph>::vertex_descriptor&, const IndexMap&, TimeMap, PredMap, VertexVector&, DomTreePredMap) [with Graph = adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >; IndexMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; TimeMap = iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>, long unsigned int, long unsigned int&>; PredMap = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>, void*, void*&>; VertexVector = std::vector<void*>; DomTreePredMap = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, int&, vertex_index_t> >; typename graph_traits<Graph>::vertex_descriptor = void*]’
309 | depth_first_visit(g, entry,
| ~~~~~~~~~~~~~~~~~^~~~~~~~~~
310 | make_dfs_visitor(
| ~~~~~~~~~~~~~~~~~
311 | make_pair(record_predecessors(parentMap, on_tree_edge()),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
312 | detail::stamp_times_with_vertex_vector(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
313 | dfnumMap, verticesByDFNum, time, on_discover_vertex()))),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
314 | make_iterator_property_map(colors.begin(), indexMap));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dominator_tree.hpp:360:35: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename graph_traits<Graph>::vertex_descriptor&, DomTreePredMap) [with Graph = adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >; DomTreePredMap = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, int&, vertex_index_t> >; typename graph_traits<Graph>::vertex_descriptor = void*]’
360 | lengauer_tarjan_dominator_tree(g, entry, indexMap, dfnumMap, parentMap,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
361 | verticesByDFNum, domTreePredMap);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
dominatorTree.cpp:46:36: required from here
46 | lengauer_tarjan_dominator_tree(g, vertex(v, g), domTreePredMap);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:65:52: warning: ‘this’ pointer is null [-Wnonnull]
65 | static void failed() { ((Model*)0)->constraints(); }
| ~~~~~~~~~~~~~~~~~~~~~~~~^~
In file included from /home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dominator_tree.hpp:15,
from dominatorTree.cpp:2:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/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::dfs_visitor<std::pair<boost::predecessor_recorder<boost::iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::bidirectionalS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t>, void*, void*&>, boost::on_tree_edge>, boost::detail::time_stamper_with_vertex_vector<boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::bidirectionalS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t>, long unsigned int, long unsigned int&>, std::vector<void*>, long unsigned int, boost::on_discover_vertex> > >; Graph = boost::adjacency_list<boost::vecS, boost::listS, boost::bidirectionalS, boost::property<boost::vertex_index_t, int> >]’
39 | void constraints()
| ^~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::constraint<Model>::failed() [with Model = boost::ReadWritePropertyMapConcept<boost::iterator_property_map<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::bidirectionalS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t>, boost::default_color_type, boost::default_color_type&>, void*>]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:134:9: required from ‘void boost::detail::depth_first_visit_impl(const IncidenceGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, DFSVisitor&, ColorMap, TerminatorFunc) [with IncidenceGraph = boost::adjacency_list<boost::vecS, boost::listS, boost::bidirectionalS, boost::property<boost::vertex_index_t, int> >; DFSVisitor = boost::dfs_visitor<std::pair<boost::predecessor_recorder<boost::iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::bidirectionalS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t>, void*, void*&>, boost::on_tree_edge>, time_stamper_with_vertex_vector<boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::bidirectionalS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t>, long unsigned int, long unsigned int&>, std::vector<void*>, long unsigned int, boost::on_discover_vertex> > >; ColorMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::bidirectionalS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t>, boost::default_color_type, boost::default_color_type&>; TerminatorFunc = nontruth2; typename boost::graph_traits<Graph>::vertex_descriptor = void*]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:417:35: required from ‘void boost::depth_first_visit(const IncidenceGraph&, typename graph_traits<Graph>::vertex_descriptor, DFSVisitor, ColorMap) [with IncidenceGraph = adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >; DFSVisitor = dfs_visitor<std::pair<predecessor_recorder<iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>, void*, void*&>, on_tree_edge>, detail::time_stamper_with_vertex_vector<iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>, long unsigned int, long unsigned int&>, std::vector<void*>, long unsigned int, on_discover_vertex> > >; ColorMap = iterator_property_map<__gnu_cxx::__normal_iterator<default_color_type*, std::vector<default_color_type> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>, default_color_type, default_color_type&>; typename graph_traits<Graph>::vertex_descriptor = void*]’
417 | detail::depth_first_visit_impl(g, u, vis, color, detail::nontruth2());
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dominator_tree.hpp:309:22: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename graph_traits<Graph>::vertex_descriptor&, const IndexMap&, TimeMap, PredMap, VertexVector&, DomTreePredMap) [with Graph = adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >; IndexMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; TimeMap = iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>, long unsigned int, long unsigned int&>; PredMap = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>, void*, void*&>; VertexVector = std::vector<void*>; DomTreePredMap = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, int&, vertex_index_t> >; typename graph_traits<Graph>::vertex_descriptor = void*]’
309 | depth_first_visit(g, entry,
| ~~~~~~~~~~~~~~~~~^~~~~~~~~~
310 | make_dfs_visitor(
| ~~~~~~~~~~~~~~~~~
311 | make_pair(record_predecessors(parentMap, on_tree_edge()),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
312 | detail::stamp_times_with_vertex_vector(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
313 | dfnumMap, verticesByDFNum, time, on_discover_vertex()))),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
314 | make_iterator_property_map(colors.begin(), indexMap));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dominator_tree.hpp:360:35: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename graph_traits<Graph>::vertex_descriptor&, DomTreePredMap) [with Graph = adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >; DomTreePredMap = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, int&, vertex_index_t> >; typename graph_traits<Graph>::vertex_descriptor = void*]’
360 | lengauer_tarjan_dominator_tree(g, entry, indexMap, dfnumMap, parentMap,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
361 | verticesByDFNum, domTreePredMap);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
dominatorTree.cpp:46:36: required from here
46 | lengauer_tarjan_dominator_tree(g, vertex(v, g), domTreePredMap);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:65:52: warning: ‘this’ pointer is null [-Wnonnull]
65 | static void failed() { ((Model*)0)->constraints(); }
| ~~~~~~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:205:10: note: in a call to non-static member function ‘void boost::ReadWritePropertyMapConcept<PMap, Key>::constraints() [with PMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::bidirectionalS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t>, boost::default_color_type, boost::default_color_type&>; Key = void*]’
205 | void constraints() {
| ^~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::EqualityComparable<boost::default_color_type> >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable<boost::default_color_type>’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:502:1: required from ‘struct boost::concepts::ColorValue<boost::default_color_type>’
502 | BOOST_concept(ColorValue, (C))
| ^~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:502:1: required from ‘struct boost::concepts::ColorValueConcept<boost::default_color_type>’
502 | BOOST_concept(ColorValue, (C))
| ^~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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);
| ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_<void (*)(boost::concepts::ColorValueConcept<boost::default_color_type>)>’
72 | struct requirement_<void(*)(Model)>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:136:9: required from ‘void boost::detail::depth_first_visit_impl(const IncidenceGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, DFSVisitor&, ColorMap, TerminatorFunc) [with IncidenceGraph = boost::adjacency_list<boost::vecS, boost::listS, boost::bidirectionalS, boost::property<boost::vertex_index_t, int> >; DFSVisitor = boost::dfs_visitor<std::pair<boost::predecessor_recorder<boost::iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::bidirectionalS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t>, void*, void*&>, boost::on_tree_edge>, time_stamper_with_vertex_vector<boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::bidirectionalS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t>, long unsigned int, long unsigned int&>, std::vector<void*>, long unsigned int, boost::on_discover_vertex> > >; ColorMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::bidirectionalS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t>, boost::default_color_type, boost::default_color_type&>; TerminatorFunc = nontruth2; typename boost::graph_traits<Graph>::vertex_descriptor = void*]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:417:35: required from ‘void boost::depth_first_visit(const IncidenceGraph&, typename graph_traits<Graph>::vertex_descriptor, DFSVisitor, ColorMap) [with IncidenceGraph = adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >; DFSVisitor = dfs_visitor<std::pair<predecessor_recorder<iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>, void*, void*&>, on_tree_edge>, detail::time_stamper_with_vertex_vector<iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>, long unsigned int, long unsigned int&>, std::vector<void*>, long unsigned int, on_discover_vertex> > >; ColorMap = iterator_property_map<__gnu_cxx::__normal_iterator<default_color_type*, std::vector<default_color_type> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>, default_color_type, default_color_type&>; typename graph_traits<Graph>::vertex_descriptor = void*]’
417 | detail::depth_first_visit_impl(g, u, vis, color, detail::nontruth2());
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dominator_tree.hpp:309:22: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename graph_traits<Graph>::vertex_descriptor&, const IndexMap&, TimeMap, PredMap, VertexVector&, DomTreePredMap) [with Graph = adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >; IndexMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; TimeMap = iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>, long unsigned int, long unsigned int&>; PredMap = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>, void*, void*&>; VertexVector = std::vector<void*>; DomTreePredMap = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, int&, vertex_index_t> >; typename graph_traits<Graph>::vertex_descriptor = void*]’
309 | depth_first_visit(g, entry,
| ~~~~~~~~~~~~~~~~~^~~~~~~~~~
310 | make_dfs_visitor(
| ~~~~~~~~~~~~~~~~~
311 | make_pair(record_predecessors(parentMap, on_tree_edge()),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
312 | detail::stamp_times_with_vertex_vector(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
313 | dfnumMap, verticesByDFNum, time, on_discover_vertex()))),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
314 | make_iterator_property_map(colors.begin(), indexMap));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dominator_tree.hpp:360:35: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename graph_traits<Graph>::vertex_descriptor&, DomTreePredMap) [with Graph = adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >; DomTreePredMap = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, int&, vertex_index_t> >; typename graph_traits<Graph>::vertex_descriptor = void*]’
360 | lengauer_tarjan_dominator_tree(g, entry, indexMap, dfnumMap, parentMap,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
361 | verticesByDFNum, domTreePredMap);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
dominatorTree.cpp:46:36: required from here
46 | lengauer_tarjan_dominator_tree(g, vertex(v, g), domTreePredMap);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::EqualityComparable<boost::default_color_type>]’
20 | ~usage_requirements() { ((Model*)0)->~Model(); }
| ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::DefaultConstructible<boost::default_color_type> >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:137:5: required from ‘struct boost::DefaultConstructible<boost::default_color_type>’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:502:1: required from ‘struct boost::concepts::ColorValue<boost::default_color_type>’
502 | BOOST_concept(ColorValue, (C))
| ^~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:502:1: required from ‘struct boost::concepts::ColorValueConcept<boost::default_color_type>’
502 | BOOST_concept(ColorValue, (C))
| ^~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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);
| ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_<void (*)(boost::concepts::ColorValueConcept<boost::default_color_type>)>’
72 | struct requirement_<void(*)(Model)>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:136:9: required from ‘void boost::detail::depth_first_visit_impl(const IncidenceGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, DFSVisitor&, ColorMap, TerminatorFunc) [with IncidenceGraph = boost::adjacency_list<boost::vecS, boost::listS, boost::bidirectionalS, boost::property<boost::vertex_index_t, int> >; DFSVisitor = boost::dfs_visitor<std::pair<boost::predecessor_recorder<boost::iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::bidirectionalS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t>, void*, void*&>, boost::on_tree_edge>, time_stamper_with_vertex_vector<boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::bidirectionalS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t>, long unsigned int, long unsigned int&>, std::vector<void*>, long unsigned int, boost::on_discover_vertex> > >; ColorMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::bidirectionalS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t>, boost::default_color_type, boost::default_color_type&>; TerminatorFunc = nontruth2; typename boost::graph_traits<Graph>::vertex_descriptor = void*]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:417:35: required from ‘void boost::depth_first_visit(const IncidenceGraph&, typename graph_traits<Graph>::vertex_descriptor, DFSVisitor, ColorMap) [with IncidenceGraph = adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >; DFSVisitor = dfs_visitor<std::pair<predecessor_recorder<iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>, void*, void*&>, on_tree_edge>, detail::time_stamper_with_vertex_vector<iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>, long unsigned int, long unsigned int&>, std::vector<void*>, long unsigned int, on_discover_vertex> > >; ColorMap = iterator_property_map<__gnu_cxx::__normal_iterator<default_color_type*, std::vector<default_color_type> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>, default_color_type, default_color_type&>; typename graph_traits<Graph>::vertex_descriptor = void*]’
417 | detail::depth_first_visit_impl(g, u, vis, color, detail::nontruth2());
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dominator_tree.hpp:309:22: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename graph_traits<Graph>::vertex_descriptor&, const IndexMap&, TimeMap, PredMap, VertexVector&, DomTreePredMap) [with Graph = adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >; IndexMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; TimeMap = iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>, long unsigned int, long unsigned int&>; PredMap = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>, void*, void*&>; VertexVector = std::vector<void*>; DomTreePredMap = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, int&, vertex_index_t> >; typename graph_traits<Graph>::vertex_descriptor = void*]’
309 | depth_first_visit(g, entry,
| ~~~~~~~~~~~~~~~~~^~~~~~~~~~
310 | make_dfs_visitor(
| ~~~~~~~~~~~~~~~~~
311 | make_pair(record_predecessors(parentMap, on_tree_edge()),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
312 | detail::stamp_times_with_vertex_vector(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
313 | dfnumMap, verticesByDFNum, time, on_discover_vertex()))),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
314 | make_iterator_property_map(colors.begin(), indexMap));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dominator_tree.hpp:360:35: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename graph_traits<Graph>::vertex_descriptor&, DomTreePredMap) [with Graph = adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >; DomTreePredMap = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, int&, vertex_index_t> >; typename graph_traits<Graph>::vertex_descriptor = void*]’
360 | lengauer_tarjan_dominator_tree(g, entry, indexMap, dfnumMap, parentMap,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
361 | verticesByDFNum, domTreePredMap);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
dominatorTree.cpp:46:36: required from here
46 | lengauer_tarjan_dominator_tree(g, vertex(v, g), domTreePredMap);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::DefaultConstructible<boost::default_color_type>]’
20 | ~usage_requirements() { ((Model*)0)->~Model(); }
| ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::concepts::ColorValue<boost::default_color_type> >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/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> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:502:1: required from ‘struct boost::concepts::ColorValueConcept<boost::default_color_type>’
502 | BOOST_concept(ColorValue, (C))
| ^~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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);
| ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/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) );
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/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;
| ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_<void (*)(boost::concepts::ColorValueConcept<boost::default_color_type>)>’
72 | struct requirement_<void(*)(Model)>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:136:9: required from ‘void boost::detail::depth_first_visit_impl(const IncidenceGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, DFSVisitor&, ColorMap, TerminatorFunc) [with IncidenceGraph = boost::adjacency_list<boost::vecS, boost::listS, boost::bidirectionalS, boost::property<boost::vertex_index_t, int> >; DFSVisitor = boost::dfs_visitor<std::pair<boost::predecessor_recorder<boost::iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::bidirectionalS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t>, void*, void*&>, boost::on_tree_edge>, time_stamper_with_vertex_vector<boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::bidirectionalS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t>, long unsigned int, long unsigned int&>, std::vector<void*>, long unsigned int, boost::on_discover_vertex> > >; ColorMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::bidirectionalS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t>, boost::default_color_type, boost::default_color_type&>; TerminatorFunc = nontruth2; typename boost::graph_traits<Graph>::vertex_descriptor = void*]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:417:35: required from ‘void boost::depth_first_visit(const IncidenceGraph&, typename graph_traits<Graph>::vertex_descriptor, DFSVisitor, ColorMap) [with IncidenceGraph = adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >; DFSVisitor = dfs_visitor<std::pair<predecessor_recorder<iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>, void*, void*&>, on_tree_edge>, detail::time_stamper_with_vertex_vector<iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>, long unsigned int, long unsigned int&>, std::vector<void*>, long unsigned int, on_discover_vertex> > >; ColorMap = iterator_property_map<__gnu_cxx::__normal_iterator<default_color_type*, std::vector<default_color_type> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>, default_color_type, default_color_type&>; typename graph_traits<Graph>::vertex_descriptor = void*]’
417 | detail::depth_first_visit_impl(g, u, vis, color, detail::nontruth2());
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dominator_tree.hpp:309:22: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename graph_traits<Graph>::vertex_descriptor&, const IndexMap&, TimeMap, PredMap, VertexVector&, DomTreePredMap) [with Graph = adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >; IndexMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; TimeMap = iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>, long unsigned int, long unsigned int&>; PredMap = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>, void*, void*&>; VertexVector = std::vector<void*>; DomTreePredMap = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, int&, vertex_index_t> >; typename graph_traits<Graph>::vertex_descriptor = void*]’
309 | depth_first_visit(g, entry,
| ~~~~~~~~~~~~~~~~~^~~~~~~~~~
310 | make_dfs_visitor(
| ~~~~~~~~~~~~~~~~~
311 | make_pair(record_predecessors(parentMap, on_tree_edge()),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
312 | detail::stamp_times_with_vertex_vector(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
313 | dfnumMap, verticesByDFNum, time, on_discover_vertex()))),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
314 | make_iterator_property_map(colors.begin(), indexMap));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dominator_tree.hpp:360:35: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename graph_traits<Graph>::vertex_descriptor&, DomTreePredMap) [with Graph = adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >; DomTreePredMap = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, int&, vertex_index_t> >; typename graph_traits<Graph>::vertex_descriptor = void*]’
360 | lengauer_tarjan_dominator_tree(g, entry, indexMap, dfnumMap, parentMap,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
361 | verticesByDFNum, domTreePredMap);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
dominatorTree.cpp:46:36: required from here
46 | lengauer_tarjan_dominator_tree(g, vertex(v, g), domTreePredMap);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::concepts::ColorValue<boost::default_color_type>]’
20 | ~usage_requirements() { ((Model*)0)->~Model(); }
| ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::ColorValueConcept<boost::default_color_type>]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:136:9: required from ‘void boost::detail::depth_first_visit_impl(const IncidenceGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, DFSVisitor&, ColorMap, TerminatorFunc) [with IncidenceGraph = boost::adjacency_list<boost::vecS, boost::listS, boost::bidirectionalS, boost::property<boost::vertex_index_t, int> >; DFSVisitor = boost::dfs_visitor<std::pair<boost::predecessor_recorder<boost::iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::bidirectionalS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t>, void*, void*&>, boost::on_tree_edge>, time_stamper_with_vertex_vector<boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::bidirectionalS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t>, long unsigned int, long unsigned int&>, std::vector<void*>, long unsigned int, boost::on_discover_vertex> > >; ColorMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::bidirectionalS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t>, boost::default_color_type, boost::default_color_type&>; TerminatorFunc = nontruth2; typename boost::graph_traits<Graph>::vertex_descriptor = void*]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:417:35: required from ‘void boost::depth_first_visit(const IncidenceGraph&, typename graph_traits<Graph>::vertex_descriptor, DFSVisitor, ColorMap) [with IncidenceGraph = adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >; DFSVisitor = dfs_visitor<std::pair<predecessor_recorder<iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>, void*, void*&>, on_tree_edge>, detail::time_stamper_with_vertex_vector<iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>, long unsigned int, long unsigned int&>, std::vector<void*>, long unsigned int, on_discover_vertex> > >; ColorMap = iterator_property_map<__gnu_cxx::__normal_iterator<default_color_type*, std::vector<default_color_type> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>, default_color_type, default_color_type&>; typename graph_traits<Graph>::vertex_descriptor = void*]’
417 | detail::depth_first_visit_impl(g, u, vis, color, detail::nontruth2());
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dominator_tree.hpp:309:22: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename graph_traits<Graph>::vertex_descriptor&, const IndexMap&, TimeMap, PredMap, VertexVector&, DomTreePredMap) [with Graph = adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >; IndexMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; TimeMap = iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>, long unsigned int, long unsigned int&>; PredMap = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>, void*, void*&>; VertexVector = std::vector<void*>; DomTreePredMap = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, int&, vertex_index_t> >; typename graph_traits<Graph>::vertex_descriptor = void*]’
309 | depth_first_visit(g, entry,
| ~~~~~~~~~~~~~~~~~^~~~~~~~~~
310 | make_dfs_visitor(
| ~~~~~~~~~~~~~~~~~
311 | make_pair(record_predecessors(parentMap, on_tree_edge()),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
312 | detail::stamp_times_with_vertex_vector(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
313 | dfnumMap, verticesByDFNum, time, on_discover_vertex()))),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
314 | make_iterator_property_map(colors.begin(), indexMap));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dominator_tree.hpp:360:35: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename graph_traits<Graph>::vertex_descriptor&, DomTreePredMap) [with Graph = adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >; DomTreePredMap = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, int&, vertex_index_t> >; typename graph_traits<Graph>::vertex_descriptor = void*]’
360 | lengauer_tarjan_dominator_tree(g, entry, indexMap, dfnumMap, parentMap,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
361 | verticesByDFNum, domTreePredMap);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
dominatorTree.cpp:46:36: required from here
46 | lengauer_tarjan_dominator_tree(g, vertex(v, g), domTreePredMap);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:502:15: note: in a call to non-static member function ‘boost::concepts::ColorValueConcept<boost::default_color_type>::~ColorValueConcept()’
502 | BOOST_concept(ColorValue, (C))
| ^~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/preprocessor/cat.hpp:29:34: note: in definition of macro ‘BOOST_PP_CAT_I’
29 | # define BOOST_PP_CAT_I(a, b) a ## b
| ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/concept_def.hpp:23:12: note: in expansion of macro ‘BOOST_PP_CAT’
23 | struct BOOST_PP_CAT(name,Concept) \
| ^~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:502:1: note: in expansion of macro ‘BOOST_concept’
502 | BOOST_concept(ColorValue, (C))
| ^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Convertible<std::random_access_iterator_tag, std::input_iterator_tag>]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/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(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/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> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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);
| ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/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) );
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/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;
| ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 9 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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<void**, std::vector<void*> > >]’
32 | inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
| ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied<boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<void**, std::vector<void*> > > >::value’
44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied<boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<void**, std::vector<void*> > > >’
45 | typedef boost::integral_constant<bool, value> type;
| ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_<void (*)(boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<void**, std::vector<void*> > >)>’
72 | struct requirement_<void(*)(Model)>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map<RAIter, ID, typename std::iterator_traits< <template-parameter-1-1> >::value_type, typename std::iterator_traits< <template-parameter-1-1> >::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = __gnu_cxx::__normal_iterator<void**, std::vector<void*> >; ID = adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, int&, vertex_index_t>; typename std::iterator_traits< <template-parameter-1-1> >::value_type = void*; typename std::iterator_traits< <template-parameter-1-1> >::reference = void*&]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
dominatorTree.cpp:44:40: required from here
44 | make_iterator_property_map(domTreePredVector.begin(), v1_index_map);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
20 | ~usage_requirements() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible<X, Y>::~Convertible() [with X = std::random_access_iterator_tag; Y = std::input_iterator_tag]’
37 | ~model()
| ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
208 | BOOST_CONCEPT_USAGE(Convertible) {
| ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Convertible<std::random_access_iterator_tag, std::forward_iterator_tag>]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/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(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/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> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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);
| ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/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) );
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/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;
| ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 8 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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<void**, std::vector<void*> > >]’
32 | inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
| ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied<boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<void**, std::vector<void*> > > >::value’
44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied<boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<void**, std::vector<void*> > > >’
45 | typedef boost::integral_constant<bool, value> type;
| ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_<void (*)(boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<void**, std::vector<void*> > >)>’
72 | struct requirement_<void(*)(Model)>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map<RAIter, ID, typename std::iterator_traits< <template-parameter-1-1> >::value_type, typename std::iterator_traits< <template-parameter-1-1> >::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = __gnu_cxx::__normal_iterator<void**, std::vector<void*> >; ID = adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, int&, vertex_index_t>; typename std::iterator_traits< <template-parameter-1-1> >::value_type = void*; typename std::iterator_traits< <template-parameter-1-1> >::reference = void*&]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
dominatorTree.cpp:44:40: required from here
44 | make_iterator_property_map(domTreePredVector.begin(), v1_index_map);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
20 | ~usage_requirements() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible<X, Y>::~Convertible() [with X = std::random_access_iterator_tag; Y = std::forward_iterator_tag]’
37 | ~model()
| ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
208 | BOOST_CONCEPT_USAGE(Convertible) {
| ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Convertible<std::random_access_iterator_tag, std::bidirectional_iterator_tag>]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/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(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/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> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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);
| ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/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) );
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/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;
| ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 7 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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<void**, std::vector<void*> > >]’
32 | inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
| ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied<boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<void**, std::vector<void*> > > >::value’
44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied<boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<void**, std::vector<void*> > > >’
45 | typedef boost::integral_constant<bool, value> type;
| ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_<void (*)(boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<void**, std::vector<void*> > >)>’
72 | struct requirement_<void(*)(Model)>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map<RAIter, ID, typename std::iterator_traits< <template-parameter-1-1> >::value_type, typename std::iterator_traits< <template-parameter-1-1> >::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = __gnu_cxx::__normal_iterator<void**, std::vector<void*> >; ID = adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, int&, vertex_index_t>; typename std::iterator_traits< <template-parameter-1-1> >::value_type = void*; typename std::iterator_traits< <template-parameter-1-1> >::reference = void*&]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
dominatorTree.cpp:44:40: required from here
44 | make_iterator_property_map(domTreePredVector.begin(), v1_index_map);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
20 | ~usage_requirements() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible<X, Y>::~Convertible() [with X = std::random_access_iterator_tag; Y = std::bidirectional_iterator_tag]’
37 | ~model()
| ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
208 | BOOST_CONCEPT_USAGE(Convertible) {
| ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/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*> >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:137:5: required from ‘struct boost::DefaultConstructible<void*>’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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);
| ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/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) );
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/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;
| ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_<void (*)(boost::DefaultConstructible<void*>)>’
72 | struct requirement_<void(*)(Model)>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:68:9: [ skipping 8 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied<boost::concepts::BidirectionalGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::bidirectionalS, boost::property<boost::vertex_index_t, int> > > >::value’
44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied<boost::concepts::BidirectionalGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::bidirectionalS, boost::property<boost::vertex_index_t, int> > > >’
45 | typedef boost::integral_constant<bool, value> type;
| ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_<void (*)(boost::concepts::BidirectionalGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::bidirectionalS, boost::property<boost::vertex_index_t, int> > >)>’
72 | struct requirement_<void(*)(Model)>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dominator_tree.hpp:245:5: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename graph_traits<Graph>::vertex_descriptor&, const IndexMap&, TimeMap, PredMap, VertexVector&, DomTreePredMap) [with Graph = adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >; IndexMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; TimeMap = iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>, long unsigned int, long unsigned int&>; PredMap = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>, void*, void*&>; VertexVector = std::vector<void*>; DomTreePredMap = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, int&, vertex_index_t> >; typename graph_traits<Graph>::vertex_descriptor = void*]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dominator_tree.hpp:360:35: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename graph_traits<Graph>::vertex_descriptor&, DomTreePredMap) [with Graph = adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >; DomTreePredMap = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, int&, vertex_index_t> >; typename graph_traits<Graph>::vertex_descriptor = void*]’
360 | lengauer_tarjan_dominator_tree(g, entry, indexMap, dfnumMap, parentMap,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
361 | verticesByDFNum, domTreePredMap);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
dominatorTree.cpp:46:36: required from here
46 | lengauer_tarjan_dominator_tree(g, vertex(v, g), domTreePredMap);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/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(); }
| ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/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*>]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/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::bidirectionalS, boost::property<boost::vertex_index_t, int> >]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/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::bidirectionalS, boost::property<boost::vertex_index_t, int> > >]’
20 | ~usage_requirements() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/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::bidirectionalS, boost::property<boost::vertex_index_t, int> > > >]’
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:66:5: required from ‘struct boost::concepts::Graph<boost::adjacency_list<boost::vecS, boost::listS, boost::bidirectionalS, boost::property<boost::vertex_index_t, int> > >’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:75:1: required from ‘struct boost::concepts::IncidenceGraph<boost::adjacency_list<boost::vecS, boost::listS, boost::bidirectionalS, boost::property<boost::vertex_index_t, int> > >’
75 | BOOST_concept(IncidenceGraph, (G)) : Graph< G >
| ^~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:118:1: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied<boost::concepts::BidirectionalGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::bidirectionalS, boost::property<boost::vertex_index_t, int> > > >::value’
44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied<boost::concepts::BidirectionalGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::bidirectionalS, boost::property<boost::vertex_index_t, int> > > >’
45 | typedef boost::integral_constant<bool, value> type;
| ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_<void (*)(boost::concepts::BidirectionalGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::bidirectionalS, boost::property<boost::vertex_index_t, int> > >)>’
72 | struct requirement_<void(*)(Model)>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dominator_tree.hpp:245:5: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename graph_traits<Graph>::vertex_descriptor&, const IndexMap&, TimeMap, PredMap, VertexVector&, DomTreePredMap) [with Graph = adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >; IndexMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; TimeMap = iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>, long unsigned int, long unsigned int&>; PredMap = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>, void*, void*&>; VertexVector = std::vector<void*>; DomTreePredMap = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, int&, vertex_index_t> >; typename graph_traits<Graph>::vertex_descriptor = void*]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dominator_tree.hpp:360:35: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename graph_traits<Graph>::vertex_descriptor&, DomTreePredMap) [with Graph = adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >; DomTreePredMap = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, int&, vertex_index_t> >; typename graph_traits<Graph>::vertex_descriptor = void*]’
360 | lengauer_tarjan_dominator_tree(g, entry, indexMap, dfnumMap, parentMap,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
361 | verticesByDFNum, domTreePredMap);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
dominatorTree.cpp:46:36: required from here
46 | lengauer_tarjan_dominator_tree(g, vertex(v, g), domTreePredMap);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/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()
| ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:137:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
137 | BOOST_CONCEPT_USAGE(DefaultConstructible) {
| ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/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*> >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable<void*>’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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);
| ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/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) );
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/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;
| ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_<void (*)(boost::EqualityComparable<void*>)>’
72 | struct requirement_<void(*)(Model)>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:69:9: [ skipping 8 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied<boost::concepts::BidirectionalGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::bidirectionalS, boost::property<boost::vertex_index_t, int> > > >::value’
44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied<boost::concepts::BidirectionalGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::bidirectionalS, boost::property<boost::vertex_index_t, int> > > >’
45 | typedef boost::integral_constant<bool, value> type;
| ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_<void (*)(boost::concepts::BidirectionalGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::bidirectionalS, boost::property<boost::vertex_index_t, int> > >)>’
72 | struct requirement_<void(*)(Model)>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dominator_tree.hpp:245:5: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename graph_traits<Graph>::vertex_descriptor&, const IndexMap&, TimeMap, PredMap, VertexVector&, DomTreePredMap) [with Graph = adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >; IndexMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; TimeMap = iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>, long unsigned int, long unsigned int&>; PredMap = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>, void*, void*&>; VertexVector = std::vector<void*>; DomTreePredMap = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, int&, vertex_index_t> >; typename graph_traits<Graph>::vertex_descriptor = void*]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dominator_tree.hpp:360:35: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename graph_traits<Graph>::vertex_descriptor&, DomTreePredMap) [with Graph = adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >; DomTreePredMap = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, int&, vertex_index_t> >; typename graph_traits<Graph>::vertex_descriptor = void*]’
360 | lengauer_tarjan_dominator_tree(g, entry, indexMap, dfnumMap, parentMap,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
361 | verticesByDFNum, domTreePredMap);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
dominatorTree.cpp:46:36: required from here
46 | lengauer_tarjan_dominator_tree(g, vertex(v, g), domTreePredMap);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/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(); }
| ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/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*>]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/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::bidirectionalS, boost::property<boost::vertex_index_t, int> >]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/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::bidirectionalS, boost::property<boost::vertex_index_t, int> > >]’
20 | ~usage_requirements() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/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::bidirectionalS, boost::property<boost::vertex_index_t, int> > > >]’
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:66:5: required from ‘struct boost::concepts::Graph<boost::adjacency_list<boost::vecS, boost::listS, boost::bidirectionalS, boost::property<boost::vertex_index_t, int> > >’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:75:1: required from ‘struct boost::concepts::IncidenceGraph<boost::adjacency_list<boost::vecS, boost::listS, boost::bidirectionalS, boost::property<boost::vertex_index_t, int> > >’
75 | BOOST_concept(IncidenceGraph, (G)) : Graph< G >
| ^~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:118:1: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied<boost::concepts::BidirectionalGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::bidirectionalS, boost::property<boost::vertex_index_t, int> > > >::value’
44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied<boost::concepts::BidirectionalGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::bidirectionalS, boost::property<boost::vertex_index_t, int> > > >’
45 | typedef boost::integral_constant<bool, value> type;
| ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_<void (*)(boost::concepts::BidirectionalGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::bidirectionalS, boost::property<boost::vertex_index_t, int> > >)>’
72 | struct requirement_<void(*)(Model)>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dominator_tree.hpp:245:5: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename graph_traits<Graph>::vertex_descriptor&, const IndexMap&, TimeMap, PredMap, VertexVector&, DomTreePredMap) [with Graph = adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >; IndexMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; TimeMap = iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>, long unsigned int, long unsigned int&>; PredMap = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>, void*, void*&>; VertexVector = std::vector<void*>; DomTreePredMap = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, int&, vertex_index_t> >; typename graph_traits<Graph>::vertex_descriptor = void*]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dominator_tree.hpp:360:35: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename graph_traits<Graph>::vertex_descriptor&, DomTreePredMap) [with Graph = adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >; DomTreePredMap = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, int&, vertex_index_t> >; typename graph_traits<Graph>::vertex_descriptor = void*]’
360 | lengauer_tarjan_dominator_tree(g, entry, indexMap, dfnumMap, parentMap,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
361 | verticesByDFNum, domTreePredMap);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
dominatorTree.cpp:46:36: required from here
46 | lengauer_tarjan_dominator_tree(g, vertex(v, g), domTreePredMap);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/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()
| ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:233:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
233 | BOOST_CONCEPT_USAGE(EqualityComparable) {
| ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/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*> >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:145:5: required from ‘struct boost::Assignable<void*>’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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);
| ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/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) );
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/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;
| ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_<void (*)(boost::Assignable<void*>)>’
72 | struct requirement_<void(*)(Model)>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:70:9: [ skipping 8 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied<boost::concepts::BidirectionalGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::bidirectionalS, boost::property<boost::vertex_index_t, int> > > >::value’
44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied<boost::concepts::BidirectionalGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::bidirectionalS, boost::property<boost::vertex_index_t, int> > > >’
45 | typedef boost::integral_constant<bool, value> type;
| ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_<void (*)(boost::concepts::BidirectionalGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::bidirectionalS, boost::property<boost::vertex_index_t, int> > >)>’
72 | struct requirement_<void(*)(Model)>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dominator_tree.hpp:245:5: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename graph_traits<Graph>::vertex_descriptor&, const IndexMap&, TimeMap, PredMap, VertexVector&, DomTreePredMap) [with Graph = adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >; IndexMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; TimeMap = iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>, long unsigned int, long unsigned int&>; PredMap = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>, void*, void*&>; VertexVector = std::vector<void*>; DomTreePredMap = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, int&, vertex_index_t> >; typename graph_traits<Graph>::vertex_descriptor = void*]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dominator_tree.hpp:360:35: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename graph_traits<Graph>::vertex_descriptor&, DomTreePredMap) [with Graph = adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >; DomTreePredMap = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, int&, vertex_index_t> >; typename graph_traits<Graph>::vertex_descriptor = void*]’
360 | lengauer_tarjan_dominator_tree(g, entry, indexMap, dfnumMap, parentMap,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
361 | verticesByDFNum, domTreePredMap);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
dominatorTree.cpp:46:36: required from here
46 | lengauer_tarjan_dominator_tree(g, vertex(v, g), domTreePredMap);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/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(); }
| ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/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*>]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/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::bidirectionalS, boost::property<boost::vertex_index_t, int> >]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/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::bidirectionalS, boost::property<boost::vertex_index_t, int> > >]’
20 | ~usage_requirements() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/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::bidirectionalS, boost::property<boost::vertex_index_t, int> > > >]’
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:66:5: required from ‘struct boost::concepts::Graph<boost::adjacency_list<boost::vecS, boost::listS, boost::bidirectionalS, boost::property<boost::vertex_index_t, int> > >’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:75:1: required from ‘struct boost::concepts::IncidenceGraph<boost::adjacency_list<boost::vecS, boost::listS, boost::bidirectionalS, boost::property<boost::vertex_index_t, int> > >’
75 | BOOST_concept(IncidenceGraph, (G)) : Graph< G >
| ^~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:118:1: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied<boost::concepts::BidirectionalGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::bidirectionalS, boost::property<boost::vertex_index_t, int> > > >::value’
44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied<boost::concepts::BidirectionalGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::bidirectionalS, boost::property<boost::vertex_index_t, int> > > >’
45 | typedef boost::integral_constant<bool, value> type;
| ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_<void (*)(boost::concepts::BidirectionalGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::bidirectionalS, boost::property<boost::vertex_index_t, int> > >)>’
72 | struct requirement_<void(*)(Model)>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dominator_tree.hpp:245:5: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename graph_traits<Graph>::vertex_descriptor&, const IndexMap&, TimeMap, PredMap, VertexVector&, DomTreePredMap) [with Graph = adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >; IndexMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; TimeMap = iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>, long unsigned int, long unsigned int&>; PredMap = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>, void*, void*&>; VertexVector = std::vector<void*>; DomTreePredMap = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, int&, vertex_index_t> >; typename graph_traits<Graph>::vertex_descriptor = void*]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dominator_tree.hpp:360:35: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename graph_traits<Graph>::vertex_descriptor&, DomTreePredMap) [with Graph = adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >; DomTreePredMap = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, int&, vertex_index_t> >; typename graph_traits<Graph>::vertex_descriptor = void*]’
360 | lengauer_tarjan_dominator_tree(g, entry, indexMap, dfnumMap, parentMap,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
361 | verticesByDFNum, domTreePredMap);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
dominatorTree.cpp:46:36: required from here
46 | lengauer_tarjan_dominator_tree(g, vertex(v, g), domTreePredMap);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/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()
| ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:145:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
145 | BOOST_CONCEPT_USAGE(Assignable) {
| ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/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<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property>*, std::vector<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property>, std::allocator<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl<boost::bidirectional_tag, void*>, long int> > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/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<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property>*, std::vector<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property>, std::allocator<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl<boost::bidirectional_tag, void*>, long int> >’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property>*, std::vector<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property>, std::allocator<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl<boost::bidirectional_tag, void*>, long int> >]’
32 | inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
| ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/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<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property>*, std::vector<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property>, std::allocator<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl<boost::bidirectional_tag, void*>, long int> > >::value’
44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/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<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property>*, std::vector<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property>, std::allocator<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl<boost::bidirectional_tag, void*>, long int> > >’
45 | typedef boost::integral_constant<bool, value> type;
| ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/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<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property>*, std::vector<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property>, std::allocator<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl<boost::bidirectional_tag, void*>, long int> >)>’
72 | struct requirement_<void(*)(Model)>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:89:9: [ skipping 7 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied<boost::concepts::BidirectionalGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::bidirectionalS, boost::property<boost::vertex_index_t, int> > > >::value’
44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied<boost::concepts::BidirectionalGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::bidirectionalS, boost::property<boost::vertex_index_t, int> > > >’
45 | typedef boost::integral_constant<bool, value> type;
| ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_<void (*)(boost::concepts::BidirectionalGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::bidirectionalS, boost::property<boost::vertex_index_t, int> > >)>’
72 | struct requirement_<void(*)(Model)>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dominator_tree.hpp:245:5: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename graph_traits<Graph>::vertex_descriptor&, const IndexMap&, TimeMap, PredMap, VertexVector&, DomTreePredMap) [with Graph = adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >; IndexMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; TimeMap = iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>, long unsigned int, long unsigned int&>; PredMap = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>, void*, void*&>; VertexVector = std::vector<void*>; DomTreePredMap = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, int&, vertex_index_t> >; typename graph_traits<Graph>::vertex_descriptor = void*]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dominator_tree.hpp:360:35: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename graph_traits<Graph>::vertex_descriptor&, DomTreePredMap) [with Graph = adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >; DomTreePredMap = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, int&, vertex_index_t> >; typename graph_traits<Graph>::vertex_descriptor = void*]’
360 | lengauer_tarjan_dominator_tree(g, entry, indexMap, dfnumMap, parentMap,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
361 | verticesByDFNum, domTreePredMap);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
dominatorTree.cpp:46:36: required from here
46 | lengauer_tarjan_dominator_tree(g, vertex(v, g), domTreePredMap);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/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<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property>*, std::vector<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property>, std::allocator<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl<boost::bidirectional_tag, void*>, long int> >]’
20 | ~usage_requirements() { ((Model*)0)->~Model(); }
| ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/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<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property>*, std::vector<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property>, std::allocator<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl<boost::bidirectional_tag, void*>, long int> >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/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::bidirectionalS, boost::property<boost::vertex_index_t, int> >]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: required from ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::concepts::IncidenceGraph<boost::adjacency_list<boost::vecS, boost::listS, boost::bidirectionalS, boost::property<boost::vertex_index_t, int> > >]’
20 | ~usage_requirements() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/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::bidirectionalS, boost::property<boost::vertex_index_t, int> > > >]’
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:87:5: required from ‘struct boost::concepts::IncidenceGraph<boost::adjacency_list<boost::vecS, boost::listS, boost::bidirectionalS, boost::property<boost::vertex_index_t, int> > >’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:118:1: required from ‘struct boost::concepts::BidirectionalGraph<boost::adjacency_list<boost::vecS, boost::listS, boost::bidirectionalS, boost::property<boost::vertex_index_t, int> > >’
118 | BOOST_concept(BidirectionalGraph, (G)) : IncidenceGraph< G >
| ^~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:118:1: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied<boost::concepts::BidirectionalGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::bidirectionalS, boost::property<boost::vertex_index_t, int> > > >::value’
44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied<boost::concepts::BidirectionalGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::bidirectionalS, boost::property<boost::vertex_index_t, int> > > >’
45 | typedef boost::integral_constant<bool, value> type;
| ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_<void (*)(boost::concepts::BidirectionalGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::bidirectionalS, boost::property<boost::vertex_index_t, int> > >)>’
72 | struct requirement_<void(*)(Model)>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dominator_tree.hpp:245:5: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename graph_traits<Graph>::vertex_descriptor&, const IndexMap&, TimeMap, PredMap, VertexVector&, DomTreePredMap) [with Graph = adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >; IndexMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; TimeMap = iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>, long unsigned int, long unsigned int&>; PredMap = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>, void*, void*&>; VertexVector = std::vector<void*>; DomTreePredMap = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, int&, vertex_index_t> >; typename graph_traits<Graph>::vertex_descriptor = void*]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dominator_tree.hpp:360:35: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename graph_traits<Graph>::vertex_descriptor&, DomTreePredMap) [with Graph = adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >; DomTreePredMap = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, int&, vertex_index_t> >; typename graph_traits<Graph>::vertex_descriptor = void*]’
360 | lengauer_tarjan_dominator_tree(g, entry, indexMap, dfnumMap, parentMap,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
361 | verticesByDFNum, domTreePredMap);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
dominatorTree.cpp:46:36: required from here
46 | lengauer_tarjan_dominator_tree(g, vertex(v, g), domTreePredMap);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/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<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property>*, std::vector<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property>, std::allocator<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl<boost::bidirectional_tag, void*>, long int>]’
37 | ~model()
| ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:52:50: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
52 | BOOST_concept(MultiPassInputIterator, (T)) { BOOST_CONCEPT_USAGE(
| ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/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::bidirectional_tag, void*> > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:137:5: required from ‘struct boost::DefaultConstructible<boost::detail::edge_desc_impl<boost::bidirectional_tag, void*> >’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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::bidirectional_tag, void*> >]’
32 | inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
| ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/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::bidirectional_tag, void*> > >::value’
44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/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::bidirectional_tag, void*> > >’
45 | typedef boost::integral_constant<bool, value> type;
| ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_<void (*)(boost::DefaultConstructible<boost::detail::edge_desc_impl<boost::bidirectional_tag, void*> >)>’
72 | struct requirement_<void(*)(Model)>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:90:9: [ skipping 7 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied<boost::concepts::BidirectionalGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::bidirectionalS, boost::property<boost::vertex_index_t, int> > > >::value’
44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied<boost::concepts::BidirectionalGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::bidirectionalS, boost::property<boost::vertex_index_t, int> > > >’
45 | typedef boost::integral_constant<bool, value> type;
| ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_<void (*)(boost::concepts::BidirectionalGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::bidirectionalS, boost::property<boost::vertex_index_t, int> > >)>’
72 | struct requirement_<void(*)(Model)>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dominator_tree.hpp:245:5: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename graph_traits<Graph>::vertex_descriptor&, const IndexMap&, TimeMap, PredMap, VertexVector&, DomTreePredMap) [with Graph = adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >; IndexMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; TimeMap = iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>, long unsigned int, long unsigned int&>; PredMap = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>, void*, void*&>; VertexVector = std::vector<void*>; DomTreePredMap = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, int&, vertex_index_t> >; typename graph_traits<Graph>::vertex_descriptor = void*]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dominator_tree.hpp:360:35: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename graph_traits<Graph>::vertex_descriptor&, DomTreePredMap) [with Graph = adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >; DomTreePredMap = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, int&, vertex_index_t> >; typename graph_traits<Graph>::vertex_descriptor = void*]’
360 | lengauer_tarjan_dominator_tree(g, entry, indexMap, dfnumMap, parentMap,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
361 | verticesByDFNum, domTreePredMap);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
dominatorTree.cpp:46:36: required from here
46 | lengauer_tarjan_dominator_tree(g, vertex(v, g), domTreePredMap);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/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::bidirectional_tag, void*> >]’
20 | ~usage_requirements() { ((Model*)0)->~Model(); }
| ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/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::bidirectional_tag, void*> >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:90:9: required from ‘boost::concepts::IncidenceGraph<G>::~IncidenceGraph() [with G = boost::adjacency_list<boost::vecS, boost::listS, boost::bidirectionalS, boost::property<boost::vertex_index_t, int> >]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: required from ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::concepts::IncidenceGraph<boost::adjacency_list<boost::vecS, boost::listS, boost::bidirectionalS, boost::property<boost::vertex_index_t, int> > >]’
20 | ~usage_requirements() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/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::bidirectionalS, boost::property<boost::vertex_index_t, int> > > >]’
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:87:5: required from ‘struct boost::concepts::IncidenceGraph<boost::adjacency_list<boost::vecS, boost::listS, boost::bidirectionalS, boost::property<boost::vertex_index_t, int> > >’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:118:1: required from ‘struct boost::concepts::BidirectionalGraph<boost::adjacency_list<boost::vecS, boost::listS, boost::bidirectionalS, boost::property<boost::vertex_index_t, int> > >’
118 | BOOST_concept(BidirectionalGraph, (G)) : IncidenceGraph< G >
| ^~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:118:1: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied<boost::concepts::BidirectionalGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::bidirectionalS, boost::property<boost::vertex_index_t, int> > > >::value’
44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied<boost::concepts::BidirectionalGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::bidirectionalS, boost::property<boost::vertex_index_t, int> > > >’
45 | typedef boost::integral_constant<bool, value> type;
| ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_<void (*)(boost::concepts::BidirectionalGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::bidirectionalS, boost::property<boost::vertex_index_t, int> > >)>’
72 | struct requirement_<void(*)(Model)>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dominator_tree.hpp:245:5: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename graph_traits<Graph>::vertex_descriptor&, const IndexMap&, TimeMap, PredMap, VertexVector&, DomTreePredMap) [with Graph = adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >; IndexMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; TimeMap = iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>, long unsigned int, long unsigned int&>; PredMap = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>, void*, void*&>; VertexVector = std::vector<void*>; DomTreePredMap = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, int&, vertex_index_t> >; typename graph_traits<Graph>::vertex_descriptor = void*]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dominator_tree.hpp:360:35: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename graph_traits<Graph>::vertex_descriptor&, DomTreePredMap) [with Graph = adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >; DomTreePredMap = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, int&, vertex_index_t> >; typename graph_traits<Graph>::vertex_descriptor = void*]’
360 | lengauer_tarjan_dominator_tree(g, entry, indexMap, dfnumMap, parentMap,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
361 | verticesByDFNum, domTreePredMap);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
dominatorTree.cpp:46:36: required from here
46 | lengauer_tarjan_dominator_tree(g, vertex(v, g), domTreePredMap);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/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::bidirectional_tag, void*>]’
37 | ~model()
| ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:137:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
137 | BOOST_CONCEPT_USAGE(DefaultConstructible) {
| ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/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::bidirectional_tag, void*> > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable<boost::detail::edge_desc_impl<boost::bidirectional_tag, void*> >’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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::bidirectional_tag, void*> >]’
32 | inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
| ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/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::bidirectional_tag, void*> > >::value’
44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/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::bidirectional_tag, void*> > >’
45 | typedef boost::integral_constant<bool, value> type;
| ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_<void (*)(boost::EqualityComparable<boost::detail::edge_desc_impl<boost::bidirectional_tag, void*> >)>’
72 | struct requirement_<void(*)(Model)>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:91:9: [ skipping 7 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied<boost::concepts::BidirectionalGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::bidirectionalS, boost::property<boost::vertex_index_t, int> > > >::value’
44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied<boost::concepts::BidirectionalGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::bidirectionalS, boost::property<boost::vertex_index_t, int> > > >’
45 | typedef boost::integral_constant<bool, value> type;
| ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_<void (*)(boost::concepts::BidirectionalGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::bidirectionalS, boost::property<boost::vertex_index_t, int> > >)>’
72 | struct requirement_<void(*)(Model)>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dominator_tree.hpp:245:5: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename graph_traits<Graph>::vertex_descriptor&, const IndexMap&, TimeMap, PredMap, VertexVector&, DomTreePredMap) [with Graph = adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >; IndexMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; TimeMap = iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>, long unsigned int, long unsigned int&>; PredMap = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>, void*, void*&>; VertexVector = std::vector<void*>; DomTreePredMap = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, int&, vertex_index_t> >; typename graph_traits<Graph>::vertex_descriptor = void*]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dominator_tree.hpp:360:35: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename graph_traits<Graph>::vertex_descriptor&, DomTreePredMap) [with Graph = adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >; DomTreePredMap = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, int&, vertex_index_t> >; typename graph_traits<Graph>::vertex_descriptor = void*]’
360 | lengauer_tarjan_dominator_tree(g, entry, indexMap, dfnumMap, parentMap,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
361 | verticesByDFNum, domTreePredMap);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
dominatorTree.cpp:46:36: required from here
46 | lengauer_tarjan_dominator_tree(g, vertex(v, g), domTreePredMap);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/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::bidirectional_tag, void*> >]’
20 | ~usage_requirements() { ((Model*)0)->~Model(); }
| ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/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::bidirectional_tag, void*> >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:91:9: required from ‘boost::concepts::IncidenceGraph<G>::~IncidenceGraph() [with G = boost::adjacency_list<boost::vecS, boost::listS, boost::bidirectionalS, boost::property<boost::vertex_index_t, int> >]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: required from ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::concepts::IncidenceGraph<boost::adjacency_list<boost::vecS, boost::listS, boost::bidirectionalS, boost::property<boost::vertex_index_t, int> > >]’
20 | ~usage_requirements() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/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::bidirectionalS, boost::property<boost::vertex_index_t, int> > > >]’
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:87:5: required from ‘struct boost::concepts::IncidenceGraph<boost::adjacency_list<boost::vecS, boost::listS, boost::bidirectionalS, boost::property<boost::vertex_index_t, int> > >’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:118:1: required from ‘struct boost::concepts::BidirectionalGraph<boost::adjacency_list<boost::vecS, boost::listS, boost::bidirectionalS, boost::property<boost::vertex_index_t, int> > >’
118 | BOOST_concept(BidirectionalGraph, (G)) : IncidenceGraph< G >
| ^~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:118:1: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied<boost::concepts::BidirectionalGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::bidirectionalS, boost::property<boost::vertex_index_t, int> > > >::value’
44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied<boost::concepts::BidirectionalGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::bidirectionalS, boost::property<boost::vertex_index_t, int> > > >’
45 | typedef boost::integral_constant<bool, value> type;
| ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_<void (*)(boost::concepts::BidirectionalGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::bidirectionalS, boost::property<boost::vertex_index_t, int> > >)>’
72 | struct requirement_<void(*)(Model)>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dominator_tree.hpp:245:5: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename graph_traits<Graph>::vertex_descriptor&, const IndexMap&, TimeMap, PredMap, VertexVector&, DomTreePredMap) [with Graph = adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >; IndexMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; TimeMap = iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>, long unsigned int, long unsigned int&>; PredMap = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>, void*, void*&>; VertexVector = std::vector<void*>; DomTreePredMap = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, int&, vertex_index_t> >; typename graph_traits<Graph>::vertex_descriptor = void*]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dominator_tree.hpp:360:35: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename graph_traits<Graph>::vertex_descriptor&, DomTreePredMap) [with Graph = adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >; DomTreePredMap = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, int&, vertex_index_t> >; typename graph_traits<Graph>::vertex_descriptor = void*]’
360 | lengauer_tarjan_dominator_tree(g, entry, indexMap, dfnumMap, parentMap,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
361 | verticesByDFNum, domTreePredMap);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
dominatorTree.cpp:46:36: required from here
46 | lengauer_tarjan_dominator_tree(g, vertex(v, g), domTreePredMap);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/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::bidirectional_tag, void*>]’
37 | ~model()
| ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:233:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
233 | BOOST_CONCEPT_USAGE(EqualityComparable) {
| ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/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::bidirectional_tag, void*> > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:145:5: required from ‘struct boost::Assignable<boost::detail::edge_desc_impl<boost::bidirectional_tag, void*> >’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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::bidirectional_tag, void*> >]’
32 | inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
| ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/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::bidirectional_tag, void*> > >::value’
44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/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::bidirectional_tag, void*> > >’
45 | typedef boost::integral_constant<bool, value> type;
| ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_<void (*)(boost::Assignable<boost::detail::edge_desc_impl<boost::bidirectional_tag, void*> >)>’
72 | struct requirement_<void(*)(Model)>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:92:9: [ skipping 7 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied<boost::concepts::BidirectionalGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::bidirectionalS, boost::property<boost::vertex_index_t, int> > > >::value’
44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied<boost::concepts::BidirectionalGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::bidirectionalS, boost::property<boost::vertex_index_t, int> > > >’
45 | typedef boost::integral_constant<bool, value> type;
| ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_<void (*)(boost::concepts::BidirectionalGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::bidirectionalS, boost::property<boost::vertex_index_t, int> > >)>’
72 | struct requirement_<void(*)(Model)>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dominator_tree.hpp:245:5: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename graph_traits<Graph>::vertex_descriptor&, const IndexMap&, TimeMap, PredMap, VertexVector&, DomTreePredMap) [with Graph = adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >; IndexMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; TimeMap = iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>, long unsigned int, long unsigned int&>; PredMap = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>, void*, void*&>; VertexVector = std::vector<void*>; DomTreePredMap = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, int&, vertex_index_t> >; typename graph_traits<Graph>::vertex_descriptor = void*]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dominator_tree.hpp:360:35: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename graph_traits<Graph>::vertex_descriptor&, DomTreePredMap) [with Graph = adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >; DomTreePredMap = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, int&, vertex_index_t> >; typename graph_traits<Graph>::vertex_descriptor = void*]’
360 | lengauer_tarjan_dominator_tree(g, entry, indexMap, dfnumMap, parentMap,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
361 | verticesByDFNum, domTreePredMap);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
dominatorTree.cpp:46:36: required from here
46 | lengauer_tarjan_dominator_tree(g, vertex(v, g), domTreePredMap);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/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::bidirectional_tag, void*> >]’
20 | ~usage_requirements() { ((Model*)0)->~Model(); }
| ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/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::bidirectional_tag, void*> >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:92:9: required from ‘boost::concepts::IncidenceGraph<G>::~IncidenceGraph() [with G = boost::adjacency_list<boost::vecS, boost::listS, boost::bidirectionalS, boost::property<boost::vertex_index_t, int> >]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: required from ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::concepts::IncidenceGraph<boost::adjacency_list<boost::vecS, boost::listS, boost::bidirectionalS, boost::property<boost::vertex_index_t, int> > >]’
20 | ~usage_requirements() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/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::bidirectionalS, boost::property<boost::vertex_index_t, int> > > >]’
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:87:5: required from ‘struct boost::concepts::IncidenceGraph<boost::adjacency_list<boost::vecS, boost::listS, boost::bidirectionalS, boost::property<boost::vertex_index_t, int> > >’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:118:1: required from ‘struct boost::concepts::BidirectionalGraph<boost::adjacency_list<boost::vecS, boost::listS, boost::bidirectionalS, boost::property<boost::vertex_index_t, int> > >’
118 | BOOST_concept(BidirectionalGraph, (G)) : IncidenceGraph< G >
| ^~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:118:1: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied<boost::concepts::BidirectionalGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::bidirectionalS, boost::property<boost::vertex_index_t, int> > > >::value’
44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied<boost::concepts::BidirectionalGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::bidirectionalS, boost::property<boost::vertex_index_t, int> > > >’
45 | typedef boost::integral_constant<bool, value> type;
| ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_<void (*)(boost::concepts::BidirectionalGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::bidirectionalS, boost::property<boost::vertex_index_t, int> > >)>’
72 | struct requirement_<void(*)(Model)>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dominator_tree.hpp:245:5: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename graph_traits<Graph>::vertex_descriptor&, const IndexMap&, TimeMap, PredMap, VertexVector&, DomTreePredMap) [with Graph = adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >; IndexMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; TimeMap = iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>, long unsigned int, long unsigned int&>; PredMap = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>, void*, void*&>; VertexVector = std::vector<void*>; DomTreePredMap = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, int&, vertex_index_t> >; typename graph_traits<Graph>::vertex_descriptor = void*]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dominator_tree.hpp:360:35: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename graph_traits<Graph>::vertex_descriptor&, DomTreePredMap) [with Graph = adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >; DomTreePredMap = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, int&, vertex_index_t> >; typename graph_traits<Graph>::vertex_descriptor = void*]’
360 | lengauer_tarjan_dominator_tree(g, entry, indexMap, dfnumMap, parentMap,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
361 | verticesByDFNum, domTreePredMap);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
dominatorTree.cpp:46:36: required from here
46 | lengauer_tarjan_dominator_tree(g, vertex(v, g), domTreePredMap);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/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::bidirectional_tag, void*>]’
37 | ~model()
| ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:145:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
145 | BOOST_CONCEPT_USAGE(Assignable) {
| ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/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::bidir_adj_list_traversal_tag, boost::incidence_graph_tag> >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible<boost::bidir_adj_list_traversal_tag, boost::incidence_graph_tag>’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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::bidir_adj_list_traversal_tag, boost::incidence_graph_tag>]’
32 | inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
| ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied<boost::Convertible<boost::bidir_adj_list_traversal_tag, boost::incidence_graph_tag> >::value’
44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied<boost::Convertible<boost::bidir_adj_list_traversal_tag, boost::incidence_graph_tag> >’
45 | typedef boost::integral_constant<bool, value> type;
| ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_<void (*)(boost::Convertible<boost::bidir_adj_list_traversal_tag, boost::incidence_graph_tag>)>’
72 | struct requirement_<void(*)(Model)>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:93:9: [ skipping 7 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied<boost::concepts::BidirectionalGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::bidirectionalS, boost::property<boost::vertex_index_t, int> > > >::value’
44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied<boost::concepts::BidirectionalGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::bidirectionalS, boost::property<boost::vertex_index_t, int> > > >’
45 | typedef boost::integral_constant<bool, value> type;
| ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_<void (*)(boost::concepts::BidirectionalGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::bidirectionalS, boost::property<boost::vertex_index_t, int> > >)>’
72 | struct requirement_<void(*)(Model)>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dominator_tree.hpp:245:5: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename graph_traits<Graph>::vertex_descriptor&, const IndexMap&, TimeMap, PredMap, VertexVector&, DomTreePredMap) [with Graph = adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >; IndexMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; TimeMap = iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>, long unsigned int, long unsigned int&>; PredMap = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>, void*, void*&>; VertexVector = std::vector<void*>; DomTreePredMap = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, int&, vertex_index_t> >; typename graph_traits<Graph>::vertex_descriptor = void*]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dominator_tree.hpp:360:35: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename graph_traits<Graph>::vertex_descriptor&, DomTreePredMap) [with Graph = adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >; DomTreePredMap = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, int&, vertex_index_t> >; typename graph_traits<Graph>::vertex_descriptor = void*]’
360 | lengauer_tarjan_dominator_tree(g, entry, indexMap, dfnumMap, parentMap,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
361 | verticesByDFNum, domTreePredMap);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
dominatorTree.cpp:46:36: required from here
46 | lengauer_tarjan_dominator_tree(g, vertex(v, g), domTreePredMap);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/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::bidir_adj_list_traversal_tag, boost::incidence_graph_tag>]’
20 | ~usage_requirements() { ((Model*)0)->~Model(); }
| ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/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::bidir_adj_list_traversal_tag, boost::incidence_graph_tag>]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/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::bidirectionalS, boost::property<boost::vertex_index_t, int> >]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: required from ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::concepts::IncidenceGraph<boost::adjacency_list<boost::vecS, boost::listS, boost::bidirectionalS, boost::property<boost::vertex_index_t, int> > >]’
20 | ~usage_requirements() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/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::bidirectionalS, boost::property<boost::vertex_index_t, int> > > >]’
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:87:5: required from ‘struct boost::concepts::IncidenceGraph<boost::adjacency_list<boost::vecS, boost::listS, boost::bidirectionalS, boost::property<boost::vertex_index_t, int> > >’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:118:1: required from ‘struct boost::concepts::BidirectionalGraph<boost::adjacency_list<boost::vecS, boost::listS, boost::bidirectionalS, boost::property<boost::vertex_index_t, int> > >’
118 | BOOST_concept(BidirectionalGraph, (G)) : IncidenceGraph< G >
| ^~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:118:1: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied<boost::concepts::BidirectionalGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::bidirectionalS, boost::property<boost::vertex_index_t, int> > > >::value’
44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied<boost::concepts::BidirectionalGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::bidirectionalS, boost::property<boost::vertex_index_t, int> > > >’
45 | typedef boost::integral_constant<bool, value> type;
| ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_<void (*)(boost::concepts::BidirectionalGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::bidirectionalS, boost::property<boost::vertex_index_t, int> > >)>’
72 | struct requirement_<void(*)(Model)>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dominator_tree.hpp:245:5: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename graph_traits<Graph>::vertex_descriptor&, const IndexMap&, TimeMap, PredMap, VertexVector&, DomTreePredMap) [with Graph = adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >; IndexMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; TimeMap = iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>, long unsigned int, long unsigned int&>; PredMap = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>, void*, void*&>; VertexVector = std::vector<void*>; DomTreePredMap = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, int&, vertex_index_t> >; typename graph_traits<Graph>::vertex_descriptor = void*]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dominator_tree.hpp:360:35: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename graph_traits<Graph>::vertex_descriptor&, DomTreePredMap) [with Graph = adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >; DomTreePredMap = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, int&, vertex_index_t> >; typename graph_traits<Graph>::vertex_descriptor = void*]’
360 | lengauer_tarjan_dominator_tree(g, entry, indexMap, dfnumMap, parentMap,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
361 | verticesByDFNum, domTreePredMap);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
dominatorTree.cpp:46:36: required from here
46 | lengauer_tarjan_dominator_tree(g, vertex(v, g), domTreePredMap);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/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::bidir_adj_list_traversal_tag; Y = boost::incidence_graph_tag]’
37 | ~model()
| ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
208 | BOOST_CONCEPT_USAGE(Convertible) {
| ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::concepts::MultiPassInputIterator<boost::detail::in_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property>*, std::vector<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property>, std::allocator<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl<boost::bidirectional_tag, void*>, long int> >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/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::in_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property>*, std::vector<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property>, std::allocator<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl<boost::bidirectional_tag, void*>, long int> > >]’
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:52:50: required from ‘struct boost::concepts::MultiPassInputIterator<boost::detail::in_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property>*, std::vector<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property>, std::allocator<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl<boost::bidirectional_tag, void*>, long int> >’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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::in_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property>*, std::vector<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property>, std::allocator<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl<boost::bidirectional_tag, void*>, long int> >]’
32 | inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
| ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied<boost::concepts::MultiPassInputIterator<boost::detail::in_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property>*, std::vector<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property>, std::allocator<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl<boost::bidirectional_tag, void*>, long int> > >::value’
44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied<boost::concepts::MultiPassInputIterator<boost::detail::in_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property>*, std::vector<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property>, std::allocator<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl<boost::bidirectional_tag, void*>, long int> > >’
45 | typedef boost::integral_constant<bool, value> type;
| ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_<void (*)(boost::concepts::MultiPassInputIterator<boost::detail::in_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property>*, std::vector<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property>, std::allocator<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl<boost::bidirectional_tag, void*>, long int> >)>’
72 | struct requirement_<void(*)(Model)>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:125:9: required from ‘boost::concepts::BidirectionalGraph<G>::~BidirectionalGraph() [with G = boost::adjacency_list<boost::vecS, boost::listS, boost::bidirectionalS, boost::property<boost::vertex_index_t, int> >]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:118:1: required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::BidirectionalGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::bidirectionalS, boost::property<boost::vertex_index_t, int> > >]’
118 | BOOST_concept(BidirectionalGraph, (G)) : IncidenceGraph< G >
| ^~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dominator_tree.hpp:245:5: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename graph_traits<Graph>::vertex_descriptor&, const IndexMap&, TimeMap, PredMap, VertexVector&, DomTreePredMap) [with Graph = adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >; IndexMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; TimeMap = iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>, long unsigned int, long unsigned int&>; PredMap = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>, void*, void*&>; VertexVector = std::vector<void*>; DomTreePredMap = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, int&, vertex_index_t> >; typename graph_traits<Graph>::vertex_descriptor = void*]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dominator_tree.hpp:360:35: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename graph_traits<Graph>::vertex_descriptor&, DomTreePredMap) [with Graph = adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >; DomTreePredMap = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, int&, vertex_index_t> >; typename graph_traits<Graph>::vertex_descriptor = void*]’
360 | lengauer_tarjan_dominator_tree(g, entry, indexMap, dfnumMap, parentMap,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
361 | verticesByDFNum, domTreePredMap);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
dominatorTree.cpp:46:36: required from here
46 | lengauer_tarjan_dominator_tree(g, vertex(v, g), domTreePredMap);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
20 | ~usage_requirements() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/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::in_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property>*, std::vector<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property>, std::allocator<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl<boost::bidirectional_tag, void*>, long int>]’
37 | ~model()
| ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:52:50: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
52 | BOOST_concept(MultiPassInputIterator, (T)) { BOOST_CONCEPT_USAGE(
| ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Convertible<boost::bidir_adj_list_traversal_tag, boost::bidirectional_graph_tag>]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/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::bidir_adj_list_traversal_tag, boost::bidirectional_graph_tag> >]’
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible<boost::bidir_adj_list_traversal_tag, boost::bidirectional_graph_tag>’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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::bidir_adj_list_traversal_tag, boost::bidirectional_graph_tag>]’
32 | inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
| ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied<boost::Convertible<boost::bidir_adj_list_traversal_tag, boost::bidirectional_graph_tag> >::value’
44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied<boost::Convertible<boost::bidir_adj_list_traversal_tag, boost::bidirectional_graph_tag> >’
45 | typedef boost::integral_constant<bool, value> type;
| ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_<void (*)(boost::Convertible<boost::bidir_adj_list_traversal_tag, boost::bidirectional_graph_tag>)>’
72 | struct requirement_<void(*)(Model)>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:126:9: required from ‘boost::concepts::BidirectionalGraph<G>::~BidirectionalGraph() [with G = boost::adjacency_list<boost::vecS, boost::listS, boost::bidirectionalS, boost::property<boost::vertex_index_t, int> >]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:118:1: required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::BidirectionalGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::bidirectionalS, boost::property<boost::vertex_index_t, int> > >]’
118 | BOOST_concept(BidirectionalGraph, (G)) : IncidenceGraph< G >
| ^~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dominator_tree.hpp:245:5: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename graph_traits<Graph>::vertex_descriptor&, const IndexMap&, TimeMap, PredMap, VertexVector&, DomTreePredMap) [with Graph = adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >; IndexMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; TimeMap = iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>, long unsigned int, long unsigned int&>; PredMap = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>, void*, void*&>; VertexVector = std::vector<void*>; DomTreePredMap = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, int&, vertex_index_t> >; typename graph_traits<Graph>::vertex_descriptor = void*]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dominator_tree.hpp:360:35: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename graph_traits<Graph>::vertex_descriptor&, DomTreePredMap) [with Graph = adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >; DomTreePredMap = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, int&, vertex_index_t> >; typename graph_traits<Graph>::vertex_descriptor = void*]’
360 | lengauer_tarjan_dominator_tree(g, entry, indexMap, dfnumMap, parentMap,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
361 | verticesByDFNum, domTreePredMap);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
dominatorTree.cpp:46:36: required from here
46 | lengauer_tarjan_dominator_tree(g, vertex(v, g), domTreePredMap);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
20 | ~usage_requirements() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/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::bidir_adj_list_traversal_tag; Y = boost::bidirectional_graph_tag]’
37 | ~model()
| ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
208 | BOOST_CONCEPT_USAGE(Convertible) {
| ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/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::dfs_visitor<std::pair<boost::predecessor_recorder<boost::iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::bidirectionalS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t>, void*, void*&>, boost::on_tree_edge>, boost::detail::time_stamper_with_vertex_vector<boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::bidirectionalS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t>, long unsigned int, long unsigned int&>, std::vector<void*>, long unsigned int, boost::on_discover_vertex> > > > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:167:5: required from ‘struct boost::CopyConstructible<boost::dfs_visitor<std::pair<boost::predecessor_recorder<boost::iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::bidirectionalS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t>, void*, void*&>, boost::on_tree_edge>, boost::detail::time_stamper_with_vertex_vector<boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::bidirectionalS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t>, long unsigned int, long unsigned int&>, std::vector<void*>, long unsigned int, boost::on_discover_vertex> > > >’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:165:3: required from ‘struct boost::CopyConstructibleConcept<boost::dfs_visitor<std::pair<boost::predecessor_recorder<boost::iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::bidirectionalS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t>, void*, void*&>, boost::on_tree_edge>, boost::detail::time_stamper_with_vertex_vector<boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::bidirectionalS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t>, long unsigned int, long unsigned int&>, std::vector<void*>, long unsigned int, boost::on_discover_vertex> > > >’
165 | BOOST_concept(CopyConstructible,(TT))
| ^~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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::dfs_visitor<std::pair<boost::predecessor_recorder<boost::iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::bidirectionalS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t>, void*, void*&>, boost::on_tree_edge>, boost::detail::time_stamper_with_vertex_vector<boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::bidirectionalS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t>, long unsigned int, long unsigned int&>, std::vector<void*>, long unsigned int, boost::on_discover_vertex> > > >]’
32 | inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
| ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied<boost::CopyConstructibleConcept<boost::dfs_visitor<std::pair<boost::predecessor_recorder<boost::iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::bidirectionalS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t>, void*, void*&>, boost::on_tree_edge>, boost::detail::time_stamper_with_vertex_vector<boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::bidirectionalS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t>, long unsigned int, long unsigned int&>, std::vector<void*>, long unsigned int, boost::on_discover_vertex> > > > >::value’
44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied<boost::CopyConstructibleConcept<boost::dfs_visitor<std::pair<boost::predecessor_recorder<boost::iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::bidirectionalS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t>, void*, void*&>, boost::on_tree_edge>, boost::detail::time_stamper_with_vertex_vector<boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::bidirectionalS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t>, long unsigned int, long unsigned int&>, std::vector<void*>, long unsigned int, boost::on_discover_vertex> > > > >’
45 | typedef boost::integral_constant<bool, value> type;
| ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_<void (*)(boost::DFSVisitorConcept<boost::dfs_visitor<std::pair<boost::predecessor_recorder<boost::iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::bidirectionalS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t>, void*, void*&>, boost::on_tree_edge>, boost::detail::time_stamper_with_vertex_vector<boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::bidirectionalS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t>, long unsigned int, long unsigned int&>, std::vector<void*>, long unsigned int, boost::on_discover_vertex> > >, boost::adjacency_list<boost::vecS, boost::listS, boost::bidirectionalS, boost::property<boost::vertex_index_t, int> > >)>’
72 | struct requirement_<void(*)(Model)>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:130:9: required from ‘void boost::detail::depth_first_visit_impl(const IncidenceGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, DFSVisitor&, ColorMap, TerminatorFunc) [with IncidenceGraph = boost::adjacency_list<boost::vecS, boost::listS, boost::bidirectionalS, boost::property<boost::vertex_index_t, int> >; DFSVisitor = boost::dfs_visitor<std::pair<boost::predecessor_recorder<boost::iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::bidirectionalS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t>, void*, void*&>, boost::on_tree_edge>, time_stamper_with_vertex_vector<boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::bidirectionalS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t>, long unsigned int, long unsigned int&>, std::vector<void*>, long unsigned int, boost::on_discover_vertex> > >; ColorMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::bidirectionalS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t>, boost::default_color_type, boost::default_color_type&>; TerminatorFunc = nontruth2; typename boost::graph_traits<Graph>::vertex_descriptor = void*]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:417:35: required from ‘void boost::depth_first_visit(const IncidenceGraph&, typename graph_traits<Graph>::vertex_descriptor, DFSVisitor, ColorMap) [with IncidenceGraph = adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >; DFSVisitor = dfs_visitor<std::pair<predecessor_recorder<iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>, void*, void*&>, on_tree_edge>, detail::time_stamper_with_vertex_vector<iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>, long unsigned int, long unsigned int&>, std::vector<void*>, long unsigned int, on_discover_vertex> > >; ColorMap = iterator_property_map<__gnu_cxx::__normal_iterator<default_color_type*, std::vector<default_color_type> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>, default_color_type, default_color_type&>; typename graph_traits<Graph>::vertex_descriptor = void*]’
417 | detail::depth_first_visit_impl(g, u, vis, color, detail::nontruth2());
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dominator_tree.hpp:309:22: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename graph_traits<Graph>::vertex_descriptor&, const IndexMap&, TimeMap, PredMap, VertexVector&, DomTreePredMap) [with Graph = adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >; IndexMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; TimeMap = iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>, long unsigned int, long unsigned int&>; PredMap = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>, void*, void*&>; VertexVector = std::vector<void*>; DomTreePredMap = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, int&, vertex_index_t> >; typename graph_traits<Graph>::vertex_descriptor = void*]’
309 | depth_first_visit(g, entry,
| ~~~~~~~~~~~~~~~~~^~~~~~~~~~
310 | make_dfs_visitor(
| ~~~~~~~~~~~~~~~~~
311 | make_pair(record_predecessors(parentMap, on_tree_edge()),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
312 | detail::stamp_times_with_vertex_vector(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
313 | dfnumMap, verticesByDFNum, time, on_discover_vertex()))),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
314 | make_iterator_property_map(colors.begin(), indexMap));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dominator_tree.hpp:360:35: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename graph_traits<Graph>::vertex_descriptor&, DomTreePredMap) [with Graph = adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >; DomTreePredMap = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, int&, vertex_index_t> >; typename graph_traits<Graph>::vertex_descriptor = void*]’
360 | lengauer_tarjan_dominator_tree(g, entry, indexMap, dfnumMap, parentMap,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
361 | verticesByDFNum, domTreePredMap);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
dominatorTree.cpp:46:36: required from here
46 | lengauer_tarjan_dominator_tree(g, vertex(v, g), domTreePredMap);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/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::dfs_visitor<std::pair<boost::predecessor_recorder<boost::iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::bidirectionalS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t>, void*, void*&>, boost::on_tree_edge>, boost::detail::time_stamper_with_vertex_vector<boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::bidirectionalS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t>, long unsigned int, long unsigned int&>, std::vector<void*>, long unsigned int, boost::on_discover_vertex> > > >]’
20 | ~usage_requirements() { ((Model*)0)->~Model(); }
| ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/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::dfs_visitor<std::pair<boost::predecessor_recorder<boost::iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::bidirectionalS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t>, void*, void*&>, boost::on_tree_edge>, boost::detail::time_stamper_with_vertex_vector<boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::bidirectionalS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t>, long unsigned int, long unsigned int&>, std::vector<void*>, long unsigned int, boost::on_discover_vertex> > > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:41:9: required from ‘void boost::DFSVisitorConcept<Visitor, Graph>::constraints() [with Visitor = boost::dfs_visitor<std::pair<boost::predecessor_recorder<boost::iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::bidirectionalS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t>, void*, void*&>, boost::on_tree_edge>, boost::detail::time_stamper_with_vertex_vector<boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::bidirectionalS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t>, long unsigned int, long unsigned int&>, std::vector<void*>, long unsigned int, boost::on_discover_vertex> > >; Graph = boost::adjacency_list<boost::vecS, boost::listS, boost::bidirectionalS, boost::property<boost::vertex_index_t, int> >]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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::dfs_visitor<std::pair<boost::predecessor_recorder<boost::iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::bidirectionalS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t>, void*, void*&>, boost::on_tree_edge>, boost::detail::time_stamper_with_vertex_vector<boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::bidirectionalS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t>, long unsigned int, long unsigned int&>, std::vector<void*>, long unsigned int, boost::on_discover_vertex> > >, boost::adjacency_list<boost::vecS, boost::listS, boost::bidirectionalS, boost::property<boost::vertex_index_t, int> > >]’
32 | inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
| ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied<boost::DFSVisitorConcept<boost::dfs_visitor<std::pair<boost::predecessor_recorder<boost::iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::bidirectionalS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t>, void*, void*&>, boost::on_tree_edge>, boost::detail::time_stamper_with_vertex_vector<boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::bidirectionalS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t>, long unsigned int, long unsigned int&>, std::vector<void*>, long unsigned int, boost::on_discover_vertex> > >, boost::adjacency_list<boost::vecS, boost::listS, boost::bidirectionalS, boost::property<boost::vertex_index_t, int> > > >::value’
44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied<boost::DFSVisitorConcept<boost::dfs_visitor<std::pair<boost::predecessor_recorder<boost::iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::bidirectionalS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t>, void*, void*&>, boost::on_tree_edge>, boost::detail::time_stamper_with_vertex_vector<boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::bidirectionalS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t>, long unsigned int, long unsigned int&>, std::vector<void*>, long unsigned int, boost::on_discover_vertex> > >, boost::adjacency_list<boost::vecS, boost::listS, boost::bidirectionalS, boost::property<boost::vertex_index_t, int> > > >’
45 | typedef boost::integral_constant<bool, value> type;
| ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_<void (*)(boost::DFSVisitorConcept<boost::dfs_visitor<std::pair<boost::predecessor_recorder<boost::iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::bidirectionalS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t>, void*, void*&>, boost::on_tree_edge>, boost::detail::time_stamper_with_vertex_vector<boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::bidirectionalS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t>, long unsigned int, long unsigned int&>, std::vector<void*>, long unsigned int, boost::on_discover_vertex> > >, boost::adjacency_list<boost::vecS, boost::listS, boost::bidirectionalS, boost::property<boost::vertex_index_t, int> > >)>’
72 | struct requirement_<void(*)(Model)>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:130:9: required from ‘void boost::detail::depth_first_visit_impl(const IncidenceGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, DFSVisitor&, ColorMap, TerminatorFunc) [with IncidenceGraph = boost::adjacency_list<boost::vecS, boost::listS, boost::bidirectionalS, boost::property<boost::vertex_index_t, int> >; DFSVisitor = boost::dfs_visitor<std::pair<boost::predecessor_recorder<boost::iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::bidirectionalS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t>, void*, void*&>, boost::on_tree_edge>, time_stamper_with_vertex_vector<boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::bidirectionalS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t>, long unsigned int, long unsigned int&>, std::vector<void*>, long unsigned int, boost::on_discover_vertex> > >; ColorMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::bidirectionalS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t>, boost::default_color_type, boost::default_color_type&>; TerminatorFunc = nontruth2; typename boost::graph_traits<Graph>::vertex_descriptor = void*]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:417:35: required from ‘void boost::depth_first_visit(const IncidenceGraph&, typename graph_traits<Graph>::vertex_descriptor, DFSVisitor, ColorMap) [with IncidenceGraph = adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >; DFSVisitor = dfs_visitor<std::pair<predecessor_recorder<iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>, void*, void*&>, on_tree_edge>, detail::time_stamper_with_vertex_vector<iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>, long unsigned int, long unsigned int&>, std::vector<void*>, long unsigned int, on_discover_vertex> > >; ColorMap = iterator_property_map<__gnu_cxx::__normal_iterator<default_color_type*, std::vector<default_color_type> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>, default_color_type, default_color_type&>; typename graph_traits<Graph>::vertex_descriptor = void*]’
417 | detail::depth_first_visit_impl(g, u, vis, color, detail::nontruth2());
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dominator_tree.hpp:309:22: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename graph_traits<Graph>::vertex_descriptor&, const IndexMap&, TimeMap, PredMap, VertexVector&, DomTreePredMap) [with Graph = adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >; IndexMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; TimeMap = iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>, long unsigned int, long unsigned int&>; PredMap = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>, void*, void*&>; VertexVector = std::vector<void*>; DomTreePredMap = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, int&, vertex_index_t> >; typename graph_traits<Graph>::vertex_descriptor = void*]’
309 | depth_first_visit(g, entry,
| ~~~~~~~~~~~~~~~~~^~~~~~~~~~
310 | make_dfs_visitor(
| ~~~~~~~~~~~~~~~~~
311 | make_pair(record_predecessors(parentMap, on_tree_edge()),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
312 | detail::stamp_times_with_vertex_vector(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
313 | dfnumMap, verticesByDFNum, time, on_discover_vertex()))),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
314 | make_iterator_property_map(colors.begin(), indexMap));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dominator_tree.hpp:360:35: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename graph_traits<Graph>::vertex_descriptor&, DomTreePredMap) [with Graph = adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >; DomTreePredMap = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, int&, vertex_index_t> >; typename graph_traits<Graph>::vertex_descriptor = void*]’
360 | lengauer_tarjan_dominator_tree(g, entry, indexMap, dfnumMap, parentMap,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
361 | verticesByDFNum, domTreePredMap);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
dominatorTree.cpp:46:36: required from here
46 | lengauer_tarjan_dominator_tree(g, vertex(v, g), domTreePredMap);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:165:17: note: in a call to non-static member function ‘boost::CopyConstructibleConcept<boost::dfs_visitor<std::pair<boost::predecessor_recorder<boost::iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::bidirectionalS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t>, void*, void*&>, boost::on_tree_edge>, boost::detail::time_stamper_with_vertex_vector<boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::bidirectionalS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t>, long unsigned int, long unsigned int&>, std::vector<void*>, long unsigned int, boost::on_discover_vertex> > > >::~CopyConstructibleConcept()’
165 | BOOST_concept(CopyConstructible,(TT))
| ^~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/preprocessor/cat.hpp:29:34: note: in definition of macro ‘BOOST_PP_CAT_I’
29 | # define BOOST_PP_CAT_I(a, b) a ## b
| ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/concept_def.hpp:23:12: note: in expansion of macro ‘BOOST_PP_CAT’
23 | struct BOOST_PP_CAT(name,Concept) \
| ^~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:165:3: note: in expansion of macro ‘BOOST_concept’
165 | BOOST_concept(CopyConstructible,(TT))
| ^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::constraint<Model>::failed() [with Model = boost::ReadablePropertyMapConcept<boost::iterator_property_map<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::bidirectionalS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t>, boost::default_color_type, boost::default_color_type&>, void*>]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:206:7: required from ‘void boost::ReadWritePropertyMapConcept<PMap, Key>::constraints() [with PMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::bidirectionalS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t>, boost::default_color_type, boost::default_color_type&>; Key = void*]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::ReadWritePropertyMapConcept<boost::iterator_property_map<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::bidirectionalS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t>, boost::default_color_type, boost::default_color_type&>, void*>]’
32 | inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
| ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied<boost::ReadWritePropertyMapConcept<boost::iterator_property_map<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::bidirectionalS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t>, boost::default_color_type, boost::default_color_type&>, void*> >::value’
44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied<boost::ReadWritePropertyMapConcept<boost::iterator_property_map<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::bidirectionalS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t>, boost::default_color_type, boost::default_color_type&>, void*> >’
45 | typedef boost::integral_constant<bool, value> type;
| ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_<void (*)(boost::ReadWritePropertyMapConcept<boost::iterator_property_map<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::bidirectionalS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t>, boost::default_color_type, boost::default_color_type&>, void*>)>’
72 | struct requirement_<void(*)(Model)>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:134:9: required from ‘void boost::detail::depth_first_visit_impl(const IncidenceGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, DFSVisitor&, ColorMap, TerminatorFunc) [with IncidenceGraph = boost::adjacency_list<boost::vecS, boost::listS, boost::bidirectionalS, boost::property<boost::vertex_index_t, int> >; DFSVisitor = boost::dfs_visitor<std::pair<boost::predecessor_recorder<boost::iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::bidirectionalS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t>, void*, void*&>, boost::on_tree_edge>, time_stamper_with_vertex_vector<boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::bidirectionalS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t>, long unsigned int, long unsigned int&>, std::vector<void*>, long unsigned int, boost::on_discover_vertex> > >; ColorMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::bidirectionalS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t>, boost::default_color_type, boost::default_color_type&>; TerminatorFunc = nontruth2; typename boost::graph_traits<Graph>::vertex_descriptor = void*]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:417:35: required from ‘void boost::depth_first_visit(const IncidenceGraph&, typename graph_traits<Graph>::vertex_descriptor, DFSVisitor, ColorMap) [with IncidenceGraph = adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >; DFSVisitor = dfs_visitor<std::pair<predecessor_recorder<iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>, void*, void*&>, on_tree_edge>, detail::time_stamper_with_vertex_vector<iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>, long unsigned int, long unsigned int&>, std::vector<void*>, long unsigned int, on_discover_vertex> > >; ColorMap = iterator_property_map<__gnu_cxx::__normal_iterator<default_color_type*, std::vector<default_color_type> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>, default_color_type, default_color_type&>; typename graph_traits<Graph>::vertex_descriptor = void*]’
417 | detail::depth_first_visit_impl(g, u, vis, color, detail::nontruth2());
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dominator_tree.hpp:309:22: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename graph_traits<Graph>::vertex_descriptor&, const IndexMap&, TimeMap, PredMap, VertexVector&, DomTreePredMap) [with Graph = adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >; IndexMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; TimeMap = iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>, long unsigned int, long unsigned int&>; PredMap = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>, void*, void*&>; VertexVector = std::vector<void*>; DomTreePredMap = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, int&, vertex_index_t> >; typename graph_traits<Graph>::vertex_descriptor = void*]’
309 | depth_first_visit(g, entry,
| ~~~~~~~~~~~~~~~~~^~~~~~~~~~
310 | make_dfs_visitor(
| ~~~~~~~~~~~~~~~~~
311 | make_pair(record_predecessors(parentMap, on_tree_edge()),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
312 | detail::stamp_times_with_vertex_vector(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
313 | dfnumMap, verticesByDFNum, time, on_discover_vertex()))),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
314 | make_iterator_property_map(colors.begin(), indexMap));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dominator_tree.hpp:360:35: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename graph_traits<Graph>::vertex_descriptor&, DomTreePredMap) [with Graph = adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >; DomTreePredMap = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, int&, vertex_index_t> >; typename graph_traits<Graph>::vertex_descriptor = void*]’
360 | lengauer_tarjan_dominator_tree(g, entry, indexMap, dfnumMap, parentMap,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
361 | verticesByDFNum, domTreePredMap);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
dominatorTree.cpp:46:36: required from here
46 | lengauer_tarjan_dominator_tree(g, vertex(v, g), domTreePredMap);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:65:52: warning: ‘this’ pointer is null [-Wnonnull]
65 | static void failed() { ((Model*)0)->constraints(); }
| ~~~~~~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:147:10: note: in a call to non-static member function ‘void boost::ReadablePropertyMapConcept<PMap, Key>::constraints() [with PMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::bidirectionalS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t>, boost::default_color_type, boost::default_color_type&>; Key = void*]’
147 | void constraints() {
| ^~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::constraint<Model>::failed() [with Model = boost::WritablePropertyMapConcept<boost::iterator_property_map<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::bidirectionalS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t>, boost::default_color_type, boost::default_color_type&>, void*>]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:207:7: required from ‘void boost::ReadWritePropertyMapConcept<PMap, Key>::constraints() [with PMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::bidirectionalS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t>, boost::default_color_type, boost::default_color_type&>; Key = void*]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::ReadWritePropertyMapConcept<boost::iterator_property_map<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::bidirectionalS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t>, boost::default_color_type, boost::default_color_type&>, void*>]’
32 | inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
| ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied<boost::ReadWritePropertyMapConcept<boost::iterator_property_map<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::bidirectionalS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t>, boost::default_color_type, boost::default_color_type&>, void*> >::value’
44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied<boost::ReadWritePropertyMapConcept<boost::iterator_property_map<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::bidirectionalS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t>, boost::default_color_type, boost::default_color_type&>, void*> >’
45 | typedef boost::integral_constant<bool, value> type;
| ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_<void (*)(boost::ReadWritePropertyMapConcept<boost::iterator_property_map<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::bidirectionalS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t>, boost::default_color_type, boost::default_color_type&>, void*>)>’
72 | struct requirement_<void(*)(Model)>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:134:9: required from ‘void boost::detail::depth_first_visit_impl(const IncidenceGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, DFSVisitor&, ColorMap, TerminatorFunc) [with IncidenceGraph = boost::adjacency_list<boost::vecS, boost::listS, boost::bidirectionalS, boost::property<boost::vertex_index_t, int> >; DFSVisitor = boost::dfs_visitor<std::pair<boost::predecessor_recorder<boost::iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::bidirectionalS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t>, void*, void*&>, boost::on_tree_edge>, time_stamper_with_vertex_vector<boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::bidirectionalS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t>, long unsigned int, long unsigned int&>, std::vector<void*>, long unsigned int, boost::on_discover_vertex> > >; ColorMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::bidirectionalS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t>, boost::default_color_type, boost::default_color_type&>; TerminatorFunc = nontruth2; typename boost::graph_traits<Graph>::vertex_descriptor = void*]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:417:35: required from ‘void boost::depth_first_visit(const IncidenceGraph&, typename graph_traits<Graph>::vertex_descriptor, DFSVisitor, ColorMap) [with IncidenceGraph = adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >; DFSVisitor = dfs_visitor<std::pair<predecessor_recorder<iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>, void*, void*&>, on_tree_edge>, detail::time_stamper_with_vertex_vector<iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>, long unsigned int, long unsigned int&>, std::vector<void*>, long unsigned int, on_discover_vertex> > >; ColorMap = iterator_property_map<__gnu_cxx::__normal_iterator<default_color_type*, std::vector<default_color_type> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>, default_color_type, default_color_type&>; typename graph_traits<Graph>::vertex_descriptor = void*]’
417 | detail::depth_first_visit_impl(g, u, vis, color, detail::nontruth2());
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dominator_tree.hpp:309:22: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename graph_traits<Graph>::vertex_descriptor&, const IndexMap&, TimeMap, PredMap, VertexVector&, DomTreePredMap) [with Graph = adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >; IndexMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; TimeMap = iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>, long unsigned int, long unsigned int&>; PredMap = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>, void*, void*&>; VertexVector = std::vector<void*>; DomTreePredMap = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, int&, vertex_index_t> >; typename graph_traits<Graph>::vertex_descriptor = void*]’
309 | depth_first_visit(g, entry,
| ~~~~~~~~~~~~~~~~~^~~~~~~~~~
310 | make_dfs_visitor(
| ~~~~~~~~~~~~~~~~~
311 | make_pair(record_predecessors(parentMap, on_tree_edge()),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
312 | detail::stamp_times_with_vertex_vector(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
313 | dfnumMap, verticesByDFNum, time, on_discover_vertex()))),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
314 | make_iterator_property_map(colors.begin(), indexMap));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dominator_tree.hpp:360:35: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename graph_traits<Graph>::vertex_descriptor&, DomTreePredMap) [with Graph = adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >; DomTreePredMap = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, int&, vertex_index_t> >; typename graph_traits<Graph>::vertex_descriptor = void*]’
360 | lengauer_tarjan_dominator_tree(g, entry, indexMap, dfnumMap, parentMap,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
361 | verticesByDFNum, domTreePredMap);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
dominatorTree.cpp:46:36: required from here
46 | lengauer_tarjan_dominator_tree(g, vertex(v, g), domTreePredMap);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:65:52: warning: ‘this’ pointer is null [-Wnonnull]
65 | static void failed() { ((Model*)0)->constraints(); }
| ~~~~~~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:179:10: note: in a call to non-static member function ‘void boost::WritablePropertyMapConcept<PMap, Key>::constraints() [with PMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::bidirectionalS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t>, boost::default_color_type, boost::default_color_type&>; Key = void*]’
179 | void constraints() {
| ^~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Convertible<boost::lvalue_property_map_tag, boost::read_write_property_map_tag> >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/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> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/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))
| ^~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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);
| ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/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) );
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/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;
| ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_<void (*)(boost::ReadWritePropertyMapConcept<boost::iterator_property_map<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::bidirectionalS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t>, boost::default_color_type, boost::default_color_type&>, void*>)>’
72 | struct requirement_<void(*)(Model)>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:134:9: required from ‘void boost::detail::depth_first_visit_impl(const IncidenceGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, DFSVisitor&, ColorMap, TerminatorFunc) [with IncidenceGraph = boost::adjacency_list<boost::vecS, boost::listS, boost::bidirectionalS, boost::property<boost::vertex_index_t, int> >; DFSVisitor = boost::dfs_visitor<std::pair<boost::predecessor_recorder<boost::iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::bidirectionalS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t>, void*, void*&>, boost::on_tree_edge>, time_stamper_with_vertex_vector<boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::bidirectionalS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t>, long unsigned int, long unsigned int&>, std::vector<void*>, long unsigned int, boost::on_discover_vertex> > >; ColorMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::bidirectionalS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t>, boost::default_color_type, boost::default_color_type&>; TerminatorFunc = nontruth2; typename boost::graph_traits<Graph>::vertex_descriptor = void*]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:417:35: required from ‘void boost::depth_first_visit(const IncidenceGraph&, typename graph_traits<Graph>::vertex_descriptor, DFSVisitor, ColorMap) [with IncidenceGraph = adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >; DFSVisitor = dfs_visitor<std::pair<predecessor_recorder<iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>, void*, void*&>, on_tree_edge>, detail::time_stamper_with_vertex_vector<iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>, long unsigned int, long unsigned int&>, std::vector<void*>, long unsigned int, on_discover_vertex> > >; ColorMap = iterator_property_map<__gnu_cxx::__normal_iterator<default_color_type*, std::vector<default_color_type> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>, default_color_type, default_color_type&>; typename graph_traits<Graph>::vertex_descriptor = void*]’
417 | detail::depth_first_visit_impl(g, u, vis, color, detail::nontruth2());
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dominator_tree.hpp:309:22: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename graph_traits<Graph>::vertex_descriptor&, const IndexMap&, TimeMap, PredMap, VertexVector&, DomTreePredMap) [with Graph = adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >; IndexMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; TimeMap = iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>, long unsigned int, long unsigned int&>; PredMap = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>, void*, void*&>; VertexVector = std::vector<void*>; DomTreePredMap = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, int&, vertex_index_t> >; typename graph_traits<Graph>::vertex_descriptor = void*]’
309 | depth_first_visit(g, entry,
| ~~~~~~~~~~~~~~~~~^~~~~~~~~~
310 | make_dfs_visitor(
| ~~~~~~~~~~~~~~~~~
311 | make_pair(record_predecessors(parentMap, on_tree_edge()),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
312 | detail::stamp_times_with_vertex_vector(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
313 | dfnumMap, verticesByDFNum, time, on_discover_vertex()))),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
314 | make_iterator_property_map(colors.begin(), indexMap));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dominator_tree.hpp:360:35: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename graph_traits<Graph>::vertex_descriptor&, DomTreePredMap) [with Graph = adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >; DomTreePredMap = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, int&, vertex_index_t> >; typename graph_traits<Graph>::vertex_descriptor = void*]’
360 | lengauer_tarjan_dominator_tree(g, entry, indexMap, dfnumMap, parentMap,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
361 | verticesByDFNum, domTreePredMap);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
dominatorTree.cpp:46:36: required from here
46 | lengauer_tarjan_dominator_tree(g, vertex(v, g), domTreePredMap);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Convertible<boost::lvalue_property_map_tag, boost::read_write_property_map_tag>]’
20 | ~usage_requirements() { ((Model*)0)->~Model(); }
| ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::ConvertibleConcept<boost::lvalue_property_map_tag, boost::read_write_property_map_tag>]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:208:7: required from ‘void boost::ReadWritePropertyMapConcept<PMap, Key>::constraints() [with PMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::bidirectionalS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t>, boost::default_color_type, boost::default_color_type&>; Key = void*]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::ReadWritePropertyMapConcept<boost::iterator_property_map<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::bidirectionalS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t>, boost::default_color_type, boost::default_color_type&>, void*>]’
32 | inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
| ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied<boost::ReadWritePropertyMapConcept<boost::iterator_property_map<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::bidirectionalS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t>, boost::default_color_type, boost::default_color_type&>, void*> >::value’
44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied<boost::ReadWritePropertyMapConcept<boost::iterator_property_map<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::bidirectionalS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t>, boost::default_color_type, boost::default_color_type&>, void*> >’
45 | typedef boost::integral_constant<bool, value> type;
| ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_<void (*)(boost::ReadWritePropertyMapConcept<boost::iterator_property_map<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::bidirectionalS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t>, boost::default_color_type, boost::default_color_type&>, void*>)>’
72 | struct requirement_<void(*)(Model)>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:134:9: required from ‘void boost::detail::depth_first_visit_impl(const IncidenceGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, DFSVisitor&, ColorMap, TerminatorFunc) [with IncidenceGraph = boost::adjacency_list<boost::vecS, boost::listS, boost::bidirectionalS, boost::property<boost::vertex_index_t, int> >; DFSVisitor = boost::dfs_visitor<std::pair<boost::predecessor_recorder<boost::iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::bidirectionalS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t>, void*, void*&>, boost::on_tree_edge>, time_stamper_with_vertex_vector<boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::bidirectionalS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t>, long unsigned int, long unsigned int&>, std::vector<void*>, long unsigned int, boost::on_discover_vertex> > >; ColorMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::bidirectionalS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t>, boost::default_color_type, boost::default_color_type&>; TerminatorFunc = nontruth2; typename boost::graph_traits<Graph>::vertex_descriptor = void*]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:417:35: required from ‘void boost::depth_first_visit(const IncidenceGraph&, typename graph_traits<Graph>::vertex_descriptor, DFSVisitor, ColorMap) [with IncidenceGraph = adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >; DFSVisitor = dfs_visitor<std::pair<predecessor_recorder<iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>, void*, void*&>, on_tree_edge>, detail::time_stamper_with_vertex_vector<iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>, long unsigned int, long unsigned int&>, std::vector<void*>, long unsigned int, on_discover_vertex> > >; ColorMap = iterator_property_map<__gnu_cxx::__normal_iterator<default_color_type*, std::vector<default_color_type> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>, default_color_type, default_color_type&>; typename graph_traits<Graph>::vertex_descriptor = void*]’
417 | detail::depth_first_visit_impl(g, u, vis, color, detail::nontruth2());
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dominator_tree.hpp:309:22: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename graph_traits<Graph>::vertex_descriptor&, const IndexMap&, TimeMap, PredMap, VertexVector&, DomTreePredMap) [with Graph = adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >; IndexMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; TimeMap = iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>, long unsigned int, long unsigned int&>; PredMap = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>, void*, void*&>; VertexVector = std::vector<void*>; DomTreePredMap = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, int&, vertex_index_t> >; typename graph_traits<Graph>::vertex_descriptor = void*]’
309 | depth_first_visit(g, entry,
| ~~~~~~~~~~~~~~~~~^~~~~~~~~~
310 | make_dfs_visitor(
| ~~~~~~~~~~~~~~~~~
311 | make_pair(record_predecessors(parentMap, on_tree_edge()),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
312 | detail::stamp_times_with_vertex_vector(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
313 | dfnumMap, verticesByDFNum, time, on_discover_vertex()))),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
314 | make_iterator_property_map(colors.begin(), indexMap));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dominator_tree.hpp:360:35: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename graph_traits<Graph>::vertex_descriptor&, DomTreePredMap) [with Graph = adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >; DomTreePredMap = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, int&, vertex_index_t> >; typename graph_traits<Graph>::vertex_descriptor = void*]’
360 | lengauer_tarjan_dominator_tree(g, entry, indexMap, dfnumMap, parentMap,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
361 | verticesByDFNum, domTreePredMap);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
dominatorTree.cpp:46:36: required from here
46 | lengauer_tarjan_dominator_tree(g, vertex(v, g), domTreePredMap);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:206:17: note: in a call to non-static member function ‘boost::ConvertibleConcept<boost::lvalue_property_map_tag, boost::read_write_property_map_tag>::~ConvertibleConcept()’
206 | BOOST_concept(Convertible,(X)(Y))
| ^~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/preprocessor/cat.hpp:29:34: note: in definition of macro ‘BOOST_PP_CAT_I’
29 | # define BOOST_PP_CAT_I(a, b) a ## b
| ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/concept_def.hpp:23:12: note: in expansion of macro ‘BOOST_PP_CAT’
23 | struct BOOST_PP_CAT(name,Concept) \
| ^~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:206:3: note: in expansion of macro ‘BOOST_concept’
206 | BOOST_concept(Convertible,(X)(Y))
| ^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::EqualityComparable<boost::default_color_type>]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/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(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable<boost::default_color_type>’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:502:1: required from ‘struct boost::concepts::ColorValue<boost::default_color_type>’
502 | BOOST_concept(ColorValue, (C))
| ^~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:502:1: required from ‘struct boost::concepts::ColorValueConcept<boost::default_color_type>’
502 | BOOST_concept(ColorValue, (C))
| ^~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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);
| ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_<void (*)(boost::concepts::ColorValueConcept<boost::default_color_type>)>’
72 | struct requirement_<void(*)(Model)>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:136:9: required from ‘void boost::detail::depth_first_visit_impl(const IncidenceGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, DFSVisitor&, ColorMap, TerminatorFunc) [with IncidenceGraph = boost::adjacency_list<boost::vecS, boost::listS, boost::bidirectionalS, boost::property<boost::vertex_index_t, int> >; DFSVisitor = boost::dfs_visitor<std::pair<boost::predecessor_recorder<boost::iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::bidirectionalS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t>, void*, void*&>, boost::on_tree_edge>, time_stamper_with_vertex_vector<boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::bidirectionalS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t>, long unsigned int, long unsigned int&>, std::vector<void*>, long unsigned int, boost::on_discover_vertex> > >; ColorMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::bidirectionalS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t>, boost::default_color_type, boost::default_color_type&>; TerminatorFunc = nontruth2; typename boost::graph_traits<Graph>::vertex_descriptor = void*]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:417:35: required from ‘void boost::depth_first_visit(const IncidenceGraph&, typename graph_traits<Graph>::vertex_descriptor, DFSVisitor, ColorMap) [with IncidenceGraph = adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >; DFSVisitor = dfs_visitor<std::pair<predecessor_recorder<iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>, void*, void*&>, on_tree_edge>, detail::time_stamper_with_vertex_vector<iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>, long unsigned int, long unsigned int&>, std::vector<void*>, long unsigned int, on_discover_vertex> > >; ColorMap = iterator_property_map<__gnu_cxx::__normal_iterator<default_color_type*, std::vector<default_color_type> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>, default_color_type, default_color_type&>; typename graph_traits<Graph>::vertex_descriptor = void*]’
417 | detail::depth_first_visit_impl(g, u, vis, color, detail::nontruth2());
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dominator_tree.hpp:309:22: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename graph_traits<Graph>::vertex_descriptor&, const IndexMap&, TimeMap, PredMap, VertexVector&, DomTreePredMap) [with Graph = adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >; IndexMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; TimeMap = iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>, long unsigned int, long unsigned int&>; PredMap = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>, void*, void*&>; VertexVector = std::vector<void*>; DomTreePredMap = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, int&, vertex_index_t> >; typename graph_traits<Graph>::vertex_descriptor = void*]’
309 | depth_first_visit(g, entry,
| ~~~~~~~~~~~~~~~~~^~~~~~~~~~
310 | make_dfs_visitor(
| ~~~~~~~~~~~~~~~~~
311 | make_pair(record_predecessors(parentMap, on_tree_edge()),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
312 | detail::stamp_times_with_vertex_vector(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
313 | dfnumMap, verticesByDFNum, time, on_discover_vertex()))),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
314 | make_iterator_property_map(colors.begin(), indexMap));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dominator_tree.hpp:360:35: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename graph_traits<Graph>::vertex_descriptor&, DomTreePredMap) [with Graph = adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >; DomTreePredMap = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, int&, vertex_index_t> >; typename graph_traits<Graph>::vertex_descriptor = void*]’
360 | lengauer_tarjan_dominator_tree(g, entry, indexMap, dfnumMap, parentMap,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
361 | verticesByDFNum, domTreePredMap);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
dominatorTree.cpp:46:36: required from here
46 | lengauer_tarjan_dominator_tree(g, vertex(v, g), domTreePredMap);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
20 | ~usage_requirements() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::EqualityComparable<TT>::~EqualityComparable() [with TT = boost::default_color_type]’
37 | ~model()
| ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:233:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
233 | BOOST_CONCEPT_USAGE(EqualityComparable) {
| ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::DefaultConstructible<boost::default_color_type>]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/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(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:137:5: required from ‘struct boost::DefaultConstructible<boost::default_color_type>’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:502:1: required from ‘struct boost::concepts::ColorValue<boost::default_color_type>’
502 | BOOST_concept(ColorValue, (C))
| ^~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:502:1: required from ‘struct boost::concepts::ColorValueConcept<boost::default_color_type>’
502 | BOOST_concept(ColorValue, (C))
| ^~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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);
| ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_<void (*)(boost::concepts::ColorValueConcept<boost::default_color_type>)>’
72 | struct requirement_<void(*)(Model)>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:136:9: required from ‘void boost::detail::depth_first_visit_impl(const IncidenceGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, DFSVisitor&, ColorMap, TerminatorFunc) [with IncidenceGraph = boost::adjacency_list<boost::vecS, boost::listS, boost::bidirectionalS, boost::property<boost::vertex_index_t, int> >; DFSVisitor = boost::dfs_visitor<std::pair<boost::predecessor_recorder<boost::iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::bidirectionalS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t>, void*, void*&>, boost::on_tree_edge>, time_stamper_with_vertex_vector<boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::bidirectionalS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t>, long unsigned int, long unsigned int&>, std::vector<void*>, long unsigned int, boost::on_discover_vertex> > >; ColorMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::bidirectionalS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t>, boost::default_color_type, boost::default_color_type&>; TerminatorFunc = nontruth2; typename boost::graph_traits<Graph>::vertex_descriptor = void*]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:417:35: required from ‘void boost::depth_first_visit(const IncidenceGraph&, typename graph_traits<Graph>::vertex_descriptor, DFSVisitor, ColorMap) [with IncidenceGraph = adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >; DFSVisitor = dfs_visitor<std::pair<predecessor_recorder<iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>, void*, void*&>, on_tree_edge>, detail::time_stamper_with_vertex_vector<iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>, long unsigned int, long unsigned int&>, std::vector<void*>, long unsigned int, on_discover_vertex> > >; ColorMap = iterator_property_map<__gnu_cxx::__normal_iterator<default_color_type*, std::vector<default_color_type> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>, default_color_type, default_color_type&>; typename graph_traits<Graph>::vertex_descriptor = void*]’
417 | detail::depth_first_visit_impl(g, u, vis, color, detail::nontruth2());
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dominator_tree.hpp:309:22: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename graph_traits<Graph>::vertex_descriptor&, const IndexMap&, TimeMap, PredMap, VertexVector&, DomTreePredMap) [with Graph = adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >; IndexMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; TimeMap = iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>, long unsigned int, long unsigned int&>; PredMap = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>, void*, void*&>; VertexVector = std::vector<void*>; DomTreePredMap = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, int&, vertex_index_t> >; typename graph_traits<Graph>::vertex_descriptor = void*]’
309 | depth_first_visit(g, entry,
| ~~~~~~~~~~~~~~~~~^~~~~~~~~~
310 | make_dfs_visitor(
| ~~~~~~~~~~~~~~~~~
311 | make_pair(record_predecessors(parentMap, on_tree_edge()),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
312 | detail::stamp_times_with_vertex_vector(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
313 | dfnumMap, verticesByDFNum, time, on_discover_vertex()))),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
314 | make_iterator_property_map(colors.begin(), indexMap));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dominator_tree.hpp:360:35: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename graph_traits<Graph>::vertex_descriptor&, DomTreePredMap) [with Graph = adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >; DomTreePredMap = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, int&, vertex_index_t> >; typename graph_traits<Graph>::vertex_descriptor = void*]’
360 | lengauer_tarjan_dominator_tree(g, entry, indexMap, dfnumMap, parentMap,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
361 | verticesByDFNum, domTreePredMap);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
dominatorTree.cpp:46:36: required from here
46 | lengauer_tarjan_dominator_tree(g, vertex(v, g), domTreePredMap);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
20 | ~usage_requirements() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::DefaultConstructible<TT>::~DefaultConstructible() [with TT = boost::default_color_type]’
37 | ~model()
| ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:137:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
137 | BOOST_CONCEPT_USAGE(DefaultConstructible) {
| ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::concepts::ColorValue<boost::default_color_type>]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/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(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/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> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:502:1: required from ‘struct boost::concepts::ColorValueConcept<boost::default_color_type>’
502 | BOOST_concept(ColorValue, (C))
| ^~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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);
| ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_<void (*)(boost::concepts::ColorValueConcept<boost::default_color_type>)>’
72 | struct requirement_<void(*)(Model)>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:136:9: required from ‘void boost::detail::depth_first_visit_impl(const IncidenceGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, DFSVisitor&, ColorMap, TerminatorFunc) [with IncidenceGraph = boost::adjacency_list<boost::vecS, boost::listS, boost::bidirectionalS, boost::property<boost::vertex_index_t, int> >; DFSVisitor = boost::dfs_visitor<std::pair<boost::predecessor_recorder<boost::iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::bidirectionalS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t>, void*, void*&>, boost::on_tree_edge>, time_stamper_with_vertex_vector<boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::bidirectionalS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t>, long unsigned int, long unsigned int&>, std::vector<void*>, long unsigned int, boost::on_discover_vertex> > >; ColorMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::bidirectionalS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t>, boost::default_color_type, boost::default_color_type&>; TerminatorFunc = nontruth2; typename boost::graph_traits<Graph>::vertex_descriptor = void*]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:417:35: required from ‘void boost::depth_first_visit(const IncidenceGraph&, typename graph_traits<Graph>::vertex_descriptor, DFSVisitor, ColorMap) [with IncidenceGraph = adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >; DFSVisitor = dfs_visitor<std::pair<predecessor_recorder<iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>, void*, void*&>, on_tree_edge>, detail::time_stamper_with_vertex_vector<iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>, long unsigned int, long unsigned int&>, std::vector<void*>, long unsigned int, on_discover_vertex> > >; ColorMap = iterator_property_map<__gnu_cxx::__normal_iterator<default_color_type*, std::vector<default_color_type> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>, default_color_type, default_color_type&>; typename graph_traits<Graph>::vertex_descriptor = void*]’
417 | detail::depth_first_visit_impl(g, u, vis, color, detail::nontruth2());
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dominator_tree.hpp:309:22: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename graph_traits<Graph>::vertex_descriptor&, const IndexMap&, TimeMap, PredMap, VertexVector&, DomTreePredMap) [with Graph = adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >; IndexMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; TimeMap = iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>, long unsigned int, long unsigned int&>; PredMap = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>, void*, void*&>; VertexVector = std::vector<void*>; DomTreePredMap = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, int&, vertex_index_t> >; typename graph_traits<Graph>::vertex_descriptor = void*]’
309 | depth_first_visit(g, entry,
| ~~~~~~~~~~~~~~~~~^~~~~~~~~~
310 | make_dfs_visitor(
| ~~~~~~~~~~~~~~~~~
311 | make_pair(record_predecessors(parentMap, on_tree_edge()),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
312 | detail::stamp_times_with_vertex_vector(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
313 | dfnumMap, verticesByDFNum, time, on_discover_vertex()))),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
314 | make_iterator_property_map(colors.begin(), indexMap));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dominator_tree.hpp:360:35: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename graph_traits<Graph>::vertex_descriptor&, DomTreePredMap) [with Graph = adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >; DomTreePredMap = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, int&, vertex_index_t> >; typename graph_traits<Graph>::vertex_descriptor = void*]’
360 | lengauer_tarjan_dominator_tree(g, entry, indexMap, dfnumMap, parentMap,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
361 | verticesByDFNum, domTreePredMap);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
dominatorTree.cpp:46:36: required from here
46 | lengauer_tarjan_dominator_tree(g, vertex(v, g), domTreePredMap);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
20 | ~usage_requirements() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::concepts::ColorValue<C>::~ColorValue() [with C = boost::default_color_type]’
37 | ~model()
| ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:505:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
505 | BOOST_CONCEPT_USAGE(ColorValue)
| ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/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<std::deque<void*, std::allocator<void*> >*, std::vector<std::deque<void*, std::allocator<void*> >, std::allocator<std::deque<void*, std::allocator<void*> > > > > > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:145:5: required from ‘struct boost::Assignable<__gnu_cxx::__normal_iterator<std::deque<void*, std::allocator<void*> >*, std::vector<std::deque<void*, std::allocator<void*> >, std::allocator<std::deque<void*, std::allocator<void*> > > > > >’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator<__gnu_cxx::__normal_iterator<std::deque<void*, std::allocator<void*> >*, std::vector<std::deque<void*, std::allocator<void*> >, std::allocator<std::deque<void*, std::allocator<void*> > > > > >’
502 | BOOST_concept(InputIterator,(TT))
| ^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:540:3: required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator<std::deque<void*, std::allocator<void*> >*, std::vector<std::deque<void*, std::allocator<void*> >, std::allocator<std::deque<void*, std::allocator<void*> > > > > >’
540 | BOOST_concept(ForwardIterator,(TT))
| ^~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator<std::deque<void*, std::allocator<void*> >*, std::vector<std::deque<void*, std::allocator<void*> >, std::allocator<std::deque<void*, std::allocator<void*> > > > > >’
568 | BOOST_concept(BidirectionalIterator,(TT))
| ^~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator<std::deque<void*, std::allocator<void*> >*, std::vector<std::deque<void*, std::allocator<void*> >, std::allocator<std::deque<void*, std::allocator<void*> > > > > >’
597 | BOOST_concept(RandomAccessIterator,(TT))
| ^~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3: [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map<RAIter, ID, typename std::iterator_traits< <template-parameter-1-1> >::value_type, typename std::iterator_traits< <template-parameter-1-1> >::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = __gnu_cxx::__normal_iterator<std::deque<void*, std::allocator<void*> >*, std::vector<std::deque<void*, std::allocator<void*> >, std::allocator<std::deque<void*, std::allocator<void*> > > > >; ID = adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; typename std::iterator_traits< <template-parameter-1-1> >::value_type = std::deque<void*, std::allocator<void*> >; typename std::iterator_traits< <template-parameter-1-1> >::reference = std::deque<void*, std::allocator<void*> >&]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dominator_tree.hpp:91:48: required from ‘boost::detail::dominator_visitor<Graph, IndexMap, TimeMap, PredMap, DomTreePredMap>::dominator_visitor(const Graph&, const Vertex&, const IndexMap&, DomTreePredMap) [with Graph = boost::adjacency_list<boost::vecS, boost::listS, boost::bidirectionalS, boost::property<boost::vertex_index_t, int> >; IndexMap = boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::bidirectionalS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t>; TimeMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::bidirectionalS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t>, long unsigned int, long unsigned int&>; PredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::bidirectionalS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t>, void*, void*&>; DomTreePredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::bidirectionalS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t> >; Vertex = void*]’
91 | , bucketMap_(make_iterator_property_map(buckets_.begin(), indexMap))
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dominator_tree.hpp:254:9: required from ‘void boost::lengauer_tarjan_dominator_tree_without_dfs(const Graph&, const typename graph_traits<Graph>::vertex_descriptor&, const IndexMap&, TimeMap, PredMap, VertexVector&, DomTreePredMap) [with Graph = adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >; IndexMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; TimeMap = iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>, long unsigned int, long unsigned int&>; PredMap = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>, void*, void*&>; VertexVector = std::vector<void*>; DomTreePredMap = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, int&, vertex_index_t> >; typename graph_traits<Graph>::vertex_descriptor = void*]’
254 | visitor(g, entry, indexMap, domTreePredMap);
| ^~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dominator_tree.hpp:317:47: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename graph_traits<Graph>::vertex_descriptor&, const IndexMap&, TimeMap, PredMap, VertexVector&, DomTreePredMap) [with Graph = adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >; IndexMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; TimeMap = iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>, long unsigned int, long unsigned int&>; PredMap = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>, void*, void*&>; VertexVector = std::vector<void*>; DomTreePredMap = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, int&, vertex_index_t> >; typename graph_traits<Graph>::vertex_descriptor = void*]’
317 | lengauer_tarjan_dominator_tree_without_dfs(g, entry, indexMap, dfnumMap,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
318 | parentMap, verticesByDFNum, domTreePredMap);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dominator_tree.hpp:360:35: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename graph_traits<Graph>::vertex_descriptor&, DomTreePredMap) [with Graph = adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >; DomTreePredMap = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, int&, vertex_index_t> >; typename graph_traits<Graph>::vertex_descriptor = void*]’
360 | lengauer_tarjan_dominator_tree(g, entry, indexMap, dfnumMap, parentMap,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
361 | verticesByDFNum, domTreePredMap);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
dominatorTree.cpp:46:36: required from here
46 | lengauer_tarjan_dominator_tree(g, vertex(v, g), domTreePredMap);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/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<std::deque<void*, std::allocator<void*> >*, std::vector<std::deque<void*, std::allocator<void*> >, std::allocator<std::deque<void*, std::allocator<void*> > > > > >]’
20 | ~usage_requirements() { ((Model*)0)->~Model(); }
| ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/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<std::deque<void*, std::allocator<void*> >*, std::vector<std::deque<void*, std::allocator<void*> >, std::allocator<std::deque<void*, std::allocator<void*> > > > > > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable<__gnu_cxx::__normal_iterator<std::deque<void*, std::allocator<void*> >*, std::vector<std::deque<void*, std::allocator<void*> >, std::allocator<std::deque<void*, std::allocator<void*> > > > > >’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator<__gnu_cxx::__normal_iterator<std::deque<void*, std::allocator<void*> >*, std::vector<std::deque<void*, std::allocator<void*> >, std::allocator<std::deque<void*, std::allocator<void*> > > > > >’
502 | BOOST_concept(InputIterator,(TT))
| ^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:540:3: required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator<std::deque<void*, std::allocator<void*> >*, std::vector<std::deque<void*, std::allocator<void*> >, std::allocator<std::deque<void*, std::allocator<void*> > > > > >’
540 | BOOST_concept(ForwardIterator,(TT))
| ^~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator<std::deque<void*, std::allocator<void*> >*, std::vector<std::deque<void*, std::allocator<void*> >, std::allocator<std::deque<void*, std::allocator<void*> > > > > >’
568 | BOOST_concept(BidirectionalIterator,(TT))
| ^~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator<std::deque<void*, std::allocator<void*> >*, std::vector<std::deque<void*, std::allocator<void*> >, std::allocator<std::deque<void*, std::allocator<void*> > > > > >’
597 | BOOST_concept(RandomAccessIterator,(TT))
| ^~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3: [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map<RAIter, ID, typename std::iterator_traits< <template-parameter-1-1> >::value_type, typename std::iterator_traits< <template-parameter-1-1> >::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = __gnu_cxx::__normal_iterator<std::deque<void*, std::allocator<void*> >*, std::vector<std::deque<void*, std::allocator<void*> >, std::allocator<std::deque<void*, std::allocator<void*> > > > >; ID = adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; typename std::iterator_traits< <template-parameter-1-1> >::value_type = std::deque<void*, std::allocator<void*> >; typename std::iterator_traits< <template-parameter-1-1> >::reference = std::deque<void*, std::allocator<void*> >&]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dominator_tree.hpp:91:48: required from ‘boost::detail::dominator_visitor<Graph, IndexMap, TimeMap, PredMap, DomTreePredMap>::dominator_visitor(const Graph&, const Vertex&, const IndexMap&, DomTreePredMap) [with Graph = boost::adjacency_list<boost::vecS, boost::listS, boost::bidirectionalS, boost::property<boost::vertex_index_t, int> >; IndexMap = boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::bidirectionalS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t>; TimeMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::bidirectionalS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t>, long unsigned int, long unsigned int&>; PredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::bidirectionalS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t>, void*, void*&>; DomTreePredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::bidirectionalS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t> >; Vertex = void*]’
91 | , bucketMap_(make_iterator_property_map(buckets_.begin(), indexMap))
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dominator_tree.hpp:254:9: required from ‘void boost::lengauer_tarjan_dominator_tree_without_dfs(const Graph&, const typename graph_traits<Graph>::vertex_descriptor&, const IndexMap&, TimeMap, PredMap, VertexVector&, DomTreePredMap) [with Graph = adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >; IndexMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; TimeMap = iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>, long unsigned int, long unsigned int&>; PredMap = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>, void*, void*&>; VertexVector = std::vector<void*>; DomTreePredMap = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, int&, vertex_index_t> >; typename graph_traits<Graph>::vertex_descriptor = void*]’
254 | visitor(g, entry, indexMap, domTreePredMap);
| ^~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dominator_tree.hpp:317:47: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename graph_traits<Graph>::vertex_descriptor&, const IndexMap&, TimeMap, PredMap, VertexVector&, DomTreePredMap) [with Graph = adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >; IndexMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; TimeMap = iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>, long unsigned int, long unsigned int&>; PredMap = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>, void*, void*&>; VertexVector = std::vector<void*>; DomTreePredMap = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, int&, vertex_index_t> >; typename graph_traits<Graph>::vertex_descriptor = void*]’
317 | lengauer_tarjan_dominator_tree_without_dfs(g, entry, indexMap, dfnumMap,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
318 | parentMap, verticesByDFNum, domTreePredMap);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dominator_tree.hpp:360:35: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename graph_traits<Graph>::vertex_descriptor&, DomTreePredMap) [with Graph = adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >; DomTreePredMap = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, int&, vertex_index_t> >; typename graph_traits<Graph>::vertex_descriptor = void*]’
360 | lengauer_tarjan_dominator_tree(g, entry, indexMap, dfnumMap, parentMap,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
361 | verticesByDFNum, domTreePredMap);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
dominatorTree.cpp:46:36: required from here
46 | lengauer_tarjan_dominator_tree(g, vertex(v, g), domTreePredMap);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/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<std::deque<void*, std::allocator<void*> >*, std::vector<std::deque<void*, std::allocator<void*> >, std::allocator<std::deque<void*, std::allocator<void*> > > > > >]’
20 | ~usage_requirements() { ((Model*)0)->~Model(); }
| ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/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<std::deque<void*, std::allocator<void*> >*, std::vector<std::deque<void*, std::allocator<void*> >, std::allocator<std::deque<void*, std::allocator<void*> > > > > > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:512:7: required from ‘struct boost::InputIterator<__gnu_cxx::__normal_iterator<std::deque<void*, std::allocator<void*> >*, std::vector<std::deque<void*, std::allocator<void*> >, std::allocator<std::deque<void*, std::allocator<void*> > > > > >’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:540:3: required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator<std::deque<void*, std::allocator<void*> >*, std::vector<std::deque<void*, std::allocator<void*> >, std::allocator<std::deque<void*, std::allocator<void*> > > > > >’
540 | BOOST_concept(ForwardIterator,(TT))
| ^~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator<std::deque<void*, std::allocator<void*> >*, std::vector<std::deque<void*, std::allocator<void*> >, std::allocator<std::deque<void*, std::allocator<void*> > > > > >’
568 | BOOST_concept(BidirectionalIterator,(TT))
| ^~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator<std::deque<void*, std::allocator<void*> >*, std::vector<std::deque<void*, std::allocator<void*> >, std::allocator<std::deque<void*, std::allocator<void*> > > > > >’
597 | BOOST_concept(RandomAccessIterator,(TT))
| ^~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<std::deque<void*, std::allocator<void*> >*, std::vector<std::deque<void*, std::allocator<void*> >, std::allocator<std::deque<void*, std::allocator<void*> > > > > >’
597 | BOOST_concept(RandomAccessIterator,(TT))
| ^~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map<RAIter, ID, typename std::iterator_traits< <template-parameter-1-1> >::value_type, typename std::iterator_traits< <template-parameter-1-1> >::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = __gnu_cxx::__normal_iterator<std::deque<void*, std::allocator<void*> >*, std::vector<std::deque<void*, std::allocator<void*> >, std::allocator<std::deque<void*, std::allocator<void*> > > > >; ID = adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; typename std::iterator_traits< <template-parameter-1-1> >::value_type = std::deque<void*, std::allocator<void*> >; typename std::iterator_traits< <template-parameter-1-1> >::reference = std::deque<void*, std::allocator<void*> >&]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dominator_tree.hpp:91:48: required from ‘boost::detail::dominator_visitor<Graph, IndexMap, TimeMap, PredMap, DomTreePredMap>::dominator_visitor(const Graph&, const Vertex&, const IndexMap&, DomTreePredMap) [with Graph = boost::adjacency_list<boost::vecS, boost::listS, boost::bidirectionalS, boost::property<boost::vertex_index_t, int> >; IndexMap = boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::bidirectionalS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t>; TimeMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::bidirectionalS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t>, long unsigned int, long unsigned int&>; PredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::bidirectionalS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t>, void*, void*&>; DomTreePredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::bidirectionalS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t> >; Vertex = void*]’
91 | , bucketMap_(make_iterator_property_map(buckets_.begin(), indexMap))
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dominator_tree.hpp:254:9: required from ‘void boost::lengauer_tarjan_dominator_tree_without_dfs(const Graph&, const typename graph_traits<Graph>::vertex_descriptor&, const IndexMap&, TimeMap, PredMap, VertexVector&, DomTreePredMap) [with Graph = adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >; IndexMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; TimeMap = iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>, long unsigned int, long unsigned int&>; PredMap = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>, void*, void*&>; VertexVector = std::vector<void*>; DomTreePredMap = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, int&, vertex_index_t> >; typename graph_traits<Graph>::vertex_descriptor = void*]’
254 | visitor(g, entry, indexMap, domTreePredMap);
| ^~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dominator_tree.hpp:317:47: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename graph_traits<Graph>::vertex_descriptor&, const IndexMap&, TimeMap, PredMap, VertexVector&, DomTreePredMap) [with Graph = adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >; IndexMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; TimeMap = iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>, long unsigned int, long unsigned int&>; PredMap = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>, void*, void*&>; VertexVector = std::vector<void*>; DomTreePredMap = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, int&, vertex_index_t> >; typename graph_traits<Graph>::vertex_descriptor = void*]’
317 | lengauer_tarjan_dominator_tree_without_dfs(g, entry, indexMap, dfnumMap,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
318 | parentMap, verticesByDFNum, domTreePredMap);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dominator_tree.hpp:360:35: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename graph_traits<Graph>::vertex_descriptor&, DomTreePredMap) [with Graph = adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >; DomTreePredMap = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, int&, vertex_index_t> >; typename graph_traits<Graph>::vertex_descriptor = void*]’
360 | lengauer_tarjan_dominator_tree(g, entry, indexMap, dfnumMap, parentMap,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
361 | verticesByDFNum, domTreePredMap);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
dominatorTree.cpp:46:36: required from here
46 | lengauer_tarjan_dominator_tree(g, vertex(v, g), domTreePredMap);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/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<std::deque<void*, std::allocator<void*> >*, std::vector<std::deque<void*, std::allocator<void*> >, std::allocator<std::deque<void*, std::allocator<void*> > > > > >]’
20 | ~usage_requirements() { ((Model*)0)->~Model(); }
| ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/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<std::deque<void*, std::allocator<void*> >*, std::vector<std::deque<void*, std::allocator<void*> >, std::allocator<std::deque<void*, std::allocator<void*> > > > > > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:543:7: required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator<std::deque<void*, std::allocator<void*> >*, std::vector<std::deque<void*, std::allocator<void*> >, std::allocator<std::deque<void*, std::allocator<void*> > > > > >’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator<std::deque<void*, std::allocator<void*> >*, std::vector<std::deque<void*, std::allocator<void*> >, std::allocator<std::deque<void*, std::allocator<void*> > > > > >’
568 | BOOST_concept(BidirectionalIterator,(TT))
| ^~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator<std::deque<void*, std::allocator<void*> >*, std::vector<std::deque<void*, std::allocator<void*> >, std::allocator<std::deque<void*, std::allocator<void*> > > > > >’
597 | BOOST_concept(RandomAccessIterator,(TT))
| ^~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<std::deque<void*, std::allocator<void*> >*, std::vector<std::deque<void*, std::allocator<void*> >, std::allocator<std::deque<void*, std::allocator<void*> > > > > >’
597 | BOOST_concept(RandomAccessIterator,(TT))
| ^~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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<std::deque<void*, std::allocator<void*> >*, std::vector<std::deque<void*, std::allocator<void*> >, std::allocator<std::deque<void*, std::allocator<void*> > > > > >]’
32 | inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
| ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map<RAIter, ID, typename std::iterator_traits< <template-parameter-1-1> >::value_type, typename std::iterator_traits< <template-parameter-1-1> >::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = __gnu_cxx::__normal_iterator<std::deque<void*, std::allocator<void*> >*, std::vector<std::deque<void*, std::allocator<void*> >, std::allocator<std::deque<void*, std::allocator<void*> > > > >; ID = adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; typename std::iterator_traits< <template-parameter-1-1> >::value_type = std::deque<void*, std::allocator<void*> >; typename std::iterator_traits< <template-parameter-1-1> >::reference = std::deque<void*, std::allocator<void*> >&]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dominator_tree.hpp:91:48: required from ‘boost::detail::dominator_visitor<Graph, IndexMap, TimeMap, PredMap, DomTreePredMap>::dominator_visitor(const Graph&, const Vertex&, const IndexMap&, DomTreePredMap) [with Graph = boost::adjacency_list<boost::vecS, boost::listS, boost::bidirectionalS, boost::property<boost::vertex_index_t, int> >; IndexMap = boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::bidirectionalS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t>; TimeMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::bidirectionalS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t>, long unsigned int, long unsigned int&>; PredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::bidirectionalS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t>, void*, void*&>; DomTreePredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::bidirectionalS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t> >; Vertex = void*]’
91 | , bucketMap_(make_iterator_property_map(buckets_.begin(), indexMap))
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dominator_tree.hpp:254:9: required from ‘void boost::lengauer_tarjan_dominator_tree_without_dfs(const Graph&, const typename graph_traits<Graph>::vertex_descriptor&, const IndexMap&, TimeMap, PredMap, VertexVector&, DomTreePredMap) [with Graph = adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >; IndexMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; TimeMap = iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>, long unsigned int, long unsigned int&>; PredMap = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>, void*, void*&>; VertexVector = std::vector<void*>; DomTreePredMap = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, int&, vertex_index_t> >; typename graph_traits<Graph>::vertex_descriptor = void*]’
254 | visitor(g, entry, indexMap, domTreePredMap);
| ^~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dominator_tree.hpp:317:47: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename graph_traits<Graph>::vertex_descriptor&, const IndexMap&, TimeMap, PredMap, VertexVector&, DomTreePredMap) [with Graph = adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >; IndexMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; TimeMap = iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>, long unsigned int, long unsigned int&>; PredMap = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>, void*, void*&>; VertexVector = std::vector<void*>; DomTreePredMap = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, int&, vertex_index_t> >; typename graph_traits<Graph>::vertex_descriptor = void*]’
317 | lengauer_tarjan_dominator_tree_without_dfs(g, entry, indexMap, dfnumMap,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
318 | parentMap, verticesByDFNum, domTreePredMap);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dominator_tree.hpp:360:35: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename graph_traits<Graph>::vertex_descriptor&, DomTreePredMap) [with Graph = adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >; DomTreePredMap = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, int&, vertex_index_t> >; typename graph_traits<Graph>::vertex_descriptor = void*]’
360 | lengauer_tarjan_dominator_tree(g, entry, indexMap, dfnumMap, parentMap,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
361 | verticesByDFNum, domTreePredMap);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
dominatorTree.cpp:46:36: required from here
46 | lengauer_tarjan_dominator_tree(g, vertex(v, g), domTreePredMap);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/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<std::deque<void*, std::allocator<void*> >*, std::vector<std::deque<void*, std::allocator<void*> >, std::allocator<std::deque<void*, std::allocator<void*> > > > > >]’
20 | ~usage_requirements() { ((Model*)0)->~Model(); }
| ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/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<std::deque<void*, std::allocator<void*> >*, std::vector<std::deque<void*, std::allocator<void*> >, std::allocator<std::deque<void*, std::allocator<void*> > > > > > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:571:7: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator<std::deque<void*, std::allocator<void*> >*, std::vector<std::deque<void*, std::allocator<void*> >, std::allocator<std::deque<void*, std::allocator<void*> > > > > >’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator<std::deque<void*, std::allocator<void*> >*, std::vector<std::deque<void*, std::allocator<void*> >, std::allocator<std::deque<void*, std::allocator<void*> > > > > >’
597 | BOOST_concept(RandomAccessIterator,(TT))
| ^~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<std::deque<void*, std::allocator<void*> >*, std::vector<std::deque<void*, std::allocator<void*> >, std::allocator<std::deque<void*, std::allocator<void*> > > > > >’
597 | BOOST_concept(RandomAccessIterator,(TT))
| ^~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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<std::deque<void*, std::allocator<void*> >*, std::vector<std::deque<void*, std::allocator<void*> >, std::allocator<std::deque<void*, std::allocator<void*> > > > > >]’
32 | inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
| ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied<boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<std::deque<void*, std::allocator<void*> >*, std::vector<std::deque<void*, std::allocator<void*> >, std::allocator<std::deque<void*, std::allocator<void*> > > > > > >::value’
44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map<RAIter, ID, typename std::iterator_traits< <template-parameter-1-1> >::value_type, typename std::iterator_traits< <template-parameter-1-1> >::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = __gnu_cxx::__normal_iterator<std::deque<void*, std::allocator<void*> >*, std::vector<std::deque<void*, std::allocator<void*> >, std::allocator<std::deque<void*, std::allocator<void*> > > > >; ID = adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; typename std::iterator_traits< <template-parameter-1-1> >::value_type = std::deque<void*, std::allocator<void*> >; typename std::iterator_traits< <template-parameter-1-1> >::reference = std::deque<void*, std::allocator<void*> >&]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dominator_tree.hpp:91:48: required from ‘boost::detail::dominator_visitor<Graph, IndexMap, TimeMap, PredMap, DomTreePredMap>::dominator_visitor(const Graph&, const Vertex&, const IndexMap&, DomTreePredMap) [with Graph = boost::adjacency_list<boost::vecS, boost::listS, boost::bidirectionalS, boost::property<boost::vertex_index_t, int> >; IndexMap = boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::bidirectionalS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t>; TimeMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::bidirectionalS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t>, long unsigned int, long unsigned int&>; PredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::bidirectionalS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t>, void*, void*&>; DomTreePredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::bidirectionalS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t> >; Vertex = void*]’
91 | , bucketMap_(make_iterator_property_map(buckets_.begin(), indexMap))
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dominator_tree.hpp:254:9: required from ‘void boost::lengauer_tarjan_dominator_tree_without_dfs(const Graph&, const typename graph_traits<Graph>::vertex_descriptor&, const IndexMap&, TimeMap, PredMap, VertexVector&, DomTreePredMap) [with Graph = adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >; IndexMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; TimeMap = iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>, long unsigned int, long unsigned int&>; PredMap = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>, void*, void*&>; VertexVector = std::vector<void*>; DomTreePredMap = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, int&, vertex_index_t> >; typename graph_traits<Graph>::vertex_descriptor = void*]’
254 | visitor(g, entry, indexMap, domTreePredMap);
| ^~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dominator_tree.hpp:317:47: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename graph_traits<Graph>::vertex_descriptor&, const IndexMap&, TimeMap, PredMap, VertexVector&, DomTreePredMap) [with Graph = adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >; IndexMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; TimeMap = iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>, long unsigned int, long unsigned int&>; PredMap = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>, void*, void*&>; VertexVector = std::vector<void*>; DomTreePredMap = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, int&, vertex_index_t> >; typename graph_traits<Graph>::vertex_descriptor = void*]’
317 | lengauer_tarjan_dominator_tree_without_dfs(g, entry, indexMap, dfnumMap,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
318 | parentMap, verticesByDFNum, domTreePredMap);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dominator_tree.hpp:360:35: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename graph_traits<Graph>::vertex_descriptor&, DomTreePredMap) [with Graph = adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >; DomTreePredMap = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, int&, vertex_index_t> >; typename graph_traits<Graph>::vertex_descriptor = void*]’
360 | lengauer_tarjan_dominator_tree(g, entry, indexMap, dfnumMap, parentMap,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
361 | verticesByDFNum, domTreePredMap);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
dominatorTree.cpp:46:36: required from here
46 | lengauer_tarjan_dominator_tree(g, vertex(v, g), domTreePredMap);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/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<std::deque<void*, std::allocator<void*> >*, std::vector<std::deque<void*, std::allocator<void*> >, std::allocator<std::deque<void*, std::allocator<void*> > > > > >]’
20 | ~usage_requirements() { ((Model*)0)->~Model(); }
| ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/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<std::deque<void*, std::allocator<void*> >*, std::vector<std::deque<void*, std::allocator<void*> >, std::allocator<std::deque<void*, std::allocator<void*> > > > > > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:253:5: required from ‘struct boost::Comparable<__gnu_cxx::__normal_iterator<std::deque<void*, std::allocator<void*> >*, std::vector<std::deque<void*, std::allocator<void*> >, std::allocator<std::deque<void*, std::allocator<void*> > > > > >’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator<std::deque<void*, std::allocator<void*> >*, std::vector<std::deque<void*, std::allocator<void*> >, std::allocator<std::deque<void*, std::allocator<void*> > > > > >’
597 | BOOST_concept(RandomAccessIterator,(TT))
| ^~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<std::deque<void*, std::allocator<void*> >*, std::vector<std::deque<void*, std::allocator<void*> >, std::allocator<std::deque<void*, std::allocator<void*> > > > > >’
597 | BOOST_concept(RandomAccessIterator,(TT))
| ^~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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<std::deque<void*, std::allocator<void*> >*, std::vector<std::deque<void*, std::allocator<void*> >, std::allocator<std::deque<void*, std::allocator<void*> > > > > >]’
32 | inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
| ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied<boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<std::deque<void*, std::allocator<void*> >*, std::vector<std::deque<void*, std::allocator<void*> >, std::allocator<std::deque<void*, std::allocator<void*> > > > > > >::value’
44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map<RAIter, ID, typename std::iterator_traits< <template-parameter-1-1> >::value_type, typename std::iterator_traits< <template-parameter-1-1> >::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = __gnu_cxx::__normal_iterator<std::deque<void*, std::allocator<void*> >*, std::vector<std::deque<void*, std::allocator<void*> >, std::allocator<std::deque<void*, std::allocator<void*> > > > >; ID = adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; typename std::iterator_traits< <template-parameter-1-1> >::value_type = std::deque<void*, std::allocator<void*> >; typename std::iterator_traits< <template-parameter-1-1> >::reference = std::deque<void*, std::allocator<void*> >&]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dominator_tree.hpp:91:48: required from ‘boost::detail::dominator_visitor<Graph, IndexMap, TimeMap, PredMap, DomTreePredMap>::dominator_visitor(const Graph&, const Vertex&, const IndexMap&, DomTreePredMap) [with Graph = boost::adjacency_list<boost::vecS, boost::listS, boost::bidirectionalS, boost::property<boost::vertex_index_t, int> >; IndexMap = boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::bidirectionalS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t>; TimeMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::bidirectionalS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t>, long unsigned int, long unsigned int&>; PredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::bidirectionalS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t>, void*, void*&>; DomTreePredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::bidirectionalS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t> >; Vertex = void*]’
91 | , bucketMap_(make_iterator_property_map(buckets_.begin(), indexMap))
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dominator_tree.hpp:254:9: required from ‘void boost::lengauer_tarjan_dominator_tree_without_dfs(const Graph&, const typename graph_traits<Graph>::vertex_descriptor&, const IndexMap&, TimeMap, PredMap, VertexVector&, DomTreePredMap) [with Graph = adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >; IndexMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; TimeMap = iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>, long unsigned int, long unsigned int&>; PredMap = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>, void*, void*&>; VertexVector = std::vector<void*>; DomTreePredMap = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, int&, vertex_index_t> >; typename graph_traits<Graph>::vertex_descriptor = void*]’
254 | visitor(g, entry, indexMap, domTreePredMap);
| ^~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dominator_tree.hpp:317:47: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename graph_traits<Graph>::vertex_descriptor&, const IndexMap&, TimeMap, PredMap, VertexVector&, DomTreePredMap) [with Graph = adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >; IndexMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; TimeMap = iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>, long unsigned int, long unsigned int&>; PredMap = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>, void*, void*&>; VertexVector = std::vector<void*>; DomTreePredMap = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, int&, vertex_index_t> >; typename graph_traits<Graph>::vertex_descriptor = void*]’
317 | lengauer_tarjan_dominator_tree_without_dfs(g, entry, indexMap, dfnumMap,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
318 | parentMap, verticesByDFNum, domTreePredMap);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dominator_tree.hpp:360:35: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename graph_traits<Graph>::vertex_descriptor&, DomTreePredMap) [with Graph = adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >; DomTreePredMap = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, int&, vertex_index_t> >; typename graph_traits<Graph>::vertex_descriptor = void*]’
360 | lengauer_tarjan_dominator_tree(g, entry, indexMap, dfnumMap, parentMap,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
361 | verticesByDFNum, domTreePredMap);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
dominatorTree.cpp:46:36: required from here
46 | lengauer_tarjan_dominator_tree(g, vertex(v, g), domTreePredMap);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/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<std::deque<void*, std::allocator<void*> >*, std::vector<std::deque<void*, std::allocator<void*> >, std::allocator<std::deque<void*, std::allocator<void*> > > > > >]’
20 | ~usage_requirements() { ((Model*)0)->~Model(); }
| ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/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<std::deque<void*, std::allocator<void*> >*, std::vector<std::deque<void*, std::allocator<void*> >, std::allocator<std::deque<void*, std::allocator<void*> > > > > > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:601:7: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator<std::deque<void*, std::allocator<void*> >*, std::vector<std::deque<void*, std::allocator<void*> >, std::allocator<std::deque<void*, std::allocator<void*> > > > > >’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<std::deque<void*, std::allocator<void*> >*, std::vector<std::deque<void*, std::allocator<void*> >, std::allocator<std::deque<void*, std::allocator<void*> > > > > >’
597 | BOOST_concept(RandomAccessIterator,(TT))
| ^~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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<std::deque<void*, std::allocator<void*> >*, std::vector<std::deque<void*, std::allocator<void*> >, std::allocator<std::deque<void*, std::allocator<void*> > > > > >]’
32 | inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
| ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied<boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<std::deque<void*, std::allocator<void*> >*, std::vector<std::deque<void*, std::allocator<void*> >, std::allocator<std::deque<void*, std::allocator<void*> > > > > > >::value’
44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map<RAIter, ID, typename std::iterator_traits< <template-parameter-1-1> >::value_type, typename std::iterator_traits< <template-parameter-1-1> >::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = __gnu_cxx::__normal_iterator<std::deque<void*, std::allocator<void*> >*, std::vector<std::deque<void*, std::allocator<void*> >, std::allocator<std::deque<void*, std::allocator<void*> > > > >; ID = adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; typename std::iterator_traits< <template-parameter-1-1> >::value_type = std::deque<void*, std::allocator<void*> >; typename std::iterator_traits< <template-parameter-1-1> >::reference = std::deque<void*, std::allocator<void*> >&]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dominator_tree.hpp:91:48: required from ‘boost::detail::dominator_visitor<Graph, IndexMap, TimeMap, PredMap, DomTreePredMap>::dominator_visitor(const Graph&, const Vertex&, const IndexMap&, DomTreePredMap) [with Graph = boost::adjacency_list<boost::vecS, boost::listS, boost::bidirectionalS, boost::property<boost::vertex_index_t, int> >; IndexMap = boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::bidirectionalS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t>; TimeMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::bidirectionalS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t>, long unsigned int, long unsigned int&>; PredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::bidirectionalS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t>, void*, void*&>; DomTreePredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::bidirectionalS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t> >; Vertex = void*]’
91 | , bucketMap_(make_iterator_property_map(buckets_.begin(), indexMap))
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dominator_tree.hpp:254:9: required from ‘void boost::lengauer_tarjan_dominator_tree_without_dfs(const Graph&, const typename graph_traits<Graph>::vertex_descriptor&, const IndexMap&, TimeMap, PredMap, VertexVector&, DomTreePredMap) [with Graph = adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >; IndexMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; TimeMap = iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>, long unsigned int, long unsigned int&>; PredMap = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>, void*, void*&>; VertexVector = std::vector<void*>; DomTreePredMap = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, int&, vertex_index_t> >; typename graph_traits<Graph>::vertex_descriptor = void*]’
254 | visitor(g, entry, indexMap, domTreePredMap);
| ^~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dominator_tree.hpp:317:47: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename graph_traits<Graph>::vertex_descriptor&, const IndexMap&, TimeMap, PredMap, VertexVector&, DomTreePredMap) [with Graph = adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >; IndexMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; TimeMap = iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>, long unsigned int, long unsigned int&>; PredMap = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>, void*, void*&>; VertexVector = std::vector<void*>; DomTreePredMap = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, int&, vertex_index_t> >; typename graph_traits<Graph>::vertex_descriptor = void*]’
317 | lengauer_tarjan_dominator_tree_without_dfs(g, entry, indexMap, dfnumMap,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
318 | parentMap, verticesByDFNum, domTreePredMap);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dominator_tree.hpp:360:35: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename graph_traits<Graph>::vertex_descriptor&, DomTreePredMap) [with Graph = adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >; DomTreePredMap = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, int&, vertex_index_t> >; typename graph_traits<Graph>::vertex_descriptor = void*]’
360 | lengauer_tarjan_dominator_tree(g, entry, indexMap, dfnumMap, parentMap,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
361 | verticesByDFNum, domTreePredMap);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
dominatorTree.cpp:46:36: required from here
46 | lengauer_tarjan_dominator_tree(g, vertex(v, g), domTreePredMap);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/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<std::deque<void*, std::allocator<void*> >*, std::vector<std::deque<void*, std::allocator<void*> >, std::allocator<std::deque<void*, std::allocator<void*> > > > > >]’
20 | ~usage_requirements() { ((Model*)0)->~Model(); }
| ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/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<std::deque<void*, std::allocator<void*> >*, std::vector<std::deque<void*, std::allocator<void*> >, std::allocator<std::deque<void*, std::allocator<void*> > > > > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map<RAIter, ID, typename std::iterator_traits< <template-parameter-1-1> >::value_type, typename std::iterator_traits< <template-parameter-1-1> >::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = __gnu_cxx::__normal_iterator<std::deque<void*, std::allocator<void*> >*, std::vector<std::deque<void*, std::allocator<void*> >, std::allocator<std::deque<void*, std::allocator<void*> > > > >; ID = adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; typename std::iterator_traits< <template-parameter-1-1> >::value_type = std::deque<void*, std::allocator<void*> >; typename std::iterator_traits< <template-parameter-1-1> >::reference = std::deque<void*, std::allocator<void*> >&]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dominator_tree.hpp:91:48: required from ‘boost::detail::dominator_visitor<Graph, IndexMap, TimeMap, PredMap, DomTreePredMap>::dominator_visitor(const Graph&, const Vertex&, const IndexMap&, DomTreePredMap) [with Graph = boost::adjacency_list<boost::vecS, boost::listS, boost::bidirectionalS, boost::property<boost::vertex_index_t, int> >; IndexMap = boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::bidirectionalS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t>; TimeMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::bidirectionalS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t>, long unsigned int, long unsigned int&>; PredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::bidirectionalS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t>, void*, void*&>; DomTreePredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::bidirectionalS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t> >; Vertex = void*]’
91 | , bucketMap_(make_iterator_property_map(buckets_.begin(), indexMap))
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dominator_tree.hpp:254:9: required from ‘void boost::lengauer_tarjan_dominator_tree_without_dfs(const Graph&, const typename graph_traits<Graph>::vertex_descriptor&, const IndexMap&, TimeMap, PredMap, VertexVector&, DomTreePredMap) [with Graph = adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >; IndexMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; TimeMap = iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>, long unsigned int, long unsigned int&>; PredMap = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>, void*, void*&>; VertexVector = std::vector<void*>; DomTreePredMap = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, int&, vertex_index_t> >; typename graph_traits<Graph>::vertex_descriptor = void*]’
254 | visitor(g, entry, indexMap, domTreePredMap);
| ^~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dominator_tree.hpp:317:47: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename graph_traits<Graph>::vertex_descriptor&, const IndexMap&, TimeMap, PredMap, VertexVector&, DomTreePredMap) [with Graph = adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >; IndexMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; TimeMap = iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>, long unsigned int, long unsigned int&>; PredMap = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>, void*, void*&>; VertexVector = std::vector<void*>; DomTreePredMap = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, int&, vertex_index_t> >; typename graph_traits<Graph>::vertex_descriptor = void*]’
317 | lengauer_tarjan_dominator_tree_without_dfs(g, entry, indexMap, dfnumMap,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
318 | parentMap, verticesByDFNum, domTreePredMap);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dominator_tree.hpp:360:35: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename graph_traits<Graph>::vertex_descriptor&, DomTreePredMap) [with Graph = adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >; DomTreePredMap = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, int&, vertex_index_t> >; typename graph_traits<Graph>::vertex_descriptor = void*]’
360 | lengauer_tarjan_dominator_tree(g, entry, indexMap, dfnumMap, parentMap,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
361 | verticesByDFNum, domTreePredMap);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
dominatorTree.cpp:46:36: required from here
46 | lengauer_tarjan_dominator_tree(g, vertex(v, g), domTreePredMap);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:17: note: in a call to non-static member function ‘boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<std::deque<void*, std::allocator<void*> >*, std::vector<std::deque<void*, std::allocator<void*> >, std::allocator<std::deque<void*, std::allocator<void*> > > > > >::~RandomAccessIteratorConcept()’
597 | BOOST_concept(RandomAccessIterator,(TT))
| ^~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/preprocessor/cat.hpp:29:34: note: in definition of macro ‘BOOST_PP_CAT_I’
29 | # define BOOST_PP_CAT_I(a, b) a ## b
| ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/concept_def.hpp:23:12: note: in expansion of macro ‘BOOST_PP_CAT’
23 | struct BOOST_PP_CAT(name,Concept) \
| ^~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3: note: in expansion of macro ‘BOOST_concept’
597 | BOOST_concept(RandomAccessIterator,(TT))
| ^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::DefaultConstructible<void*>]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/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(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:137:5: required from ‘struct boost::DefaultConstructible<void*>’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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);
| ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/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) );
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/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;
| ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 9 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied<boost::concepts::BidirectionalGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::bidirectionalS, boost::property<boost::vertex_index_t, int> > > >::value’
44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied<boost::concepts::BidirectionalGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::bidirectionalS, boost::property<boost::vertex_index_t, int> > > >’
45 | typedef boost::integral_constant<bool, value> type;
| ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_<void (*)(boost::concepts::BidirectionalGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::bidirectionalS, boost::property<boost::vertex_index_t, int> > >)>’
72 | struct requirement_<void(*)(Model)>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dominator_tree.hpp:245:5: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename graph_traits<Graph>::vertex_descriptor&, const IndexMap&, TimeMap, PredMap, VertexVector&, DomTreePredMap) [with Graph = adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >; IndexMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; TimeMap = iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>, long unsigned int, long unsigned int&>; PredMap = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>, void*, void*&>; VertexVector = std::vector<void*>; DomTreePredMap = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, int&, vertex_index_t> >; typename graph_traits<Graph>::vertex_descriptor = void*]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dominator_tree.hpp:360:35: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename graph_traits<Graph>::vertex_descriptor&, DomTreePredMap) [with Graph = adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >; DomTreePredMap = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, int&, vertex_index_t> >; typename graph_traits<Graph>::vertex_descriptor = void*]’
360 | lengauer_tarjan_dominator_tree(g, entry, indexMap, dfnumMap, parentMap,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
361 | verticesByDFNum, domTreePredMap);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
dominatorTree.cpp:46:36: required from here
46 | lengauer_tarjan_dominator_tree(g, vertex(v, g), domTreePredMap);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
20 | ~usage_requirements() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/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()
| ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:137:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
137 | BOOST_CONCEPT_USAGE(DefaultConstructible) {
| ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::EqualityComparable<void*>]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/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(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable<void*>’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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);
| ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/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) );
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/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;
| ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 9 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied<boost::concepts::BidirectionalGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::bidirectionalS, boost::property<boost::vertex_index_t, int> > > >::value’
44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied<boost::concepts::BidirectionalGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::bidirectionalS, boost::property<boost::vertex_index_t, int> > > >’
45 | typedef boost::integral_constant<bool, value> type;
| ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_<void (*)(boost::concepts::BidirectionalGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::bidirectionalS, boost::property<boost::vertex_index_t, int> > >)>’
72 | struct requirement_<void(*)(Model)>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dominator_tree.hpp:245:5: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename graph_traits<Graph>::vertex_descriptor&, const IndexMap&, TimeMap, PredMap, VertexVector&, DomTreePredMap) [with Graph = adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >; IndexMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; TimeMap = iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>, long unsigned int, long unsigned int&>; PredMap = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>, void*, void*&>; VertexVector = std::vector<void*>; DomTreePredMap = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, int&, vertex_index_t> >; typename graph_traits<Graph>::vertex_descriptor = void*]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dominator_tree.hpp:360:35: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename graph_traits<Graph>::vertex_descriptor&, DomTreePredMap) [with Graph = adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >; DomTreePredMap = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, int&, vertex_index_t> >; typename graph_traits<Graph>::vertex_descriptor = void*]’
360 | lengauer_tarjan_dominator_tree(g, entry, indexMap, dfnumMap, parentMap,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
361 | verticesByDFNum, domTreePredMap);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
dominatorTree.cpp:46:36: required from here
46 | lengauer_tarjan_dominator_tree(g, vertex(v, g), domTreePredMap);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
20 | ~usage_requirements() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/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()
| ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:233:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
233 | BOOST_CONCEPT_USAGE(EqualityComparable) {
| ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Assignable<void*>]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/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(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:145:5: required from ‘struct boost::Assignable<void*>’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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);
| ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/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) );
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/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;
| ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 9 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied<boost::concepts::BidirectionalGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::bidirectionalS, boost::property<boost::vertex_index_t, int> > > >::value’
44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied<boost::concepts::BidirectionalGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::bidirectionalS, boost::property<boost::vertex_index_t, int> > > >’
45 | typedef boost::integral_constant<bool, value> type;
| ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_<void (*)(boost::concepts::BidirectionalGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::bidirectionalS, boost::property<boost::vertex_index_t, int> > >)>’
72 | struct requirement_<void(*)(Model)>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dominator_tree.hpp:245:5: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename graph_traits<Graph>::vertex_descriptor&, const IndexMap&, TimeMap, PredMap, VertexVector&, DomTreePredMap) [with Graph = adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >; IndexMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; TimeMap = iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>, long unsigned int, long unsigned int&>; PredMap = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>, void*, void*&>; VertexVector = std::vector<void*>; DomTreePredMap = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, int&, vertex_index_t> >; typename graph_traits<Graph>::vertex_descriptor = void*]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dominator_tree.hpp:360:35: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename graph_traits<Graph>::vertex_descriptor&, DomTreePredMap) [with Graph = adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >; DomTreePredMap = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, int&, vertex_index_t> >; typename graph_traits<Graph>::vertex_descriptor = void*]’
360 | lengauer_tarjan_dominator_tree(g, entry, indexMap, dfnumMap, parentMap,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
361 | verticesByDFNum, domTreePredMap);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
dominatorTree.cpp:46:36: required from here
46 | lengauer_tarjan_dominator_tree(g, vertex(v, g), domTreePredMap);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
20 | ~usage_requirements() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/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()
| ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:145:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
145 | BOOST_CONCEPT_USAGE(Assignable) {
| ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/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<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property>*, std::vector<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property>, std::allocator<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl<boost::bidirectional_tag, void*>, long int> >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/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<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property>*, std::vector<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property>, std::allocator<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl<boost::bidirectional_tag, void*>, long int> > >]’
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/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<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property>*, std::vector<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property>, std::allocator<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl<boost::bidirectional_tag, void*>, long int> >’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property>*, std::vector<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property>, std::allocator<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl<boost::bidirectional_tag, void*>, long int> >]’
32 | inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
| ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/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<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property>*, std::vector<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property>, std::allocator<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl<boost::bidirectional_tag, void*>, long int> > >::value’
44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/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<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property>*, std::vector<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property>, std::allocator<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl<boost::bidirectional_tag, void*>, long int> > >’
45 | typedef boost::integral_constant<bool, value> type;
| ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 8 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied<boost::concepts::BidirectionalGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::bidirectionalS, boost::property<boost::vertex_index_t, int> > > >::value’
44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied<boost::concepts::BidirectionalGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::bidirectionalS, boost::property<boost::vertex_index_t, int> > > >’
45 | typedef boost::integral_constant<bool, value> type;
| ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_<void (*)(boost::concepts::BidirectionalGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::bidirectionalS, boost::property<boost::vertex_index_t, int> > >)>’
72 | struct requirement_<void(*)(Model)>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dominator_tree.hpp:245:5: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename graph_traits<Graph>::vertex_descriptor&, const IndexMap&, TimeMap, PredMap, VertexVector&, DomTreePredMap) [with Graph = adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >; IndexMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; TimeMap = iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>, long unsigned int, long unsigned int&>; PredMap = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>, void*, void*&>; VertexVector = std::vector<void*>; DomTreePredMap = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, int&, vertex_index_t> >; typename graph_traits<Graph>::vertex_descriptor = void*]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dominator_tree.hpp:360:35: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename graph_traits<Graph>::vertex_descriptor&, DomTreePredMap) [with Graph = adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >; DomTreePredMap = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, int&, vertex_index_t> >; typename graph_traits<Graph>::vertex_descriptor = void*]’
360 | lengauer_tarjan_dominator_tree(g, entry, indexMap, dfnumMap, parentMap,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
361 | verticesByDFNum, domTreePredMap);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
dominatorTree.cpp:46:36: required from here
46 | lengauer_tarjan_dominator_tree(g, vertex(v, g), domTreePredMap);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
20 | ~usage_requirements() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/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<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property>*, std::vector<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property>, std::allocator<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl<boost::bidirectional_tag, void*>, long int>]’
37 | ~model()
| ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:52:50: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
52 | BOOST_concept(MultiPassInputIterator, (T)) { BOOST_CONCEPT_USAGE(
| ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/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::bidirectional_tag, void*> >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/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::bidirectional_tag, void*> > >]’
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:137:5: required from ‘struct boost::DefaultConstructible<boost::detail::edge_desc_impl<boost::bidirectional_tag, void*> >’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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::bidirectional_tag, void*> >]’
32 | inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
| ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/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::bidirectional_tag, void*> > >::value’
44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/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::bidirectional_tag, void*> > >’
45 | typedef boost::integral_constant<bool, value> type;
| ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 8 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied<boost::concepts::BidirectionalGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::bidirectionalS, boost::property<boost::vertex_index_t, int> > > >::value’
44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied<boost::concepts::BidirectionalGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::bidirectionalS, boost::property<boost::vertex_index_t, int> > > >’
45 | typedef boost::integral_constant<bool, value> type;
| ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_<void (*)(boost::concepts::BidirectionalGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::bidirectionalS, boost::property<boost::vertex_index_t, int> > >)>’
72 | struct requirement_<void(*)(Model)>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dominator_tree.hpp:245:5: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename graph_traits<Graph>::vertex_descriptor&, const IndexMap&, TimeMap, PredMap, VertexVector&, DomTreePredMap) [with Graph = adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >; IndexMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; TimeMap = iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>, long unsigned int, long unsigned int&>; PredMap = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>, void*, void*&>; VertexVector = std::vector<void*>; DomTreePredMap = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, int&, vertex_index_t> >; typename graph_traits<Graph>::vertex_descriptor = void*]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dominator_tree.hpp:360:35: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename graph_traits<Graph>::vertex_descriptor&, DomTreePredMap) [with Graph = adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >; DomTreePredMap = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, int&, vertex_index_t> >; typename graph_traits<Graph>::vertex_descriptor = void*]’
360 | lengauer_tarjan_dominator_tree(g, entry, indexMap, dfnumMap, parentMap,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
361 | verticesByDFNum, domTreePredMap);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
dominatorTree.cpp:46:36: required from here
46 | lengauer_tarjan_dominator_tree(g, vertex(v, g), domTreePredMap);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
20 | ~usage_requirements() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/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::bidirectional_tag, void*>]’
37 | ~model()
| ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:137:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
137 | BOOST_CONCEPT_USAGE(DefaultConstructible) {
| ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/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::bidirectional_tag, void*> >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/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::bidirectional_tag, void*> > >]’
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable<boost::detail::edge_desc_impl<boost::bidirectional_tag, void*> >’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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::bidirectional_tag, void*> >]’
32 | inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
| ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/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::bidirectional_tag, void*> > >::value’
44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/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::bidirectional_tag, void*> > >’
45 | typedef boost::integral_constant<bool, value> type;
| ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 8 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied<boost::concepts::BidirectionalGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::bidirectionalS, boost::property<boost::vertex_index_t, int> > > >::value’
44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied<boost::concepts::BidirectionalGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::bidirectionalS, boost::property<boost::vertex_index_t, int> > > >’
45 | typedef boost::integral_constant<bool, value> type;
| ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_<void (*)(boost::concepts::BidirectionalGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::bidirectionalS, boost::property<boost::vertex_index_t, int> > >)>’
72 | struct requirement_<void(*)(Model)>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dominator_tree.hpp:245:5: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename graph_traits<Graph>::vertex_descriptor&, const IndexMap&, TimeMap, PredMap, VertexVector&, DomTreePredMap) [with Graph = adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >; IndexMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; TimeMap = iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>, long unsigned int, long unsigned int&>; PredMap = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>, void*, void*&>; VertexVector = std::vector<void*>; DomTreePredMap = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, int&, vertex_index_t> >; typename graph_traits<Graph>::vertex_descriptor = void*]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dominator_tree.hpp:360:35: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename graph_traits<Graph>::vertex_descriptor&, DomTreePredMap) [with Graph = adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >; DomTreePredMap = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, int&, vertex_index_t> >; typename graph_traits<Graph>::vertex_descriptor = void*]’
360 | lengauer_tarjan_dominator_tree(g, entry, indexMap, dfnumMap, parentMap,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
361 | verticesByDFNum, domTreePredMap);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
dominatorTree.cpp:46:36: required from here
46 | lengauer_tarjan_dominator_tree(g, vertex(v, g), domTreePredMap);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
20 | ~usage_requirements() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/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::bidirectional_tag, void*>]’
37 | ~model()
| ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:233:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
233 | BOOST_CONCEPT_USAGE(EqualityComparable) {
| ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/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::bidirectional_tag, void*> >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/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::bidirectional_tag, void*> > >]’
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:145:5: required from ‘struct boost::Assignable<boost::detail::edge_desc_impl<boost::bidirectional_tag, void*> >’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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::bidirectional_tag, void*> >]’
32 | inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
| ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/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::bidirectional_tag, void*> > >::value’
44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/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::bidirectional_tag, void*> > >’
45 | typedef boost::integral_constant<bool, value> type;
| ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 8 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied<boost::concepts::BidirectionalGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::bidirectionalS, boost::property<boost::vertex_index_t, int> > > >::value’
44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied<boost::concepts::BidirectionalGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::bidirectionalS, boost::property<boost::vertex_index_t, int> > > >’
45 | typedef boost::integral_constant<bool, value> type;
| ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_<void (*)(boost::concepts::BidirectionalGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::bidirectionalS, boost::property<boost::vertex_index_t, int> > >)>’
72 | struct requirement_<void(*)(Model)>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dominator_tree.hpp:245:5: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename graph_traits<Graph>::vertex_descriptor&, const IndexMap&, TimeMap, PredMap, VertexVector&, DomTreePredMap) [with Graph = adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >; IndexMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; TimeMap = iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>, long unsigned int, long unsigned int&>; PredMap = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>, void*, void*&>; VertexVector = std::vector<void*>; DomTreePredMap = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, int&, vertex_index_t> >; typename graph_traits<Graph>::vertex_descriptor = void*]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dominator_tree.hpp:360:35: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename graph_traits<Graph>::vertex_descriptor&, DomTreePredMap) [with Graph = adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >; DomTreePredMap = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, int&, vertex_index_t> >; typename graph_traits<Graph>::vertex_descriptor = void*]’
360 | lengauer_tarjan_dominator_tree(g, entry, indexMap, dfnumMap, parentMap,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
361 | verticesByDFNum, domTreePredMap);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
dominatorTree.cpp:46:36: required from here
46 | lengauer_tarjan_dominator_tree(g, vertex(v, g), domTreePredMap);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
20 | ~usage_requirements() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/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::bidirectional_tag, void*>]’
37 | ~model()
| ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:145:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
145 | BOOST_CONCEPT_USAGE(Assignable) {
| ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Convertible<boost::bidir_adj_list_traversal_tag, boost::incidence_graph_tag>]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/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::bidir_adj_list_traversal_tag, boost::incidence_graph_tag> >]’
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible<boost::bidir_adj_list_traversal_tag, boost::incidence_graph_tag>’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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::bidir_adj_list_traversal_tag, boost::incidence_graph_tag>]’
32 | inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
| ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied<boost::Convertible<boost::bidir_adj_list_traversal_tag, boost::incidence_graph_tag> >::value’
44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied<boost::Convertible<boost::bidir_adj_list_traversal_tag, boost::incidence_graph_tag> >’
45 | typedef boost::integral_constant<bool, value> type;
| ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 8 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied<boost::concepts::BidirectionalGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::bidirectionalS, boost::property<boost::vertex_index_t, int> > > >::value’
44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied<boost::concepts::BidirectionalGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::bidirectionalS, boost::property<boost::vertex_index_t, int> > > >’
45 | typedef boost::integral_constant<bool, value> type;
| ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_<void (*)(boost::concepts::BidirectionalGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::bidirectionalS, boost::property<boost::vertex_index_t, int> > >)>’
72 | struct requirement_<void(*)(Model)>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dominator_tree.hpp:245:5: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename graph_traits<Graph>::vertex_descriptor&, const IndexMap&, TimeMap, PredMap, VertexVector&, DomTreePredMap) [with Graph = adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >; IndexMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; TimeMap = iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>, long unsigned int, long unsigned int&>; PredMap = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>, void*, void*&>; VertexVector = std::vector<void*>; DomTreePredMap = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, int&, vertex_index_t> >; typename graph_traits<Graph>::vertex_descriptor = void*]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dominator_tree.hpp:360:35: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename graph_traits<Graph>::vertex_descriptor&, DomTreePredMap) [with Graph = adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >; DomTreePredMap = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, int&, vertex_index_t> >; typename graph_traits<Graph>::vertex_descriptor = void*]’
360 | lengauer_tarjan_dominator_tree(g, entry, indexMap, dfnumMap, parentMap,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
361 | verticesByDFNum, domTreePredMap);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
dominatorTree.cpp:46:36: required from here
46 | lengauer_tarjan_dominator_tree(g, vertex(v, g), domTreePredMap);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
20 | ~usage_requirements() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/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::bidir_adj_list_traversal_tag; Y = boost::incidence_graph_tag]’
37 | ~model()
| ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
208 | BOOST_CONCEPT_USAGE(Convertible) {
| ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/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::in_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property>*, std::vector<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property>, std::allocator<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl<boost::bidirectional_tag, void*>, long int> > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:145:5: required from ‘struct boost::Assignable<boost::detail::in_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property>*, std::vector<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property>, std::allocator<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl<boost::bidirectional_tag, void*>, long int> >’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator<boost::detail::in_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property>*, std::vector<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property>, std::allocator<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl<boost::bidirectional_tag, void*>, long int> >’
502 | BOOST_concept(InputIterator,(TT))
| ^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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::in_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property>*, std::vector<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property>, std::allocator<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl<boost::bidirectional_tag, void*>, long int> >]’
32 | inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
| ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied<boost::InputIterator<boost::detail::in_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property>*, std::vector<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property>, std::allocator<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl<boost::bidirectional_tag, void*>, long int> > >::value’
44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied<boost::InputIterator<boost::detail::in_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property>*, std::vector<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property>, std::allocator<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl<boost::bidirectional_tag, void*>, long int> > >’
45 | typedef boost::integral_constant<bool, value> type;
| ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/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::in_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property>*, std::vector<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property>, std::allocator<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl<boost::bidirectional_tag, void*>, long int> >]’
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:125:9: required from ‘boost::concepts::BidirectionalGraph<G>::~BidirectionalGraph() [with G = boost::adjacency_list<boost::vecS, boost::listS, boost::bidirectionalS, boost::property<boost::vertex_index_t, int> >]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:118:1: required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::BidirectionalGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::bidirectionalS, boost::property<boost::vertex_index_t, int> > >]’
118 | BOOST_concept(BidirectionalGraph, (G)) : IncidenceGraph< G >
| ^~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dominator_tree.hpp:245:5: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename graph_traits<Graph>::vertex_descriptor&, const IndexMap&, TimeMap, PredMap, VertexVector&, DomTreePredMap) [with Graph = adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >; IndexMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; TimeMap = iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>, long unsigned int, long unsigned int&>; PredMap = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>, void*, void*&>; VertexVector = std::vector<void*>; DomTreePredMap = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, int&, vertex_index_t> >; typename graph_traits<Graph>::vertex_descriptor = void*]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dominator_tree.hpp:360:35: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename graph_traits<Graph>::vertex_descriptor&, DomTreePredMap) [with Graph = adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >; DomTreePredMap = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, int&, vertex_index_t> >; typename graph_traits<Graph>::vertex_descriptor = void*]’
360 | lengauer_tarjan_dominator_tree(g, entry, indexMap, dfnumMap, parentMap,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
361 | verticesByDFNum, domTreePredMap);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
dominatorTree.cpp:46:36: required from here
46 | lengauer_tarjan_dominator_tree(g, vertex(v, g), domTreePredMap);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/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::in_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property>*, std::vector<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property>, std::allocator<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl<boost::bidirectional_tag, void*>, long int> >]’
20 | ~usage_requirements() { ((Model*)0)->~Model(); }
| ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/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::in_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property>*, std::vector<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property>, std::allocator<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl<boost::bidirectional_tag, void*>, long int> > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable<boost::detail::in_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property>*, std::vector<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property>, std::allocator<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl<boost::bidirectional_tag, void*>, long int> >’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator<boost::detail::in_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property>*, std::vector<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property>, std::allocator<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl<boost::bidirectional_tag, void*>, long int> >’
502 | BOOST_concept(InputIterator,(TT))
| ^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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::in_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property>*, std::vector<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property>, std::allocator<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl<boost::bidirectional_tag, void*>, long int> >]’
32 | inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
| ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied<boost::InputIterator<boost::detail::in_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property>*, std::vector<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property>, std::allocator<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl<boost::bidirectional_tag, void*>, long int> > >::value’
44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied<boost::InputIterator<boost::detail::in_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property>*, std::vector<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property>, std::allocator<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl<boost::bidirectional_tag, void*>, long int> > >’
45 | typedef boost::integral_constant<bool, value> type;
| ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/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::in_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property>*, std::vector<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property>, std::allocator<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl<boost::bidirectional_tag, void*>, long int> >]’
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:125:9: required from ‘boost::concepts::BidirectionalGraph<G>::~BidirectionalGraph() [with G = boost::adjacency_list<boost::vecS, boost::listS, boost::bidirectionalS, boost::property<boost::vertex_index_t, int> >]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:118:1: required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::BidirectionalGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::bidirectionalS, boost::property<boost::vertex_index_t, int> > >]’
118 | BOOST_concept(BidirectionalGraph, (G)) : IncidenceGraph< G >
| ^~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dominator_tree.hpp:245:5: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename graph_traits<Graph>::vertex_descriptor&, const IndexMap&, TimeMap, PredMap, VertexVector&, DomTreePredMap) [with Graph = adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >; IndexMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; TimeMap = iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>, long unsigned int, long unsigned int&>; PredMap = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>, void*, void*&>; VertexVector = std::vector<void*>; DomTreePredMap = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, int&, vertex_index_t> >; typename graph_traits<Graph>::vertex_descriptor = void*]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dominator_tree.hpp:360:35: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename graph_traits<Graph>::vertex_descriptor&, DomTreePredMap) [with Graph = adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >; DomTreePredMap = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, int&, vertex_index_t> >; typename graph_traits<Graph>::vertex_descriptor = void*]’
360 | lengauer_tarjan_dominator_tree(g, entry, indexMap, dfnumMap, parentMap,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
361 | verticesByDFNum, domTreePredMap);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
dominatorTree.cpp:46:36: required from here
46 | lengauer_tarjan_dominator_tree(g, vertex(v, g), domTreePredMap);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/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::in_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property>*, std::vector<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property>, std::allocator<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl<boost::bidirectional_tag, void*>, long int> >]’
20 | ~usage_requirements() { ((Model*)0)->~Model(); }
| ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/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::in_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property>*, std::vector<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property>, std::allocator<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl<boost::bidirectional_tag, void*>, long int> > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:512:7: required from ‘struct boost::InputIterator<boost::detail::in_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property>*, std::vector<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property>, std::allocator<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl<boost::bidirectional_tag, void*>, long int> >’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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::in_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property>*, std::vector<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property>, std::allocator<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl<boost::bidirectional_tag, void*>, long int> >]’
32 | inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
| ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied<boost::InputIterator<boost::detail::in_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property>*, std::vector<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property>, std::allocator<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl<boost::bidirectional_tag, void*>, long int> > >::value’
44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied<boost::InputIterator<boost::detail::in_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property>*, std::vector<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property>, std::allocator<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl<boost::bidirectional_tag, void*>, long int> > >’
45 | typedef boost::integral_constant<bool, value> type;
| ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/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::in_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property>*, std::vector<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property>, std::allocator<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl<boost::bidirectional_tag, void*>, long int> >]’
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:125:9: required from ‘boost::concepts::BidirectionalGraph<G>::~BidirectionalGraph() [with G = boost::adjacency_list<boost::vecS, boost::listS, boost::bidirectionalS, boost::property<boost::vertex_index_t, int> >]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:118:1: required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::BidirectionalGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::bidirectionalS, boost::property<boost::vertex_index_t, int> > >]’
118 | BOOST_concept(BidirectionalGraph, (G)) : IncidenceGraph< G >
| ^~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dominator_tree.hpp:245:5: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename graph_traits<Graph>::vertex_descriptor&, const IndexMap&, TimeMap, PredMap, VertexVector&, DomTreePredMap) [with Graph = adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >; IndexMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; TimeMap = iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>, long unsigned int, long unsigned int&>; PredMap = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>, void*, void*&>; VertexVector = std::vector<void*>; DomTreePredMap = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, int&, vertex_index_t> >; typename graph_traits<Graph>::vertex_descriptor = void*]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dominator_tree.hpp:360:35: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename graph_traits<Graph>::vertex_descriptor&, DomTreePredMap) [with Graph = adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >; DomTreePredMap = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, int&, vertex_index_t> >; typename graph_traits<Graph>::vertex_descriptor = void*]’
360 | lengauer_tarjan_dominator_tree(g, entry, indexMap, dfnumMap, parentMap,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
361 | verticesByDFNum, domTreePredMap);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
dominatorTree.cpp:46:36: required from here
46 | lengauer_tarjan_dominator_tree(g, vertex(v, g), domTreePredMap);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/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::in_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property>*, std::vector<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property>, std::allocator<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl<boost::bidirectional_tag, void*>, long int> >]’
20 | ~usage_requirements() { ((Model*)0)->~Model(); }
| ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/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::in_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property>*, std::vector<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property>, std::allocator<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl<boost::bidirectional_tag, void*>, long int> >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:53:35: required from ‘boost::concepts::MultiPassInputIterator<T>::~MultiPassInputIterator() [with T = boost::detail::in_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property>*, std::vector<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property>, std::allocator<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl<boost::bidirectional_tag, void*>, long int>]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/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::in_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property>*, std::vector<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property>, std::allocator<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl<boost::bidirectional_tag, void*>, long int> >]’
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:125:9: required from ‘boost::concepts::BidirectionalGraph<G>::~BidirectionalGraph() [with G = boost::adjacency_list<boost::vecS, boost::listS, boost::bidirectionalS, boost::property<boost::vertex_index_t, int> >]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:118:1: required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::BidirectionalGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::bidirectionalS, boost::property<boost::vertex_index_t, int> > >]’
118 | BOOST_concept(BidirectionalGraph, (G)) : IncidenceGraph< G >
| ^~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dominator_tree.hpp:245:5: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename graph_traits<Graph>::vertex_descriptor&, const IndexMap&, TimeMap, PredMap, VertexVector&, DomTreePredMap) [with Graph = adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >; IndexMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; TimeMap = iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>, long unsigned int, long unsigned int&>; PredMap = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>, void*, void*&>; VertexVector = std::vector<void*>; DomTreePredMap = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, int&, vertex_index_t> >; typename graph_traits<Graph>::vertex_descriptor = void*]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dominator_tree.hpp:360:35: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename graph_traits<Graph>::vertex_descriptor&, DomTreePredMap) [with Graph = adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >; DomTreePredMap = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, int&, vertex_index_t> >; typename graph_traits<Graph>::vertex_descriptor = void*]’
360 | lengauer_tarjan_dominator_tree(g, entry, indexMap, dfnumMap, parentMap,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
361 | verticesByDFNum, domTreePredMap);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
dominatorTree.cpp:46:36: required from here
46 | lengauer_tarjan_dominator_tree(g, vertex(v, g), domTreePredMap);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/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::in_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property>*, std::vector<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property>, std::allocator<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl<boost::bidirectional_tag, void*>, long int>]’
37 | ~model()
| ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:512:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
512 | BOOST_CONCEPT_USAGE(InputIterator)
| ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::CopyConstructible<boost::dfs_visitor<std::pair<boost::predecessor_recorder<boost::iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::bidirectionalS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t>, void*, void*&>, boost::on_tree_edge>, boost::detail::time_stamper_with_vertex_vector<boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::bidirectionalS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t>, long unsigned int, long unsigned int&>, std::vector<void*>, long unsigned int, boost::on_discover_vertex> > > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/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::dfs_visitor<std::pair<boost::predecessor_recorder<boost::iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::bidirectionalS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t>, void*, void*&>, boost::on_tree_edge>, boost::detail::time_stamper_with_vertex_vector<boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::bidirectionalS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t>, long unsigned int, long unsigned int&>, std::vector<void*>, long unsigned int, boost::on_discover_vertex> > > > >]’
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:167:5: required from ‘struct boost::CopyConstructible<boost::dfs_visitor<std::pair<boost::predecessor_recorder<boost::iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::bidirectionalS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t>, void*, void*&>, boost::on_tree_edge>, boost::detail::time_stamper_with_vertex_vector<boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::bidirectionalS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t>, long unsigned int, long unsigned int&>, std::vector<void*>, long unsigned int, boost::on_discover_vertex> > > >’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:165:3: required from ‘struct boost::CopyConstructibleConcept<boost::dfs_visitor<std::pair<boost::predecessor_recorder<boost::iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::bidirectionalS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t>, void*, void*&>, boost::on_tree_edge>, boost::detail::time_stamper_with_vertex_vector<boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::bidirectionalS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t>, long unsigned int, long unsigned int&>, std::vector<void*>, long unsigned int, boost::on_discover_vertex> > > >’
165 | BOOST_concept(CopyConstructible,(TT))
| ^~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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::dfs_visitor<std::pair<boost::predecessor_recorder<boost::iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::bidirectionalS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t>, void*, void*&>, boost::on_tree_edge>, boost::detail::time_stamper_with_vertex_vector<boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::bidirectionalS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t>, long unsigned int, long unsigned int&>, std::vector<void*>, long unsigned int, boost::on_discover_vertex> > > >]’
32 | inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
| ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied<boost::CopyConstructibleConcept<boost::dfs_visitor<std::pair<boost::predecessor_recorder<boost::iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::bidirectionalS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t>, void*, void*&>, boost::on_tree_edge>, boost::detail::time_stamper_with_vertex_vector<boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::bidirectionalS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t>, long unsigned int, long unsigned int&>, std::vector<void*>, long unsigned int, boost::on_discover_vertex> > > > >::value’
44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 6 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_<void (*)(boost::DFSVisitorConcept<boost::dfs_visitor<std::pair<boost::predecessor_recorder<boost::iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::bidirectionalS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t>, void*, void*&>, boost::on_tree_edge>, boost::detail::time_stamper_with_vertex_vector<boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::bidirectionalS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t>, long unsigned int, long unsigned int&>, std::vector<void*>, long unsigned int, boost::on_discover_vertex> > >, boost::adjacency_list<boost::vecS, boost::listS, boost::bidirectionalS, boost::property<boost::vertex_index_t, int> > >)>’
72 | struct requirement_<void(*)(Model)>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:130:9: required from ‘void boost::detail::depth_first_visit_impl(const IncidenceGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, DFSVisitor&, ColorMap, TerminatorFunc) [with IncidenceGraph = boost::adjacency_list<boost::vecS, boost::listS, boost::bidirectionalS, boost::property<boost::vertex_index_t, int> >; DFSVisitor = boost::dfs_visitor<std::pair<boost::predecessor_recorder<boost::iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::bidirectionalS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t>, void*, void*&>, boost::on_tree_edge>, time_stamper_with_vertex_vector<boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::bidirectionalS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t>, long unsigned int, long unsigned int&>, std::vector<void*>, long unsigned int, boost::on_discover_vertex> > >; ColorMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::bidirectionalS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t>, boost::default_color_type, boost::default_color_type&>; TerminatorFunc = nontruth2; typename boost::graph_traits<Graph>::vertex_descriptor = void*]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:417:35: required from ‘void boost::depth_first_visit(const IncidenceGraph&, typename graph_traits<Graph>::vertex_descriptor, DFSVisitor, ColorMap) [with IncidenceGraph = adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >; DFSVisitor = dfs_visitor<std::pair<predecessor_recorder<iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>, void*, void*&>, on_tree_edge>, detail::time_stamper_with_vertex_vector<iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>, long unsigned int, long unsigned int&>, std::vector<void*>, long unsigned int, on_discover_vertex> > >; ColorMap = iterator_property_map<__gnu_cxx::__normal_iterator<default_color_type*, std::vector<default_color_type> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>, default_color_type, default_color_type&>; typename graph_traits<Graph>::vertex_descriptor = void*]’
417 | detail::depth_first_visit_impl(g, u, vis, color, detail::nontruth2());
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dominator_tree.hpp:309:22: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename graph_traits<Graph>::vertex_descriptor&, const IndexMap&, TimeMap, PredMap, VertexVector&, DomTreePredMap) [with Graph = adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >; IndexMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; TimeMap = iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>, long unsigned int, long unsigned int&>; PredMap = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>, void*, void*&>; VertexVector = std::vector<void*>; DomTreePredMap = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, int&, vertex_index_t> >; typename graph_traits<Graph>::vertex_descriptor = void*]’
309 | depth_first_visit(g, entry,
| ~~~~~~~~~~~~~~~~~^~~~~~~~~~
310 | make_dfs_visitor(
| ~~~~~~~~~~~~~~~~~
311 | make_pair(record_predecessors(parentMap, on_tree_edge()),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
312 | detail::stamp_times_with_vertex_vector(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
313 | dfnumMap, verticesByDFNum, time, on_discover_vertex()))),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
314 | make_iterator_property_map(colors.begin(), indexMap));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dominator_tree.hpp:360:35: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename graph_traits<Graph>::vertex_descriptor&, DomTreePredMap) [with Graph = adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >; DomTreePredMap = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, int&, vertex_index_t> >; typename graph_traits<Graph>::vertex_descriptor = void*]’
360 | lengauer_tarjan_dominator_tree(g, entry, indexMap, dfnumMap, parentMap,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
361 | verticesByDFNum, domTreePredMap);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
dominatorTree.cpp:46:36: required from here
46 | lengauer_tarjan_dominator_tree(g, vertex(v, g), domTreePredMap);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
20 | ~usage_requirements() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::CopyConstructible<TT>::~CopyConstructible() [with TT = boost::dfs_visitor<std::pair<boost::predecessor_recorder<boost::iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::bidirectionalS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t>, void*, void*&>, boost::on_tree_edge>, boost::detail::time_stamper_with_vertex_vector<boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::bidirectionalS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t>, long unsigned int, long unsigned int&>, std::vector<void*>, long unsigned int, boost::on_discover_vertex> > >]’
37 | ~model()
| ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:167:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
167 | BOOST_CONCEPT_USAGE(CopyConstructible) {
| ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Convertible<boost::lvalue_property_map_tag, boost::readable_property_map_tag> >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/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> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/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))
| ^~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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);
| ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/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) );
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/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;
| ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 10 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_<void (*)(boost::ReadWritePropertyMapConcept<boost::iterator_property_map<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::bidirectionalS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t>, boost::default_color_type, boost::default_color_type&>, void*>)>’
72 | struct requirement_<void(*)(Model)>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:134:9: required from ‘void boost::detail::depth_first_visit_impl(const IncidenceGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, DFSVisitor&, ColorMap, TerminatorFunc) [with IncidenceGraph = boost::adjacency_list<boost::vecS, boost::listS, boost::bidirectionalS, boost::property<boost::vertex_index_t, int> >; DFSVisitor = boost::dfs_visitor<std::pair<boost::predecessor_recorder<boost::iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::bidirectionalS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t>, void*, void*&>, boost::on_tree_edge>, time_stamper_with_vertex_vector<boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::bidirectionalS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t>, long unsigned int, long unsigned int&>, std::vector<void*>, long unsigned int, boost::on_discover_vertex> > >; ColorMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::bidirectionalS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t>, boost::default_color_type, boost::default_color_type&>; TerminatorFunc = nontruth2; typename boost::graph_traits<Graph>::vertex_descriptor = void*]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:417:35: required from ‘void boost::depth_first_visit(const IncidenceGraph&, typename graph_traits<Graph>::vertex_descriptor, DFSVisitor, ColorMap) [with IncidenceGraph = adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >; DFSVisitor = dfs_visitor<std::pair<predecessor_recorder<iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>, void*, void*&>, on_tree_edge>, detail::time_stamper_with_vertex_vector<iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>, long unsigned int, long unsigned int&>, std::vector<void*>, long unsigned int, on_discover_vertex> > >; ColorMap = iterator_property_map<__gnu_cxx::__normal_iterator<default_color_type*, std::vector<default_color_type> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>, default_color_type, default_color_type&>; typename graph_traits<Graph>::vertex_descriptor = void*]’
417 | detail::depth_first_visit_impl(g, u, vis, color, detail::nontruth2());
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dominator_tree.hpp:309:22: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename graph_traits<Graph>::vertex_descriptor&, const IndexMap&, TimeMap, PredMap, VertexVector&, DomTreePredMap) [with Graph = adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >; IndexMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; TimeMap = iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>, long unsigned int, long unsigned int&>; PredMap = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>, void*, void*&>; VertexVector = std::vector<void*>; DomTreePredMap = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, int&, vertex_index_t> >; typename graph_traits<Graph>::vertex_descriptor = void*]’
309 | depth_first_visit(g, entry,
| ~~~~~~~~~~~~~~~~~^~~~~~~~~~
310 | make_dfs_visitor(
| ~~~~~~~~~~~~~~~~~
311 | make_pair(record_predecessors(parentMap, on_tree_edge()),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
312 | detail::stamp_times_with_vertex_vector(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
313 | dfnumMap, verticesByDFNum, time, on_discover_vertex()))),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
314 | make_iterator_property_map(colors.begin(), indexMap));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dominator_tree.hpp:360:35: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename graph_traits<Graph>::vertex_descriptor&, DomTreePredMap) [with Graph = adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >; DomTreePredMap = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, int&, vertex_index_t> >; typename graph_traits<Graph>::vertex_descriptor = void*]’
360 | lengauer_tarjan_dominator_tree(g, entry, indexMap, dfnumMap, parentMap,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
361 | verticesByDFNum, domTreePredMap);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
dominatorTree.cpp:46:36: required from here
46 | lengauer_tarjan_dominator_tree(g, vertex(v, g), domTreePredMap);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Convertible<boost::lvalue_property_map_tag, boost::readable_property_map_tag>]’
20 | ~usage_requirements() { ((Model*)0)->~Model(); }
| ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::ConvertibleConcept<boost::lvalue_property_map_tag, boost::readable_property_map_tag>]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:148:7: required from ‘void boost::ReadablePropertyMapConcept<PMap, Key>::constraints() [with PMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::bidirectionalS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t>, boost::default_color_type, boost::default_color_type&>; Key = void*]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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::iterator_property_map<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::bidirectionalS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t>, boost::default_color_type, boost::default_color_type&>, void*>]’
32 | inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
| ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied<boost::ReadablePropertyMapConcept<boost::iterator_property_map<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::bidirectionalS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t>, boost::default_color_type, boost::default_color_type&>, void*> >::value’
44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied<boost::ReadablePropertyMapConcept<boost::iterator_property_map<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::bidirectionalS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t>, boost::default_color_type, boost::default_color_type&>, void*> >’
45 | typedef boost::integral_constant<bool, value> type;
| ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_<void (*)(boost::ReadablePropertyMapConcept<boost::iterator_property_map<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::bidirectionalS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t>, boost::default_color_type, boost::default_color_type&>, void*>)>’
72 | struct requirement_<void(*)(Model)>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:206:7: [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_<void (*)(boost::ReadWritePropertyMapConcept<boost::iterator_property_map<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::bidirectionalS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t>, boost::default_color_type, boost::default_color_type&>, void*>)>’
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:134:9: required from ‘void boost::detail::depth_first_visit_impl(const IncidenceGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, DFSVisitor&, ColorMap, TerminatorFunc) [with IncidenceGraph = boost::adjacency_list<boost::vecS, boost::listS, boost::bidirectionalS, boost::property<boost::vertex_index_t, int> >; DFSVisitor = boost::dfs_visitor<std::pair<boost::predecessor_recorder<boost::iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::bidirectionalS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t>, void*, void*&>, boost::on_tree_edge>, time_stamper_with_vertex_vector<boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::bidirectionalS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t>, long unsigned int, long unsigned int&>, std::vector<void*>, long unsigned int, boost::on_discover_vertex> > >; ColorMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::bidirectionalS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t>, boost::default_color_type, boost::default_color_type&>; TerminatorFunc = nontruth2; typename boost::graph_traits<Graph>::vertex_descriptor = void*]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:417:35: required from ‘void boost::depth_first_visit(const IncidenceGraph&, typename graph_traits<Graph>::vertex_descriptor, DFSVisitor, ColorMap) [with IncidenceGraph = adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >; DFSVisitor = dfs_visitor<std::pair<predecessor_recorder<iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>, void*, void*&>, on_tree_edge>, detail::time_stamper_with_vertex_vector<iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>, long unsigned int, long unsigned int&>, std::vector<void*>, long unsigned int, on_discover_vertex> > >; ColorMap = iterator_property_map<__gnu_cxx::__normal_iterator<default_color_type*, std::vector<default_color_type> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>, default_color_type, default_color_type&>; typename graph_traits<Graph>::vertex_descriptor = void*]’
417 | detail::depth_first_visit_impl(g, u, vis, color, detail::nontruth2());
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dominator_tree.hpp:309:22: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename graph_traits<Graph>::vertex_descriptor&, const IndexMap&, TimeMap, PredMap, VertexVector&, DomTreePredMap) [with Graph = adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >; IndexMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; TimeMap = iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>, long unsigned int, long unsigned int&>; PredMap = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>, void*, void*&>; VertexVector = std::vector<void*>; DomTreePredMap = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, int&, vertex_index_t> >; typename graph_traits<Graph>::vertex_descriptor = void*]’
309 | depth_first_visit(g, entry,
| ~~~~~~~~~~~~~~~~~^~~~~~~~~~
310 | make_dfs_visitor(
| ~~~~~~~~~~~~~~~~~
311 | make_pair(record_predecessors(parentMap, on_tree_edge()),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
312 | detail::stamp_times_with_vertex_vector(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
313 | dfnumMap, verticesByDFNum, time, on_discover_vertex()))),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
314 | make_iterator_property_map(colors.begin(), indexMap));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dominator_tree.hpp:360:35: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename graph_traits<Graph>::vertex_descriptor&, DomTreePredMap) [with Graph = adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >; DomTreePredMap = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, int&, vertex_index_t> >; typename graph_traits<Graph>::vertex_descriptor = void*]’
360 | lengauer_tarjan_dominator_tree(g, entry, indexMap, dfnumMap, parentMap,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
361 | verticesByDFNum, domTreePredMap);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
dominatorTree.cpp:46:36: required from here
46 | lengauer_tarjan_dominator_tree(g, vertex(v, g), domTreePredMap);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:206:17: note: in a call to non-static member function ‘boost::ConvertibleConcept<boost::lvalue_property_map_tag, boost::readable_property_map_tag>::~ConvertibleConcept()’
206 | BOOST_concept(Convertible,(X)(Y))
| ^~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/preprocessor/cat.hpp:29:34: note: in definition of macro ‘BOOST_PP_CAT_I’
29 | # define BOOST_PP_CAT_I(a, b) a ## b
| ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/concept_def.hpp:23:12: note: in expansion of macro ‘BOOST_PP_CAT’
23 | struct BOOST_PP_CAT(name,Concept) \
| ^~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:206:3: note: in expansion of macro ‘BOOST_concept’
206 | BOOST_concept(Convertible,(X)(Y))
| ^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Convertible<boost::lvalue_property_map_tag, boost::writable_property_map_tag> >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/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> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/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))
| ^~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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);
| ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/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) );
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/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;
| ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 10 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_<void (*)(boost::ReadWritePropertyMapConcept<boost::iterator_property_map<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::bidirectionalS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t>, boost::default_color_type, boost::default_color_type&>, void*>)>’
72 | struct requirement_<void(*)(Model)>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:134:9: required from ‘void boost::detail::depth_first_visit_impl(const IncidenceGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, DFSVisitor&, ColorMap, TerminatorFunc) [with IncidenceGraph = boost::adjacency_list<boost::vecS, boost::listS, boost::bidirectionalS, boost::property<boost::vertex_index_t, int> >; DFSVisitor = boost::dfs_visitor<std::pair<boost::predecessor_recorder<boost::iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::bidirectionalS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t>, void*, void*&>, boost::on_tree_edge>, time_stamper_with_vertex_vector<boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::bidirectionalS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t>, long unsigned int, long unsigned int&>, std::vector<void*>, long unsigned int, boost::on_discover_vertex> > >; ColorMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::bidirectionalS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t>, boost::default_color_type, boost::default_color_type&>; TerminatorFunc = nontruth2; typename boost::graph_traits<Graph>::vertex_descriptor = void*]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:417:35: required from ‘void boost::depth_first_visit(const IncidenceGraph&, typename graph_traits<Graph>::vertex_descriptor, DFSVisitor, ColorMap) [with IncidenceGraph = adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >; DFSVisitor = dfs_visitor<std::pair<predecessor_recorder<iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>, void*, void*&>, on_tree_edge>, detail::time_stamper_with_vertex_vector<iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>, long unsigned int, long unsigned int&>, std::vector<void*>, long unsigned int, on_discover_vertex> > >; ColorMap = iterator_property_map<__gnu_cxx::__normal_iterator<default_color_type*, std::vector<default_color_type> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>, default_color_type, default_color_type&>; typename graph_traits<Graph>::vertex_descriptor = void*]’
417 | detail::depth_first_visit_impl(g, u, vis, color, detail::nontruth2());
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dominator_tree.hpp:309:22: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename graph_traits<Graph>::vertex_descriptor&, const IndexMap&, TimeMap, PredMap, VertexVector&, DomTreePredMap) [with Graph = adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >; IndexMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; TimeMap = iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>, long unsigned int, long unsigned int&>; PredMap = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>, void*, void*&>; VertexVector = std::vector<void*>; DomTreePredMap = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, int&, vertex_index_t> >; typename graph_traits<Graph>::vertex_descriptor = void*]’
309 | depth_first_visit(g, entry,
| ~~~~~~~~~~~~~~~~~^~~~~~~~~~
310 | make_dfs_visitor(
| ~~~~~~~~~~~~~~~~~
311 | make_pair(record_predecessors(parentMap, on_tree_edge()),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
312 | detail::stamp_times_with_vertex_vector(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
313 | dfnumMap, verticesByDFNum, time, on_discover_vertex()))),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
314 | make_iterator_property_map(colors.begin(), indexMap));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dominator_tree.hpp:360:35: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename graph_traits<Graph>::vertex_descriptor&, DomTreePredMap) [with Graph = adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >; DomTreePredMap = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, int&, vertex_index_t> >; typename graph_traits<Graph>::vertex_descriptor = void*]’
360 | lengauer_tarjan_dominator_tree(g, entry, indexMap, dfnumMap, parentMap,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
361 | verticesByDFNum, domTreePredMap);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
dominatorTree.cpp:46:36: required from here
46 | lengauer_tarjan_dominator_tree(g, vertex(v, g), domTreePredMap);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Convertible<boost::lvalue_property_map_tag, boost::writable_property_map_tag>]’
20 | ~usage_requirements() { ((Model*)0)->~Model(); }
| ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::ConvertibleConcept<boost::lvalue_property_map_tag, boost::writable_property_map_tag>]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:180:7: required from ‘void boost::WritablePropertyMapConcept<PMap, Key>::constraints() [with PMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::bidirectionalS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t>, boost::default_color_type, boost::default_color_type&>; Key = void*]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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::iterator_property_map<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::bidirectionalS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t>, boost::default_color_type, boost::default_color_type&>, void*>]’
32 | inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
| ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied<boost::WritablePropertyMapConcept<boost::iterator_property_map<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::bidirectionalS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t>, boost::default_color_type, boost::default_color_type&>, void*> >::value’
44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied<boost::WritablePropertyMapConcept<boost::iterator_property_map<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::bidirectionalS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t>, boost::default_color_type, boost::default_color_type&>, void*> >’
45 | typedef boost::integral_constant<bool, value> type;
| ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_<void (*)(boost::WritablePropertyMapConcept<boost::iterator_property_map<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::bidirectionalS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t>, boost::default_color_type, boost::default_color_type&>, void*>)>’
72 | struct requirement_<void(*)(Model)>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:207:7: [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_<void (*)(boost::ReadWritePropertyMapConcept<boost::iterator_property_map<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::bidirectionalS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t>, boost::default_color_type, boost::default_color_type&>, void*>)>’
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:134:9: required from ‘void boost::detail::depth_first_visit_impl(const IncidenceGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, DFSVisitor&, ColorMap, TerminatorFunc) [with IncidenceGraph = boost::adjacency_list<boost::vecS, boost::listS, boost::bidirectionalS, boost::property<boost::vertex_index_t, int> >; DFSVisitor = boost::dfs_visitor<std::pair<boost::predecessor_recorder<boost::iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::bidirectionalS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t>, void*, void*&>, boost::on_tree_edge>, time_stamper_with_vertex_vector<boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::bidirectionalS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t>, long unsigned int, long unsigned int&>, std::vector<void*>, long unsigned int, boost::on_discover_vertex> > >; ColorMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::bidirectionalS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t>, boost::default_color_type, boost::default_color_type&>; TerminatorFunc = nontruth2; typename boost::graph_traits<Graph>::vertex_descriptor = void*]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:417:35: required from ‘void boost::depth_first_visit(const IncidenceGraph&, typename graph_traits<Graph>::vertex_descriptor, DFSVisitor, ColorMap) [with IncidenceGraph = adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >; DFSVisitor = dfs_visitor<std::pair<predecessor_recorder<iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>, void*, void*&>, on_tree_edge>, detail::time_stamper_with_vertex_vector<iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>, long unsigned int, long unsigned int&>, std::vector<void*>, long unsigned int, on_discover_vertex> > >; ColorMap = iterator_property_map<__gnu_cxx::__normal_iterator<default_color_type*, std::vector<default_color_type> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>, default_color_type, default_color_type&>; typename graph_traits<Graph>::vertex_descriptor = void*]’
417 | detail::depth_first_visit_impl(g, u, vis, color, detail::nontruth2());
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dominator_tree.hpp:309:22: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename graph_traits<Graph>::vertex_descriptor&, const IndexMap&, TimeMap, PredMap, VertexVector&, DomTreePredMap) [with Graph = adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >; IndexMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; TimeMap = iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>, long unsigned int, long unsigned int&>; PredMap = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>, void*, void*&>; VertexVector = std::vector<void*>; DomTreePredMap = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, int&, vertex_index_t> >; typename graph_traits<Graph>::vertex_descriptor = void*]’
309 | depth_first_visit(g, entry,
| ~~~~~~~~~~~~~~~~~^~~~~~~~~~
310 | make_dfs_visitor(
| ~~~~~~~~~~~~~~~~~
311 | make_pair(record_predecessors(parentMap, on_tree_edge()),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
312 | detail::stamp_times_with_vertex_vector(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
313 | dfnumMap, verticesByDFNum, time, on_discover_vertex()))),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
314 | make_iterator_property_map(colors.begin(), indexMap));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dominator_tree.hpp:360:35: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename graph_traits<Graph>::vertex_descriptor&, DomTreePredMap) [with Graph = adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >; DomTreePredMap = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, int&, vertex_index_t> >; typename graph_traits<Graph>::vertex_descriptor = void*]’
360 | lengauer_tarjan_dominator_tree(g, entry, indexMap, dfnumMap, parentMap,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
361 | verticesByDFNum, domTreePredMap);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
dominatorTree.cpp:46:36: required from here
46 | lengauer_tarjan_dominator_tree(g, vertex(v, g), domTreePredMap);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:206:17: note: in a call to non-static member function ‘boost::ConvertibleConcept<boost::lvalue_property_map_tag, boost::writable_property_map_tag>::~ConvertibleConcept()’
206 | BOOST_concept(Convertible,(X)(Y))
| ^~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/preprocessor/cat.hpp:29:34: note: in definition of macro ‘BOOST_PP_CAT_I’
29 | # define BOOST_PP_CAT_I(a, b) a ## b
| ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/concept_def.hpp:23:12: note: in expansion of macro ‘BOOST_PP_CAT’
23 | struct BOOST_PP_CAT(name,Concept) \
| ^~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:206:3: note: in expansion of macro ‘BOOST_concept’
206 | BOOST_concept(Convertible,(X)(Y))
| ^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Convertible<boost::lvalue_property_map_tag, boost::read_write_property_map_tag>]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/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(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/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> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/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))
| ^~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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);
| ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/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) );
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 6 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_<void (*)(boost::ReadWritePropertyMapConcept<boost::iterator_property_map<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::bidirectionalS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t>, boost::default_color_type, boost::default_color_type&>, void*>)>’
72 | struct requirement_<void(*)(Model)>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:134:9: required from ‘void boost::detail::depth_first_visit_impl(const IncidenceGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, DFSVisitor&, ColorMap, TerminatorFunc) [with IncidenceGraph = boost::adjacency_list<boost::vecS, boost::listS, boost::bidirectionalS, boost::property<boost::vertex_index_t, int> >; DFSVisitor = boost::dfs_visitor<std::pair<boost::predecessor_recorder<boost::iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::bidirectionalS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t>, void*, void*&>, boost::on_tree_edge>, time_stamper_with_vertex_vector<boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::bidirectionalS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t>, long unsigned int, long unsigned int&>, std::vector<void*>, long unsigned int, boost::on_discover_vertex> > >; ColorMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::bidirectionalS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t>, boost::default_color_type, boost::default_color_type&>; TerminatorFunc = nontruth2; typename boost::graph_traits<Graph>::vertex_descriptor = void*]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:417:35: required from ‘void boost::depth_first_visit(const IncidenceGraph&, typename graph_traits<Graph>::vertex_descriptor, DFSVisitor, ColorMap) [with IncidenceGraph = adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >; DFSVisitor = dfs_visitor<std::pair<predecessor_recorder<iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>, void*, void*&>, on_tree_edge>, detail::time_stamper_with_vertex_vector<iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>, long unsigned int, long unsigned int&>, std::vector<void*>, long unsigned int, on_discover_vertex> > >; ColorMap = iterator_property_map<__gnu_cxx::__normal_iterator<default_color_type*, std::vector<default_color_type> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>, default_color_type, default_color_type&>; typename graph_traits<Graph>::vertex_descriptor = void*]’
417 | detail::depth_first_visit_impl(g, u, vis, color, detail::nontruth2());
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dominator_tree.hpp:309:22: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename graph_traits<Graph>::vertex_descriptor&, const IndexMap&, TimeMap, PredMap, VertexVector&, DomTreePredMap) [with Graph = adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >; IndexMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; TimeMap = iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>, long unsigned int, long unsigned int&>; PredMap = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>, void*, void*&>; VertexVector = std::vector<void*>; DomTreePredMap = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, int&, vertex_index_t> >; typename graph_traits<Graph>::vertex_descriptor = void*]’
309 | depth_first_visit(g, entry,
| ~~~~~~~~~~~~~~~~~^~~~~~~~~~
310 | make_dfs_visitor(
| ~~~~~~~~~~~~~~~~~
311 | make_pair(record_predecessors(parentMap, on_tree_edge()),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
312 | detail::stamp_times_with_vertex_vector(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
313 | dfnumMap, verticesByDFNum, time, on_discover_vertex()))),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
314 | make_iterator_property_map(colors.begin(), indexMap));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dominator_tree.hpp:360:35: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename graph_traits<Graph>::vertex_descriptor&, DomTreePredMap) [with Graph = adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >; DomTreePredMap = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, int&, vertex_index_t> >; typename graph_traits<Graph>::vertex_descriptor = void*]’
360 | lengauer_tarjan_dominator_tree(g, entry, indexMap, dfnumMap, parentMap,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
361 | verticesByDFNum, domTreePredMap);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
dominatorTree.cpp:46:36: required from here
46 | lengauer_tarjan_dominator_tree(g, vertex(v, g), domTreePredMap);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
20 | ~usage_requirements() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible<X, Y>::~Convertible() [with X = boost::lvalue_property_map_tag; Y = boost::read_write_property_map_tag]’
37 | ~model()
| ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
208 | BOOST_CONCEPT_USAGE(Convertible) {
| ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Assignable<__gnu_cxx::__normal_iterator<std::deque<void*, std::allocator<void*> >*, std::vector<std::deque<void*, std::allocator<void*> >, std::allocator<std::deque<void*, std::allocator<void*> > > > > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/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<std::deque<void*, std::allocator<void*> >*, std::vector<std::deque<void*, std::allocator<void*> >, std::allocator<std::deque<void*, std::allocator<void*> > > > > > >]’
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:145:5: required from ‘struct boost::Assignable<__gnu_cxx::__normal_iterator<std::deque<void*, std::allocator<void*> >*, std::vector<std::deque<void*, std::allocator<void*> >, std::allocator<std::deque<void*, std::allocator<void*> > > > > >’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator<__gnu_cxx::__normal_iterator<std::deque<void*, std::allocator<void*> >*, std::vector<std::deque<void*, std::allocator<void*> >, std::allocator<std::deque<void*, std::allocator<void*> > > > > >’
502 | BOOST_concept(InputIterator,(TT))
| ^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:540:3: required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator<std::deque<void*, std::allocator<void*> >*, std::vector<std::deque<void*, std::allocator<void*> >, std::allocator<std::deque<void*, std::allocator<void*> > > > > >’
540 | BOOST_concept(ForwardIterator,(TT))
| ^~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator<std::deque<void*, std::allocator<void*> >*, std::vector<std::deque<void*, std::allocator<void*> >, std::allocator<std::deque<void*, std::allocator<void*> > > > > >’
568 | BOOST_concept(BidirectionalIterator,(TT))
| ^~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3: [ skipping 6 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map<RAIter, ID, typename std::iterator_traits< <template-parameter-1-1> >::value_type, typename std::iterator_traits< <template-parameter-1-1> >::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = __gnu_cxx::__normal_iterator<std::deque<void*, std::allocator<void*> >*, std::vector<std::deque<void*, std::allocator<void*> >, std::allocator<std::deque<void*, std::allocator<void*> > > > >; ID = adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; typename std::iterator_traits< <template-parameter-1-1> >::value_type = std::deque<void*, std::allocator<void*> >; typename std::iterator_traits< <template-parameter-1-1> >::reference = std::deque<void*, std::allocator<void*> >&]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dominator_tree.hpp:91:48: required from ‘boost::detail::dominator_visitor<Graph, IndexMap, TimeMap, PredMap, DomTreePredMap>::dominator_visitor(const Graph&, const Vertex&, const IndexMap&, DomTreePredMap) [with Graph = boost::adjacency_list<boost::vecS, boost::listS, boost::bidirectionalS, boost::property<boost::vertex_index_t, int> >; IndexMap = boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::bidirectionalS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t>; TimeMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::bidirectionalS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t>, long unsigned int, long unsigned int&>; PredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::bidirectionalS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t>, void*, void*&>; DomTreePredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::bidirectionalS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t> >; Vertex = void*]’
91 | , bucketMap_(make_iterator_property_map(buckets_.begin(), indexMap))
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dominator_tree.hpp:254:9: required from ‘void boost::lengauer_tarjan_dominator_tree_without_dfs(const Graph&, const typename graph_traits<Graph>::vertex_descriptor&, const IndexMap&, TimeMap, PredMap, VertexVector&, DomTreePredMap) [with Graph = adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >; IndexMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; TimeMap = iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>, long unsigned int, long unsigned int&>; PredMap = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>, void*, void*&>; VertexVector = std::vector<void*>; DomTreePredMap = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, int&, vertex_index_t> >; typename graph_traits<Graph>::vertex_descriptor = void*]’
254 | visitor(g, entry, indexMap, domTreePredMap);
| ^~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dominator_tree.hpp:317:47: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename graph_traits<Graph>::vertex_descriptor&, const IndexMap&, TimeMap, PredMap, VertexVector&, DomTreePredMap) [with Graph = adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >; IndexMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; TimeMap = iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>, long unsigned int, long unsigned int&>; PredMap = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>, void*, void*&>; VertexVector = std::vector<void*>; DomTreePredMap = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, int&, vertex_index_t> >; typename graph_traits<Graph>::vertex_descriptor = void*]’
317 | lengauer_tarjan_dominator_tree_without_dfs(g, entry, indexMap, dfnumMap,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
318 | parentMap, verticesByDFNum, domTreePredMap);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dominator_tree.hpp:360:35: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename graph_traits<Graph>::vertex_descriptor&, DomTreePredMap) [with Graph = adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >; DomTreePredMap = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, int&, vertex_index_t> >; typename graph_traits<Graph>::vertex_descriptor = void*]’
360 | lengauer_tarjan_dominator_tree(g, entry, indexMap, dfnumMap, parentMap,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
361 | verticesByDFNum, domTreePredMap);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
dominatorTree.cpp:46:36: required from here
46 | lengauer_tarjan_dominator_tree(g, vertex(v, g), domTreePredMap);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
20 | ~usage_requirements() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/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<std::deque<void*, std::allocator<void*> >*, std::vector<std::deque<void*, std::allocator<void*> >, std::allocator<std::deque<void*, std::allocator<void*> > > > >]’
37 | ~model()
| ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:145:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
145 | BOOST_CONCEPT_USAGE(Assignable) {
| ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::EqualityComparable<__gnu_cxx::__normal_iterator<std::deque<void*, std::allocator<void*> >*, std::vector<std::deque<void*, std::allocator<void*> >, std::allocator<std::deque<void*, std::allocator<void*> > > > > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/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<std::deque<void*, std::allocator<void*> >*, std::vector<std::deque<void*, std::allocator<void*> >, std::allocator<std::deque<void*, std::allocator<void*> > > > > > >]’
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable<__gnu_cxx::__normal_iterator<std::deque<void*, std::allocator<void*> >*, std::vector<std::deque<void*, std::allocator<void*> >, std::allocator<std::deque<void*, std::allocator<void*> > > > > >’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator<__gnu_cxx::__normal_iterator<std::deque<void*, std::allocator<void*> >*, std::vector<std::deque<void*, std::allocator<void*> >, std::allocator<std::deque<void*, std::allocator<void*> > > > > >’
502 | BOOST_concept(InputIterator,(TT))
| ^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:540:3: required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator<std::deque<void*, std::allocator<void*> >*, std::vector<std::deque<void*, std::allocator<void*> >, std::allocator<std::deque<void*, std::allocator<void*> > > > > >’
540 | BOOST_concept(ForwardIterator,(TT))
| ^~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator<std::deque<void*, std::allocator<void*> >*, std::vector<std::deque<void*, std::allocator<void*> >, std::allocator<std::deque<void*, std::allocator<void*> > > > > >’
568 | BOOST_concept(BidirectionalIterator,(TT))
| ^~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3: [ skipping 6 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map<RAIter, ID, typename std::iterator_traits< <template-parameter-1-1> >::value_type, typename std::iterator_traits< <template-parameter-1-1> >::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = __gnu_cxx::__normal_iterator<std::deque<void*, std::allocator<void*> >*, std::vector<std::deque<void*, std::allocator<void*> >, std::allocator<std::deque<void*, std::allocator<void*> > > > >; ID = adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; typename std::iterator_traits< <template-parameter-1-1> >::value_type = std::deque<void*, std::allocator<void*> >; typename std::iterator_traits< <template-parameter-1-1> >::reference = std::deque<void*, std::allocator<void*> >&]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dominator_tree.hpp:91:48: required from ‘boost::detail::dominator_visitor<Graph, IndexMap, TimeMap, PredMap, DomTreePredMap>::dominator_visitor(const Graph&, const Vertex&, const IndexMap&, DomTreePredMap) [with Graph = boost::adjacency_list<boost::vecS, boost::listS, boost::bidirectionalS, boost::property<boost::vertex_index_t, int> >; IndexMap = boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::bidirectionalS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t>; TimeMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::bidirectionalS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t>, long unsigned int, long unsigned int&>; PredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::bidirectionalS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t>, void*, void*&>; DomTreePredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::bidirectionalS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t> >; Vertex = void*]’
91 | , bucketMap_(make_iterator_property_map(buckets_.begin(), indexMap))
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dominator_tree.hpp:254:9: required from ‘void boost::lengauer_tarjan_dominator_tree_without_dfs(const Graph&, const typename graph_traits<Graph>::vertex_descriptor&, const IndexMap&, TimeMap, PredMap, VertexVector&, DomTreePredMap) [with Graph = adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >; IndexMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; TimeMap = iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>, long unsigned int, long unsigned int&>; PredMap = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>, void*, void*&>; VertexVector = std::vector<void*>; DomTreePredMap = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, int&, vertex_index_t> >; typename graph_traits<Graph>::vertex_descriptor = void*]’
254 | visitor(g, entry, indexMap, domTreePredMap);
| ^~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dominator_tree.hpp:317:47: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename graph_traits<Graph>::vertex_descriptor&, const IndexMap&, TimeMap, PredMap, VertexVector&, DomTreePredMap) [with Graph = adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >; IndexMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; TimeMap = iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>, long unsigned int, long unsigned int&>; PredMap = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>, void*, void*&>; VertexVector = std::vector<void*>; DomTreePredMap = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, int&, vertex_index_t> >; typename graph_traits<Graph>::vertex_descriptor = void*]’
317 | lengauer_tarjan_dominator_tree_without_dfs(g, entry, indexMap, dfnumMap,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
318 | parentMap, verticesByDFNum, domTreePredMap);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dominator_tree.hpp:360:35: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename graph_traits<Graph>::vertex_descriptor&, DomTreePredMap) [with Graph = adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >; DomTreePredMap = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, int&, vertex_index_t> >; typename graph_traits<Graph>::vertex_descriptor = void*]’
360 | lengauer_tarjan_dominator_tree(g, entry, indexMap, dfnumMap, parentMap,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
361 | verticesByDFNum, domTreePredMap);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
dominatorTree.cpp:46:36: required from here
46 | lengauer_tarjan_dominator_tree(g, vertex(v, g), domTreePredMap);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
20 | ~usage_requirements() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/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<std::deque<void*, std::allocator<void*> >*, std::vector<std::deque<void*, std::allocator<void*> >, std::allocator<std::deque<void*, std::allocator<void*> > > > >]’
37 | ~model()
| ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:233:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
233 | BOOST_CONCEPT_USAGE(EqualityComparable) {
| ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::InputIterator<__gnu_cxx::__normal_iterator<std::deque<void*, std::allocator<void*> >*, std::vector<std::deque<void*, std::allocator<void*> >, std::allocator<std::deque<void*, std::allocator<void*> > > > > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/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<std::deque<void*, std::allocator<void*> >*, std::vector<std::deque<void*, std::allocator<void*> >, std::allocator<std::deque<void*, std::allocator<void*> > > > > > >]’
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:512:7: required from ‘struct boost::InputIterator<__gnu_cxx::__normal_iterator<std::deque<void*, std::allocator<void*> >*, std::vector<std::deque<void*, std::allocator<void*> >, std::allocator<std::deque<void*, std::allocator<void*> > > > > >’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:540:3: required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator<std::deque<void*, std::allocator<void*> >*, std::vector<std::deque<void*, std::allocator<void*> >, std::allocator<std::deque<void*, std::allocator<void*> > > > > >’
540 | BOOST_concept(ForwardIterator,(TT))
| ^~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator<std::deque<void*, std::allocator<void*> >*, std::vector<std::deque<void*, std::allocator<void*> >, std::allocator<std::deque<void*, std::allocator<void*> > > > > >’
568 | BOOST_concept(BidirectionalIterator,(TT))
| ^~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator<std::deque<void*, std::allocator<void*> >*, std::vector<std::deque<void*, std::allocator<void*> >, std::allocator<std::deque<void*, std::allocator<void*> > > > > >’
597 | BOOST_concept(RandomAccessIterator,(TT))
| ^~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3: [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map<RAIter, ID, typename std::iterator_traits< <template-parameter-1-1> >::value_type, typename std::iterator_traits< <template-parameter-1-1> >::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = __gnu_cxx::__normal_iterator<std::deque<void*, std::allocator<void*> >*, std::vector<std::deque<void*, std::allocator<void*> >, std::allocator<std::deque<void*, std::allocator<void*> > > > >; ID = adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; typename std::iterator_traits< <template-parameter-1-1> >::value_type = std::deque<void*, std::allocator<void*> >; typename std::iterator_traits< <template-parameter-1-1> >::reference = std::deque<void*, std::allocator<void*> >&]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dominator_tree.hpp:91:48: required from ‘boost::detail::dominator_visitor<Graph, IndexMap, TimeMap, PredMap, DomTreePredMap>::dominator_visitor(const Graph&, const Vertex&, const IndexMap&, DomTreePredMap) [with Graph = boost::adjacency_list<boost::vecS, boost::listS, boost::bidirectionalS, boost::property<boost::vertex_index_t, int> >; IndexMap = boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::bidirectionalS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t>; TimeMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::bidirectionalS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t>, long unsigned int, long unsigned int&>; PredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::bidirectionalS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t>, void*, void*&>; DomTreePredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::bidirectionalS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t> >; Vertex = void*]’
91 | , bucketMap_(make_iterator_property_map(buckets_.begin(), indexMap))
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dominator_tree.hpp:254:9: required from ‘void boost::lengauer_tarjan_dominator_tree_without_dfs(const Graph&, const typename graph_traits<Graph>::vertex_descriptor&, const IndexMap&, TimeMap, PredMap, VertexVector&, DomTreePredMap) [with Graph = adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >; IndexMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; TimeMap = iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>, long unsigned int, long unsigned int&>; PredMap = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>, void*, void*&>; VertexVector = std::vector<void*>; DomTreePredMap = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, int&, vertex_index_t> >; typename graph_traits<Graph>::vertex_descriptor = void*]’
254 | visitor(g, entry, indexMap, domTreePredMap);
| ^~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dominator_tree.hpp:317:47: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename graph_traits<Graph>::vertex_descriptor&, const IndexMap&, TimeMap, PredMap, VertexVector&, DomTreePredMap) [with Graph = adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >; IndexMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; TimeMap = iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>, long unsigned int, long unsigned int&>; PredMap = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>, void*, void*&>; VertexVector = std::vector<void*>; DomTreePredMap = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, int&, vertex_index_t> >; typename graph_traits<Graph>::vertex_descriptor = void*]’
317 | lengauer_tarjan_dominator_tree_without_dfs(g, entry, indexMap, dfnumMap,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
318 | parentMap, verticesByDFNum, domTreePredMap);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dominator_tree.hpp:360:35: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename graph_traits<Graph>::vertex_descriptor&, DomTreePredMap) [with Graph = adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >; DomTreePredMap = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, int&, vertex_index_t> >; typename graph_traits<Graph>::vertex_descriptor = void*]’
360 | lengauer_tarjan_dominator_tree(g, entry, indexMap, dfnumMap, parentMap,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
361 | verticesByDFNum, domTreePredMap);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
dominatorTree.cpp:46:36: required from here
46 | lengauer_tarjan_dominator_tree(g, vertex(v, g), domTreePredMap);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
20 | ~usage_requirements() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/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<std::deque<void*, std::allocator<void*> >*, std::vector<std::deque<void*, std::allocator<void*> >, std::allocator<std::deque<void*, std::allocator<void*> > > > >]’
37 | ~model()
| ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:512:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
512 | BOOST_CONCEPT_USAGE(InputIterator)
| ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::ForwardIterator<__gnu_cxx::__normal_iterator<std::deque<void*, std::allocator<void*> >*, std::vector<std::deque<void*, std::allocator<void*> >, std::allocator<std::deque<void*, std::allocator<void*> > > > > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/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<std::deque<void*, std::allocator<void*> >*, std::vector<std::deque<void*, std::allocator<void*> >, std::allocator<std::deque<void*, std::allocator<void*> > > > > > >]’
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:543:7: required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator<std::deque<void*, std::allocator<void*> >*, std::vector<std::deque<void*, std::allocator<void*> >, std::allocator<std::deque<void*, std::allocator<void*> > > > > >’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator<std::deque<void*, std::allocator<void*> >*, std::vector<std::deque<void*, std::allocator<void*> >, std::allocator<std::deque<void*, std::allocator<void*> > > > > >’
568 | BOOST_concept(BidirectionalIterator,(TT))
| ^~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator<std::deque<void*, std::allocator<void*> >*, std::vector<std::deque<void*, std::allocator<void*> >, std::allocator<std::deque<void*, std::allocator<void*> > > > > >’
597 | BOOST_concept(RandomAccessIterator,(TT))
| ^~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<std::deque<void*, std::allocator<void*> >*, std::vector<std::deque<void*, std::allocator<void*> >, std::allocator<std::deque<void*, std::allocator<void*> > > > > >’
597 | BOOST_concept(RandomAccessIterator,(TT))
| ^~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map<RAIter, ID, typename std::iterator_traits< <template-parameter-1-1> >::value_type, typename std::iterator_traits< <template-parameter-1-1> >::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = __gnu_cxx::__normal_iterator<std::deque<void*, std::allocator<void*> >*, std::vector<std::deque<void*, std::allocator<void*> >, std::allocator<std::deque<void*, std::allocator<void*> > > > >; ID = adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; typename std::iterator_traits< <template-parameter-1-1> >::value_type = std::deque<void*, std::allocator<void*> >; typename std::iterator_traits< <template-parameter-1-1> >::reference = std::deque<void*, std::allocator<void*> >&]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dominator_tree.hpp:91:48: required from ‘boost::detail::dominator_visitor<Graph, IndexMap, TimeMap, PredMap, DomTreePredMap>::dominator_visitor(const Graph&, const Vertex&, const IndexMap&, DomTreePredMap) [with Graph = boost::adjacency_list<boost::vecS, boost::listS, boost::bidirectionalS, boost::property<boost::vertex_index_t, int> >; IndexMap = boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::bidirectionalS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t>; TimeMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::bidirectionalS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t>, long unsigned int, long unsigned int&>; PredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::bidirectionalS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t>, void*, void*&>; DomTreePredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::bidirectionalS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t> >; Vertex = void*]’
91 | , bucketMap_(make_iterator_property_map(buckets_.begin(), indexMap))
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dominator_tree.hpp:254:9: required from ‘void boost::lengauer_tarjan_dominator_tree_without_dfs(const Graph&, const typename graph_traits<Graph>::vertex_descriptor&, const IndexMap&, TimeMap, PredMap, VertexVector&, DomTreePredMap) [with Graph = adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >; IndexMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; TimeMap = iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>, long unsigned int, long unsigned int&>; PredMap = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>, void*, void*&>; VertexVector = std::vector<void*>; DomTreePredMap = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, int&, vertex_index_t> >; typename graph_traits<Graph>::vertex_descriptor = void*]’
254 | visitor(g, entry, indexMap, domTreePredMap);
| ^~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dominator_tree.hpp:317:47: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename graph_traits<Graph>::vertex_descriptor&, const IndexMap&, TimeMap, PredMap, VertexVector&, DomTreePredMap) [with Graph = adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >; IndexMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; TimeMap = iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>, long unsigned int, long unsigned int&>; PredMap = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>, void*, void*&>; VertexVector = std::vector<void*>; DomTreePredMap = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, int&, vertex_index_t> >; typename graph_traits<Graph>::vertex_descriptor = void*]’
317 | lengauer_tarjan_dominator_tree_without_dfs(g, entry, indexMap, dfnumMap,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
318 | parentMap, verticesByDFNum, domTreePredMap);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dominator_tree.hpp:360:35: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename graph_traits<Graph>::vertex_descriptor&, DomTreePredMap) [with Graph = adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >; DomTreePredMap = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, int&, vertex_index_t> >; typename graph_traits<Graph>::vertex_descriptor = void*]’
360 | lengauer_tarjan_dominator_tree(g, entry, indexMap, dfnumMap, parentMap,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
361 | verticesByDFNum, domTreePredMap);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
dominatorTree.cpp:46:36: required from here
46 | lengauer_tarjan_dominator_tree(g, vertex(v, g), domTreePredMap);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
20 | ~usage_requirements() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/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<std::deque<void*, std::allocator<void*> >*, std::vector<std::deque<void*, std::allocator<void*> >, std::allocator<std::deque<void*, std::allocator<void*> > > > >]’
37 | ~model()
| ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:543:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
543 | BOOST_CONCEPT_USAGE(ForwardIterator)
| ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::BidirectionalIterator<__gnu_cxx::__normal_iterator<std::deque<void*, std::allocator<void*> >*, std::vector<std::deque<void*, std::allocator<void*> >, std::allocator<std::deque<void*, std::allocator<void*> > > > > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/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<std::deque<void*, std::allocator<void*> >*, std::vector<std::deque<void*, std::allocator<void*> >, std::allocator<std::deque<void*, std::allocator<void*> > > > > > >]’
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:571:7: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator<std::deque<void*, std::allocator<void*> >*, std::vector<std::deque<void*, std::allocator<void*> >, std::allocator<std::deque<void*, std::allocator<void*> > > > > >’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator<std::deque<void*, std::allocator<void*> >*, std::vector<std::deque<void*, std::allocator<void*> >, std::allocator<std::deque<void*, std::allocator<void*> > > > > >’
597 | BOOST_concept(RandomAccessIterator,(TT))
| ^~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<std::deque<void*, std::allocator<void*> >*, std::vector<std::deque<void*, std::allocator<void*> >, std::allocator<std::deque<void*, std::allocator<void*> > > > > >’
597 | BOOST_concept(RandomAccessIterator,(TT))
| ^~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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<std::deque<void*, std::allocator<void*> >*, std::vector<std::deque<void*, std::allocator<void*> >, std::allocator<std::deque<void*, std::allocator<void*> > > > > >]’
32 | inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
| ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map<RAIter, ID, typename std::iterator_traits< <template-parameter-1-1> >::value_type, typename std::iterator_traits< <template-parameter-1-1> >::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = __gnu_cxx::__normal_iterator<std::deque<void*, std::allocator<void*> >*, std::vector<std::deque<void*, std::allocator<void*> >, std::allocator<std::deque<void*, std::allocator<void*> > > > >; ID = adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; typename std::iterator_traits< <template-parameter-1-1> >::value_type = std::deque<void*, std::allocator<void*> >; typename std::iterator_traits< <template-parameter-1-1> >::reference = std::deque<void*, std::allocator<void*> >&]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dominator_tree.hpp:91:48: required from ‘boost::detail::dominator_visitor<Graph, IndexMap, TimeMap, PredMap, DomTreePredMap>::dominator_visitor(const Graph&, const Vertex&, const IndexMap&, DomTreePredMap) [with Graph = boost::adjacency_list<boost::vecS, boost::listS, boost::bidirectionalS, boost::property<boost::vertex_index_t, int> >; IndexMap = boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::bidirectionalS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t>; TimeMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::bidirectionalS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t>, long unsigned int, long unsigned int&>; PredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::bidirectionalS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t>, void*, void*&>; DomTreePredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::bidirectionalS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t> >; Vertex = void*]’
91 | , bucketMap_(make_iterator_property_map(buckets_.begin(), indexMap))
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dominator_tree.hpp:254:9: required from ‘void boost::lengauer_tarjan_dominator_tree_without_dfs(const Graph&, const typename graph_traits<Graph>::vertex_descriptor&, const IndexMap&, TimeMap, PredMap, VertexVector&, DomTreePredMap) [with Graph = adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >; IndexMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; TimeMap = iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>, long unsigned int, long unsigned int&>; PredMap = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>, void*, void*&>; VertexVector = std::vector<void*>; DomTreePredMap = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, int&, vertex_index_t> >; typename graph_traits<Graph>::vertex_descriptor = void*]’
254 | visitor(g, entry, indexMap, domTreePredMap);
| ^~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dominator_tree.hpp:317:47: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename graph_traits<Graph>::vertex_descriptor&, const IndexMap&, TimeMap, PredMap, VertexVector&, DomTreePredMap) [with Graph = adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >; IndexMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; TimeMap = iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>, long unsigned int, long unsigned int&>; PredMap = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>, void*, void*&>; VertexVector = std::vector<void*>; DomTreePredMap = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, int&, vertex_index_t> >; typename graph_traits<Graph>::vertex_descriptor = void*]’
317 | lengauer_tarjan_dominator_tree_without_dfs(g, entry, indexMap, dfnumMap,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
318 | parentMap, verticesByDFNum, domTreePredMap);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dominator_tree.hpp:360:35: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename graph_traits<Graph>::vertex_descriptor&, DomTreePredMap) [with Graph = adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >; DomTreePredMap = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, int&, vertex_index_t> >; typename graph_traits<Graph>::vertex_descriptor = void*]’
360 | lengauer_tarjan_dominator_tree(g, entry, indexMap, dfnumMap, parentMap,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
361 | verticesByDFNum, domTreePredMap);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
dominatorTree.cpp:46:36: required from here
46 | lengauer_tarjan_dominator_tree(g, vertex(v, g), domTreePredMap);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
20 | ~usage_requirements() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/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<std::deque<void*, std::allocator<void*> >*, std::vector<std::deque<void*, std::allocator<void*> >, std::allocator<std::deque<void*, std::allocator<void*> > > > >]’
37 | ~model()
| ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:571:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
571 | BOOST_CONCEPT_USAGE(BidirectionalIterator)
| ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Comparable<__gnu_cxx::__normal_iterator<std::deque<void*, std::allocator<void*> >*, std::vector<std::deque<void*, std::allocator<void*> >, std::allocator<std::deque<void*, std::allocator<void*> > > > > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/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<std::deque<void*, std::allocator<void*> >*, std::vector<std::deque<void*, std::allocator<void*> >, std::allocator<std::deque<void*, std::allocator<void*> > > > > > >]’
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:253:5: required from ‘struct boost::Comparable<__gnu_cxx::__normal_iterator<std::deque<void*, std::allocator<void*> >*, std::vector<std::deque<void*, std::allocator<void*> >, std::allocator<std::deque<void*, std::allocator<void*> > > > > >’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator<std::deque<void*, std::allocator<void*> >*, std::vector<std::deque<void*, std::allocator<void*> >, std::allocator<std::deque<void*, std::allocator<void*> > > > > >’
597 | BOOST_concept(RandomAccessIterator,(TT))
| ^~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<std::deque<void*, std::allocator<void*> >*, std::vector<std::deque<void*, std::allocator<void*> >, std::allocator<std::deque<void*, std::allocator<void*> > > > > >’
597 | BOOST_concept(RandomAccessIterator,(TT))
| ^~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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<std::deque<void*, std::allocator<void*> >*, std::vector<std::deque<void*, std::allocator<void*> >, std::allocator<std::deque<void*, std::allocator<void*> > > > > >]’
32 | inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
| ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map<RAIter, ID, typename std::iterator_traits< <template-parameter-1-1> >::value_type, typename std::iterator_traits< <template-parameter-1-1> >::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = __gnu_cxx::__normal_iterator<std::deque<void*, std::allocator<void*> >*, std::vector<std::deque<void*, std::allocator<void*> >, std::allocator<std::deque<void*, std::allocator<void*> > > > >; ID = adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; typename std::iterator_traits< <template-parameter-1-1> >::value_type = std::deque<void*, std::allocator<void*> >; typename std::iterator_traits< <template-parameter-1-1> >::reference = std::deque<void*, std::allocator<void*> >&]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dominator_tree.hpp:91:48: required from ‘boost::detail::dominator_visitor<Graph, IndexMap, TimeMap, PredMap, DomTreePredMap>::dominator_visitor(const Graph&, const Vertex&, const IndexMap&, DomTreePredMap) [with Graph = boost::adjacency_list<boost::vecS, boost::listS, boost::bidirectionalS, boost::property<boost::vertex_index_t, int> >; IndexMap = boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::bidirectionalS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t>; TimeMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::bidirectionalS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t>, long unsigned int, long unsigned int&>; PredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::bidirectionalS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t>, void*, void*&>; DomTreePredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::bidirectionalS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t> >; Vertex = void*]’
91 | , bucketMap_(make_iterator_property_map(buckets_.begin(), indexMap))
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dominator_tree.hpp:254:9: required from ‘void boost::lengauer_tarjan_dominator_tree_without_dfs(const Graph&, const typename graph_traits<Graph>::vertex_descriptor&, const IndexMap&, TimeMap, PredMap, VertexVector&, DomTreePredMap) [with Graph = adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >; IndexMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; TimeMap = iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>, long unsigned int, long unsigned int&>; PredMap = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>, void*, void*&>; VertexVector = std::vector<void*>; DomTreePredMap = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, int&, vertex_index_t> >; typename graph_traits<Graph>::vertex_descriptor = void*]’
254 | visitor(g, entry, indexMap, domTreePredMap);
| ^~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dominator_tree.hpp:317:47: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename graph_traits<Graph>::vertex_descriptor&, const IndexMap&, TimeMap, PredMap, VertexVector&, DomTreePredMap) [with Graph = adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >; IndexMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; TimeMap = iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>, long unsigned int, long unsigned int&>; PredMap = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>, void*, void*&>; VertexVector = std::vector<void*>; DomTreePredMap = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, int&, vertex_index_t> >; typename graph_traits<Graph>::vertex_descriptor = void*]’
317 | lengauer_tarjan_dominator_tree_without_dfs(g, entry, indexMap, dfnumMap,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
318 | parentMap, verticesByDFNum, domTreePredMap);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dominator_tree.hpp:360:35: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename graph_traits<Graph>::vertex_descriptor&, DomTreePredMap) [with Graph = adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >; DomTreePredMap = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, int&, vertex_index_t> >; typename graph_traits<Graph>::vertex_descriptor = void*]’
360 | lengauer_tarjan_dominator_tree(g, entry, indexMap, dfnumMap, parentMap,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
361 | verticesByDFNum, domTreePredMap);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
dominatorTree.cpp:46:36: required from here
46 | lengauer_tarjan_dominator_tree(g, vertex(v, g), domTreePredMap);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
20 | ~usage_requirements() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/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<std::deque<void*, std::allocator<void*> >*, std::vector<std::deque<void*, std::allocator<void*> >, std::allocator<std::deque<void*, std::allocator<void*> > > > >]’
37 | ~model()
| ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:253:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
253 | BOOST_CONCEPT_USAGE(Comparable) {
| ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::RandomAccessIterator<__gnu_cxx::__normal_iterator<std::deque<void*, std::allocator<void*> >*, std::vector<std::deque<void*, std::allocator<void*> >, std::allocator<std::deque<void*, std::allocator<void*> > > > > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/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<std::deque<void*, std::allocator<void*> >*, std::vector<std::deque<void*, std::allocator<void*> >, std::allocator<std::deque<void*, std::allocator<void*> > > > > > >]’
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:601:7: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator<std::deque<void*, std::allocator<void*> >*, std::vector<std::deque<void*, std::allocator<void*> >, std::allocator<std::deque<void*, std::allocator<void*> > > > > >’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<std::deque<void*, std::allocator<void*> >*, std::vector<std::deque<void*, std::allocator<void*> >, std::allocator<std::deque<void*, std::allocator<void*> > > > > >’
597 | BOOST_concept(RandomAccessIterator,(TT))
| ^~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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<std::deque<void*, std::allocator<void*> >*, std::vector<std::deque<void*, std::allocator<void*> >, std::allocator<std::deque<void*, std::allocator<void*> > > > > >]’
32 | inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
| ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied<boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<std::deque<void*, std::allocator<void*> >*, std::vector<std::deque<void*, std::allocator<void*> >, std::allocator<std::deque<void*, std::allocator<void*> > > > > > >::value’
44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map<RAIter, ID, typename std::iterator_traits< <template-parameter-1-1> >::value_type, typename std::iterator_traits< <template-parameter-1-1> >::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = __gnu_cxx::__normal_iterator<std::deque<void*, std::allocator<void*> >*, std::vector<std::deque<void*, std::allocator<void*> >, std::allocator<std::deque<void*, std::allocator<void*> > > > >; ID = adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; typename std::iterator_traits< <template-parameter-1-1> >::value_type = std::deque<void*, std::allocator<void*> >; typename std::iterator_traits< <template-parameter-1-1> >::reference = std::deque<void*, std::allocator<void*> >&]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dominator_tree.hpp:91:48: required from ‘boost::detail::dominator_visitor<Graph, IndexMap, TimeMap, PredMap, DomTreePredMap>::dominator_visitor(const Graph&, const Vertex&, const IndexMap&, DomTreePredMap) [with Graph = boost::adjacency_list<boost::vecS, boost::listS, boost::bidirectionalS, boost::property<boost::vertex_index_t, int> >; IndexMap = boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::bidirectionalS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t>; TimeMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::bidirectionalS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t>, long unsigned int, long unsigned int&>; PredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::bidirectionalS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t>, void*, void*&>; DomTreePredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::bidirectionalS, boost::property<boost::vertex_index_t, int> >, int, int&, boost::vertex_index_t> >; Vertex = void*]’
91 | , bucketMap_(make_iterator_property_map(buckets_.begin(), indexMap))
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dominator_tree.hpp:254:9: required from ‘void boost::lengauer_tarjan_dominator_tree_without_dfs(const Graph&, const typename graph_traits<Graph>::vertex_descriptor&, const IndexMap&, TimeMap, PredMap, VertexVector&, DomTreePredMap) [with Graph = adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >; IndexMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; TimeMap = iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>, long unsigned int, long unsigned int&>; PredMap = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>, void*, void*&>; VertexVector = std::vector<void*>; DomTreePredMap = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, int&, vertex_index_t> >; typename graph_traits<Graph>::vertex_descriptor = void*]’
254 | visitor(g, entry, indexMap, domTreePredMap);
| ^~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dominator_tree.hpp:317:47: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename graph_traits<Graph>::vertex_descriptor&, const IndexMap&, TimeMap, PredMap, VertexVector&, DomTreePredMap) [with Graph = adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >; IndexMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; TimeMap = iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>, long unsigned int, long unsigned int&>; PredMap = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>, void*, void*&>; VertexVector = std::vector<void*>; DomTreePredMap = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, int&, vertex_index_t> >; typename graph_traits<Graph>::vertex_descriptor = void*]’
317 | lengauer_tarjan_dominator_tree_without_dfs(g, entry, indexMap, dfnumMap,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
318 | parentMap, verticesByDFNum, domTreePredMap);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dominator_tree.hpp:360:35: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename graph_traits<Graph>::vertex_descriptor&, DomTreePredMap) [with Graph = adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >; DomTreePredMap = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, int&, vertex_index_t> >; typename graph_traits<Graph>::vertex_descriptor = void*]’
360 | lengauer_tarjan_dominator_tree(g, entry, indexMap, dfnumMap, parentMap,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
361 | verticesByDFNum, domTreePredMap);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
dominatorTree.cpp:46:36: required from here
46 | lengauer_tarjan_dominator_tree(g, vertex(v, g), domTreePredMap);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
20 | ~usage_requirements() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/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<std::deque<void*, std::allocator<void*> >*, std::vector<std::deque<void*, std::allocator<void*> >, std::allocator<std::deque<void*, std::allocator<void*> > > > >]’
37 | ~model()
| ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:601:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
601 | BOOST_CONCEPT_USAGE(RandomAccessIterator)
| ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/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<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property>*, std::vector<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property>, std::allocator<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl<boost::bidirectional_tag, void*>, long int> > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/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<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property>*, std::vector<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property>, std::allocator<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl<boost::bidirectional_tag, void*>, long int> >’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/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<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property>*, std::vector<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property>, std::allocator<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl<boost::bidirectional_tag, void*>, long int> >’
502 | BOOST_concept(InputIterator,(TT))
| ^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property>*, std::vector<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property>, std::allocator<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl<boost::bidirectional_tag, void*>, long int> >]’
32 | inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
| ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/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<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property>*, std::vector<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property>, std::allocator<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl<boost::bidirectional_tag, void*>, long int> > >::value’
44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/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<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property>*, std::vector<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property>, std::allocator<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl<boost::bidirectional_tag, void*>, long int> > >’
45 | typedef boost::integral_constant<bool, value> type;
| ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 10 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied<boost::concepts::BidirectionalGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::bidirectionalS, boost::property<boost::vertex_index_t, int> > > >::value’
44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied<boost::concepts::BidirectionalGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::bidirectionalS, boost::property<boost::vertex_index_t, int> > > >’
45 | typedef boost::integral_constant<bool, value> type;
| ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_<void (*)(boost::concepts::BidirectionalGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::bidirectionalS, boost::property<boost::vertex_index_t, int> > >)>’
72 | struct requirement_<void(*)(Model)>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dominator_tree.hpp:245:5: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename graph_traits<Graph>::vertex_descriptor&, const IndexMap&, TimeMap, PredMap, VertexVector&, DomTreePredMap) [with Graph = adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >; IndexMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; TimeMap = iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>, long unsigned int, long unsigned int&>; PredMap = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>, void*, void*&>; VertexVector = std::vector<void*>; DomTreePredMap = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, int&, vertex_index_t> >; typename graph_traits<Graph>::vertex_descriptor = void*]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dominator_tree.hpp:360:35: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename graph_traits<Graph>::vertex_descriptor&, DomTreePredMap) [with Graph = adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >; DomTreePredMap = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, int&, vertex_index_t> >; typename graph_traits<Graph>::vertex_descriptor = void*]’
360 | lengauer_tarjan_dominator_tree(g, entry, indexMap, dfnumMap, parentMap,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
361 | verticesByDFNum, domTreePredMap);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
dominatorTree.cpp:46:36: required from here
46 | lengauer_tarjan_dominator_tree(g, vertex(v, g), domTreePredMap);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/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<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property>*, std::vector<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property>, std::allocator<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl<boost::bidirectional_tag, void*>, long int> >]’
20 | ~usage_requirements() { ((Model*)0)->~Model(); }
| ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/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<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property>*, std::vector<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property>, std::allocator<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl<boost::bidirectional_tag, void*>, long int> > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/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<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property>*, std::vector<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property>, std::allocator<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl<boost::bidirectional_tag, void*>, long int> >’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/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<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property>*, std::vector<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property>, std::allocator<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl<boost::bidirectional_tag, void*>, long int> >’
502 | BOOST_concept(InputIterator,(TT))
| ^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property>*, std::vector<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property>, std::allocator<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl<boost::bidirectional_tag, void*>, long int> >]’
32 | inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
| ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/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<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property>*, std::vector<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property>, std::allocator<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl<boost::bidirectional_tag, void*>, long int> > >::value’
44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/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<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property>*, std::vector<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property>, std::allocator<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl<boost::bidirectional_tag, void*>, long int> > >’
45 | typedef boost::integral_constant<bool, value> type;
| ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 10 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied<boost::concepts::BidirectionalGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::bidirectionalS, boost::property<boost::vertex_index_t, int> > > >::value’
44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied<boost::concepts::BidirectionalGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::bidirectionalS, boost::property<boost::vertex_index_t, int> > > >’
45 | typedef boost::integral_constant<bool, value> type;
| ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_<void (*)(boost::concepts::BidirectionalGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::bidirectionalS, boost::property<boost::vertex_index_t, int> > >)>’
72 | struct requirement_<void(*)(Model)>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dominator_tree.hpp:245:5: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename graph_traits<Graph>::vertex_descriptor&, const IndexMap&, TimeMap, PredMap, VertexVector&, DomTreePredMap) [with Graph = adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >; IndexMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; TimeMap = iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>, long unsigned int, long unsigned int&>; PredMap = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>, void*, void*&>; VertexVector = std::vector<void*>; DomTreePredMap = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, int&, vertex_index_t> >; typename graph_traits<Graph>::vertex_descriptor = void*]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dominator_tree.hpp:360:35: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename graph_traits<Graph>::vertex_descriptor&, DomTreePredMap) [with Graph = adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >; DomTreePredMap = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, int&, vertex_index_t> >; typename graph_traits<Graph>::vertex_descriptor = void*]’
360 | lengauer_tarjan_dominator_tree(g, entry, indexMap, dfnumMap, parentMap,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
361 | verticesByDFNum, domTreePredMap);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
dominatorTree.cpp:46:36: required from here
46 | lengauer_tarjan_dominator_tree(g, vertex(v, g), domTreePredMap);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/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<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property>*, std::vector<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property>, std::allocator<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl<boost::bidirectional_tag, void*>, long int> >]’
20 | ~usage_requirements() { ((Model*)0)->~Model(); }
| ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/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<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property>*, std::vector<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property>, std::allocator<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl<boost::bidirectional_tag, void*>, long int> > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/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<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property>*, std::vector<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property>, std::allocator<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl<boost::bidirectional_tag, void*>, long int> >’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property>*, std::vector<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property>, std::allocator<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl<boost::bidirectional_tag, void*>, long int> >]’
32 | inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
| ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/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<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property>*, std::vector<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property>, std::allocator<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl<boost::bidirectional_tag, void*>, long int> > >::value’
44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/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<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property>*, std::vector<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property>, std::allocator<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl<boost::bidirectional_tag, void*>, long int> > >’
45 | typedef boost::integral_constant<bool, value> type;
| ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/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<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property>*, std::vector<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property>, std::allocator<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl<boost::bidirectional_tag, void*>, long int> >)>’
72 | struct requirement_<void(*)(Model)>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:53:35: [ skipping 9 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied<boost::concepts::BidirectionalGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::bidirectionalS, boost::property<boost::vertex_index_t, int> > > >::value’
44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied<boost::concepts::BidirectionalGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::bidirectionalS, boost::property<boost::vertex_index_t, int> > > >’
45 | typedef boost::integral_constant<bool, value> type;
| ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_<void (*)(boost::concepts::BidirectionalGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::bidirectionalS, boost::property<boost::vertex_index_t, int> > >)>’
72 | struct requirement_<void(*)(Model)>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dominator_tree.hpp:245:5: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename graph_traits<Graph>::vertex_descriptor&, const IndexMap&, TimeMap, PredMap, VertexVector&, DomTreePredMap) [with Graph = adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >; IndexMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; TimeMap = iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>, long unsigned int, long unsigned int&>; PredMap = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>, void*, void*&>; VertexVector = std::vector<void*>; DomTreePredMap = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, int&, vertex_index_t> >; typename graph_traits<Graph>::vertex_descriptor = void*]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dominator_tree.hpp:360:35: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename graph_traits<Graph>::vertex_descriptor&, DomTreePredMap) [with Graph = adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >; DomTreePredMap = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, int&, vertex_index_t> >; typename graph_traits<Graph>::vertex_descriptor = void*]’
360 | lengauer_tarjan_dominator_tree(g, entry, indexMap, dfnumMap, parentMap,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
361 | verticesByDFNum, domTreePredMap);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
dominatorTree.cpp:46:36: required from here
46 | lengauer_tarjan_dominator_tree(g, vertex(v, g), domTreePredMap);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/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<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property>*, std::vector<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property>, std::allocator<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl<boost::bidirectional_tag, void*>, long int> >]’
20 | ~usage_requirements() { ((Model*)0)->~Model(); }
| ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/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<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property>*, std::vector<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property>, std::allocator<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl<boost::bidirectional_tag, void*>, long int> >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/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<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property>*, std::vector<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property>, std::allocator<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl<boost::bidirectional_tag, void*>, long int>]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/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<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property>*, std::vector<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property>, std::allocator<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl<boost::bidirectional_tag, void*>, long int> >]’
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/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::bidirectionalS, boost::property<boost::vertex_index_t, int> >]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: required from ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::concepts::IncidenceGraph<boost::adjacency_list<boost::vecS, boost::listS, boost::bidirectionalS, boost::property<boost::vertex_index_t, int> > >]’
20 | ~usage_requirements() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/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::bidirectionalS, boost::property<boost::vertex_index_t, int> > > >]’
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:87:5: [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied<boost::concepts::BidirectionalGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::bidirectionalS, boost::property<boost::vertex_index_t, int> > > >::value’
44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied<boost::concepts::BidirectionalGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::bidirectionalS, boost::property<boost::vertex_index_t, int> > > >’
45 | typedef boost::integral_constant<bool, value> type;
| ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_<void (*)(boost::concepts::BidirectionalGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::bidirectionalS, boost::property<boost::vertex_index_t, int> > >)>’
72 | struct requirement_<void(*)(Model)>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dominator_tree.hpp:245:5: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename graph_traits<Graph>::vertex_descriptor&, const IndexMap&, TimeMap, PredMap, VertexVector&, DomTreePredMap) [with Graph = adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >; IndexMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; TimeMap = iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>, long unsigned int, long unsigned int&>; PredMap = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>, void*, void*&>; VertexVector = std::vector<void*>; DomTreePredMap = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, int&, vertex_index_t> >; typename graph_traits<Graph>::vertex_descriptor = void*]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dominator_tree.hpp:360:35: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename graph_traits<Graph>::vertex_descriptor&, DomTreePredMap) [with Graph = adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >; DomTreePredMap = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, int&, vertex_index_t> >; typename graph_traits<Graph>::vertex_descriptor = void*]’
360 | lengauer_tarjan_dominator_tree(g, entry, indexMap, dfnumMap, parentMap,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
361 | verticesByDFNum, domTreePredMap);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
dominatorTree.cpp:46:36: required from here
46 | lengauer_tarjan_dominator_tree(g, vertex(v, g), domTreePredMap);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/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<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property>*, std::vector<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property>, std::allocator<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl<boost::bidirectional_tag, void*>, long int>]’
37 | ~model()
| ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:512:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
512 | BOOST_CONCEPT_USAGE(InputIterator)
| ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Assignable<boost::detail::in_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property>*, std::vector<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property>, std::allocator<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl<boost::bidirectional_tag, void*>, long int> >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/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::in_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property>*, std::vector<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property>, std::allocator<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl<boost::bidirectional_tag, void*>, long int> > >]’
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:145:5: required from ‘struct boost::Assignable<boost::detail::in_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property>*, std::vector<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property>, std::allocator<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl<boost::bidirectional_tag, void*>, long int> >’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator<boost::detail::in_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property>*, std::vector<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property>, std::allocator<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl<boost::bidirectional_tag, void*>, long int> >’
502 | BOOST_concept(InputIterator,(TT))
| ^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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::in_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property>*, std::vector<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property>, std::allocator<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl<boost::bidirectional_tag, void*>, long int> >]’
32 | inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
| ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied<boost::InputIterator<boost::detail::in_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property>*, std::vector<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property>, std::allocator<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl<boost::bidirectional_tag, void*>, long int> > >::value’
44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/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::in_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property>*, std::vector<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property>, std::allocator<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl<boost::bidirectional_tag, void*>, long int> >]’
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:125:9: required from ‘boost::concepts::BidirectionalGraph<G>::~BidirectionalGraph() [with G = boost::adjacency_list<boost::vecS, boost::listS, boost::bidirectionalS, boost::property<boost::vertex_index_t, int> >]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:118:1: required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::BidirectionalGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::bidirectionalS, boost::property<boost::vertex_index_t, int> > >]’
118 | BOOST_concept(BidirectionalGraph, (G)) : IncidenceGraph< G >
| ^~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dominator_tree.hpp:245:5: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename graph_traits<Graph>::vertex_descriptor&, const IndexMap&, TimeMap, PredMap, VertexVector&, DomTreePredMap) [with Graph = adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >; IndexMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; TimeMap = iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>, long unsigned int, long unsigned int&>; PredMap = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>, void*, void*&>; VertexVector = std::vector<void*>; DomTreePredMap = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, int&, vertex_index_t> >; typename graph_traits<Graph>::vertex_descriptor = void*]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dominator_tree.hpp:360:35: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename graph_traits<Graph>::vertex_descriptor&, DomTreePredMap) [with Graph = adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >; DomTreePredMap = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, int&, vertex_index_t> >; typename graph_traits<Graph>::vertex_descriptor = void*]’
360 | lengauer_tarjan_dominator_tree(g, entry, indexMap, dfnumMap, parentMap,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
361 | verticesByDFNum, domTreePredMap);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
dominatorTree.cpp:46:36: required from here
46 | lengauer_tarjan_dominator_tree(g, vertex(v, g), domTreePredMap);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
20 | ~usage_requirements() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/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::in_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property>*, std::vector<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property>, std::allocator<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl<boost::bidirectional_tag, void*>, long int>]’
37 | ~model()
| ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:145:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
145 | BOOST_CONCEPT_USAGE(Assignable) {
| ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::EqualityComparable<boost::detail::in_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property>*, std::vector<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property>, std::allocator<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl<boost::bidirectional_tag, void*>, long int> >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/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::in_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property>*, std::vector<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property>, std::allocator<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl<boost::bidirectional_tag, void*>, long int> > >]’
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable<boost::detail::in_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property>*, std::vector<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property>, std::allocator<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl<boost::bidirectional_tag, void*>, long int> >’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator<boost::detail::in_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property>*, std::vector<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property>, std::allocator<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl<boost::bidirectional_tag, void*>, long int> >’
502 | BOOST_concept(InputIterator,(TT))
| ^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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::in_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property>*, std::vector<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property>, std::allocator<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl<boost::bidirectional_tag, void*>, long int> >]’
32 | inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
| ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied<boost::InputIterator<boost::detail::in_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property>*, std::vector<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property>, std::allocator<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl<boost::bidirectional_tag, void*>, long int> > >::value’
44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/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::in_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property>*, std::vector<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property>, std::allocator<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl<boost::bidirectional_tag, void*>, long int> >]’
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:125:9: required from ‘boost::concepts::BidirectionalGraph<G>::~BidirectionalGraph() [with G = boost::adjacency_list<boost::vecS, boost::listS, boost::bidirectionalS, boost::property<boost::vertex_index_t, int> >]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:118:1: required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::BidirectionalGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::bidirectionalS, boost::property<boost::vertex_index_t, int> > >]’
118 | BOOST_concept(BidirectionalGraph, (G)) : IncidenceGraph< G >
| ^~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dominator_tree.hpp:245:5: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename graph_traits<Graph>::vertex_descriptor&, const IndexMap&, TimeMap, PredMap, VertexVector&, DomTreePredMap) [with Graph = adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >; IndexMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; TimeMap = iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>, long unsigned int, long unsigned int&>; PredMap = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>, void*, void*&>; VertexVector = std::vector<void*>; DomTreePredMap = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, int&, vertex_index_t> >; typename graph_traits<Graph>::vertex_descriptor = void*]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dominator_tree.hpp:360:35: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename graph_traits<Graph>::vertex_descriptor&, DomTreePredMap) [with Graph = adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >; DomTreePredMap = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, int&, vertex_index_t> >; typename graph_traits<Graph>::vertex_descriptor = void*]’
360 | lengauer_tarjan_dominator_tree(g, entry, indexMap, dfnumMap, parentMap,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
361 | verticesByDFNum, domTreePredMap);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
dominatorTree.cpp:46:36: required from here
46 | lengauer_tarjan_dominator_tree(g, vertex(v, g), domTreePredMap);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
20 | ~usage_requirements() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/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::in_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property>*, std::vector<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property>, std::allocator<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl<boost::bidirectional_tag, void*>, long int>]’
37 | ~model()
| ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:233:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
233 | BOOST_CONCEPT_USAGE(EqualityComparable) {
| ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::InputIterator<boost::detail::in_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property>*, std::vector<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property>, std::allocator<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl<boost::bidirectional_tag, void*>, long int> >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/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::in_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property>*, std::vector<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property>, std::allocator<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl<boost::bidirectional_tag, void*>, long int> > >]’
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:512:7: required from ‘struct boost::InputIterator<boost::detail::in_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property>*, std::vector<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property>, std::allocator<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl<boost::bidirectional_tag, void*>, long int> >’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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::in_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property>*, std::vector<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property>, std::allocator<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl<boost::bidirectional_tag, void*>, long int> >]’
32 | inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
| ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied<boost::InputIterator<boost::detail::in_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property>*, std::vector<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property>, std::allocator<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl<boost::bidirectional_tag, void*>, long int> > >::value’
44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied<boost::InputIterator<boost::detail::in_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property>*, std::vector<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property>, std::allocator<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl<boost::bidirectional_tag, void*>, long int> > >’
45 | typedef boost::integral_constant<bool, value> type;
| ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/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::in_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property>*, std::vector<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property>, std::allocator<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl<boost::bidirectional_tag, void*>, long int> >]’
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:125:9: required from ‘boost::concepts::BidirectionalGraph<G>::~BidirectionalGraph() [with G = boost::adjacency_list<boost::vecS, boost::listS, boost::bidirectionalS, boost::property<boost::vertex_index_t, int> >]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:118:1: required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::BidirectionalGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::bidirectionalS, boost::property<boost::vertex_index_t, int> > >]’
118 | BOOST_concept(BidirectionalGraph, (G)) : IncidenceGraph< G >
| ^~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dominator_tree.hpp:245:5: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename graph_traits<Graph>::vertex_descriptor&, const IndexMap&, TimeMap, PredMap, VertexVector&, DomTreePredMap) [with Graph = adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >; IndexMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; TimeMap = iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>, long unsigned int, long unsigned int&>; PredMap = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>, void*, void*&>; VertexVector = std::vector<void*>; DomTreePredMap = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, int&, vertex_index_t> >; typename graph_traits<Graph>::vertex_descriptor = void*]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dominator_tree.hpp:360:35: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename graph_traits<Graph>::vertex_descriptor&, DomTreePredMap) [with Graph = adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >; DomTreePredMap = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, int&, vertex_index_t> >; typename graph_traits<Graph>::vertex_descriptor = void*]’
360 | lengauer_tarjan_dominator_tree(g, entry, indexMap, dfnumMap, parentMap,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
361 | verticesByDFNum, domTreePredMap);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
dominatorTree.cpp:46:36: required from here
46 | lengauer_tarjan_dominator_tree(g, vertex(v, g), domTreePredMap);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
20 | ~usage_requirements() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/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::in_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property>*, std::vector<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property>, std::allocator<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl<boost::bidirectional_tag, void*>, long int>]’
37 | ~model()
| ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:512:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
512 | BOOST_CONCEPT_USAGE(InputIterator)
| ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Convertible<boost::lvalue_property_map_tag, boost::readable_property_map_tag>]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/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(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/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> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/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))
| ^~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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);
| ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/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) );
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 11 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_<void (*)(boost::ReadWritePropertyMapConcept<boost::iterator_property_map<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::bidirectionalS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t>, boost::default_color_type, boost::default_color_type&>, void*>)>’
72 | struct requirement_<void(*)(Model)>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:134:9: required from ‘void boost::detail::depth_first_visit_impl(const IncidenceGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, DFSVisitor&, ColorMap, TerminatorFunc) [with IncidenceGraph = boost::adjacency_list<boost::vecS, boost::listS, boost::bidirectionalS, boost::property<boost::vertex_index_t, int> >; DFSVisitor = boost::dfs_visitor<std::pair<boost::predecessor_recorder<boost::iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::bidirectionalS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t>, void*, void*&>, boost::on_tree_edge>, time_stamper_with_vertex_vector<boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::bidirectionalS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t>, long unsigned int, long unsigned int&>, std::vector<void*>, long unsigned int, boost::on_discover_vertex> > >; ColorMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::bidirectionalS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t>, boost::default_color_type, boost::default_color_type&>; TerminatorFunc = nontruth2; typename boost::graph_traits<Graph>::vertex_descriptor = void*]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:417:35: required from ‘void boost::depth_first_visit(const IncidenceGraph&, typename graph_traits<Graph>::vertex_descriptor, DFSVisitor, ColorMap) [with IncidenceGraph = adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >; DFSVisitor = dfs_visitor<std::pair<predecessor_recorder<iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>, void*, void*&>, on_tree_edge>, detail::time_stamper_with_vertex_vector<iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>, long unsigned int, long unsigned int&>, std::vector<void*>, long unsigned int, on_discover_vertex> > >; ColorMap = iterator_property_map<__gnu_cxx::__normal_iterator<default_color_type*, std::vector<default_color_type> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>, default_color_type, default_color_type&>; typename graph_traits<Graph>::vertex_descriptor = void*]’
417 | detail::depth_first_visit_impl(g, u, vis, color, detail::nontruth2());
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dominator_tree.hpp:309:22: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename graph_traits<Graph>::vertex_descriptor&, const IndexMap&, TimeMap, PredMap, VertexVector&, DomTreePredMap) [with Graph = adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >; IndexMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; TimeMap = iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>, long unsigned int, long unsigned int&>; PredMap = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>, void*, void*&>; VertexVector = std::vector<void*>; DomTreePredMap = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, int&, vertex_index_t> >; typename graph_traits<Graph>::vertex_descriptor = void*]’
309 | depth_first_visit(g, entry,
| ~~~~~~~~~~~~~~~~~^~~~~~~~~~
310 | make_dfs_visitor(
| ~~~~~~~~~~~~~~~~~
311 | make_pair(record_predecessors(parentMap, on_tree_edge()),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
312 | detail::stamp_times_with_vertex_vector(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
313 | dfnumMap, verticesByDFNum, time, on_discover_vertex()))),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
314 | make_iterator_property_map(colors.begin(), indexMap));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dominator_tree.hpp:360:35: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename graph_traits<Graph>::vertex_descriptor&, DomTreePredMap) [with Graph = adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >; DomTreePredMap = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, int&, vertex_index_t> >; typename graph_traits<Graph>::vertex_descriptor = void*]’
360 | lengauer_tarjan_dominator_tree(g, entry, indexMap, dfnumMap, parentMap,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
361 | verticesByDFNum, domTreePredMap);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
dominatorTree.cpp:46:36: required from here
46 | lengauer_tarjan_dominator_tree(g, vertex(v, g), domTreePredMap);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
20 | ~usage_requirements() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible<X, Y>::~Convertible() [with X = boost::lvalue_property_map_tag; Y = boost::readable_property_map_tag]’
37 | ~model()
| ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
208 | BOOST_CONCEPT_USAGE(Convertible) {
| ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Convertible<boost::lvalue_property_map_tag, boost::writable_property_map_tag>]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/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(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/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> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/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))
| ^~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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);
| ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/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) );
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 11 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_<void (*)(boost::ReadWritePropertyMapConcept<boost::iterator_property_map<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::bidirectionalS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t>, boost::default_color_type, boost::default_color_type&>, void*>)>’
72 | struct requirement_<void(*)(Model)>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:134:9: required from ‘void boost::detail::depth_first_visit_impl(const IncidenceGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, DFSVisitor&, ColorMap, TerminatorFunc) [with IncidenceGraph = boost::adjacency_list<boost::vecS, boost::listS, boost::bidirectionalS, boost::property<boost::vertex_index_t, int> >; DFSVisitor = boost::dfs_visitor<std::pair<boost::predecessor_recorder<boost::iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::bidirectionalS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t>, void*, void*&>, boost::on_tree_edge>, time_stamper_with_vertex_vector<boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::bidirectionalS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t>, long unsigned int, long unsigned int&>, std::vector<void*>, long unsigned int, boost::on_discover_vertex> > >; ColorMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> >, boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::bidirectionalS, boost::property<boost::vertex_index_t, int> >, int, const int&, boost::vertex_index_t>, boost::default_color_type, boost::default_color_type&>; TerminatorFunc = nontruth2; typename boost::graph_traits<Graph>::vertex_descriptor = void*]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:417:35: required from ‘void boost::depth_first_visit(const IncidenceGraph&, typename graph_traits<Graph>::vertex_descriptor, DFSVisitor, ColorMap) [with IncidenceGraph = adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >; DFSVisitor = dfs_visitor<std::pair<predecessor_recorder<iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>, void*, void*&>, on_tree_edge>, detail::time_stamper_with_vertex_vector<iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>, long unsigned int, long unsigned int&>, std::vector<void*>, long unsigned int, on_discover_vertex> > >; ColorMap = iterator_property_map<__gnu_cxx::__normal_iterator<default_color_type*, std::vector<default_color_type> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>, default_color_type, default_color_type&>; typename graph_traits<Graph>::vertex_descriptor = void*]’
417 | detail::depth_first_visit_impl(g, u, vis, color, detail::nontruth2());
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dominator_tree.hpp:309:22: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename graph_traits<Graph>::vertex_descriptor&, const IndexMap&, TimeMap, PredMap, VertexVector&, DomTreePredMap) [with Graph = adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >; IndexMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; TimeMap = iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>, long unsigned int, long unsigned int&>; PredMap = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>, void*, void*&>; VertexVector = std::vector<void*>; DomTreePredMap = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, int&, vertex_index_t> >; typename graph_traits<Graph>::vertex_descriptor = void*]’
309 | depth_first_visit(g, entry,
| ~~~~~~~~~~~~~~~~~^~~~~~~~~~
310 | make_dfs_visitor(
| ~~~~~~~~~~~~~~~~~
311 | make_pair(record_predecessors(parentMap, on_tree_edge()),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
312 | detail::stamp_times_with_vertex_vector(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
313 | dfnumMap, verticesByDFNum, time, on_discover_vertex()))),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
314 | make_iterator_property_map(colors.begin(), indexMap));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dominator_tree.hpp:360:35: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename graph_traits<Graph>::vertex_descriptor&, DomTreePredMap) [with Graph = adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >; DomTreePredMap = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, int&, vertex_index_t> >; typename graph_traits<Graph>::vertex_descriptor = void*]’
360 | lengauer_tarjan_dominator_tree(g, entry, indexMap, dfnumMap, parentMap,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
361 | verticesByDFNum, domTreePredMap);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
dominatorTree.cpp:46:36: required from here
46 | lengauer_tarjan_dominator_tree(g, vertex(v, g), domTreePredMap);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
20 | ~usage_requirements() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible<X, Y>::~Convertible() [with X = boost::lvalue_property_map_tag; Y = boost::writable_property_map_tag]’
37 | ~model()
| ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
208 | BOOST_CONCEPT_USAGE(Convertible) {
| ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/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<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property>*, std::vector<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property>, std::allocator<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl<boost::bidirectional_tag, void*>, long int> >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/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<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property>*, std::vector<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property>, std::allocator<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl<boost::bidirectional_tag, void*>, long int> > >]’
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/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<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property>*, std::vector<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property>, std::allocator<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl<boost::bidirectional_tag, void*>, long int> >’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/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<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property>*, std::vector<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property>, std::allocator<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl<boost::bidirectional_tag, void*>, long int> >’
502 | BOOST_concept(InputIterator,(TT))
| ^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property>*, std::vector<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property>, std::allocator<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl<boost::bidirectional_tag, void*>, long int> >]’
32 | inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
| ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/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<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property>*, std::vector<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property>, std::allocator<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl<boost::bidirectional_tag, void*>, long int> > >::value’
44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 11 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied<boost::concepts::BidirectionalGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::bidirectionalS, boost::property<boost::vertex_index_t, int> > > >::value’
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied<boost::concepts::BidirectionalGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::bidirectionalS, boost::property<boost::vertex_index_t, int> > > >’
45 | typedef boost::integral_constant<bool, value> type;
| ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_<void (*)(boost::concepts::BidirectionalGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::bidirectionalS, boost::property<boost::vertex_index_t, int> > >)>’
72 | struct requirement_<void(*)(Model)>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dominator_tree.hpp:245:5: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename graph_traits<Graph>::vertex_descriptor&, const IndexMap&, TimeMap, PredMap, VertexVector&, DomTreePredMap) [with Graph = adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >; IndexMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; TimeMap = iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>, long unsigned int, long unsigned int&>; PredMap = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>, void*, void*&>; VertexVector = std::vector<void*>; DomTreePredMap = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, int&, vertex_index_t> >; typename graph_traits<Graph>::vertex_descriptor = void*]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dominator_tree.hpp:360:35: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename graph_traits<Graph>::vertex_descriptor&, DomTreePredMap) [with Graph = adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >; DomTreePredMap = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, int&, vertex_index_t> >; typename graph_traits<Graph>::vertex_descriptor = void*]’
360 | lengauer_tarjan_dominator_tree(g, entry, indexMap, dfnumMap, parentMap,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
361 | verticesByDFNum, domTreePredMap);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
dominatorTree.cpp:46:36: required from here
46 | lengauer_tarjan_dominator_tree(g, vertex(v, g), domTreePredMap);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
20 | ~usage_requirements() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/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<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property>*, std::vector<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property>, std::allocator<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl<boost::bidirectional_tag, void*>, long int>]’
37 | ~model()
| ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:145:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
145 | BOOST_CONCEPT_USAGE(Assignable) {
| ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/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<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property>*, std::vector<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property>, std::allocator<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl<boost::bidirectional_tag, void*>, long int> >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/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<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property>*, std::vector<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property>, std::allocator<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl<boost::bidirectional_tag, void*>, long int> > >]’
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/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<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property>*, std::vector<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property>, std::allocator<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl<boost::bidirectional_tag, void*>, long int> >’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/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<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property>*, std::vector<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property>, std::allocator<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl<boost::bidirectional_tag, void*>, long int> >’
502 | BOOST_concept(InputIterator,(TT))
| ^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property>*, std::vector<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property>, std::allocator<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl<boost::bidirectional_tag, void*>, long int> >]’
32 | inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
| ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/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<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property>*, std::vector<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property>, std::allocator<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl<boost::bidirectional_tag, void*>, long int> > >::value’
44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 11 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied<boost::concepts::BidirectionalGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::bidirectionalS, boost::property<boost::vertex_index_t, int> > > >::value’
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied<boost::concepts::BidirectionalGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::bidirectionalS, boost::property<boost::vertex_index_t, int> > > >’
45 | typedef boost::integral_constant<bool, value> type;
| ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_<void (*)(boost::concepts::BidirectionalGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::bidirectionalS, boost::property<boost::vertex_index_t, int> > >)>’
72 | struct requirement_<void(*)(Model)>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dominator_tree.hpp:245:5: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename graph_traits<Graph>::vertex_descriptor&, const IndexMap&, TimeMap, PredMap, VertexVector&, DomTreePredMap) [with Graph = adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >; IndexMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; TimeMap = iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>, long unsigned int, long unsigned int&>; PredMap = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>, void*, void*&>; VertexVector = std::vector<void*>; DomTreePredMap = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, int&, vertex_index_t> >; typename graph_traits<Graph>::vertex_descriptor = void*]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dominator_tree.hpp:360:35: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename graph_traits<Graph>::vertex_descriptor&, DomTreePredMap) [with Graph = adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >; DomTreePredMap = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, int&, vertex_index_t> >; typename graph_traits<Graph>::vertex_descriptor = void*]’
360 | lengauer_tarjan_dominator_tree(g, entry, indexMap, dfnumMap, parentMap,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
361 | verticesByDFNum, domTreePredMap);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
dominatorTree.cpp:46:36: required from here
46 | lengauer_tarjan_dominator_tree(g, vertex(v, g), domTreePredMap);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
20 | ~usage_requirements() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/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<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property>*, std::vector<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property>, std::allocator<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl<boost::bidirectional_tag, void*>, long int>]’
37 | ~model()
| ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:233:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
233 | BOOST_CONCEPT_USAGE(EqualityComparable) {
| ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/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<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property>*, std::vector<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property>, std::allocator<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl<boost::bidirectional_tag, void*>, long int> >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/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<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property>*, std::vector<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property>, std::allocator<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl<boost::bidirectional_tag, void*>, long int> > >]’
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/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<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property>*, std::vector<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property>, std::allocator<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl<boost::bidirectional_tag, void*>, long int> >’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property>*, std::vector<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property>, std::allocator<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl<boost::bidirectional_tag, void*>, long int> >]’
32 | inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
| ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/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<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property>*, std::vector<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property>, std::allocator<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl<boost::bidirectional_tag, void*>, long int> > >::value’
44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/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<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property>*, std::vector<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property>, std::allocator<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl<boost::bidirectional_tag, void*>, long int> > >’
45 | typedef boost::integral_constant<bool, value> type;
| ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 10 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied<boost::concepts::BidirectionalGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::bidirectionalS, boost::property<boost::vertex_index_t, int> > > >::value’
44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied<boost::concepts::BidirectionalGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::bidirectionalS, boost::property<boost::vertex_index_t, int> > > >’
45 | typedef boost::integral_constant<bool, value> type;
| ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_<void (*)(boost::concepts::BidirectionalGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::bidirectionalS, boost::property<boost::vertex_index_t, int> > >)>’
72 | struct requirement_<void(*)(Model)>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dominator_tree.hpp:245:5: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename graph_traits<Graph>::vertex_descriptor&, const IndexMap&, TimeMap, PredMap, VertexVector&, DomTreePredMap) [with Graph = adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >; IndexMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; TimeMap = iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>, long unsigned int, long unsigned int&>; PredMap = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>, void*, void*&>; VertexVector = std::vector<void*>; DomTreePredMap = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, int&, vertex_index_t> >; typename graph_traits<Graph>::vertex_descriptor = void*]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dominator_tree.hpp:360:35: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename graph_traits<Graph>::vertex_descriptor&, DomTreePredMap) [with Graph = adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >; DomTreePredMap = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, int&, vertex_index_t> >; typename graph_traits<Graph>::vertex_descriptor = void*]’
360 | lengauer_tarjan_dominator_tree(g, entry, indexMap, dfnumMap, parentMap,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
361 | verticesByDFNum, domTreePredMap);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
dominatorTree.cpp:46:36: required from here
46 | lengauer_tarjan_dominator_tree(g, vertex(v, g), domTreePredMap);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
20 | ~usage_requirements() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/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<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property>*, std::vector<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property>, std::allocator<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl<boost::bidirectional_tag, void*>, long int>]’
37 | ~model()
| ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:512:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
512 | BOOST_CONCEPT_USAGE(InputIterator)
| ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Convertible<boost::iterators::detail::iterator_category_with_traversal<std::input_iterator_tag, boost::iterators::random_access_traversal_tag>, std::input_iterator_tag> >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/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> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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);
| ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/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) );
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/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;
| ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/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)>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:515:9: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/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::in_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property>*, std::vector<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property>, std::allocator<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl<boost::bidirectional_tag, void*>, long int> >]’
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:125:9: required from ‘boost::concepts::BidirectionalGraph<G>::~BidirectionalGraph() [with G = boost::adjacency_list<boost::vecS, boost::listS, boost::bidirectionalS, boost::property<boost::vertex_index_t, int> >]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:118:1: required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::BidirectionalGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::bidirectionalS, boost::property<boost::vertex_index_t, int> > >]’
118 | BOOST_concept(BidirectionalGraph, (G)) : IncidenceGraph< G >
| ^~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dominator_tree.hpp:245:5: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename graph_traits<Graph>::vertex_descriptor&, const IndexMap&, TimeMap, PredMap, VertexVector&, DomTreePredMap) [with Graph = adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >; IndexMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; TimeMap = iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>, long unsigned int, long unsigned int&>; PredMap = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>, void*, void*&>; VertexVector = std::vector<void*>; DomTreePredMap = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, int&, vertex_index_t> >; typename graph_traits<Graph>::vertex_descriptor = void*]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dominator_tree.hpp:360:35: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename graph_traits<Graph>::vertex_descriptor&, DomTreePredMap) [with Graph = adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >; DomTreePredMap = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, int&, vertex_index_t> >; typename graph_traits<Graph>::vertex_descriptor = void*]’
360 | lengauer_tarjan_dominator_tree(g, entry, indexMap, dfnumMap, parentMap,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
361 | verticesByDFNum, domTreePredMap);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
dominatorTree.cpp:46:36: required from here
46 | lengauer_tarjan_dominator_tree(g, vertex(v, g), domTreePredMap);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Convertible<boost::iterators::detail::iterator_category_with_traversal<std::input_iterator_tag, boost::iterators::random_access_traversal_tag>, std::input_iterator_tag>]’
20 | ~usage_requirements() { ((Model*)0)->~Model(); }
| ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::Convertible<boost::iterators::detail::iterator_category_with_traversal<std::input_iterator_tag, boost::iterators::random_access_traversal_tag>, std::input_iterator_tag>]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:515:9: required from ‘boost::InputIterator<TT>::~InputIterator() [with TT = boost::detail::in_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property>*, std::vector<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property>, std::allocator<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl<boost::bidirectional_tag, void*>, long int>]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/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::in_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property>*, std::vector<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property>, std::allocator<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl<boost::bidirectional_tag, void*>, long int> >]’
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:53:35: required from ‘boost::concepts::MultiPassInputIterator<T>::~MultiPassInputIterator() [with T = boost::detail::in_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property>*, std::vector<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property>, std::allocator<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl<boost::bidirectional_tag, void*>, long int>]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/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::in_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property>*, std::vector<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property>, std::allocator<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl<boost::bidirectional_tag, void*>, long int> >]’
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:125:9: required from ‘boost::concepts::BidirectionalGraph<G>::~BidirectionalGraph() [with G = boost::adjacency_list<boost::vecS, boost::listS, boost::bidirectionalS, boost::property<boost::vertex_index_t, int> >]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:118:1: required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::BidirectionalGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::bidirectionalS, boost::property<boost::vertex_index_t, int> > >]’
118 | BOOST_concept(BidirectionalGraph, (G)) : IncidenceGraph< G >
| ^~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dominator_tree.hpp:245:5: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename graph_traits<Graph>::vertex_descriptor&, const IndexMap&, TimeMap, PredMap, VertexVector&, DomTreePredMap) [with Graph = adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >; IndexMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; TimeMap = iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>, long unsigned int, long unsigned int&>; PredMap = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>, void*, void*&>; VertexVector = std::vector<void*>; DomTreePredMap = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, int&, vertex_index_t> >; typename graph_traits<Graph>::vertex_descriptor = void*]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dominator_tree.hpp:360:35: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename graph_traits<Graph>::vertex_descriptor&, DomTreePredMap) [with Graph = adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >; DomTreePredMap = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, int&, vertex_index_t> >; typename graph_traits<Graph>::vertex_descriptor = void*]’
360 | lengauer_tarjan_dominator_tree(g, entry, indexMap, dfnumMap, parentMap,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
361 | verticesByDFNum, domTreePredMap);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
dominatorTree.cpp:46:36: required from here
46 | lengauer_tarjan_dominator_tree(g, vertex(v, g), domTreePredMap);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible<X, Y>::~Convertible() [with X = boost::iterators::detail::iterator_category_with_traversal<std::input_iterator_tag, boost::iterators::random_access_traversal_tag>; Y = std::input_iterator_tag]’
37 | ~model()
| ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
208 | BOOST_CONCEPT_USAGE(Convertible) {
| ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Convertible<boost::iterators::detail::iterator_category_with_traversal<std::input_iterator_tag, boost::iterators::random_access_traversal_tag>, std::input_iterator_tag>]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/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(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/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> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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);
| ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/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) );
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/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;
| ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/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::in_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property>*, std::vector<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property>, std::allocator<boost::detail::stored_edge_iter<void*, std::_List_iterator<boost::list_edge<void*, boost::no_property> >, boost::no_property> > > >, void*, boost::detail::edge_desc_impl<boost::bidirectional_tag, void*>, long int> >]’
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:125:9: required from ‘boost::concepts::BidirectionalGraph<G>::~BidirectionalGraph() [with G = boost::adjacency_list<boost::vecS, boost::listS, boost::bidirectionalS, boost::property<boost::vertex_index_t, int> >]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:118:1: required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::BidirectionalGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::bidirectionalS, boost::property<boost::vertex_index_t, int> > >]’
118 | BOOST_concept(BidirectionalGraph, (G)) : IncidenceGraph< G >
| ^~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dominator_tree.hpp:245:5: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename graph_traits<Graph>::vertex_descriptor&, const IndexMap&, TimeMap, PredMap, VertexVector&, DomTreePredMap) [with Graph = adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >; IndexMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>; TimeMap = iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int, std::allocator<long unsigned int> > >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>, long unsigned int, long unsigned int&>; PredMap = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, const int&, vertex_index_t>, void*, void*&>; VertexVector = std::vector<void*>; DomTreePredMap = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, int&, vertex_index_t> >; typename graph_traits<Graph>::vertex_descriptor = void*]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dominator_tree.hpp:360:35: required from ‘void boost::lengauer_tarjan_dominator_tree(const Graph&, const typename graph_traits<Graph>::vertex_descriptor&, DomTreePredMap) [with Graph = adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >; DomTreePredMap = iterator_property_map<__gnu_cxx::__normal_iterator<void**, std::vector<void*> >, adj_list_vertex_property_map<adjacency_list<vecS, listS, bidirectionalS, property<vertex_index_t, int> >, int, int&, vertex_index_t> >; typename graph_traits<Graph>::vertex_descriptor = void*]’
360 | lengauer_tarjan_dominator_tree(g, entry, indexMap, dfnumMap, parentMap,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
361 | verticesByDFNum, domTreePredMap);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
dominatorTree.cpp:46:36: required from here
46 | lengauer_tarjan_dominator_tree(g, vertex(v, g), domTreePredMap);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
20 | ~usage_requirements() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible<X, Y>::~Convertible() [with X = boost::iterators::detail::iterator_category_with_traversal<std::input_iterator_tag, boost::iterators::random_access_traversal_tag>; Y = std::input_iterator_tag]’
37 | ~model()
| ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
208 | BOOST_CONCEPT_USAGE(Convertible) {
| ^~~~~~~~~~~~~~~~~~~
/opt/ohpc/pub/compiler/gcc/14.2.0/bin/aarch64-unknown-linux-gnu-g++ -std=gnu++17 -I"/home/biocbuild/R/R/include" -DNDEBUG -I'/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include' -I/usr/local/include -fPIC -g -O2 -Wall -Werror=format-security -DR_NO_REMAP -c edmonds_optimum_branching.cpp -o edmonds_optimum_branching.o
In file included from edmonds_optimum_branching.cpp:1:
RBGL.hpp:41:9: warning: "R_NO_REMAP" redefined
41 | #define R_NO_REMAP
| ^~~~~~~~~~
<command-line>: note: this is the location of the previous definition
In file included from /home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:22,
from RBGL.hpp:17:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/mpl/assert.hpp:194:21: warning: unnecessary parentheses in declaration of ‘assert_arg’ [-Wparentheses]
194 | failed ************ (Pred::************
| ^~~~~~~~~~~~~~~~~~~
195 | assert_arg( void (*)(Pred), typename assert_arg_pred<Pred>::type )
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
196 | );
| ~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/mpl/assert.hpp:194:21: note: remove parentheses
194 | failed ************ (Pred::************
| ^~~~~~~~~~~~~~~~~~~
| -
195 | assert_arg( void (*)(Pred), typename assert_arg_pred<Pred>::type )
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
196 | );
| ~
| -
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/mpl/assert.hpp:199:21: warning: unnecessary parentheses in declaration of ‘assert_not_arg’ [-Wparentheses]
199 | failed ************ (boost::mpl::not_<Pred>::************
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
200 | assert_not_arg( void (*)(Pred), typename assert_arg_pred_not<Pred>::type )
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
201 | );
| ~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/mpl/assert.hpp:199:21: note: remove parentheses
199 | failed ************ (boost::mpl::not_<Pred>::************
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
| -
200 | assert_not_arg( void (*)(Pred), typename assert_arg_pred_not<Pred>::type )
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
201 | );
| ~
| -
In file included from /home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/smart_ptr/shared_ptr.hpp:17,
from /home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/vector_property_map.hpp:14,
from /home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:598:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/smart_ptr/detail/shared_count.hpp:326:33: warning: ‘template<class> class std::auto_ptr’ is deprecated: use 'std::unique_ptr' instead [-Wdeprecated-declarations]
326 | explicit shared_count( std::auto_ptr<Y> & r ): pi_( new sp_counted_impl_p<Y>( r.get() ) )
| ^~~~~~~~
In file included from /opt/ohpc/pub/compiler/gcc/14.2.0/include/c++/14.2.0/memory:78,
from /home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/smart_ptr/detail/sp_counted_impl.hpp:35,
from /home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/smart_ptr/detail/shared_count.hpp:23:
/opt/ohpc/pub/compiler/gcc/14.2.0/include/c++/14.2.0/bits/unique_ptr.h:59:28: note: declared here
59 | template<typename> class auto_ptr;
| ^~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/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()
| ^~~~~~~~
/opt/ohpc/pub/compiler/gcc/14.2.0/include/c++/14.2.0/bits/unique_ptr.h:59:28: note: declared here
59 | template<typename> class auto_ptr;
| ^~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/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()
| ^~~~~~~~
/opt/ohpc/pub/compiler/gcc/14.2.0/include/c++/14.2.0/bits/unique_ptr.h:59:28: note: declared here
59 | template<typename> class auto_ptr;
| ^~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/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 )
| ^~~~~~~~
/opt/ohpc/pub/compiler/gcc/14.2.0/include/c++/14.2.0/bits/unique_ptr.h:59:28: note: declared here
59 | template<typename> class auto_ptr;
| ^~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/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 )
| ^~~~~~~~
/opt/ohpc/pub/compiler/gcc/14.2.0/include/c++/14.2.0/bits/unique_ptr.h:59:28: note: declared here
59 | template<typename> class auto_ptr;
| ^~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/smart_ptr/shared_ptr.hpp: In member function ‘boost::shared_ptr<T>& boost::shared_ptr<T>::operator=(std::auto_ptr<_Up>&&)’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/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 );
| ^~~~~~~~
/opt/ohpc/pub/compiler/gcc/14.2.0/include/c++/14.2.0/bits/unique_ptr.h:59:28: note: declared here
59 | template<typename> class auto_ptr;
| ^~~~~~~~
In file included from /home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/scoped_ptr.hpp:13,
from /home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/adjacency_list.hpp:22,
from RBGL.hpp:38:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/smart_ptr/scoped_ptr.hpp: At global scope:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/smart_ptr/scoped_ptr.hpp:75:31: warning: ‘template<class> class std::auto_ptr’ is deprecated: use 'std::unique_ptr' instead [-Wdeprecated-declarations]
75 | explicit scoped_ptr( std::auto_ptr<T> p ) noexcept : px( p.release() )
| ^~~~~~~~
/opt/ohpc/pub/compiler/gcc/14.2.0/include/c++/14.2.0/bits/unique_ptr.h:59:28: note: declared here
59 | template<typename> class auto_ptr;
| ^~~~~~~~
In file included from edmonds_optimum_branching.hpp:94,
from edmonds_optimum_branching.cpp:3:
edmonds_optimum_branching_impl.hpp: In function ‘void edmonds_optimum_branching(TEdgeListGraph&, TVertexIndexMap, TWeightMap, TInputIterator, TInputIterator, TOutputIterator)’:
edmonds_optimum_branching_impl.hpp:520:71: warning: typedef ‘EdgeIter’ locally defined but not used [-Wunused-local-typedefs]
520 | typedef typename graph_traits<TEdgeListGraph>::edge_iterator EdgeIter;
| ^~~~~~~~
edmonds_optimum_branching_impl.hpp:521:71: warning: typedef ‘weight_t’ locally defined but not used [-Wunused-local-typedefs]
521 | typedef typename property_traits<TWeightMap>::value_type weight_t;
| ^~~~~~~~
In file included from /home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/assert.hpp:35,
from /home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:19:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/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<R_adjacency_list<boost::directedS, double> > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:66:5: required from ‘struct boost::concepts::Graph<R_adjacency_list<boost::directedS, double> >’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:226:1: required from ‘struct boost::concepts::EdgeListGraph<R_adjacency_list<boost::directedS, double> >’
226 | BOOST_concept(EdgeListGraph, (G)) : Graph< G >
| ^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:226:1: required from ‘struct boost::concepts::EdgeListGraphConcept<R_adjacency_list<boost::directedS, double> >’
226 | BOOST_concept(EdgeListGraph, (G)) : Graph< G >
| ^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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<R_adjacency_list<boost::directedS, double> >]’
32 | inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
| ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied<boost::concepts::EdgeListGraphConcept<R_adjacency_list<boost::directedS, double> > >::value’
44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied<boost::concepts::EdgeListGraphConcept<R_adjacency_list<boost::directedS, double> > >’
45 | typedef boost::integral_constant<bool, value> type;
| ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_<void (*)(boost::concepts::EdgeListGraphConcept<R_adjacency_list<boost::directedS, double> >)>’
72 | struct requirement_<void(*)(Model)>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:50:7: required from ‘void boost::function_requires(Model*) [with Model = concepts::EdgeListGraphConcept<R_adjacency_list<directedS, double> >]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
edmonds_optimum_branching_impl.hpp:523:62: required from ‘void edmonds_optimum_branching(TEdgeListGraph&, TVertexIndexMap, TWeightMap, TInputIterator, TInputIterator, TOutputIterator) [with bool TOptimumIsMaximum = true; bool TAttemptToSpan = false; bool TGraphIsDense = false; TEdgeListGraph = R_adjacency_list<boost::directedS, double>; TVertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>; TWeightMap = boost::adj_list_edge_property_map<boost::directed_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>; TInputIterator = long unsigned int*; TOutputIterator = std::back_insert_iterator<std::vector<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > >]’
523 | function_requires< EdgeListGraphConcept<TEdgeListGraph> >();
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~
edmonds_optimum_branching.cpp:36:47: required from here
36 | edmonds_optimum_branching<true, false, false>(g,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
37 | vertex_indices,
| ~~~~~~~~~~~~~~~
38 | weights,
| ~~~~~~~~
39 | static_cast<Vertex *>(0),
| ~~~~~~~~~~~~~~~~~~~~~~~~~
40 | static_cast<Vertex *>(0),
| ~~~~~~~~~~~~~~~~~~~~~~~~~
41 | std::back_inserter(branching));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
In file included from /home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:31,
from /home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:20:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/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<R_adjacency_list<boost::directedS, double> >]’
20 | ~usage_requirements() { ((Model*)0)->~Model(); }
| ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/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<R_adjacency_list<boost::directedS, double> > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:233:5: required from ‘struct boost::concepts::EdgeListGraph<R_adjacency_list<boost::directedS, double> >’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:226:1: required from ‘struct boost::concepts::EdgeListGraphConcept<R_adjacency_list<boost::directedS, double> >’
226 | BOOST_concept(EdgeListGraph, (G)) : Graph< G >
| ^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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<R_adjacency_list<boost::directedS, double> >]’
32 | inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
| ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied<boost::concepts::EdgeListGraphConcept<R_adjacency_list<boost::directedS, double> > >::value’
44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied<boost::concepts::EdgeListGraphConcept<R_adjacency_list<boost::directedS, double> > >’
45 | typedef boost::integral_constant<bool, value> type;
| ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_<void (*)(boost::concepts::EdgeListGraphConcept<R_adjacency_list<boost::directedS, double> >)>’
72 | struct requirement_<void(*)(Model)>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:50:7: required from ‘void boost::function_requires(Model*) [with Model = concepts::EdgeListGraphConcept<R_adjacency_list<directedS, double> >]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
edmonds_optimum_branching_impl.hpp:523:62: required from ‘void edmonds_optimum_branching(TEdgeListGraph&, TVertexIndexMap, TWeightMap, TInputIterator, TInputIterator, TOutputIterator) [with bool TOptimumIsMaximum = true; bool TAttemptToSpan = false; bool TGraphIsDense = false; TEdgeListGraph = R_adjacency_list<boost::directedS, double>; TVertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>; TWeightMap = boost::adj_list_edge_property_map<boost::directed_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>; TInputIterator = long unsigned int*; TOutputIterator = std::back_insert_iterator<std::vector<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > >]’
523 | function_requires< EdgeListGraphConcept<TEdgeListGraph> >();
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~
edmonds_optimum_branching.cpp:36:47: required from here
36 | edmonds_optimum_branching<true, false, false>(g,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
37 | vertex_indices,
| ~~~~~~~~~~~~~~~
38 | weights,
| ~~~~~~~~
39 | static_cast<Vertex *>(0),
| ~~~~~~~~~~~~~~~~~~~~~~~~~
40 | static_cast<Vertex *>(0),
| ~~~~~~~~~~~~~~~~~~~~~~~~~
41 | std::back_inserter(branching));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/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<R_adjacency_list<boost::directedS, double> >]’
20 | ~usage_requirements() { ((Model*)0)->~Model(); }
| ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/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<R_adjacency_list<boost::directedS, double> >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:50:7: required from ‘void boost::function_requires(Model*) [with Model = concepts::EdgeListGraphConcept<R_adjacency_list<directedS, double> >]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
edmonds_optimum_branching_impl.hpp:523:62: required from ‘void edmonds_optimum_branching(TEdgeListGraph&, TVertexIndexMap, TWeightMap, TInputIterator, TInputIterator, TOutputIterator) [with bool TOptimumIsMaximum = true; bool TAttemptToSpan = false; bool TGraphIsDense = false; TEdgeListGraph = R_adjacency_list<boost::directedS, double>; TVertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>; TWeightMap = boost::adj_list_edge_property_map<boost::directed_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>; TInputIterator = long unsigned int*; TOutputIterator = std::back_insert_iterator<std::vector<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > >]’
523 | function_requires< EdgeListGraphConcept<TEdgeListGraph> >();
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~
edmonds_optimum_branching.cpp:36:47: required from here
36 | edmonds_optimum_branching<true, false, false>(g,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
37 | vertex_indices,
| ~~~~~~~~~~~~~~~
38 | weights,
| ~~~~~~~~
39 | static_cast<Vertex *>(0),
| ~~~~~~~~~~~~~~~~~~~~~~~~~
40 | static_cast<Vertex *>(0),
| ~~~~~~~~~~~~~~~~~~~~~~~~~
41 | std::back_inserter(branching));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
In file included from /home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/preprocessor/repetition/enum_binary_params.hpp:15,
from /home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/utility/base_from_member.hpp:15,
from /home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/utility.hpp:15,
from RBGL.hpp:16:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:226:15: note: in a call to non-static member function ‘boost::concepts::EdgeListGraphConcept<R_adjacency_list<boost::directedS, double> >::~EdgeListGraphConcept()’
226 | BOOST_concept(EdgeListGraph, (G)) : Graph< G >
| ^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/preprocessor/cat.hpp:29:34: note: in definition of macro ‘BOOST_PP_CAT_I’
29 | # define BOOST_PP_CAT_I(a, b) a ## b
| ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/concept_def.hpp:23:12: note: in expansion of macro ‘BOOST_PP_CAT’
23 | struct BOOST_PP_CAT(name,Concept) \
| ^~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:226:1: note: in expansion of macro ‘BOOST_concept’
226 | BOOST_concept(EdgeListGraph, (G)) : Graph< G >
| ^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/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&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:50:7: required from ‘void boost::function_requires(Model*) [with Model = ReadablePropertyMapConcept<adj_list_edge_property_map<directed_tag, double, double&, long unsigned int, property<edge_weight_t, double, no_property>, edge_weight_t>, detail::edge_desc_impl<directed_tag, long unsigned int> >]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
edmonds_optimum_branching_impl.hpp:524:70: required from ‘void edmonds_optimum_branching(TEdgeListGraph&, TVertexIndexMap, TWeightMap, TInputIterator, TInputIterator, TOutputIterator) [with bool TOptimumIsMaximum = true; bool TAttemptToSpan = false; bool TGraphIsDense = false; TEdgeListGraph = R_adjacency_list<boost::directedS, double>; TVertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>; TWeightMap = boost::adj_list_edge_property_map<boost::directed_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>; TInputIterator = long unsigned int*; TOutputIterator = std::back_insert_iterator<std::vector<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > >]’
524 | function_requires< ReadablePropertyMapConcept<TWeightMap, Edge> >();
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~
edmonds_optimum_branching.cpp:36:47: required from here
36 | edmonds_optimum_branching<true, false, false>(g,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
37 | vertex_indices,
| ~~~~~~~~~~~~~~~
38 | weights,
| ~~~~~~~~
39 | static_cast<Vertex *>(0),
| ~~~~~~~~~~~~~~~~~~~~~~~~~
40 | static_cast<Vertex *>(0),
| ~~~~~~~~~~~~~~~~~~~~~~~~~
41 | std::back_inserter(branching));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:65:52: warning: ‘this’ pointer is null [-Wnonnull]
65 | static void failed() { ((Model*)0)->constraints(); }
| ~~~~~~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/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&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>; Key = boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>]’
147 | void constraints() {
| ^~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::constraint<Model>::failed() [with Model = boost::ReadablePropertyMapConcept<boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int>]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:50:7: required from ‘void boost::function_requires(Model*) [with Model = ReadablePropertyMapConcept<vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>, long unsigned int>]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
edmonds_optimum_branching_impl.hpp:525:77: required from ‘void edmonds_optimum_branching(TEdgeListGraph&, TVertexIndexMap, TWeightMap, TInputIterator, TInputIterator, TOutputIterator) [with bool TOptimumIsMaximum = true; bool TAttemptToSpan = false; bool TGraphIsDense = false; TEdgeListGraph = R_adjacency_list<boost::directedS, double>; TVertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>; TWeightMap = boost::adj_list_edge_property_map<boost::directed_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>; TInputIterator = long unsigned int*; TOutputIterator = std::back_insert_iterator<std::vector<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > >]’
525 | function_requires< ReadablePropertyMapConcept<TVertexIndexMap, Vertex> >();
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~
edmonds_optimum_branching.cpp:36:47: required from here
36 | edmonds_optimum_branching<true, false, false>(g,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
37 | vertex_indices,
| ~~~~~~~~~~~~~~~
38 | weights,
| ~~~~~~~~
39 | static_cast<Vertex *>(0),
| ~~~~~~~~~~~~~~~~~~~~~~~~~
40 | static_cast<Vertex *>(0),
| ~~~~~~~~~~~~~~~~~~~~~~~~~
41 | std::back_inserter(branching));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:65:52: warning: ‘this’ pointer is null [-Wnonnull]
65 | static void failed() { ((Model*)0)->constraints(); }
| ~~~~~~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/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::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>; Key = long unsigned int]’
147 | void constraints() {
| ^~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Assignable<long unsigned int*> >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:145:5: required from ‘struct boost::Assignable<long unsigned int*>’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator<long unsigned int*>’
502 | BOOST_concept(InputIterator,(TT))
| ^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIteratorConcept<long unsigned int*>’
502 | BOOST_concept(InputIterator,(TT))
| ^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::InputIteratorConcept<long unsigned int*>]’
32 | inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
| ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied<boost::InputIteratorConcept<long unsigned int*> >::value’
44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied<boost::InputIteratorConcept<long unsigned int*> >’
45 | typedef boost::integral_constant<bool, value> type;
| ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_<void (*)(boost::InputIteratorConcept<long unsigned int*>)>’
72 | struct requirement_<void(*)(Model)>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:50:7: required from ‘void boost::function_requires(Model*) [with Model = InputIteratorConcept<long unsigned int*>]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
edmonds_optimum_branching_impl.hpp:526:62: required from ‘void edmonds_optimum_branching(TEdgeListGraph&, TVertexIndexMap, TWeightMap, TInputIterator, TInputIterator, TOutputIterator) [with bool TOptimumIsMaximum = true; bool TAttemptToSpan = false; bool TGraphIsDense = false; TEdgeListGraph = R_adjacency_list<boost::directedS, double>; TVertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>; TWeightMap = boost::adj_list_edge_property_map<boost::directed_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>; TInputIterator = long unsigned int*; TOutputIterator = std::back_insert_iterator<std::vector<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > >]’
526 | function_requires< InputIteratorConcept<TInputIterator> >();
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~
edmonds_optimum_branching.cpp:36:47: required from here
36 | edmonds_optimum_branching<true, false, false>(g,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
37 | vertex_indices,
| ~~~~~~~~~~~~~~~
38 | weights,
| ~~~~~~~~
39 | static_cast<Vertex *>(0),
| ~~~~~~~~~~~~~~~~~~~~~~~~~
40 | static_cast<Vertex *>(0),
| ~~~~~~~~~~~~~~~~~~~~~~~~~
41 | std::back_inserter(branching));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Assignable<long unsigned int*>]’
20 | ~usage_requirements() { ((Model*)0)->~Model(); }
| ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::EqualityComparable<long unsigned int*> >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable<long unsigned int*>’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator<long unsigned int*>’
502 | BOOST_concept(InputIterator,(TT))
| ^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIteratorConcept<long unsigned int*>’
502 | BOOST_concept(InputIterator,(TT))
| ^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::InputIteratorConcept<long unsigned int*>]’
32 | inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
| ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied<boost::InputIteratorConcept<long unsigned int*> >::value’
44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied<boost::InputIteratorConcept<long unsigned int*> >’
45 | typedef boost::integral_constant<bool, value> type;
| ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_<void (*)(boost::InputIteratorConcept<long unsigned int*>)>’
72 | struct requirement_<void(*)(Model)>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:50:7: required from ‘void boost::function_requires(Model*) [with Model = InputIteratorConcept<long unsigned int*>]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
edmonds_optimum_branching_impl.hpp:526:62: required from ‘void edmonds_optimum_branching(TEdgeListGraph&, TVertexIndexMap, TWeightMap, TInputIterator, TInputIterator, TOutputIterator) [with bool TOptimumIsMaximum = true; bool TAttemptToSpan = false; bool TGraphIsDense = false; TEdgeListGraph = R_adjacency_list<boost::directedS, double>; TVertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>; TWeightMap = boost::adj_list_edge_property_map<boost::directed_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>; TInputIterator = long unsigned int*; TOutputIterator = std::back_insert_iterator<std::vector<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > >]’
526 | function_requires< InputIteratorConcept<TInputIterator> >();
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~
edmonds_optimum_branching.cpp:36:47: required from here
36 | edmonds_optimum_branching<true, false, false>(g,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
37 | vertex_indices,
| ~~~~~~~~~~~~~~~
38 | weights,
| ~~~~~~~~
39 | static_cast<Vertex *>(0),
| ~~~~~~~~~~~~~~~~~~~~~~~~~
40 | static_cast<Vertex *>(0),
| ~~~~~~~~~~~~~~~~~~~~~~~~~
41 | std::back_inserter(branching));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::EqualityComparable<long unsigned int*>]’
20 | ~usage_requirements() { ((Model*)0)->~Model(); }
| ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::InputIterator<long unsigned int*> >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:512:7: required from ‘struct boost::InputIterator<long unsigned int*>’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIteratorConcept<long unsigned int*>’
502 | BOOST_concept(InputIterator,(TT))
| ^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::InputIteratorConcept<long unsigned int*>]’
32 | inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
| ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied<boost::InputIteratorConcept<long unsigned int*> >::value’
44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied<boost::InputIteratorConcept<long unsigned int*> >’
45 | typedef boost::integral_constant<bool, value> type;
| ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_<void (*)(boost::InputIteratorConcept<long unsigned int*>)>’
72 | struct requirement_<void(*)(Model)>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:50:7: required from ‘void boost::function_requires(Model*) [with Model = InputIteratorConcept<long unsigned int*>]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
edmonds_optimum_branching_impl.hpp:526:62: required from ‘void edmonds_optimum_branching(TEdgeListGraph&, TVertexIndexMap, TWeightMap, TInputIterator, TInputIterator, TOutputIterator) [with bool TOptimumIsMaximum = true; bool TAttemptToSpan = false; bool TGraphIsDense = false; TEdgeListGraph = R_adjacency_list<boost::directedS, double>; TVertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>; TWeightMap = boost::adj_list_edge_property_map<boost::directed_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>; TInputIterator = long unsigned int*; TOutputIterator = std::back_insert_iterator<std::vector<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > >]’
526 | function_requires< InputIteratorConcept<TInputIterator> >();
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~
edmonds_optimum_branching.cpp:36:47: required from here
36 | edmonds_optimum_branching<true, false, false>(g,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
37 | vertex_indices,
| ~~~~~~~~~~~~~~~
38 | weights,
| ~~~~~~~~
39 | static_cast<Vertex *>(0),
| ~~~~~~~~~~~~~~~~~~~~~~~~~
40 | static_cast<Vertex *>(0),
| ~~~~~~~~~~~~~~~~~~~~~~~~~
41 | std::back_inserter(branching));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::InputIterator<long unsigned int*>]’
20 | ~usage_requirements() { ((Model*)0)->~Model(); }
| ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::InputIteratorConcept<long unsigned int*>]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:50:7: required from ‘void boost::function_requires(Model*) [with Model = InputIteratorConcept<long unsigned int*>]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
edmonds_optimum_branching_impl.hpp:526:62: required from ‘void edmonds_optimum_branching(TEdgeListGraph&, TVertexIndexMap, TWeightMap, TInputIterator, TInputIterator, TOutputIterator) [with bool TOptimumIsMaximum = true; bool TAttemptToSpan = false; bool TGraphIsDense = false; TEdgeListGraph = R_adjacency_list<boost::directedS, double>; TVertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>; TWeightMap = boost::adj_list_edge_property_map<boost::directed_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>; TInputIterator = long unsigned int*; TOutputIterator = std::back_insert_iterator<std::vector<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > >]’
526 | function_requires< InputIteratorConcept<TInputIterator> >();
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~
edmonds_optimum_branching.cpp:36:47: required from here
36 | edmonds_optimum_branching<true, false, false>(g,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
37 | vertex_indices,
| ~~~~~~~~~~~~~~~
38 | weights,
| ~~~~~~~~
39 | static_cast<Vertex *>(0),
| ~~~~~~~~~~~~~~~~~~~~~~~~~
40 | static_cast<Vertex *>(0),
| ~~~~~~~~~~~~~~~~~~~~~~~~~
41 | std::back_inserter(branching));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:502:17: note: in a call to non-static member function ‘boost::InputIteratorConcept<long unsigned int*>::~InputIteratorConcept()’
502 | BOOST_concept(InputIterator,(TT))
| ^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/preprocessor/cat.hpp:29:34: note: in definition of macro ‘BOOST_PP_CAT_I’
29 | # define BOOST_PP_CAT_I(a, b) a ## b
| ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/concept_def.hpp:23:12: note: in expansion of macro ‘BOOST_PP_CAT’
23 | struct BOOST_PP_CAT(name,Concept) \
| ^~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:502:3: note: in expansion of macro ‘BOOST_concept’
502 | BOOST_concept(InputIterator,(TT))
| ^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Assignable<std::back_insert_iterator<std::vector<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:145:5: required from ‘struct boost::Assignable<std::back_insert_iterator<std::vector<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:526:3: required from ‘struct boost::OutputIterator<std::back_insert_iterator<std::vector<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > >, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> >’
526 | BOOST_concept(OutputIterator,(TT)(ValueT))
| ^~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:526:3: required from ‘struct boost::OutputIteratorConcept<std::back_insert_iterator<std::vector<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > >, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> >’
526 | BOOST_concept(OutputIterator,(TT)(ValueT))
| ^~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::OutputIteratorConcept<std::back_insert_iterator<std::vector<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > >, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> >]’
32 | inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
| ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied<boost::OutputIteratorConcept<std::back_insert_iterator<std::vector<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > >, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > >::value’
44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied<boost::OutputIteratorConcept<std::back_insert_iterator<std::vector<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > >, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > >’
45 | typedef boost::integral_constant<bool, value> type;
| ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_<void (*)(boost::OutputIteratorConcept<std::back_insert_iterator<std::vector<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > >, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> >)>’
72 | struct requirement_<void(*)(Model)>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:50:7: required from ‘void boost::function_requires(Model*) [with Model = OutputIteratorConcept<std::back_insert_iterator<std::vector<detail::edge_desc_impl<directed_tag, long unsigned int> > >, detail::edge_desc_impl<directed_tag, long unsigned int> >]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
edmonds_optimum_branching_impl.hpp:527:70: required from ‘void edmonds_optimum_branching(TEdgeListGraph&, TVertexIndexMap, TWeightMap, TInputIterator, TInputIterator, TOutputIterator) [with bool TOptimumIsMaximum = true; bool TAttemptToSpan = false; bool TGraphIsDense = false; TEdgeListGraph = R_adjacency_list<boost::directedS, double>; TVertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>; TWeightMap = boost::adj_list_edge_property_map<boost::directed_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>; TInputIterator = long unsigned int*; TOutputIterator = std::back_insert_iterator<std::vector<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > >]’
527 | function_requires< OutputIteratorConcept<TOutputIterator, Edge> >();
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~
edmonds_optimum_branching.cpp:36:47: required from here
36 | edmonds_optimum_branching<true, false, false>(g,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
37 | vertex_indices,
| ~~~~~~~~~~~~~~~
38 | weights,
| ~~~~~~~~
39 | static_cast<Vertex *>(0),
| ~~~~~~~~~~~~~~~~~~~~~~~~~
40 | static_cast<Vertex *>(0),
| ~~~~~~~~~~~~~~~~~~~~~~~~~
41 | std::back_inserter(branching));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Assignable<std::back_insert_iterator<std::vector<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >]’
20 | ~usage_requirements() { ((Model*)0)->~Model(); }
| ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::OutputIterator<std::back_insert_iterator<std::vector<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > >, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:529:5: required from ‘struct boost::OutputIterator<std::back_insert_iterator<std::vector<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > >, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> >’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:526:3: required from ‘struct boost::OutputIteratorConcept<std::back_insert_iterator<std::vector<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > >, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> >’
526 | BOOST_concept(OutputIterator,(TT)(ValueT))
| ^~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::OutputIteratorConcept<std::back_insert_iterator<std::vector<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > >, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> >]’
32 | inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
| ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied<boost::OutputIteratorConcept<std::back_insert_iterator<std::vector<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > >, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > >::value’
44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied<boost::OutputIteratorConcept<std::back_insert_iterator<std::vector<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > >, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > >’
45 | typedef boost::integral_constant<bool, value> type;
| ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_<void (*)(boost::OutputIteratorConcept<std::back_insert_iterator<std::vector<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > >, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> >)>’
72 | struct requirement_<void(*)(Model)>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:50:7: required from ‘void boost::function_requires(Model*) [with Model = OutputIteratorConcept<std::back_insert_iterator<std::vector<detail::edge_desc_impl<directed_tag, long unsigned int> > >, detail::edge_desc_impl<directed_tag, long unsigned int> >]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
edmonds_optimum_branching_impl.hpp:527:70: required from ‘void edmonds_optimum_branching(TEdgeListGraph&, TVertexIndexMap, TWeightMap, TInputIterator, TInputIterator, TOutputIterator) [with bool TOptimumIsMaximum = true; bool TAttemptToSpan = false; bool TGraphIsDense = false; TEdgeListGraph = R_adjacency_list<boost::directedS, double>; TVertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>; TWeightMap = boost::adj_list_edge_property_map<boost::directed_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>; TInputIterator = long unsigned int*; TOutputIterator = std::back_insert_iterator<std::vector<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > >]’
527 | function_requires< OutputIteratorConcept<TOutputIterator, Edge> >();
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~
edmonds_optimum_branching.cpp:36:47: required from here
36 | edmonds_optimum_branching<true, false, false>(g,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
37 | vertex_indices,
| ~~~~~~~~~~~~~~~
38 | weights,
| ~~~~~~~~
39 | static_cast<Vertex *>(0),
| ~~~~~~~~~~~~~~~~~~~~~~~~~
40 | static_cast<Vertex *>(0),
| ~~~~~~~~~~~~~~~~~~~~~~~~~
41 | std::back_inserter(branching));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::OutputIterator<std::back_insert_iterator<std::vector<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > >, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> >]’
20 | ~usage_requirements() { ((Model*)0)->~Model(); }
| ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::OutputIteratorConcept<std::back_insert_iterator<std::vector<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > >, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:50:7: required from ‘void boost::function_requires(Model*) [with Model = OutputIteratorConcept<std::back_insert_iterator<std::vector<detail::edge_desc_impl<directed_tag, long unsigned int> > >, detail::edge_desc_impl<directed_tag, long unsigned int> >]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
edmonds_optimum_branching_impl.hpp:527:70: required from ‘void edmonds_optimum_branching(TEdgeListGraph&, TVertexIndexMap, TWeightMap, TInputIterator, TInputIterator, TOutputIterator) [with bool TOptimumIsMaximum = true; bool TAttemptToSpan = false; bool TGraphIsDense = false; TEdgeListGraph = R_adjacency_list<boost::directedS, double>; TVertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>; TWeightMap = boost::adj_list_edge_property_map<boost::directed_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>; TInputIterator = long unsigned int*; TOutputIterator = std::back_insert_iterator<std::vector<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > >]’
527 | function_requires< OutputIteratorConcept<TOutputIterator, Edge> >();
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~
edmonds_optimum_branching.cpp:36:47: required from here
36 | edmonds_optimum_branching<true, false, false>(g,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
37 | vertex_indices,
| ~~~~~~~~~~~~~~~
38 | weights,
| ~~~~~~~~
39 | static_cast<Vertex *>(0),
| ~~~~~~~~~~~~~~~~~~~~~~~~~
40 | static_cast<Vertex *>(0),
| ~~~~~~~~~~~~~~~~~~~~~~~~~
41 | std::back_inserter(branching));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:526:17: note: in a call to non-static member function ‘boost::OutputIteratorConcept<std::back_insert_iterator<std::vector<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > >, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> >::~OutputIteratorConcept()’
526 | BOOST_concept(OutputIterator,(TT)(ValueT))
| ^~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/preprocessor/cat.hpp:29:34: note: in definition of macro ‘BOOST_PP_CAT_I’
29 | # define BOOST_PP_CAT_I(a, b) a ## b
| ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/concept_def.hpp:23:12: note: in expansion of macro ‘BOOST_PP_CAT’
23 | struct BOOST_PP_CAT(name,Concept) \
| ^~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:526:3: note: in expansion of macro ‘BOOST_concept’
526 | BOOST_concept(OutputIterator,(TT)(ValueT))
| ^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::concepts::Graph<R_adjacency_list<boost::directedS, double> >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/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<R_adjacency_list<boost::directedS, double> > >]’
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:66:5: required from ‘struct boost::concepts::Graph<R_adjacency_list<boost::directedS, double> >’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:226:1: required from ‘struct boost::concepts::EdgeListGraph<R_adjacency_list<boost::directedS, double> >’
226 | BOOST_concept(EdgeListGraph, (G)) : Graph< G >
| ^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:226:1: required from ‘struct boost::concepts::EdgeListGraphConcept<R_adjacency_list<boost::directedS, double> >’
226 | BOOST_concept(EdgeListGraph, (G)) : Graph< G >
| ^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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<R_adjacency_list<boost::directedS, double> >]’
32 | inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
| ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied<boost::concepts::EdgeListGraphConcept<R_adjacency_list<boost::directedS, double> > >::value’
44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied<boost::concepts::EdgeListGraphConcept<R_adjacency_list<boost::directedS, double> > >’
45 | typedef boost::integral_constant<bool, value> type;
| ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_<void (*)(boost::concepts::EdgeListGraphConcept<R_adjacency_list<boost::directedS, double> >)>’
72 | struct requirement_<void(*)(Model)>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:50:7: required from ‘void boost::function_requires(Model*) [with Model = concepts::EdgeListGraphConcept<R_adjacency_list<directedS, double> >]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
edmonds_optimum_branching_impl.hpp:523:62: required from ‘void edmonds_optimum_branching(TEdgeListGraph&, TVertexIndexMap, TWeightMap, TInputIterator, TInputIterator, TOutputIterator) [with bool TOptimumIsMaximum = true; bool TAttemptToSpan = false; bool TGraphIsDense = false; TEdgeListGraph = R_adjacency_list<boost::directedS, double>; TVertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>; TWeightMap = boost::adj_list_edge_property_map<boost::directed_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>; TInputIterator = long unsigned int*; TOutputIterator = std::back_insert_iterator<std::vector<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > >]’
523 | function_requires< EdgeListGraphConcept<TEdgeListGraph> >();
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~
edmonds_optimum_branching.cpp:36:47: required from here
36 | edmonds_optimum_branching<true, false, false>(g,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
37 | vertex_indices,
| ~~~~~~~~~~~~~~~
38 | weights,
| ~~~~~~~~
39 | static_cast<Vertex *>(0),
| ~~~~~~~~~~~~~~~~~~~~~~~~~
40 | static_cast<Vertex *>(0),
| ~~~~~~~~~~~~~~~~~~~~~~~~~
41 | std::back_inserter(branching));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
20 | ~usage_requirements() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::concepts::Graph<G>::~Graph() [with G = R_adjacency_list<boost::directedS, double>]’
37 | ~model()
| ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:66:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
66 | BOOST_CONCEPT_USAGE(Graph)
| ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::concepts::EdgeListGraph<R_adjacency_list<boost::directedS, double> >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/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<R_adjacency_list<boost::directedS, double> > >]’
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:233:5: required from ‘struct boost::concepts::EdgeListGraph<R_adjacency_list<boost::directedS, double> >’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:226:1: required from ‘struct boost::concepts::EdgeListGraphConcept<R_adjacency_list<boost::directedS, double> >’
226 | BOOST_concept(EdgeListGraph, (G)) : Graph< G >
| ^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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<R_adjacency_list<boost::directedS, double> >]’
32 | inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
| ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied<boost::concepts::EdgeListGraphConcept<R_adjacency_list<boost::directedS, double> > >::value’
44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied<boost::concepts::EdgeListGraphConcept<R_adjacency_list<boost::directedS, double> > >’
45 | typedef boost::integral_constant<bool, value> type;
| ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_<void (*)(boost::concepts::EdgeListGraphConcept<R_adjacency_list<boost::directedS, double> >)>’
72 | struct requirement_<void(*)(Model)>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:50:7: required from ‘void boost::function_requires(Model*) [with Model = concepts::EdgeListGraphConcept<R_adjacency_list<directedS, double> >]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
edmonds_optimum_branching_impl.hpp:523:62: required from ‘void edmonds_optimum_branching(TEdgeListGraph&, TVertexIndexMap, TWeightMap, TInputIterator, TInputIterator, TOutputIterator) [with bool TOptimumIsMaximum = true; bool TAttemptToSpan = false; bool TGraphIsDense = false; TEdgeListGraph = R_adjacency_list<boost::directedS, double>; TVertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>; TWeightMap = boost::adj_list_edge_property_map<boost::directed_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>; TInputIterator = long unsigned int*; TOutputIterator = std::back_insert_iterator<std::vector<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > >]’
523 | function_requires< EdgeListGraphConcept<TEdgeListGraph> >();
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~
edmonds_optimum_branching.cpp:36:47: required from here
36 | edmonds_optimum_branching<true, false, false>(g,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
37 | vertex_indices,
| ~~~~~~~~~~~~~~~
38 | weights,
| ~~~~~~~~
39 | static_cast<Vertex *>(0),
| ~~~~~~~~~~~~~~~~~~~~~~~~~
40 | static_cast<Vertex *>(0),
| ~~~~~~~~~~~~~~~~~~~~~~~~~
41 | std::back_inserter(branching));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
20 | ~usage_requirements() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::concepts::EdgeListGraph<G>::~EdgeListGraph() [with G = R_adjacency_list<boost::directedS, double>]’
37 | ~model()
| ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:233:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
233 | BOOST_CONCEPT_USAGE(EdgeListGraph)
| ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Convertible<boost::lvalue_property_map_tag, boost::readable_property_map_tag> >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/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> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/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))
| ^~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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);
| ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/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) );
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/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;
| ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied<boost::ReadablePropertyMapConcept<boost::adj_list_edge_property_map<boost::directed_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > >::value’
44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied<boost::ReadablePropertyMapConcept<boost::adj_list_edge_property_map<boost::directed_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > >’
45 | typedef boost::integral_constant<bool, value> type;
| ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_<void (*)(boost::ReadablePropertyMapConcept<boost::adj_list_edge_property_map<boost::directed_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> >)>’
72 | struct requirement_<void(*)(Model)>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:50:7: required from ‘void boost::function_requires(Model*) [with Model = ReadablePropertyMapConcept<adj_list_edge_property_map<directed_tag, double, double&, long unsigned int, property<edge_weight_t, double, no_property>, edge_weight_t>, detail::edge_desc_impl<directed_tag, long unsigned int> >]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
edmonds_optimum_branching_impl.hpp:524:70: required from ‘void edmonds_optimum_branching(TEdgeListGraph&, TVertexIndexMap, TWeightMap, TInputIterator, TInputIterator, TOutputIterator) [with bool TOptimumIsMaximum = true; bool TAttemptToSpan = false; bool TGraphIsDense = false; TEdgeListGraph = R_adjacency_list<boost::directedS, double>; TVertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>; TWeightMap = boost::adj_list_edge_property_map<boost::directed_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>; TInputIterator = long unsigned int*; TOutputIterator = std::back_insert_iterator<std::vector<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > >]’
524 | function_requires< ReadablePropertyMapConcept<TWeightMap, Edge> >();
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~
edmonds_optimum_branching.cpp:36:47: required from here
36 | edmonds_optimum_branching<true, false, false>(g,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
37 | vertex_indices,
| ~~~~~~~~~~~~~~~
38 | weights,
| ~~~~~~~~
39 | static_cast<Vertex *>(0),
| ~~~~~~~~~~~~~~~~~~~~~~~~~
40 | static_cast<Vertex *>(0),
| ~~~~~~~~~~~~~~~~~~~~~~~~~
41 | std::back_inserter(branching));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Convertible<boost::lvalue_property_map_tag, boost::readable_property_map_tag>]’
20 | ~usage_requirements() { ((Model*)0)->~Model(); }
| ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::ConvertibleConcept<boost::lvalue_property_map_tag, boost::readable_property_map_tag>]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:148:7: required from ‘void boost::ReadablePropertyMapConcept<PMap, Key>::constraints() [with PMap = boost::adj_list_edge_property_map<boost::directed_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>; Key = boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::ReadablePropertyMapConcept<boost::adj_list_edge_property_map<boost::directed_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> >]’
32 | inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
| ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied<boost::ReadablePropertyMapConcept<boost::adj_list_edge_property_map<boost::directed_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > >::value’
44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied<boost::ReadablePropertyMapConcept<boost::adj_list_edge_property_map<boost::directed_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > >’
45 | typedef boost::integral_constant<bool, value> type;
| ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_<void (*)(boost::ReadablePropertyMapConcept<boost::adj_list_edge_property_map<boost::directed_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> >)>’
72 | struct requirement_<void(*)(Model)>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:50:7: required from ‘void boost::function_requires(Model*) [with Model = ReadablePropertyMapConcept<adj_list_edge_property_map<directed_tag, double, double&, long unsigned int, property<edge_weight_t, double, no_property>, edge_weight_t>, detail::edge_desc_impl<directed_tag, long unsigned int> >]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
edmonds_optimum_branching_impl.hpp:524:70: required from ‘void edmonds_optimum_branching(TEdgeListGraph&, TVertexIndexMap, TWeightMap, TInputIterator, TInputIterator, TOutputIterator) [with bool TOptimumIsMaximum = true; bool TAttemptToSpan = false; bool TGraphIsDense = false; TEdgeListGraph = R_adjacency_list<boost::directedS, double>; TVertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>; TWeightMap = boost::adj_list_edge_property_map<boost::directed_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>; TInputIterator = long unsigned int*; TOutputIterator = std::back_insert_iterator<std::vector<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > >]’
524 | function_requires< ReadablePropertyMapConcept<TWeightMap, Edge> >();
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~
edmonds_optimum_branching.cpp:36:47: required from here
36 | edmonds_optimum_branching<true, false, false>(g,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
37 | vertex_indices,
| ~~~~~~~~~~~~~~~
38 | weights,
| ~~~~~~~~
39 | static_cast<Vertex *>(0),
| ~~~~~~~~~~~~~~~~~~~~~~~~~
40 | static_cast<Vertex *>(0),
| ~~~~~~~~~~~~~~~~~~~~~~~~~
41 | std::back_inserter(branching));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:206:17: note: in a call to non-static member function ‘boost::ConvertibleConcept<boost::lvalue_property_map_tag, boost::readable_property_map_tag>::~ConvertibleConcept()’
206 | BOOST_concept(Convertible,(X)(Y))
| ^~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/preprocessor/cat.hpp:29:34: note: in definition of macro ‘BOOST_PP_CAT_I’
29 | # define BOOST_PP_CAT_I(a, b) a ## b
| ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/concept_def.hpp:23:12: note: in expansion of macro ‘BOOST_PP_CAT’
23 | struct BOOST_PP_CAT(name,Concept) \
| ^~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:206:3: note: in expansion of macro ‘BOOST_concept’
206 | BOOST_concept(Convertible,(X)(Y))
| ^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/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> >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/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> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/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))
| ^~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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);
| ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/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) );
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/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;
| ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied<boost::ReadablePropertyMapConcept<boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int> >::value’
44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied<boost::ReadablePropertyMapConcept<boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int> >’
45 | typedef boost::integral_constant<bool, value> type;
| ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_<void (*)(boost::ReadablePropertyMapConcept<boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int>)>’
72 | struct requirement_<void(*)(Model)>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:50:7: required from ‘void boost::function_requires(Model*) [with Model = ReadablePropertyMapConcept<vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>, long unsigned int>]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
edmonds_optimum_branching_impl.hpp:525:77: required from ‘void edmonds_optimum_branching(TEdgeListGraph&, TVertexIndexMap, TWeightMap, TInputIterator, TInputIterator, TOutputIterator) [with bool TOptimumIsMaximum = true; bool TAttemptToSpan = false; bool TGraphIsDense = false; TEdgeListGraph = R_adjacency_list<boost::directedS, double>; TVertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>; TWeightMap = boost::adj_list_edge_property_map<boost::directed_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>; TInputIterator = long unsigned int*; TOutputIterator = std::back_insert_iterator<std::vector<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > >]’
525 | function_requires< ReadablePropertyMapConcept<TVertexIndexMap, Vertex> >();
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~
edmonds_optimum_branching.cpp:36:47: required from here
36 | edmonds_optimum_branching<true, false, false>(g,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
37 | vertex_indices,
| ~~~~~~~~~~~~~~~
38 | weights,
| ~~~~~~~~
39 | static_cast<Vertex *>(0),
| ~~~~~~~~~~~~~~~~~~~~~~~~~
40 | static_cast<Vertex *>(0),
| ~~~~~~~~~~~~~~~~~~~~~~~~~
41 | std::back_inserter(branching));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/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(); }
| ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/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>]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:148:7: required from ‘void boost::ReadablePropertyMapConcept<PMap, Key>::constraints() [with PMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>; Key = long unsigned int]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int>]’
32 | inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
| ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied<boost::ReadablePropertyMapConcept<boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int> >::value’
44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied<boost::ReadablePropertyMapConcept<boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int> >’
45 | typedef boost::integral_constant<bool, value> type;
| ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_<void (*)(boost::ReadablePropertyMapConcept<boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int>)>’
72 | struct requirement_<void(*)(Model)>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:50:7: required from ‘void boost::function_requires(Model*) [with Model = ReadablePropertyMapConcept<vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>, long unsigned int>]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
edmonds_optimum_branching_impl.hpp:525:77: required from ‘void edmonds_optimum_branching(TEdgeListGraph&, TVertexIndexMap, TWeightMap, TInputIterator, TInputIterator, TOutputIterator) [with bool TOptimumIsMaximum = true; bool TAttemptToSpan = false; bool TGraphIsDense = false; TEdgeListGraph = R_adjacency_list<boost::directedS, double>; TVertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>; TWeightMap = boost::adj_list_edge_property_map<boost::directed_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>; TInputIterator = long unsigned int*; TOutputIterator = std::back_insert_iterator<std::vector<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > >]’
525 | function_requires< ReadablePropertyMapConcept<TVertexIndexMap, Vertex> >();
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~
edmonds_optimum_branching.cpp:36:47: required from here
36 | edmonds_optimum_branching<true, false, false>(g,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
37 | vertex_indices,
| ~~~~~~~~~~~~~~~
38 | weights,
| ~~~~~~~~
39 | static_cast<Vertex *>(0),
| ~~~~~~~~~~~~~~~~~~~~~~~~~
40 | static_cast<Vertex *>(0),
| ~~~~~~~~~~~~~~~~~~~~~~~~~
41 | std::back_inserter(branching));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/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))
| ^~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/preprocessor/cat.hpp:29:34: note: in definition of macro ‘BOOST_PP_CAT_I’
29 | # define BOOST_PP_CAT_I(a, b) a ## b
| ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/concept_def.hpp:23:12: note: in expansion of macro ‘BOOST_PP_CAT’
23 | struct BOOST_PP_CAT(name,Concept) \
| ^~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:206:3: note: in expansion of macro ‘BOOST_concept’
206 | BOOST_concept(Convertible,(X)(Y))
| ^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Assignable<long unsigned int*>]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Assignable<long unsigned int*> >]’
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:145:5: required from ‘struct boost::Assignable<long unsigned int*>’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator<long unsigned int*>’
502 | BOOST_concept(InputIterator,(TT))
| ^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIteratorConcept<long unsigned int*>’
502 | BOOST_concept(InputIterator,(TT))
| ^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::InputIteratorConcept<long unsigned int*>]’
32 | inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
| ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied<boost::InputIteratorConcept<long unsigned int*> >::value’
44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied<boost::InputIteratorConcept<long unsigned int*> >’
45 | typedef boost::integral_constant<bool, value> type;
| ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_<void (*)(boost::InputIteratorConcept<long unsigned int*>)>’
72 | struct requirement_<void(*)(Model)>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:50:7: required from ‘void boost::function_requires(Model*) [with Model = InputIteratorConcept<long unsigned int*>]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
edmonds_optimum_branching_impl.hpp:526:62: required from ‘void edmonds_optimum_branching(TEdgeListGraph&, TVertexIndexMap, TWeightMap, TInputIterator, TInputIterator, TOutputIterator) [with bool TOptimumIsMaximum = true; bool TAttemptToSpan = false; bool TGraphIsDense = false; TEdgeListGraph = R_adjacency_list<boost::directedS, double>; TVertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>; TWeightMap = boost::adj_list_edge_property_map<boost::directed_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>; TInputIterator = long unsigned int*; TOutputIterator = std::back_insert_iterator<std::vector<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > >]’
526 | function_requires< InputIteratorConcept<TInputIterator> >();
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~
edmonds_optimum_branching.cpp:36:47: required from here
36 | edmonds_optimum_branching<true, false, false>(g,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
37 | vertex_indices,
| ~~~~~~~~~~~~~~~
38 | weights,
| ~~~~~~~~
39 | static_cast<Vertex *>(0),
| ~~~~~~~~~~~~~~~~~~~~~~~~~
40 | static_cast<Vertex *>(0),
| ~~~~~~~~~~~~~~~~~~~~~~~~~
41 | std::back_inserter(branching));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
20 | ~usage_requirements() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Assignable<TT>::~Assignable() [with TT = long unsigned int*]’
37 | ~model()
| ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:145:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
145 | BOOST_CONCEPT_USAGE(Assignable) {
| ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::EqualityComparable<long unsigned int*>]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::EqualityComparable<long unsigned int*> >]’
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable<long unsigned int*>’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator<long unsigned int*>’
502 | BOOST_concept(InputIterator,(TT))
| ^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIteratorConcept<long unsigned int*>’
502 | BOOST_concept(InputIterator,(TT))
| ^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::InputIteratorConcept<long unsigned int*>]’
32 | inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
| ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied<boost::InputIteratorConcept<long unsigned int*> >::value’
44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied<boost::InputIteratorConcept<long unsigned int*> >’
45 | typedef boost::integral_constant<bool, value> type;
| ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_<void (*)(boost::InputIteratorConcept<long unsigned int*>)>’
72 | struct requirement_<void(*)(Model)>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:50:7: required from ‘void boost::function_requires(Model*) [with Model = InputIteratorConcept<long unsigned int*>]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
edmonds_optimum_branching_impl.hpp:526:62: required from ‘void edmonds_optimum_branching(TEdgeListGraph&, TVertexIndexMap, TWeightMap, TInputIterator, TInputIterator, TOutputIterator) [with bool TOptimumIsMaximum = true; bool TAttemptToSpan = false; bool TGraphIsDense = false; TEdgeListGraph = R_adjacency_list<boost::directedS, double>; TVertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>; TWeightMap = boost::adj_list_edge_property_map<boost::directed_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>; TInputIterator = long unsigned int*; TOutputIterator = std::back_insert_iterator<std::vector<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > >]’
526 | function_requires< InputIteratorConcept<TInputIterator> >();
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~
edmonds_optimum_branching.cpp:36:47: required from here
36 | edmonds_optimum_branching<true, false, false>(g,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
37 | vertex_indices,
| ~~~~~~~~~~~~~~~
38 | weights,
| ~~~~~~~~
39 | static_cast<Vertex *>(0),
| ~~~~~~~~~~~~~~~~~~~~~~~~~
40 | static_cast<Vertex *>(0),
| ~~~~~~~~~~~~~~~~~~~~~~~~~
41 | std::back_inserter(branching));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
20 | ~usage_requirements() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::EqualityComparable<TT>::~EqualityComparable() [with TT = long unsigned int*]’
37 | ~model()
| ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:233:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
233 | BOOST_CONCEPT_USAGE(EqualityComparable) {
| ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::InputIterator<long unsigned int*>]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::InputIterator<long unsigned int*> >]’
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:512:7: required from ‘struct boost::InputIterator<long unsigned int*>’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIteratorConcept<long unsigned int*>’
502 | BOOST_concept(InputIterator,(TT))
| ^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::InputIteratorConcept<long unsigned int*>]’
32 | inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
| ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied<boost::InputIteratorConcept<long unsigned int*> >::value’
44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied<boost::InputIteratorConcept<long unsigned int*> >’
45 | typedef boost::integral_constant<bool, value> type;
| ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_<void (*)(boost::InputIteratorConcept<long unsigned int*>)>’
72 | struct requirement_<void(*)(Model)>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:50:7: required from ‘void boost::function_requires(Model*) [with Model = InputIteratorConcept<long unsigned int*>]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
edmonds_optimum_branching_impl.hpp:526:62: required from ‘void edmonds_optimum_branching(TEdgeListGraph&, TVertexIndexMap, TWeightMap, TInputIterator, TInputIterator, TOutputIterator) [with bool TOptimumIsMaximum = true; bool TAttemptToSpan = false; bool TGraphIsDense = false; TEdgeListGraph = R_adjacency_list<boost::directedS, double>; TVertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>; TWeightMap = boost::adj_list_edge_property_map<boost::directed_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>; TInputIterator = long unsigned int*; TOutputIterator = std::back_insert_iterator<std::vector<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > >]’
526 | function_requires< InputIteratorConcept<TInputIterator> >();
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~
edmonds_optimum_branching.cpp:36:47: required from here
36 | edmonds_optimum_branching<true, false, false>(g,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
37 | vertex_indices,
| ~~~~~~~~~~~~~~~
38 | weights,
| ~~~~~~~~
39 | static_cast<Vertex *>(0),
| ~~~~~~~~~~~~~~~~~~~~~~~~~
40 | static_cast<Vertex *>(0),
| ~~~~~~~~~~~~~~~~~~~~~~~~~
41 | std::back_inserter(branching));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
20 | ~usage_requirements() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::InputIterator<TT>::~InputIterator() [with TT = long unsigned int*]’
37 | ~model()
| ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:512:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
512 | BOOST_CONCEPT_USAGE(InputIterator)
| ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Assignable<std::back_insert_iterator<std::vector<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Assignable<std::back_insert_iterator<std::vector<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >]’
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:145:5: required from ‘struct boost::Assignable<std::back_insert_iterator<std::vector<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:526:3: required from ‘struct boost::OutputIterator<std::back_insert_iterator<std::vector<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > >, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> >’
526 | BOOST_concept(OutputIterator,(TT)(ValueT))
| ^~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:526:3: required from ‘struct boost::OutputIteratorConcept<std::back_insert_iterator<std::vector<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > >, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> >’
526 | BOOST_concept(OutputIterator,(TT)(ValueT))
| ^~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::OutputIteratorConcept<std::back_insert_iterator<std::vector<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > >, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> >]’
32 | inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
| ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied<boost::OutputIteratorConcept<std::back_insert_iterator<std::vector<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > >, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > >::value’
44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied<boost::OutputIteratorConcept<std::back_insert_iterator<std::vector<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > >, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > >’
45 | typedef boost::integral_constant<bool, value> type;
| ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_<void (*)(boost::OutputIteratorConcept<std::back_insert_iterator<std::vector<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > >, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> >)>’
72 | struct requirement_<void(*)(Model)>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:50:7: required from ‘void boost::function_requires(Model*) [with Model = OutputIteratorConcept<std::back_insert_iterator<std::vector<detail::edge_desc_impl<directed_tag, long unsigned int> > >, detail::edge_desc_impl<directed_tag, long unsigned int> >]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
edmonds_optimum_branching_impl.hpp:527:70: required from ‘void edmonds_optimum_branching(TEdgeListGraph&, TVertexIndexMap, TWeightMap, TInputIterator, TInputIterator, TOutputIterator) [with bool TOptimumIsMaximum = true; bool TAttemptToSpan = false; bool TGraphIsDense = false; TEdgeListGraph = R_adjacency_list<boost::directedS, double>; TVertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>; TWeightMap = boost::adj_list_edge_property_map<boost::directed_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>; TInputIterator = long unsigned int*; TOutputIterator = std::back_insert_iterator<std::vector<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > >]’
527 | function_requires< OutputIteratorConcept<TOutputIterator, Edge> >();
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~
edmonds_optimum_branching.cpp:36:47: required from here
36 | edmonds_optimum_branching<true, false, false>(g,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
37 | vertex_indices,
| ~~~~~~~~~~~~~~~
38 | weights,
| ~~~~~~~~
39 | static_cast<Vertex *>(0),
| ~~~~~~~~~~~~~~~~~~~~~~~~~
40 | static_cast<Vertex *>(0),
| ~~~~~~~~~~~~~~~~~~~~~~~~~
41 | std::back_inserter(branching));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
20 | ~usage_requirements() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Assignable<TT>::~Assignable() [with TT = std::back_insert_iterator<std::vector<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > >]’
37 | ~model()
| ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:145:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
145 | BOOST_CONCEPT_USAGE(Assignable) {
| ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::OutputIterator<std::back_insert_iterator<std::vector<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > >, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::OutputIterator<std::back_insert_iterator<std::vector<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > >, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > >]’
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:529:5: required from ‘struct boost::OutputIterator<std::back_insert_iterator<std::vector<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > >, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> >’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:526:3: required from ‘struct boost::OutputIteratorConcept<std::back_insert_iterator<std::vector<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > >, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> >’
526 | BOOST_concept(OutputIterator,(TT)(ValueT))
| ^~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::OutputIteratorConcept<std::back_insert_iterator<std::vector<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > >, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> >]’
32 | inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
| ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied<boost::OutputIteratorConcept<std::back_insert_iterator<std::vector<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > >, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > >::value’
44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied<boost::OutputIteratorConcept<std::back_insert_iterator<std::vector<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > >, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > >’
45 | typedef boost::integral_constant<bool, value> type;
| ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_<void (*)(boost::OutputIteratorConcept<std::back_insert_iterator<std::vector<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > >, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> >)>’
72 | struct requirement_<void(*)(Model)>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:50:7: required from ‘void boost::function_requires(Model*) [with Model = OutputIteratorConcept<std::back_insert_iterator<std::vector<detail::edge_desc_impl<directed_tag, long unsigned int> > >, detail::edge_desc_impl<directed_tag, long unsigned int> >]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
edmonds_optimum_branching_impl.hpp:527:70: required from ‘void edmonds_optimum_branching(TEdgeListGraph&, TVertexIndexMap, TWeightMap, TInputIterator, TInputIterator, TOutputIterator) [with bool TOptimumIsMaximum = true; bool TAttemptToSpan = false; bool TGraphIsDense = false; TEdgeListGraph = R_adjacency_list<boost::directedS, double>; TVertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>; TWeightMap = boost::adj_list_edge_property_map<boost::directed_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>; TInputIterator = long unsigned int*; TOutputIterator = std::back_insert_iterator<std::vector<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > >]’
527 | function_requires< OutputIteratorConcept<TOutputIterator, Edge> >();
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~
edmonds_optimum_branching.cpp:36:47: required from here
36 | edmonds_optimum_branching<true, false, false>(g,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
37 | vertex_indices,
| ~~~~~~~~~~~~~~~
38 | weights,
| ~~~~~~~~
39 | static_cast<Vertex *>(0),
| ~~~~~~~~~~~~~~~~~~~~~~~~~
40 | static_cast<Vertex *>(0),
| ~~~~~~~~~~~~~~~~~~~~~~~~~
41 | std::back_inserter(branching));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
20 | ~usage_requirements() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::OutputIterator<TT, ValueT>::~OutputIterator() [with TT = std::back_insert_iterator<std::vector<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > >; ValueT = boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>]’
37 | ~model()
| ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:529:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
529 | BOOST_CONCEPT_USAGE(OutputIterator) {
| ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/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<boost::range_detail::integer_iterator<long unsigned int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int>, boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_color_t, boost::default_color_type>, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::no_property, boost::listS> > > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:52:50: required from ‘struct boost::concepts::MultiPassInputIterator<boost::detail::adj_list_edge_iterator<boost::range_detail::integer_iterator<long unsigned int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int>, boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_color_t, boost::default_color_type>, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::no_property, boost::listS> > >’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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<boost::range_detail::integer_iterator<long unsigned int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int>, boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_color_t, boost::default_color_type>, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::no_property, boost::listS> > >]’
32 | inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
| ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/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<boost::range_detail::integer_iterator<long unsigned int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int>, boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_color_t, boost::default_color_type>, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::no_property, boost::listS> > > >::value’
44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/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<boost::range_detail::integer_iterator<long unsigned int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int>, boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_color_t, boost::default_color_type>, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::no_property, boost::listS> > > >’
45 | typedef boost::integral_constant<bool, value> type;
| ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/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<boost::range_detail::integer_iterator<long unsigned int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int>, boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_color_t, boost::default_color_type>, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::no_property, boost::listS> > >)>’
72 | struct requirement_<void(*)(Model)>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:235:9: required from ‘boost::concepts::EdgeListGraph<G>::~EdgeListGraph() [with G = R_adjacency_list<boost::directedS, double>]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/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<R_adjacency_list<boost::directedS, double> >]’
226 | BOOST_concept(EdgeListGraph, (G)) : Graph< G >
| ^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:50:7: required from ‘void boost::function_requires(Model*) [with Model = concepts::EdgeListGraphConcept<R_adjacency_list<directedS, double> >]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
edmonds_optimum_branching_impl.hpp:523:62: required from ‘void edmonds_optimum_branching(TEdgeListGraph&, TVertexIndexMap, TWeightMap, TInputIterator, TInputIterator, TOutputIterator) [with bool TOptimumIsMaximum = true; bool TAttemptToSpan = false; bool TGraphIsDense = false; TEdgeListGraph = R_adjacency_list<boost::directedS, double>; TVertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>; TWeightMap = boost::adj_list_edge_property_map<boost::directed_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>; TInputIterator = long unsigned int*; TOutputIterator = std::back_insert_iterator<std::vector<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > >]’
523 | function_requires< EdgeListGraphConcept<TEdgeListGraph> >();
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~
edmonds_optimum_branching.cpp:36:47: required from here
36 | edmonds_optimum_branching<true, false, false>(g,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
37 | vertex_indices,
| ~~~~~~~~~~~~~~~
38 | weights,
| ~~~~~~~~
39 | static_cast<Vertex *>(0),
| ~~~~~~~~~~~~~~~~~~~~~~~~~
40 | static_cast<Vertex *>(0),
| ~~~~~~~~~~~~~~~~~~~~~~~~~
41 | std::back_inserter(branching));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/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<boost::range_detail::integer_iterator<long unsigned int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int>, boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_color_t, boost::default_color_type>, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::no_property, boost::listS> > >]’
20 | ~usage_requirements() { ((Model*)0)->~Model(); }
| ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/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<boost::range_detail::integer_iterator<long unsigned int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int>, boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_color_t, boost::default_color_type>, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::no_property, boost::listS> > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:235:9: required from ‘boost::concepts::EdgeListGraph<G>::~EdgeListGraph() [with G = R_adjacency_list<boost::directedS, double>]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/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<R_adjacency_list<boost::directedS, double> >]’
226 | BOOST_concept(EdgeListGraph, (G)) : Graph< G >
| ^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:50:7: required from ‘void boost::function_requires(Model*) [with Model = concepts::EdgeListGraphConcept<R_adjacency_list<directedS, double> >]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
edmonds_optimum_branching_impl.hpp:523:62: required from ‘void edmonds_optimum_branching(TEdgeListGraph&, TVertexIndexMap, TWeightMap, TInputIterator, TInputIterator, TOutputIterator) [with bool TOptimumIsMaximum = true; bool TAttemptToSpan = false; bool TGraphIsDense = false; TEdgeListGraph = R_adjacency_list<boost::directedS, double>; TVertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>; TWeightMap = boost::adj_list_edge_property_map<boost::directed_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>; TInputIterator = long unsigned int*; TOutputIterator = std::back_insert_iterator<std::vector<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > >]’
523 | function_requires< EdgeListGraphConcept<TEdgeListGraph> >();
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~
edmonds_optimum_branching.cpp:36:47: required from here
36 | edmonds_optimum_branching<true, false, false>(g,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
37 | vertex_indices,
| ~~~~~~~~~~~~~~~
38 | weights,
| ~~~~~~~~
39 | static_cast<Vertex *>(0),
| ~~~~~~~~~~~~~~~~~~~~~~~~~
40 | static_cast<Vertex *>(0),
| ~~~~~~~~~~~~~~~~~~~~~~~~~
41 | std::back_inserter(branching));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/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<boost::range_detail::integer_iterator<long unsigned int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int>, boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_color_t, boost::default_color_type>, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::no_property, boost::listS> >]’
37 | ~model()
| ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:52:50: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
52 | BOOST_concept(MultiPassInputIterator, (T)) { BOOST_CONCEPT_USAGE(
| ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::DefaultConstructible<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:137:5: required from ‘struct boost::DefaultConstructible<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> >’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::DefaultConstructible<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> >]’
32 | inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
| ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied<boost::DefaultConstructible<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > >::value’
44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied<boost::DefaultConstructible<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > >’
45 | typedef boost::integral_constant<bool, value> type;
| ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_<void (*)(boost::DefaultConstructible<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> >)>’
72 | struct requirement_<void(*)(Model)>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:90:9: required from ‘boost::concepts::EdgeListGraph<G>::~EdgeListGraph() [with G = R_adjacency_list<boost::directedS, double>]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/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<R_adjacency_list<boost::directedS, double> >]’
226 | BOOST_concept(EdgeListGraph, (G)) : Graph< G >
| ^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:50:7: required from ‘void boost::function_requires(Model*) [with Model = concepts::EdgeListGraphConcept<R_adjacency_list<directedS, double> >]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
edmonds_optimum_branching_impl.hpp:523:62: required from ‘void edmonds_optimum_branching(TEdgeListGraph&, TVertexIndexMap, TWeightMap, TInputIterator, TInputIterator, TOutputIterator) [with bool TOptimumIsMaximum = true; bool TAttemptToSpan = false; bool TGraphIsDense = false; TEdgeListGraph = R_adjacency_list<boost::directedS, double>; TVertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>; TWeightMap = boost::adj_list_edge_property_map<boost::directed_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>; TInputIterator = long unsigned int*; TOutputIterator = std::back_insert_iterator<std::vector<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > >]’
523 | function_requires< EdgeListGraphConcept<TEdgeListGraph> >();
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~
edmonds_optimum_branching.cpp:36:47: required from here
36 | edmonds_optimum_branching<true, false, false>(g,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
37 | vertex_indices,
| ~~~~~~~~~~~~~~~
38 | weights,
| ~~~~~~~~
39 | static_cast<Vertex *>(0),
| ~~~~~~~~~~~~~~~~~~~~~~~~~
40 | static_cast<Vertex *>(0),
| ~~~~~~~~~~~~~~~~~~~~~~~~~
41 | std::back_inserter(branching));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::DefaultConstructible<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> >]’
20 | ~usage_requirements() { ((Model*)0)->~Model(); }
| ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::DefaultConstructible<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:90:9: required from ‘boost::concepts::EdgeListGraph<G>::~EdgeListGraph() [with G = R_adjacency_list<boost::directedS, double>]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/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<R_adjacency_list<boost::directedS, double> >]’
226 | BOOST_concept(EdgeListGraph, (G)) : Graph< G >
| ^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:50:7: required from ‘void boost::function_requires(Model*) [with Model = concepts::EdgeListGraphConcept<R_adjacency_list<directedS, double> >]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
edmonds_optimum_branching_impl.hpp:523:62: required from ‘void edmonds_optimum_branching(TEdgeListGraph&, TVertexIndexMap, TWeightMap, TInputIterator, TInputIterator, TOutputIterator) [with bool TOptimumIsMaximum = true; bool TAttemptToSpan = false; bool TGraphIsDense = false; TEdgeListGraph = R_adjacency_list<boost::directedS, double>; TVertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>; TWeightMap = boost::adj_list_edge_property_map<boost::directed_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>; TInputIterator = long unsigned int*; TOutputIterator = std::back_insert_iterator<std::vector<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > >]’
523 | function_requires< EdgeListGraphConcept<TEdgeListGraph> >();
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~
edmonds_optimum_branching.cpp:36:47: required from here
36 | edmonds_optimum_branching<true, false, false>(g,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
37 | vertex_indices,
| ~~~~~~~~~~~~~~~
38 | weights,
| ~~~~~~~~
39 | static_cast<Vertex *>(0),
| ~~~~~~~~~~~~~~~~~~~~~~~~~
40 | static_cast<Vertex *>(0),
| ~~~~~~~~~~~~~~~~~~~~~~~~~
41 | std::back_inserter(branching));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::DefaultConstructible<TT>::~DefaultConstructible() [with TT = boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>]’
37 | ~model()
| ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:137:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
137 | BOOST_CONCEPT_USAGE(DefaultConstructible) {
| ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::EqualityComparable<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> >’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::EqualityComparable<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> >]’
32 | inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
| ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied<boost::EqualityComparable<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > >::value’
44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied<boost::EqualityComparable<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > >’
45 | typedef boost::integral_constant<bool, value> type;
| ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_<void (*)(boost::EqualityComparable<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> >)>’
72 | struct requirement_<void(*)(Model)>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:91:9: required from ‘boost::concepts::EdgeListGraph<G>::~EdgeListGraph() [with G = R_adjacency_list<boost::directedS, double>]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/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<R_adjacency_list<boost::directedS, double> >]’
226 | BOOST_concept(EdgeListGraph, (G)) : Graph< G >
| ^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:50:7: required from ‘void boost::function_requires(Model*) [with Model = concepts::EdgeListGraphConcept<R_adjacency_list<directedS, double> >]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
edmonds_optimum_branching_impl.hpp:523:62: required from ‘void edmonds_optimum_branching(TEdgeListGraph&, TVertexIndexMap, TWeightMap, TInputIterator, TInputIterator, TOutputIterator) [with bool TOptimumIsMaximum = true; bool TAttemptToSpan = false; bool TGraphIsDense = false; TEdgeListGraph = R_adjacency_list<boost::directedS, double>; TVertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>; TWeightMap = boost::adj_list_edge_property_map<boost::directed_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>; TInputIterator = long unsigned int*; TOutputIterator = std::back_insert_iterator<std::vector<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > >]’
523 | function_requires< EdgeListGraphConcept<TEdgeListGraph> >();
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~
edmonds_optimum_branching.cpp:36:47: required from here
36 | edmonds_optimum_branching<true, false, false>(g,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
37 | vertex_indices,
| ~~~~~~~~~~~~~~~
38 | weights,
| ~~~~~~~~
39 | static_cast<Vertex *>(0),
| ~~~~~~~~~~~~~~~~~~~~~~~~~
40 | static_cast<Vertex *>(0),
| ~~~~~~~~~~~~~~~~~~~~~~~~~
41 | std::back_inserter(branching));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::EqualityComparable<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> >]’
20 | ~usage_requirements() { ((Model*)0)->~Model(); }
| ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::EqualityComparable<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:91:9: required from ‘boost::concepts::EdgeListGraph<G>::~EdgeListGraph() [with G = R_adjacency_list<boost::directedS, double>]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/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<R_adjacency_list<boost::directedS, double> >]’
226 | BOOST_concept(EdgeListGraph, (G)) : Graph< G >
| ^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:50:7: required from ‘void boost::function_requires(Model*) [with Model = concepts::EdgeListGraphConcept<R_adjacency_list<directedS, double> >]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
edmonds_optimum_branching_impl.hpp:523:62: required from ‘void edmonds_optimum_branching(TEdgeListGraph&, TVertexIndexMap, TWeightMap, TInputIterator, TInputIterator, TOutputIterator) [with bool TOptimumIsMaximum = true; bool TAttemptToSpan = false; bool TGraphIsDense = false; TEdgeListGraph = R_adjacency_list<boost::directedS, double>; TVertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>; TWeightMap = boost::adj_list_edge_property_map<boost::directed_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>; TInputIterator = long unsigned int*; TOutputIterator = std::back_insert_iterator<std::vector<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > >]’
523 | function_requires< EdgeListGraphConcept<TEdgeListGraph> >();
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~
edmonds_optimum_branching.cpp:36:47: required from here
36 | edmonds_optimum_branching<true, false, false>(g,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
37 | vertex_indices,
| ~~~~~~~~~~~~~~~
38 | weights,
| ~~~~~~~~
39 | static_cast<Vertex *>(0),
| ~~~~~~~~~~~~~~~~~~~~~~~~~
40 | static_cast<Vertex *>(0),
| ~~~~~~~~~~~~~~~~~~~~~~~~~
41 | std::back_inserter(branching));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::EqualityComparable<TT>::~EqualityComparable() [with TT = boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>]’
37 | ~model()
| ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:233:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
233 | BOOST_CONCEPT_USAGE(EqualityComparable) {
| ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Assignable<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:145:5: required from ‘struct boost::Assignable<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> >’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::Assignable<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> >]’
32 | inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
| ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied<boost::Assignable<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > >::value’
44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied<boost::Assignable<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > >’
45 | typedef boost::integral_constant<bool, value> type;
| ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_<void (*)(boost::Assignable<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> >)>’
72 | struct requirement_<void(*)(Model)>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:92:9: required from ‘boost::concepts::EdgeListGraph<G>::~EdgeListGraph() [with G = R_adjacency_list<boost::directedS, double>]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/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<R_adjacency_list<boost::directedS, double> >]’
226 | BOOST_concept(EdgeListGraph, (G)) : Graph< G >
| ^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:50:7: required from ‘void boost::function_requires(Model*) [with Model = concepts::EdgeListGraphConcept<R_adjacency_list<directedS, double> >]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
edmonds_optimum_branching_impl.hpp:523:62: required from ‘void edmonds_optimum_branching(TEdgeListGraph&, TVertexIndexMap, TWeightMap, TInputIterator, TInputIterator, TOutputIterator) [with bool TOptimumIsMaximum = true; bool TAttemptToSpan = false; bool TGraphIsDense = false; TEdgeListGraph = R_adjacency_list<boost::directedS, double>; TVertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>; TWeightMap = boost::adj_list_edge_property_map<boost::directed_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>; TInputIterator = long unsigned int*; TOutputIterator = std::back_insert_iterator<std::vector<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > >]’
523 | function_requires< EdgeListGraphConcept<TEdgeListGraph> >();
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~
edmonds_optimum_branching.cpp:36:47: required from here
36 | edmonds_optimum_branching<true, false, false>(g,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
37 | vertex_indices,
| ~~~~~~~~~~~~~~~
38 | weights,
| ~~~~~~~~
39 | static_cast<Vertex *>(0),
| ~~~~~~~~~~~~~~~~~~~~~~~~~
40 | static_cast<Vertex *>(0),
| ~~~~~~~~~~~~~~~~~~~~~~~~~
41 | std::back_inserter(branching));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Assignable<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> >]’
20 | ~usage_requirements() { ((Model*)0)->~Model(); }
| ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::Assignable<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:92:9: required from ‘boost::concepts::EdgeListGraph<G>::~EdgeListGraph() [with G = R_adjacency_list<boost::directedS, double>]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/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<R_adjacency_list<boost::directedS, double> >]’
226 | BOOST_concept(EdgeListGraph, (G)) : Graph< G >
| ^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:50:7: required from ‘void boost::function_requires(Model*) [with Model = concepts::EdgeListGraphConcept<R_adjacency_list<directedS, double> >]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
edmonds_optimum_branching_impl.hpp:523:62: required from ‘void edmonds_optimum_branching(TEdgeListGraph&, TVertexIndexMap, TWeightMap, TInputIterator, TInputIterator, TOutputIterator) [with bool TOptimumIsMaximum = true; bool TAttemptToSpan = false; bool TGraphIsDense = false; TEdgeListGraph = R_adjacency_list<boost::directedS, double>; TVertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>; TWeightMap = boost::adj_list_edge_property_map<boost::directed_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>; TInputIterator = long unsigned int*; TOutputIterator = std::back_insert_iterator<std::vector<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > >]’
523 | function_requires< EdgeListGraphConcept<TEdgeListGraph> >();
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~
edmonds_optimum_branching.cpp:36:47: required from here
36 | edmonds_optimum_branching<true, false, false>(g,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
37 | vertex_indices,
| ~~~~~~~~~~~~~~~
38 | weights,
| ~~~~~~~~
39 | static_cast<Vertex *>(0),
| ~~~~~~~~~~~~~~~~~~~~~~~~~
40 | static_cast<Vertex *>(0),
| ~~~~~~~~~~~~~~~~~~~~~~~~~
41 | std::back_inserter(branching));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Assignable<TT>::~Assignable() [with TT = boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>]’
37 | ~model()
| ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:145:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
145 | BOOST_CONCEPT_USAGE(Assignable) {
| ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/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> >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/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> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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);
| ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/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) );
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/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;
| ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/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)>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:239:9: required from ‘boost::concepts::EdgeListGraph<G>::~EdgeListGraph() [with G = R_adjacency_list<boost::directedS, double>]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/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<R_adjacency_list<boost::directedS, double> >]’
226 | BOOST_concept(EdgeListGraph, (G)) : Graph< G >
| ^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:50:7: required from ‘void boost::function_requires(Model*) [with Model = concepts::EdgeListGraphConcept<R_adjacency_list<directedS, double> >]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
edmonds_optimum_branching_impl.hpp:523:62: required from ‘void edmonds_optimum_branching(TEdgeListGraph&, TVertexIndexMap, TWeightMap, TInputIterator, TInputIterator, TOutputIterator) [with bool TOptimumIsMaximum = true; bool TAttemptToSpan = false; bool TGraphIsDense = false; TEdgeListGraph = R_adjacency_list<boost::directedS, double>; TVertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>; TWeightMap = boost::adj_list_edge_property_map<boost::directed_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>; TInputIterator = long unsigned int*; TOutputIterator = std::back_insert_iterator<std::vector<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > >]’
523 | function_requires< EdgeListGraphConcept<TEdgeListGraph> >();
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~
edmonds_optimum_branching.cpp:36:47: required from here
36 | edmonds_optimum_branching<true, false, false>(g,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
37 | vertex_indices,
| ~~~~~~~~~~~~~~~
38 | weights,
| ~~~~~~~~
39 | static_cast<Vertex *>(0),
| ~~~~~~~~~~~~~~~~~~~~~~~~~
40 | static_cast<Vertex *>(0),
| ~~~~~~~~~~~~~~~~~~~~~~~~~
41 | std::back_inserter(branching));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/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(); }
| ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/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>]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:239:9: required from ‘boost::concepts::EdgeListGraph<G>::~EdgeListGraph() [with G = R_adjacency_list<boost::directedS, double>]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/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<R_adjacency_list<boost::directedS, double> >]’
226 | BOOST_concept(EdgeListGraph, (G)) : Graph< G >
| ^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:50:7: required from ‘void boost::function_requires(Model*) [with Model = concepts::EdgeListGraphConcept<R_adjacency_list<directedS, double> >]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
edmonds_optimum_branching_impl.hpp:523:62: required from ‘void edmonds_optimum_branching(TEdgeListGraph&, TVertexIndexMap, TWeightMap, TInputIterator, TInputIterator, TOutputIterator) [with bool TOptimumIsMaximum = true; bool TAttemptToSpan = false; bool TGraphIsDense = false; TEdgeListGraph = R_adjacency_list<boost::directedS, double>; TVertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>; TWeightMap = boost::adj_list_edge_property_map<boost::directed_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>; TInputIterator = long unsigned int*; TOutputIterator = std::back_insert_iterator<std::vector<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > >]’
523 | function_requires< EdgeListGraphConcept<TEdgeListGraph> >();
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~
edmonds_optimum_branching.cpp:36:47: required from here
36 | edmonds_optimum_branching<true, false, false>(g,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
37 | vertex_indices,
| ~~~~~~~~~~~~~~~
38 | weights,
| ~~~~~~~~
39 | static_cast<Vertex *>(0),
| ~~~~~~~~~~~~~~~~~~~~~~~~~
40 | static_cast<Vertex *>(0),
| ~~~~~~~~~~~~~~~~~~~~~~~~~
41 | std::back_inserter(branching));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/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()
| ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
208 | BOOST_CONCEPT_USAGE(Convertible) {
| ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Convertible<boost::lvalue_property_map_tag, boost::readable_property_map_tag>]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/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(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/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> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/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))
| ^~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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);
| ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/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) );
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied<boost::ReadablePropertyMapConcept<boost::adj_list_edge_property_map<boost::directed_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > >::value’
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied<boost::ReadablePropertyMapConcept<boost::adj_list_edge_property_map<boost::directed_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > >’
45 | typedef boost::integral_constant<bool, value> type;
| ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_<void (*)(boost::ReadablePropertyMapConcept<boost::adj_list_edge_property_map<boost::directed_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> >)>’
72 | struct requirement_<void(*)(Model)>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:50:7: required from ‘void boost::function_requires(Model*) [with Model = ReadablePropertyMapConcept<adj_list_edge_property_map<directed_tag, double, double&, long unsigned int, property<edge_weight_t, double, no_property>, edge_weight_t>, detail::edge_desc_impl<directed_tag, long unsigned int> >]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
edmonds_optimum_branching_impl.hpp:524:70: required from ‘void edmonds_optimum_branching(TEdgeListGraph&, TVertexIndexMap, TWeightMap, TInputIterator, TInputIterator, TOutputIterator) [with bool TOptimumIsMaximum = true; bool TAttemptToSpan = false; bool TGraphIsDense = false; TEdgeListGraph = R_adjacency_list<boost::directedS, double>; TVertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>; TWeightMap = boost::adj_list_edge_property_map<boost::directed_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>; TInputIterator = long unsigned int*; TOutputIterator = std::back_insert_iterator<std::vector<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > >]’
524 | function_requires< ReadablePropertyMapConcept<TWeightMap, Edge> >();
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~
edmonds_optimum_branching.cpp:36:47: required from here
36 | edmonds_optimum_branching<true, false, false>(g,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
37 | vertex_indices,
| ~~~~~~~~~~~~~~~
38 | weights,
| ~~~~~~~~
39 | static_cast<Vertex *>(0),
| ~~~~~~~~~~~~~~~~~~~~~~~~~
40 | static_cast<Vertex *>(0),
| ~~~~~~~~~~~~~~~~~~~~~~~~~
41 | std::back_inserter(branching));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
20 | ~usage_requirements() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible<X, Y>::~Convertible() [with X = boost::lvalue_property_map_tag; Y = boost::readable_property_map_tag]’
37 | ~model()
| ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
208 | BOOST_CONCEPT_USAGE(Convertible) {
| ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/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>]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/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(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/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> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/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))
| ^~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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);
| ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/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) );
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied<boost::ReadablePropertyMapConcept<boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int> >::value’
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied<boost::ReadablePropertyMapConcept<boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int> >’
45 | typedef boost::integral_constant<bool, value> type;
| ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_<void (*)(boost::ReadablePropertyMapConcept<boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int>)>’
72 | struct requirement_<void(*)(Model)>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:50:7: required from ‘void boost::function_requires(Model*) [with Model = ReadablePropertyMapConcept<vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>, long unsigned int>]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
edmonds_optimum_branching_impl.hpp:525:77: required from ‘void edmonds_optimum_branching(TEdgeListGraph&, TVertexIndexMap, TWeightMap, TInputIterator, TInputIterator, TOutputIterator) [with bool TOptimumIsMaximum = true; bool TAttemptToSpan = false; bool TGraphIsDense = false; TEdgeListGraph = R_adjacency_list<boost::directedS, double>; TVertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>; TWeightMap = boost::adj_list_edge_property_map<boost::directed_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>; TInputIterator = long unsigned int*; TOutputIterator = std::back_insert_iterator<std::vector<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > >]’
525 | function_requires< ReadablePropertyMapConcept<TVertexIndexMap, Vertex> >();
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~
edmonds_optimum_branching.cpp:36:47: required from here
36 | edmonds_optimum_branching<true, false, false>(g,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
37 | vertex_indices,
| ~~~~~~~~~~~~~~~
38 | weights,
| ~~~~~~~~
39 | static_cast<Vertex *>(0),
| ~~~~~~~~~~~~~~~~~~~~~~~~~
40 | static_cast<Vertex *>(0),
| ~~~~~~~~~~~~~~~~~~~~~~~~~
41 | std::back_inserter(branching));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
20 | ~usage_requirements() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/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()
| ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
208 | BOOST_CONCEPT_USAGE(Convertible) {
| ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::SignedInteger<long int>]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:514:9: required from ‘boost::InputIterator<TT>::~InputIterator() [with TT = long unsigned int*]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:502:3: required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::InputIteratorConcept<long unsigned int*>]’
502 | BOOST_concept(InputIterator,(TT))
| ^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:50:7: required from ‘void boost::function_requires(Model*) [with Model = InputIteratorConcept<long unsigned int*>]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
edmonds_optimum_branching_impl.hpp:526:62: required from ‘void edmonds_optimum_branching(TEdgeListGraph&, TVertexIndexMap, TWeightMap, TInputIterator, TInputIterator, TOutputIterator) [with bool TOptimumIsMaximum = true; bool TAttemptToSpan = false; bool TGraphIsDense = false; TEdgeListGraph = R_adjacency_list<boost::directedS, double>; TVertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>; TWeightMap = boost::adj_list_edge_property_map<boost::directed_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>; TInputIterator = long unsigned int*; TOutputIterator = std::back_insert_iterator<std::vector<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > >]’
526 | function_requires< InputIteratorConcept<TInputIterator> >();
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~
edmonds_optimum_branching.cpp:36:47: required from here
36 | edmonds_optimum_branching<true, false, false>(g,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
37 | vertex_indices,
| ~~~~~~~~~~~~~~~
38 | weights,
| ~~~~~~~~
39 | static_cast<Vertex *>(0),
| ~~~~~~~~~~~~~~~~~~~~~~~~~
40 | static_cast<Vertex *>(0),
| ~~~~~~~~~~~~~~~~~~~~~~~~~
41 | std::back_inserter(branching));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:107:22: note: in a call to non-static member function ‘boost::SignedInteger<long int>::~SignedInteger()’
107 | template <> struct SignedInteger<long> {};
| ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Convertible<std::random_access_iterator_tag, std::input_iterator_tag> >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/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> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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);
| ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/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) );
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/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;
| ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/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)>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:515:9: required from ‘boost::InputIterator<TT>::~InputIterator() [with TT = long unsigned int*]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:502:3: required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::InputIteratorConcept<long unsigned int*>]’
502 | BOOST_concept(InputIterator,(TT))
| ^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:50:7: required from ‘void boost::function_requires(Model*) [with Model = InputIteratorConcept<long unsigned int*>]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
edmonds_optimum_branching_impl.hpp:526:62: required from ‘void edmonds_optimum_branching(TEdgeListGraph&, TVertexIndexMap, TWeightMap, TInputIterator, TInputIterator, TOutputIterator) [with bool TOptimumIsMaximum = true; bool TAttemptToSpan = false; bool TGraphIsDense = false; TEdgeListGraph = R_adjacency_list<boost::directedS, double>; TVertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>; TWeightMap = boost::adj_list_edge_property_map<boost::directed_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>; TInputIterator = long unsigned int*; TOutputIterator = std::back_insert_iterator<std::vector<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > >]’
526 | function_requires< InputIteratorConcept<TInputIterator> >();
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~
edmonds_optimum_branching.cpp:36:47: required from here
36 | edmonds_optimum_branching<true, false, false>(g,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
37 | vertex_indices,
| ~~~~~~~~~~~~~~~
38 | weights,
| ~~~~~~~~
39 | static_cast<Vertex *>(0),
| ~~~~~~~~~~~~~~~~~~~~~~~~~
40 | static_cast<Vertex *>(0),
| ~~~~~~~~~~~~~~~~~~~~~~~~~
41 | std::back_inserter(branching));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Convertible<std::random_access_iterator_tag, std::input_iterator_tag>]’
20 | ~usage_requirements() { ((Model*)0)->~Model(); }
| ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::Convertible<std::random_access_iterator_tag, std::input_iterator_tag>]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:515:9: required from ‘boost::InputIterator<TT>::~InputIterator() [with TT = long unsigned int*]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:502:3: required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::InputIteratorConcept<long unsigned int*>]’
502 | BOOST_concept(InputIterator,(TT))
| ^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:50:7: required from ‘void boost::function_requires(Model*) [with Model = InputIteratorConcept<long unsigned int*>]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
edmonds_optimum_branching_impl.hpp:526:62: required from ‘void edmonds_optimum_branching(TEdgeListGraph&, TVertexIndexMap, TWeightMap, TInputIterator, TInputIterator, TOutputIterator) [with bool TOptimumIsMaximum = true; bool TAttemptToSpan = false; bool TGraphIsDense = false; TEdgeListGraph = R_adjacency_list<boost::directedS, double>; TVertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>; TWeightMap = boost::adj_list_edge_property_map<boost::directed_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>; TInputIterator = long unsigned int*; TOutputIterator = std::back_insert_iterator<std::vector<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > >]’
526 | function_requires< InputIteratorConcept<TInputIterator> >();
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~
edmonds_optimum_branching.cpp:36:47: required from here
36 | edmonds_optimum_branching<true, false, false>(g,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
37 | vertex_indices,
| ~~~~~~~~~~~~~~~
38 | weights,
| ~~~~~~~~
39 | static_cast<Vertex *>(0),
| ~~~~~~~~~~~~~~~~~~~~~~~~~
40 | static_cast<Vertex *>(0),
| ~~~~~~~~~~~~~~~~~~~~~~~~~
41 | std::back_inserter(branching));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible<X, Y>::~Convertible() [with X = std::random_access_iterator_tag; Y = std::input_iterator_tag]’
37 | ~model()
| ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
208 | BOOST_CONCEPT_USAGE(Convertible) {
| ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::DefaultConstructible<long unsigned int> >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:137:5: required from ‘struct boost::DefaultConstructible<long unsigned int>’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::DefaultConstructible<long unsigned int>]’
32 | inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
| ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied<boost::DefaultConstructible<long unsigned int> >::value’
44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied<boost::DefaultConstructible<long unsigned int> >’
45 | typedef boost::integral_constant<bool, value> type;
| ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_<void (*)(boost::DefaultConstructible<long unsigned int>)>’
72 | struct requirement_<void(*)(Model)>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:68:9: [ skipping 7 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied<boost::concepts::EdgeListGraphConcept<R_adjacency_list<boost::directedS, double> > >::value’
44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied<boost::concepts::EdgeListGraphConcept<R_adjacency_list<boost::directedS, double> > >’
45 | typedef boost::integral_constant<bool, value> type;
| ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_<void (*)(boost::concepts::EdgeListGraphConcept<R_adjacency_list<boost::directedS, double> >)>’
72 | struct requirement_<void(*)(Model)>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:50:7: required from ‘void boost::function_requires(Model*) [with Model = concepts::EdgeListGraphConcept<R_adjacency_list<directedS, double> >]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
edmonds_optimum_branching_impl.hpp:523:62: required from ‘void edmonds_optimum_branching(TEdgeListGraph&, TVertexIndexMap, TWeightMap, TInputIterator, TInputIterator, TOutputIterator) [with bool TOptimumIsMaximum = true; bool TAttemptToSpan = false; bool TGraphIsDense = false; TEdgeListGraph = R_adjacency_list<boost::directedS, double>; TVertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>; TWeightMap = boost::adj_list_edge_property_map<boost::directed_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>; TInputIterator = long unsigned int*; TOutputIterator = std::back_insert_iterator<std::vector<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > >]’
523 | function_requires< EdgeListGraphConcept<TEdgeListGraph> >();
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~
edmonds_optimum_branching.cpp:36:47: required from here
36 | edmonds_optimum_branching<true, false, false>(g,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
37 | vertex_indices,
| ~~~~~~~~~~~~~~~
38 | weights,
| ~~~~~~~~
39 | static_cast<Vertex *>(0),
| ~~~~~~~~~~~~~~~~~~~~~~~~~
40 | static_cast<Vertex *>(0),
| ~~~~~~~~~~~~~~~~~~~~~~~~~
41 | std::back_inserter(branching));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::DefaultConstructible<long unsigned int>]’
20 | ~usage_requirements() { ((Model*)0)->~Model(); }
| ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::DefaultConstructible<long unsigned int>]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:68:9: required from ‘boost::concepts::Graph<G>::~Graph() [with G = R_adjacency_list<boost::directedS, double>]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: required from ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::concepts::Graph<R_adjacency_list<boost::directedS, double> >]’
20 | ~usage_requirements() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/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<R_adjacency_list<boost::directedS, double> > >]’
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:66:5: required from ‘struct boost::concepts::Graph<R_adjacency_list<boost::directedS, double> >’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:226:1: required from ‘struct boost::concepts::EdgeListGraph<R_adjacency_list<boost::directedS, double> >’
226 | BOOST_concept(EdgeListGraph, (G)) : Graph< G >
| ^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:226:1: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied<boost::concepts::EdgeListGraphConcept<R_adjacency_list<boost::directedS, double> > >::value’
44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied<boost::concepts::EdgeListGraphConcept<R_adjacency_list<boost::directedS, double> > >’
45 | typedef boost::integral_constant<bool, value> type;
| ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_<void (*)(boost::concepts::EdgeListGraphConcept<R_adjacency_list<boost::directedS, double> >)>’
72 | struct requirement_<void(*)(Model)>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:50:7: required from ‘void boost::function_requires(Model*) [with Model = concepts::EdgeListGraphConcept<R_adjacency_list<directedS, double> >]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
edmonds_optimum_branching_impl.hpp:523:62: required from ‘void edmonds_optimum_branching(TEdgeListGraph&, TVertexIndexMap, TWeightMap, TInputIterator, TInputIterator, TOutputIterator) [with bool TOptimumIsMaximum = true; bool TAttemptToSpan = false; bool TGraphIsDense = false; TEdgeListGraph = R_adjacency_list<boost::directedS, double>; TVertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>; TWeightMap = boost::adj_list_edge_property_map<boost::directed_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>; TInputIterator = long unsigned int*; TOutputIterator = std::back_insert_iterator<std::vector<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > >]’
523 | function_requires< EdgeListGraphConcept<TEdgeListGraph> >();
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~
edmonds_optimum_branching.cpp:36:47: required from here
36 | edmonds_optimum_branching<true, false, false>(g,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
37 | vertex_indices,
| ~~~~~~~~~~~~~~~
38 | weights,
| ~~~~~~~~
39 | static_cast<Vertex *>(0),
| ~~~~~~~~~~~~~~~~~~~~~~~~~
40 | static_cast<Vertex *>(0),
| ~~~~~~~~~~~~~~~~~~~~~~~~~
41 | std::back_inserter(branching));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::DefaultConstructible<TT>::~DefaultConstructible() [with TT = long unsigned int]’
37 | ~model()
| ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:137:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
137 | BOOST_CONCEPT_USAGE(DefaultConstructible) {
| ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::EqualityComparable<long unsigned int> >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable<long unsigned int>’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::EqualityComparable<long unsigned int>]’
32 | inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
| ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied<boost::EqualityComparable<long unsigned int> >::value’
44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied<boost::EqualityComparable<long unsigned int> >’
45 | typedef boost::integral_constant<bool, value> type;
| ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_<void (*)(boost::EqualityComparable<long unsigned int>)>’
72 | struct requirement_<void(*)(Model)>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:69:9: [ skipping 7 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied<boost::concepts::EdgeListGraphConcept<R_adjacency_list<boost::directedS, double> > >::value’
44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied<boost::concepts::EdgeListGraphConcept<R_adjacency_list<boost::directedS, double> > >’
45 | typedef boost::integral_constant<bool, value> type;
| ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_<void (*)(boost::concepts::EdgeListGraphConcept<R_adjacency_list<boost::directedS, double> >)>’
72 | struct requirement_<void(*)(Model)>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:50:7: required from ‘void boost::function_requires(Model*) [with Model = concepts::EdgeListGraphConcept<R_adjacency_list<directedS, double> >]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
edmonds_optimum_branching_impl.hpp:523:62: required from ‘void edmonds_optimum_branching(TEdgeListGraph&, TVertexIndexMap, TWeightMap, TInputIterator, TInputIterator, TOutputIterator) [with bool TOptimumIsMaximum = true; bool TAttemptToSpan = false; bool TGraphIsDense = false; TEdgeListGraph = R_adjacency_list<boost::directedS, double>; TVertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>; TWeightMap = boost::adj_list_edge_property_map<boost::directed_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>; TInputIterator = long unsigned int*; TOutputIterator = std::back_insert_iterator<std::vector<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > >]’
523 | function_requires< EdgeListGraphConcept<TEdgeListGraph> >();
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~
edmonds_optimum_branching.cpp:36:47: required from here
36 | edmonds_optimum_branching<true, false, false>(g,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
37 | vertex_indices,
| ~~~~~~~~~~~~~~~
38 | weights,
| ~~~~~~~~
39 | static_cast<Vertex *>(0),
| ~~~~~~~~~~~~~~~~~~~~~~~~~
40 | static_cast<Vertex *>(0),
| ~~~~~~~~~~~~~~~~~~~~~~~~~
41 | std::back_inserter(branching));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::EqualityComparable<long unsigned int>]’
20 | ~usage_requirements() { ((Model*)0)->~Model(); }
| ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::EqualityComparable<long unsigned int>]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:69:9: required from ‘boost::concepts::Graph<G>::~Graph() [with G = R_adjacency_list<boost::directedS, double>]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: required from ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::concepts::Graph<R_adjacency_list<boost::directedS, double> >]’
20 | ~usage_requirements() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/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<R_adjacency_list<boost::directedS, double> > >]’
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:66:5: required from ‘struct boost::concepts::Graph<R_adjacency_list<boost::directedS, double> >’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:226:1: required from ‘struct boost::concepts::EdgeListGraph<R_adjacency_list<boost::directedS, double> >’
226 | BOOST_concept(EdgeListGraph, (G)) : Graph< G >
| ^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:226:1: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied<boost::concepts::EdgeListGraphConcept<R_adjacency_list<boost::directedS, double> > >::value’
44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied<boost::concepts::EdgeListGraphConcept<R_adjacency_list<boost::directedS, double> > >’
45 | typedef boost::integral_constant<bool, value> type;
| ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_<void (*)(boost::concepts::EdgeListGraphConcept<R_adjacency_list<boost::directedS, double> >)>’
72 | struct requirement_<void(*)(Model)>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:50:7: required from ‘void boost::function_requires(Model*) [with Model = concepts::EdgeListGraphConcept<R_adjacency_list<directedS, double> >]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
edmonds_optimum_branching_impl.hpp:523:62: required from ‘void edmonds_optimum_branching(TEdgeListGraph&, TVertexIndexMap, TWeightMap, TInputIterator, TInputIterator, TOutputIterator) [with bool TOptimumIsMaximum = true; bool TAttemptToSpan = false; bool TGraphIsDense = false; TEdgeListGraph = R_adjacency_list<boost::directedS, double>; TVertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>; TWeightMap = boost::adj_list_edge_property_map<boost::directed_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>; TInputIterator = long unsigned int*; TOutputIterator = std::back_insert_iterator<std::vector<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > >]’
523 | function_requires< EdgeListGraphConcept<TEdgeListGraph> >();
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~
edmonds_optimum_branching.cpp:36:47: required from here
36 | edmonds_optimum_branching<true, false, false>(g,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
37 | vertex_indices,
| ~~~~~~~~~~~~~~~
38 | weights,
| ~~~~~~~~
39 | static_cast<Vertex *>(0),
| ~~~~~~~~~~~~~~~~~~~~~~~~~
40 | static_cast<Vertex *>(0),
| ~~~~~~~~~~~~~~~~~~~~~~~~~
41 | std::back_inserter(branching));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::EqualityComparable<TT>::~EqualityComparable() [with TT = long unsigned int]’
37 | ~model()
| ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:233:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
233 | BOOST_CONCEPT_USAGE(EqualityComparable) {
| ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Assignable<long unsigned int> >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:145:5: required from ‘struct boost::Assignable<long unsigned int>’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::Assignable<long unsigned int>]’
32 | inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
| ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied<boost::Assignable<long unsigned int> >::value’
44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied<boost::Assignable<long unsigned int> >’
45 | typedef boost::integral_constant<bool, value> type;
| ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_<void (*)(boost::Assignable<long unsigned int>)>’
72 | struct requirement_<void(*)(Model)>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:70:9: [ skipping 7 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied<boost::concepts::EdgeListGraphConcept<R_adjacency_list<boost::directedS, double> > >::value’
44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied<boost::concepts::EdgeListGraphConcept<R_adjacency_list<boost::directedS, double> > >’
45 | typedef boost::integral_constant<bool, value> type;
| ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_<void (*)(boost::concepts::EdgeListGraphConcept<R_adjacency_list<boost::directedS, double> >)>’
72 | struct requirement_<void(*)(Model)>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:50:7: required from ‘void boost::function_requires(Model*) [with Model = concepts::EdgeListGraphConcept<R_adjacency_list<directedS, double> >]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
edmonds_optimum_branching_impl.hpp:523:62: required from ‘void edmonds_optimum_branching(TEdgeListGraph&, TVertexIndexMap, TWeightMap, TInputIterator, TInputIterator, TOutputIterator) [with bool TOptimumIsMaximum = true; bool TAttemptToSpan = false; bool TGraphIsDense = false; TEdgeListGraph = R_adjacency_list<boost::directedS, double>; TVertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>; TWeightMap = boost::adj_list_edge_property_map<boost::directed_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>; TInputIterator = long unsigned int*; TOutputIterator = std::back_insert_iterator<std::vector<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > >]’
523 | function_requires< EdgeListGraphConcept<TEdgeListGraph> >();
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~
edmonds_optimum_branching.cpp:36:47: required from here
36 | edmonds_optimum_branching<true, false, false>(g,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
37 | vertex_indices,
| ~~~~~~~~~~~~~~~
38 | weights,
| ~~~~~~~~
39 | static_cast<Vertex *>(0),
| ~~~~~~~~~~~~~~~~~~~~~~~~~
40 | static_cast<Vertex *>(0),
| ~~~~~~~~~~~~~~~~~~~~~~~~~
41 | std::back_inserter(branching));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Assignable<long unsigned int>]’
20 | ~usage_requirements() { ((Model*)0)->~Model(); }
| ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::Assignable<long unsigned int>]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:70:9: required from ‘boost::concepts::Graph<G>::~Graph() [with G = R_adjacency_list<boost::directedS, double>]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: required from ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::concepts::Graph<R_adjacency_list<boost::directedS, double> >]’
20 | ~usage_requirements() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/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<R_adjacency_list<boost::directedS, double> > >]’
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:66:5: required from ‘struct boost::concepts::Graph<R_adjacency_list<boost::directedS, double> >’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:226:1: required from ‘struct boost::concepts::EdgeListGraph<R_adjacency_list<boost::directedS, double> >’
226 | BOOST_concept(EdgeListGraph, (G)) : Graph< G >
| ^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:226:1: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied<boost::concepts::EdgeListGraphConcept<R_adjacency_list<boost::directedS, double> > >::value’
44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied<boost::concepts::EdgeListGraphConcept<R_adjacency_list<boost::directedS, double> > >’
45 | typedef boost::integral_constant<bool, value> type;
| ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_<void (*)(boost::concepts::EdgeListGraphConcept<R_adjacency_list<boost::directedS, double> >)>’
72 | struct requirement_<void(*)(Model)>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:50:7: required from ‘void boost::function_requires(Model*) [with Model = concepts::EdgeListGraphConcept<R_adjacency_list<directedS, double> >]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
edmonds_optimum_branching_impl.hpp:523:62: required from ‘void edmonds_optimum_branching(TEdgeListGraph&, TVertexIndexMap, TWeightMap, TInputIterator, TInputIterator, TOutputIterator) [with bool TOptimumIsMaximum = true; bool TAttemptToSpan = false; bool TGraphIsDense = false; TEdgeListGraph = R_adjacency_list<boost::directedS, double>; TVertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>; TWeightMap = boost::adj_list_edge_property_map<boost::directed_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>; TInputIterator = long unsigned int*; TOutputIterator = std::back_insert_iterator<std::vector<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > >]’
523 | function_requires< EdgeListGraphConcept<TEdgeListGraph> >();
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~
edmonds_optimum_branching.cpp:36:47: required from here
36 | edmonds_optimum_branching<true, false, false>(g,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
37 | vertex_indices,
| ~~~~~~~~~~~~~~~
38 | weights,
| ~~~~~~~~
39 | static_cast<Vertex *>(0),
| ~~~~~~~~~~~~~~~~~~~~~~~~~
40 | static_cast<Vertex *>(0),
| ~~~~~~~~~~~~~~~~~~~~~~~~~
41 | std::back_inserter(branching));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Assignable<TT>::~Assignable() [with TT = long unsigned int]’
37 | ~model()
| ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:145:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
145 | BOOST_CONCEPT_USAGE(Assignable) {
| ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/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<boost::range_detail::integer_iterator<long unsigned int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int>, boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_color_t, boost::default_color_type>, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::no_property, boost::listS> > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/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<boost::range_detail::integer_iterator<long unsigned int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int>, boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_color_t, boost::default_color_type>, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::no_property, boost::listS> > > >]’
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:52:50: required from ‘struct boost::concepts::MultiPassInputIterator<boost::detail::adj_list_edge_iterator<boost::range_detail::integer_iterator<long unsigned int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int>, boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_color_t, boost::default_color_type>, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::no_property, boost::listS> > >’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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<boost::range_detail::integer_iterator<long unsigned int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int>, boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_color_t, boost::default_color_type>, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::no_property, boost::listS> > >]’
32 | inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
| ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/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<boost::range_detail::integer_iterator<long unsigned int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int>, boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_color_t, boost::default_color_type>, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::no_property, boost::listS> > > >::value’
44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/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<boost::range_detail::integer_iterator<long unsigned int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int>, boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_color_t, boost::default_color_type>, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::no_property, boost::listS> > > >’
45 | typedef boost::integral_constant<bool, value> type;
| ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/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<boost::range_detail::integer_iterator<long unsigned int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int>, boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_color_t, boost::default_color_type>, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::no_property, boost::listS> > >)>’
72 | struct requirement_<void(*)(Model)>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:235:9: required from ‘boost::concepts::EdgeListGraph<G>::~EdgeListGraph() [with G = R_adjacency_list<boost::directedS, double>]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/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<R_adjacency_list<boost::directedS, double> >]’
226 | BOOST_concept(EdgeListGraph, (G)) : Graph< G >
| ^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:50:7: required from ‘void boost::function_requires(Model*) [with Model = concepts::EdgeListGraphConcept<R_adjacency_list<directedS, double> >]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
edmonds_optimum_branching_impl.hpp:523:62: required from ‘void edmonds_optimum_branching(TEdgeListGraph&, TVertexIndexMap, TWeightMap, TInputIterator, TInputIterator, TOutputIterator) [with bool TOptimumIsMaximum = true; bool TAttemptToSpan = false; bool TGraphIsDense = false; TEdgeListGraph = R_adjacency_list<boost::directedS, double>; TVertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>; TWeightMap = boost::adj_list_edge_property_map<boost::directed_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>; TInputIterator = long unsigned int*; TOutputIterator = std::back_insert_iterator<std::vector<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > >]’
523 | function_requires< EdgeListGraphConcept<TEdgeListGraph> >();
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~
edmonds_optimum_branching.cpp:36:47: required from here
36 | edmonds_optimum_branching<true, false, false>(g,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
37 | vertex_indices,
| ~~~~~~~~~~~~~~~
38 | weights,
| ~~~~~~~~
39 | static_cast<Vertex *>(0),
| ~~~~~~~~~~~~~~~~~~~~~~~~~
40 | static_cast<Vertex *>(0),
| ~~~~~~~~~~~~~~~~~~~~~~~~~
41 | std::back_inserter(branching));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
20 | ~usage_requirements() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/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<boost::range_detail::integer_iterator<long unsigned int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int>, boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_color_t, boost::default_color_type>, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::no_property, boost::listS> >]’
37 | ~model()
| ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:52:50: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
52 | BOOST_concept(MultiPassInputIterator, (T)) { BOOST_CONCEPT_USAGE(
| ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::DefaultConstructible<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::DefaultConstructible<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > >]’
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:137:5: required from ‘struct boost::DefaultConstructible<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> >’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::DefaultConstructible<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> >]’
32 | inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
| ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied<boost::DefaultConstructible<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > >::value’
44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied<boost::DefaultConstructible<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > >’
45 | typedef boost::integral_constant<bool, value> type;
| ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_<void (*)(boost::DefaultConstructible<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> >)>’
72 | struct requirement_<void(*)(Model)>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:90:9: required from ‘boost::concepts::EdgeListGraph<G>::~EdgeListGraph() [with G = R_adjacency_list<boost::directedS, double>]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/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<R_adjacency_list<boost::directedS, double> >]’
226 | BOOST_concept(EdgeListGraph, (G)) : Graph< G >
| ^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:50:7: required from ‘void boost::function_requires(Model*) [with Model = concepts::EdgeListGraphConcept<R_adjacency_list<directedS, double> >]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
edmonds_optimum_branching_impl.hpp:523:62: required from ‘void edmonds_optimum_branching(TEdgeListGraph&, TVertexIndexMap, TWeightMap, TInputIterator, TInputIterator, TOutputIterator) [with bool TOptimumIsMaximum = true; bool TAttemptToSpan = false; bool TGraphIsDense = false; TEdgeListGraph = R_adjacency_list<boost::directedS, double>; TVertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>; TWeightMap = boost::adj_list_edge_property_map<boost::directed_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>; TInputIterator = long unsigned int*; TOutputIterator = std::back_insert_iterator<std::vector<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > >]’
523 | function_requires< EdgeListGraphConcept<TEdgeListGraph> >();
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~
edmonds_optimum_branching.cpp:36:47: required from here
36 | edmonds_optimum_branching<true, false, false>(g,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
37 | vertex_indices,
| ~~~~~~~~~~~~~~~
38 | weights,
| ~~~~~~~~
39 | static_cast<Vertex *>(0),
| ~~~~~~~~~~~~~~~~~~~~~~~~~
40 | static_cast<Vertex *>(0),
| ~~~~~~~~~~~~~~~~~~~~~~~~~
41 | std::back_inserter(branching));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
20 | ~usage_requirements() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::DefaultConstructible<TT>::~DefaultConstructible() [with TT = boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>]’
37 | ~model()
| ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:137:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
137 | BOOST_CONCEPT_USAGE(DefaultConstructible) {
| ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::EqualityComparable<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::EqualityComparable<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > >]’
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> >’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::EqualityComparable<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> >]’
32 | inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
| ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied<boost::EqualityComparable<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > >::value’
44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied<boost::EqualityComparable<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > >’
45 | typedef boost::integral_constant<bool, value> type;
| ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_<void (*)(boost::EqualityComparable<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> >)>’
72 | struct requirement_<void(*)(Model)>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:91:9: required from ‘boost::concepts::EdgeListGraph<G>::~EdgeListGraph() [with G = R_adjacency_list<boost::directedS, double>]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/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<R_adjacency_list<boost::directedS, double> >]’
226 | BOOST_concept(EdgeListGraph, (G)) : Graph< G >
| ^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:50:7: required from ‘void boost::function_requires(Model*) [with Model = concepts::EdgeListGraphConcept<R_adjacency_list<directedS, double> >]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
edmonds_optimum_branching_impl.hpp:523:62: required from ‘void edmonds_optimum_branching(TEdgeListGraph&, TVertexIndexMap, TWeightMap, TInputIterator, TInputIterator, TOutputIterator) [with bool TOptimumIsMaximum = true; bool TAttemptToSpan = false; bool TGraphIsDense = false; TEdgeListGraph = R_adjacency_list<boost::directedS, double>; TVertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>; TWeightMap = boost::adj_list_edge_property_map<boost::directed_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>; TInputIterator = long unsigned int*; TOutputIterator = std::back_insert_iterator<std::vector<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > >]’
523 | function_requires< EdgeListGraphConcept<TEdgeListGraph> >();
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~
edmonds_optimum_branching.cpp:36:47: required from here
36 | edmonds_optimum_branching<true, false, false>(g,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
37 | vertex_indices,
| ~~~~~~~~~~~~~~~
38 | weights,
| ~~~~~~~~
39 | static_cast<Vertex *>(0),
| ~~~~~~~~~~~~~~~~~~~~~~~~~
40 | static_cast<Vertex *>(0),
| ~~~~~~~~~~~~~~~~~~~~~~~~~
41 | std::back_inserter(branching));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
20 | ~usage_requirements() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::EqualityComparable<TT>::~EqualityComparable() [with TT = boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>]’
37 | ~model()
| ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:233:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
233 | BOOST_CONCEPT_USAGE(EqualityComparable) {
| ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Assignable<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Assignable<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > >]’
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:145:5: required from ‘struct boost::Assignable<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> >’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::Assignable<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> >]’
32 | inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
| ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied<boost::Assignable<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > >::value’
44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied<boost::Assignable<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > >’
45 | typedef boost::integral_constant<bool, value> type;
| ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_<void (*)(boost::Assignable<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> >)>’
72 | struct requirement_<void(*)(Model)>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:92:9: required from ‘boost::concepts::EdgeListGraph<G>::~EdgeListGraph() [with G = R_adjacency_list<boost::directedS, double>]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/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<R_adjacency_list<boost::directedS, double> >]’
226 | BOOST_concept(EdgeListGraph, (G)) : Graph< G >
| ^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:50:7: required from ‘void boost::function_requires(Model*) [with Model = concepts::EdgeListGraphConcept<R_adjacency_list<directedS, double> >]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
edmonds_optimum_branching_impl.hpp:523:62: required from ‘void edmonds_optimum_branching(TEdgeListGraph&, TVertexIndexMap, TWeightMap, TInputIterator, TInputIterator, TOutputIterator) [with bool TOptimumIsMaximum = true; bool TAttemptToSpan = false; bool TGraphIsDense = false; TEdgeListGraph = R_adjacency_list<boost::directedS, double>; TVertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>; TWeightMap = boost::adj_list_edge_property_map<boost::directed_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>; TInputIterator = long unsigned int*; TOutputIterator = std::back_insert_iterator<std::vector<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > >]’
523 | function_requires< EdgeListGraphConcept<TEdgeListGraph> >();
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~
edmonds_optimum_branching.cpp:36:47: required from here
36 | edmonds_optimum_branching<true, false, false>(g,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
37 | vertex_indices,
| ~~~~~~~~~~~~~~~
38 | weights,
| ~~~~~~~~
39 | static_cast<Vertex *>(0),
| ~~~~~~~~~~~~~~~~~~~~~~~~~
40 | static_cast<Vertex *>(0),
| ~~~~~~~~~~~~~~~~~~~~~~~~~
41 | std::back_inserter(branching));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
20 | ~usage_requirements() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Assignable<TT>::~Assignable() [with TT = boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>]’
37 | ~model()
| ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:145:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
145 | BOOST_CONCEPT_USAGE(Assignable) {
| ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/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>]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/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(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/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> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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);
| ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/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) );
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/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;
| ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/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)>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:239:9: required from ‘boost::concepts::EdgeListGraph<G>::~EdgeListGraph() [with G = R_adjacency_list<boost::directedS, double>]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/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<R_adjacency_list<boost::directedS, double> >]’
226 | BOOST_concept(EdgeListGraph, (G)) : Graph< G >
| ^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:50:7: required from ‘void boost::function_requires(Model*) [with Model = concepts::EdgeListGraphConcept<R_adjacency_list<directedS, double> >]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
edmonds_optimum_branching_impl.hpp:523:62: required from ‘void edmonds_optimum_branching(TEdgeListGraph&, TVertexIndexMap, TWeightMap, TInputIterator, TInputIterator, TOutputIterator) [with bool TOptimumIsMaximum = true; bool TAttemptToSpan = false; bool TGraphIsDense = false; TEdgeListGraph = R_adjacency_list<boost::directedS, double>; TVertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>; TWeightMap = boost::adj_list_edge_property_map<boost::directed_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>; TInputIterator = long unsigned int*; TOutputIterator = std::back_insert_iterator<std::vector<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > >]’
523 | function_requires< EdgeListGraphConcept<TEdgeListGraph> >();
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~
edmonds_optimum_branching.cpp:36:47: required from here
36 | edmonds_optimum_branching<true, false, false>(g,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
37 | vertex_indices,
| ~~~~~~~~~~~~~~~
38 | weights,
| ~~~~~~~~
39 | static_cast<Vertex *>(0),
| ~~~~~~~~~~~~~~~~~~~~~~~~~
40 | static_cast<Vertex *>(0),
| ~~~~~~~~~~~~~~~~~~~~~~~~~
41 | std::back_inserter(branching));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
20 | ~usage_requirements() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/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()
| ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
208 | BOOST_CONCEPT_USAGE(Convertible) {
| ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Convertible<std::random_access_iterator_tag, std::input_iterator_tag>]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/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(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/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> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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);
| ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/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) );
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/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;
| ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/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)>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:515:9: required from ‘boost::InputIterator<TT>::~InputIterator() [with TT = long unsigned int*]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:502:3: required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::InputIteratorConcept<long unsigned int*>]’
502 | BOOST_concept(InputIterator,(TT))
| ^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:50:7: required from ‘void boost::function_requires(Model*) [with Model = InputIteratorConcept<long unsigned int*>]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
edmonds_optimum_branching_impl.hpp:526:62: required from ‘void edmonds_optimum_branching(TEdgeListGraph&, TVertexIndexMap, TWeightMap, TInputIterator, TInputIterator, TOutputIterator) [with bool TOptimumIsMaximum = true; bool TAttemptToSpan = false; bool TGraphIsDense = false; TEdgeListGraph = R_adjacency_list<boost::directedS, double>; TVertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>; TWeightMap = boost::adj_list_edge_property_map<boost::directed_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>; TInputIterator = long unsigned int*; TOutputIterator = std::back_insert_iterator<std::vector<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > >]’
526 | function_requires< InputIteratorConcept<TInputIterator> >();
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~
edmonds_optimum_branching.cpp:36:47: required from here
36 | edmonds_optimum_branching<true, false, false>(g,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
37 | vertex_indices,
| ~~~~~~~~~~~~~~~
38 | weights,
| ~~~~~~~~
39 | static_cast<Vertex *>(0),
| ~~~~~~~~~~~~~~~~~~~~~~~~~
40 | static_cast<Vertex *>(0),
| ~~~~~~~~~~~~~~~~~~~~~~~~~
41 | std::back_inserter(branching));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
20 | ~usage_requirements() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible<X, Y>::~Convertible() [with X = std::random_access_iterator_tag; Y = std::input_iterator_tag]’
37 | ~model()
| ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
208 | BOOST_CONCEPT_USAGE(Convertible) {
| ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::DefaultConstructible<long unsigned int>]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::DefaultConstructible<long unsigned int> >]’
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:137:5: required from ‘struct boost::DefaultConstructible<long unsigned int>’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::DefaultConstructible<long unsigned int>]’
32 | inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
| ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied<boost::DefaultConstructible<long unsigned int> >::value’
44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied<boost::DefaultConstructible<long unsigned int> >’
45 | typedef boost::integral_constant<bool, value> type;
| ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 8 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied<boost::concepts::EdgeListGraphConcept<R_adjacency_list<boost::directedS, double> > >::value’
44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied<boost::concepts::EdgeListGraphConcept<R_adjacency_list<boost::directedS, double> > >’
45 | typedef boost::integral_constant<bool, value> type;
| ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_<void (*)(boost::concepts::EdgeListGraphConcept<R_adjacency_list<boost::directedS, double> >)>’
72 | struct requirement_<void(*)(Model)>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:50:7: required from ‘void boost::function_requires(Model*) [with Model = concepts::EdgeListGraphConcept<R_adjacency_list<directedS, double> >]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
edmonds_optimum_branching_impl.hpp:523:62: required from ‘void edmonds_optimum_branching(TEdgeListGraph&, TVertexIndexMap, TWeightMap, TInputIterator, TInputIterator, TOutputIterator) [with bool TOptimumIsMaximum = true; bool TAttemptToSpan = false; bool TGraphIsDense = false; TEdgeListGraph = R_adjacency_list<boost::directedS, double>; TVertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>; TWeightMap = boost::adj_list_edge_property_map<boost::directed_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>; TInputIterator = long unsigned int*; TOutputIterator = std::back_insert_iterator<std::vector<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > >]’
523 | function_requires< EdgeListGraphConcept<TEdgeListGraph> >();
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~
edmonds_optimum_branching.cpp:36:47: required from here
36 | edmonds_optimum_branching<true, false, false>(g,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
37 | vertex_indices,
| ~~~~~~~~~~~~~~~
38 | weights,
| ~~~~~~~~
39 | static_cast<Vertex *>(0),
| ~~~~~~~~~~~~~~~~~~~~~~~~~
40 | static_cast<Vertex *>(0),
| ~~~~~~~~~~~~~~~~~~~~~~~~~
41 | std::back_inserter(branching));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
20 | ~usage_requirements() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::DefaultConstructible<TT>::~DefaultConstructible() [with TT = long unsigned int]’
37 | ~model()
| ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:137:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
137 | BOOST_CONCEPT_USAGE(DefaultConstructible) {
| ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::EqualityComparable<long unsigned int>]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::EqualityComparable<long unsigned int> >]’
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable<long unsigned int>’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::EqualityComparable<long unsigned int>]’
32 | inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
| ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied<boost::EqualityComparable<long unsigned int> >::value’
44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied<boost::EqualityComparable<long unsigned int> >’
45 | typedef boost::integral_constant<bool, value> type;
| ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 8 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied<boost::concepts::EdgeListGraphConcept<R_adjacency_list<boost::directedS, double> > >::value’
44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied<boost::concepts::EdgeListGraphConcept<R_adjacency_list<boost::directedS, double> > >’
45 | typedef boost::integral_constant<bool, value> type;
| ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_<void (*)(boost::concepts::EdgeListGraphConcept<R_adjacency_list<boost::directedS, double> >)>’
72 | struct requirement_<void(*)(Model)>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:50:7: required from ‘void boost::function_requires(Model*) [with Model = concepts::EdgeListGraphConcept<R_adjacency_list<directedS, double> >]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
edmonds_optimum_branching_impl.hpp:523:62: required from ‘void edmonds_optimum_branching(TEdgeListGraph&, TVertexIndexMap, TWeightMap, TInputIterator, TInputIterator, TOutputIterator) [with bool TOptimumIsMaximum = true; bool TAttemptToSpan = false; bool TGraphIsDense = false; TEdgeListGraph = R_adjacency_list<boost::directedS, double>; TVertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>; TWeightMap = boost::adj_list_edge_property_map<boost::directed_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>; TInputIterator = long unsigned int*; TOutputIterator = std::back_insert_iterator<std::vector<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > >]’
523 | function_requires< EdgeListGraphConcept<TEdgeListGraph> >();
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~
edmonds_optimum_branching.cpp:36:47: required from here
36 | edmonds_optimum_branching<true, false, false>(g,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
37 | vertex_indices,
| ~~~~~~~~~~~~~~~
38 | weights,
| ~~~~~~~~
39 | static_cast<Vertex *>(0),
| ~~~~~~~~~~~~~~~~~~~~~~~~~
40 | static_cast<Vertex *>(0),
| ~~~~~~~~~~~~~~~~~~~~~~~~~
41 | std::back_inserter(branching));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
20 | ~usage_requirements() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::EqualityComparable<TT>::~EqualityComparable() [with TT = long unsigned int]’
37 | ~model()
| ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:233:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
233 | BOOST_CONCEPT_USAGE(EqualityComparable) {
| ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Assignable<long unsigned int>]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Assignable<long unsigned int> >]’
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:145:5: required from ‘struct boost::Assignable<long unsigned int>’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::Assignable<long unsigned int>]’
32 | inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
| ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied<boost::Assignable<long unsigned int> >::value’
44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied<boost::Assignable<long unsigned int> >’
45 | typedef boost::integral_constant<bool, value> type;
| ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 8 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied<boost::concepts::EdgeListGraphConcept<R_adjacency_list<boost::directedS, double> > >::value’
44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied<boost::concepts::EdgeListGraphConcept<R_adjacency_list<boost::directedS, double> > >’
45 | typedef boost::integral_constant<bool, value> type;
| ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_<void (*)(boost::concepts::EdgeListGraphConcept<R_adjacency_list<boost::directedS, double> >)>’
72 | struct requirement_<void(*)(Model)>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:50:7: required from ‘void boost::function_requires(Model*) [with Model = concepts::EdgeListGraphConcept<R_adjacency_list<directedS, double> >]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
edmonds_optimum_branching_impl.hpp:523:62: required from ‘void edmonds_optimum_branching(TEdgeListGraph&, TVertexIndexMap, TWeightMap, TInputIterator, TInputIterator, TOutputIterator) [with bool TOptimumIsMaximum = true; bool TAttemptToSpan = false; bool TGraphIsDense = false; TEdgeListGraph = R_adjacency_list<boost::directedS, double>; TVertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>; TWeightMap = boost::adj_list_edge_property_map<boost::directed_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>; TInputIterator = long unsigned int*; TOutputIterator = std::back_insert_iterator<std::vector<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > >]’
523 | function_requires< EdgeListGraphConcept<TEdgeListGraph> >();
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~
edmonds_optimum_branching.cpp:36:47: required from here
36 | edmonds_optimum_branching<true, false, false>(g,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
37 | vertex_indices,
| ~~~~~~~~~~~~~~~
38 | weights,
| ~~~~~~~~
39 | static_cast<Vertex *>(0),
| ~~~~~~~~~~~~~~~~~~~~~~~~~
40 | static_cast<Vertex *>(0),
| ~~~~~~~~~~~~~~~~~~~~~~~~~
41 | std::back_inserter(branching));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
20 | ~usage_requirements() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Assignable<TT>::~Assignable() [with TT = long unsigned int]’
37 | ~model()
| ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:145:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
145 | BOOST_CONCEPT_USAGE(Assignable) {
| ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/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<boost::range_detail::integer_iterator<long unsigned int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int>, boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_color_t, boost::default_color_type>, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::no_property, boost::listS> > > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:145:5: required from ‘struct boost::Assignable<boost::detail::adj_list_edge_iterator<boost::range_detail::integer_iterator<long unsigned int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int>, boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_color_t, boost::default_color_type>, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::no_property, boost::listS> > >’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator<boost::detail::adj_list_edge_iterator<boost::range_detail::integer_iterator<long unsigned int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int>, boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_color_t, boost::default_color_type>, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::no_property, boost::listS> > >’
502 | BOOST_concept(InputIterator,(TT))
| ^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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<boost::range_detail::integer_iterator<long unsigned int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int>, boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_color_t, boost::default_color_type>, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::no_property, boost::listS> > >]’
32 | inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
| ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/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<boost::range_detail::integer_iterator<long unsigned int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int>, boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_color_t, boost::default_color_type>, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::no_property, boost::listS> > > >::value’
44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/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<boost::range_detail::integer_iterator<long unsigned int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int>, boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_color_t, boost::default_color_type>, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::no_property, boost::listS> > > >’
45 | typedef boost::integral_constant<bool, value> type;
| ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/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<boost::range_detail::integer_iterator<long unsigned int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int>, boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_color_t, boost::default_color_type>, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::no_property, boost::listS> > >]’
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:235:9: required from ‘boost::concepts::EdgeListGraph<G>::~EdgeListGraph() [with G = R_adjacency_list<boost::directedS, double>]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/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<R_adjacency_list<boost::directedS, double> >]’
226 | BOOST_concept(EdgeListGraph, (G)) : Graph< G >
| ^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:50:7: required from ‘void boost::function_requires(Model*) [with Model = concepts::EdgeListGraphConcept<R_adjacency_list<directedS, double> >]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
edmonds_optimum_branching_impl.hpp:523:62: required from ‘void edmonds_optimum_branching(TEdgeListGraph&, TVertexIndexMap, TWeightMap, TInputIterator, TInputIterator, TOutputIterator) [with bool TOptimumIsMaximum = true; bool TAttemptToSpan = false; bool TGraphIsDense = false; TEdgeListGraph = R_adjacency_list<boost::directedS, double>; TVertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>; TWeightMap = boost::adj_list_edge_property_map<boost::directed_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>; TInputIterator = long unsigned int*; TOutputIterator = std::back_insert_iterator<std::vector<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > >]’
523 | function_requires< EdgeListGraphConcept<TEdgeListGraph> >();
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~
edmonds_optimum_branching.cpp:36:47: required from here
36 | edmonds_optimum_branching<true, false, false>(g,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
37 | vertex_indices,
| ~~~~~~~~~~~~~~~
38 | weights,
| ~~~~~~~~
39 | static_cast<Vertex *>(0),
| ~~~~~~~~~~~~~~~~~~~~~~~~~
40 | static_cast<Vertex *>(0),
| ~~~~~~~~~~~~~~~~~~~~~~~~~
41 | std::back_inserter(branching));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/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<boost::range_detail::integer_iterator<long unsigned int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int>, boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_color_t, boost::default_color_type>, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::no_property, boost::listS> > >]’
20 | ~usage_requirements() { ((Model*)0)->~Model(); }
| ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/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<boost::range_detail::integer_iterator<long unsigned int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int>, boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_color_t, boost::default_color_type>, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::no_property, boost::listS> > > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable<boost::detail::adj_list_edge_iterator<boost::range_detail::integer_iterator<long unsigned int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int>, boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_color_t, boost::default_color_type>, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::no_property, boost::listS> > >’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator<boost::detail::adj_list_edge_iterator<boost::range_detail::integer_iterator<long unsigned int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int>, boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_color_t, boost::default_color_type>, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::no_property, boost::listS> > >’
502 | BOOST_concept(InputIterator,(TT))
| ^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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<boost::range_detail::integer_iterator<long unsigned int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int>, boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_color_t, boost::default_color_type>, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::no_property, boost::listS> > >]’
32 | inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
| ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/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<boost::range_detail::integer_iterator<long unsigned int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int>, boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_color_t, boost::default_color_type>, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::no_property, boost::listS> > > >::value’
44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/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<boost::range_detail::integer_iterator<long unsigned int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int>, boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_color_t, boost::default_color_type>, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::no_property, boost::listS> > > >’
45 | typedef boost::integral_constant<bool, value> type;
| ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/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<boost::range_detail::integer_iterator<long unsigned int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int>, boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_color_t, boost::default_color_type>, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::no_property, boost::listS> > >]’
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:235:9: required from ‘boost::concepts::EdgeListGraph<G>::~EdgeListGraph() [with G = R_adjacency_list<boost::directedS, double>]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/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<R_adjacency_list<boost::directedS, double> >]’
226 | BOOST_concept(EdgeListGraph, (G)) : Graph< G >
| ^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:50:7: required from ‘void boost::function_requires(Model*) [with Model = concepts::EdgeListGraphConcept<R_adjacency_list<directedS, double> >]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
edmonds_optimum_branching_impl.hpp:523:62: required from ‘void edmonds_optimum_branching(TEdgeListGraph&, TVertexIndexMap, TWeightMap, TInputIterator, TInputIterator, TOutputIterator) [with bool TOptimumIsMaximum = true; bool TAttemptToSpan = false; bool TGraphIsDense = false; TEdgeListGraph = R_adjacency_list<boost::directedS, double>; TVertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>; TWeightMap = boost::adj_list_edge_property_map<boost::directed_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>; TInputIterator = long unsigned int*; TOutputIterator = std::back_insert_iterator<std::vector<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > >]’
523 | function_requires< EdgeListGraphConcept<TEdgeListGraph> >();
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~
edmonds_optimum_branching.cpp:36:47: required from here
36 | edmonds_optimum_branching<true, false, false>(g,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
37 | vertex_indices,
| ~~~~~~~~~~~~~~~
38 | weights,
| ~~~~~~~~
39 | static_cast<Vertex *>(0),
| ~~~~~~~~~~~~~~~~~~~~~~~~~
40 | static_cast<Vertex *>(0),
| ~~~~~~~~~~~~~~~~~~~~~~~~~
41 | std::back_inserter(branching));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/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<boost::range_detail::integer_iterator<long unsigned int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int>, boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_color_t, boost::default_color_type>, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::no_property, boost::listS> > >]’
20 | ~usage_requirements() { ((Model*)0)->~Model(); }
| ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/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<boost::range_detail::integer_iterator<long unsigned int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int>, boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_color_t, boost::default_color_type>, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::no_property, boost::listS> > > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:512:7: required from ‘struct boost::InputIterator<boost::detail::adj_list_edge_iterator<boost::range_detail::integer_iterator<long unsigned int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int>, boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_color_t, boost::default_color_type>, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::no_property, boost::listS> > >’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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<boost::range_detail::integer_iterator<long unsigned int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int>, boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_color_t, boost::default_color_type>, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::no_property, boost::listS> > >]’
32 | inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
| ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/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<boost::range_detail::integer_iterator<long unsigned int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int>, boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_color_t, boost::default_color_type>, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::no_property, boost::listS> > > >::value’
44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/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<boost::range_detail::integer_iterator<long unsigned int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int>, boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_color_t, boost::default_color_type>, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::no_property, boost::listS> > > >’
45 | typedef boost::integral_constant<bool, value> type;
| ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/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<boost::range_detail::integer_iterator<long unsigned int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int>, boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_color_t, boost::default_color_type>, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::no_property, boost::listS> > >]’
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:235:9: required from ‘boost::concepts::EdgeListGraph<G>::~EdgeListGraph() [with G = R_adjacency_list<boost::directedS, double>]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/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<R_adjacency_list<boost::directedS, double> >]’
226 | BOOST_concept(EdgeListGraph, (G)) : Graph< G >
| ^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:50:7: required from ‘void boost::function_requires(Model*) [with Model = concepts::EdgeListGraphConcept<R_adjacency_list<directedS, double> >]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
edmonds_optimum_branching_impl.hpp:523:62: required from ‘void edmonds_optimum_branching(TEdgeListGraph&, TVertexIndexMap, TWeightMap, TInputIterator, TInputIterator, TOutputIterator) [with bool TOptimumIsMaximum = true; bool TAttemptToSpan = false; bool TGraphIsDense = false; TEdgeListGraph = R_adjacency_list<boost::directedS, double>; TVertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>; TWeightMap = boost::adj_list_edge_property_map<boost::directed_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>; TInputIterator = long unsigned int*; TOutputIterator = std::back_insert_iterator<std::vector<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > >]’
523 | function_requires< EdgeListGraphConcept<TEdgeListGraph> >();
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~
edmonds_optimum_branching.cpp:36:47: required from here
36 | edmonds_optimum_branching<true, false, false>(g,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
37 | vertex_indices,
| ~~~~~~~~~~~~~~~
38 | weights,
| ~~~~~~~~
39 | static_cast<Vertex *>(0),
| ~~~~~~~~~~~~~~~~~~~~~~~~~
40 | static_cast<Vertex *>(0),
| ~~~~~~~~~~~~~~~~~~~~~~~~~
41 | std::back_inserter(branching));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/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<boost::range_detail::integer_iterator<long unsigned int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int>, boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_color_t, boost::default_color_type>, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::no_property, boost::listS> > >]’
20 | ~usage_requirements() { ((Model*)0)->~Model(); }
| ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/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<boost::range_detail::integer_iterator<long unsigned int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int>, boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_color_t, boost::default_color_type>, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::no_property, boost::listS> > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:53:35: required from ‘boost::concepts::MultiPassInputIterator<T>::~MultiPassInputIterator() [with T = boost::detail::adj_list_edge_iterator<boost::range_detail::integer_iterator<long unsigned int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int>, boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_color_t, boost::default_color_type>, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::no_property, boost::listS> >]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/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<boost::range_detail::integer_iterator<long unsigned int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int>, boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_color_t, boost::default_color_type>, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::no_property, boost::listS> > >]’
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:235:9: required from ‘boost::concepts::EdgeListGraph<G>::~EdgeListGraph() [with G = R_adjacency_list<boost::directedS, double>]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/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<R_adjacency_list<boost::directedS, double> >]’
226 | BOOST_concept(EdgeListGraph, (G)) : Graph< G >
| ^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:50:7: required from ‘void boost::function_requires(Model*) [with Model = concepts::EdgeListGraphConcept<R_adjacency_list<directedS, double> >]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
edmonds_optimum_branching_impl.hpp:523:62: required from ‘void edmonds_optimum_branching(TEdgeListGraph&, TVertexIndexMap, TWeightMap, TInputIterator, TInputIterator, TOutputIterator) [with bool TOptimumIsMaximum = true; bool TAttemptToSpan = false; bool TGraphIsDense = false; TEdgeListGraph = R_adjacency_list<boost::directedS, double>; TVertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>; TWeightMap = boost::adj_list_edge_property_map<boost::directed_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>; TInputIterator = long unsigned int*; TOutputIterator = std::back_insert_iterator<std::vector<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > >]’
523 | function_requires< EdgeListGraphConcept<TEdgeListGraph> >();
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~
edmonds_optimum_branching.cpp:36:47: required from here
36 | edmonds_optimum_branching<true, false, false>(g,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
37 | vertex_indices,
| ~~~~~~~~~~~~~~~
38 | weights,
| ~~~~~~~~
39 | static_cast<Vertex *>(0),
| ~~~~~~~~~~~~~~~~~~~~~~~~~
40 | static_cast<Vertex *>(0),
| ~~~~~~~~~~~~~~~~~~~~~~~~~
41 | std::back_inserter(branching));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/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<boost::range_detail::integer_iterator<long unsigned int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int>, boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_color_t, boost::default_color_type>, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::no_property, boost::listS> >]’
37 | ~model()
| ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:512:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
512 | BOOST_CONCEPT_USAGE(InputIterator)
| ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/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<boost::range_detail::integer_iterator<long unsigned int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int>, boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_color_t, boost::default_color_type>, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::no_property, boost::listS> > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/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<boost::range_detail::integer_iterator<long unsigned int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int>, boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_color_t, boost::default_color_type>, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::no_property, boost::listS> > > >]’
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:145:5: required from ‘struct boost::Assignable<boost::detail::adj_list_edge_iterator<boost::range_detail::integer_iterator<long unsigned int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int>, boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_color_t, boost::default_color_type>, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::no_property, boost::listS> > >’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator<boost::detail::adj_list_edge_iterator<boost::range_detail::integer_iterator<long unsigned int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int>, boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_color_t, boost::default_color_type>, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::no_property, boost::listS> > >’
502 | BOOST_concept(InputIterator,(TT))
| ^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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<boost::range_detail::integer_iterator<long unsigned int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int>, boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_color_t, boost::default_color_type>, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::no_property, boost::listS> > >]’
32 | inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
| ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/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<boost::range_detail::integer_iterator<long unsigned int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int>, boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_color_t, boost::default_color_type>, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::no_property, boost::listS> > > >::value’
44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/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<boost::range_detail::integer_iterator<long unsigned int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int>, boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_color_t, boost::default_color_type>, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::no_property, boost::listS> > >]’
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:235:9: required from ‘boost::concepts::EdgeListGraph<G>::~EdgeListGraph() [with G = R_adjacency_list<boost::directedS, double>]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/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<R_adjacency_list<boost::directedS, double> >]’
226 | BOOST_concept(EdgeListGraph, (G)) : Graph< G >
| ^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:50:7: required from ‘void boost::function_requires(Model*) [with Model = concepts::EdgeListGraphConcept<R_adjacency_list<directedS, double> >]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
edmonds_optimum_branching_impl.hpp:523:62: required from ‘void edmonds_optimum_branching(TEdgeListGraph&, TVertexIndexMap, TWeightMap, TInputIterator, TInputIterator, TOutputIterator) [with bool TOptimumIsMaximum = true; bool TAttemptToSpan = false; bool TGraphIsDense = false; TEdgeListGraph = R_adjacency_list<boost::directedS, double>; TVertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>; TWeightMap = boost::adj_list_edge_property_map<boost::directed_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>; TInputIterator = long unsigned int*; TOutputIterator = std::back_insert_iterator<std::vector<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > >]’
523 | function_requires< EdgeListGraphConcept<TEdgeListGraph> >();
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~
edmonds_optimum_branching.cpp:36:47: required from here
36 | edmonds_optimum_branching<true, false, false>(g,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
37 | vertex_indices,
| ~~~~~~~~~~~~~~~
38 | weights,
| ~~~~~~~~
39 | static_cast<Vertex *>(0),
| ~~~~~~~~~~~~~~~~~~~~~~~~~
40 | static_cast<Vertex *>(0),
| ~~~~~~~~~~~~~~~~~~~~~~~~~
41 | std::back_inserter(branching));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
20 | ~usage_requirements() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/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<boost::range_detail::integer_iterator<long unsigned int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int>, boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_color_t, boost::default_color_type>, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::no_property, boost::listS> >]’
37 | ~model()
| ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:145:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
145 | BOOST_CONCEPT_USAGE(Assignable) {
| ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/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<boost::range_detail::integer_iterator<long unsigned int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int>, boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_color_t, boost::default_color_type>, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::no_property, boost::listS> > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/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<boost::range_detail::integer_iterator<long unsigned int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int>, boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_color_t, boost::default_color_type>, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::no_property, boost::listS> > > >]’
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable<boost::detail::adj_list_edge_iterator<boost::range_detail::integer_iterator<long unsigned int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int>, boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_color_t, boost::default_color_type>, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::no_property, boost::listS> > >’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator<boost::detail::adj_list_edge_iterator<boost::range_detail::integer_iterator<long unsigned int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int>, boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_color_t, boost::default_color_type>, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::no_property, boost::listS> > >’
502 | BOOST_concept(InputIterator,(TT))
| ^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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<boost::range_detail::integer_iterator<long unsigned int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int>, boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_color_t, boost::default_color_type>, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::no_property, boost::listS> > >]’
32 | inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
| ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/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<boost::range_detail::integer_iterator<long unsigned int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int>, boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_color_t, boost::default_color_type>, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::no_property, boost::listS> > > >::value’
44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/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<boost::range_detail::integer_iterator<long unsigned int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int>, boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_color_t, boost::default_color_type>, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::no_property, boost::listS> > >]’
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:235:9: required from ‘boost::concepts::EdgeListGraph<G>::~EdgeListGraph() [with G = R_adjacency_list<boost::directedS, double>]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/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<R_adjacency_list<boost::directedS, double> >]’
226 | BOOST_concept(EdgeListGraph, (G)) : Graph< G >
| ^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:50:7: required from ‘void boost::function_requires(Model*) [with Model = concepts::EdgeListGraphConcept<R_adjacency_list<directedS, double> >]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
edmonds_optimum_branching_impl.hpp:523:62: required from ‘void edmonds_optimum_branching(TEdgeListGraph&, TVertexIndexMap, TWeightMap, TInputIterator, TInputIterator, TOutputIterator) [with bool TOptimumIsMaximum = true; bool TAttemptToSpan = false; bool TGraphIsDense = false; TEdgeListGraph = R_adjacency_list<boost::directedS, double>; TVertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>; TWeightMap = boost::adj_list_edge_property_map<boost::directed_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>; TInputIterator = long unsigned int*; TOutputIterator = std::back_insert_iterator<std::vector<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > >]’
523 | function_requires< EdgeListGraphConcept<TEdgeListGraph> >();
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~
edmonds_optimum_branching.cpp:36:47: required from here
36 | edmonds_optimum_branching<true, false, false>(g,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
37 | vertex_indices,
| ~~~~~~~~~~~~~~~
38 | weights,
| ~~~~~~~~
39 | static_cast<Vertex *>(0),
| ~~~~~~~~~~~~~~~~~~~~~~~~~
40 | static_cast<Vertex *>(0),
| ~~~~~~~~~~~~~~~~~~~~~~~~~
41 | std::back_inserter(branching));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
20 | ~usage_requirements() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/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<boost::range_detail::integer_iterator<long unsigned int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int>, boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_color_t, boost::default_color_type>, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::no_property, boost::listS> >]’
37 | ~model()
| ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:233:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
233 | BOOST_CONCEPT_USAGE(EqualityComparable) {
| ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/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<boost::range_detail::integer_iterator<long unsigned int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int>, boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_color_t, boost::default_color_type>, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::no_property, boost::listS> > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/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<boost::range_detail::integer_iterator<long unsigned int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int>, boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_color_t, boost::default_color_type>, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::no_property, boost::listS> > > >]’
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:512:7: required from ‘struct boost::InputIterator<boost::detail::adj_list_edge_iterator<boost::range_detail::integer_iterator<long unsigned int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int>, boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_color_t, boost::default_color_type>, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::no_property, boost::listS> > >’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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<boost::range_detail::integer_iterator<long unsigned int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int>, boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_color_t, boost::default_color_type>, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::no_property, boost::listS> > >]’
32 | inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
| ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/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<boost::range_detail::integer_iterator<long unsigned int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int>, boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_color_t, boost::default_color_type>, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::no_property, boost::listS> > > >::value’
44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/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<boost::range_detail::integer_iterator<long unsigned int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int>, boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_color_t, boost::default_color_type>, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::no_property, boost::listS> > > >’
45 | typedef boost::integral_constant<bool, value> type;
| ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/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<boost::range_detail::integer_iterator<long unsigned int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int>, boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_color_t, boost::default_color_type>, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::no_property, boost::listS> > >]’
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:235:9: required from ‘boost::concepts::EdgeListGraph<G>::~EdgeListGraph() [with G = R_adjacency_list<boost::directedS, double>]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/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<R_adjacency_list<boost::directedS, double> >]’
226 | BOOST_concept(EdgeListGraph, (G)) : Graph< G >
| ^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:50:7: required from ‘void boost::function_requires(Model*) [with Model = concepts::EdgeListGraphConcept<R_adjacency_list<directedS, double> >]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
edmonds_optimum_branching_impl.hpp:523:62: required from ‘void edmonds_optimum_branching(TEdgeListGraph&, TVertexIndexMap, TWeightMap, TInputIterator, TInputIterator, TOutputIterator) [with bool TOptimumIsMaximum = true; bool TAttemptToSpan = false; bool TGraphIsDense = false; TEdgeListGraph = R_adjacency_list<boost::directedS, double>; TVertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>; TWeightMap = boost::adj_list_edge_property_map<boost::directed_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>; TInputIterator = long unsigned int*; TOutputIterator = std::back_insert_iterator<std::vector<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > >]’
523 | function_requires< EdgeListGraphConcept<TEdgeListGraph> >();
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~
edmonds_optimum_branching.cpp:36:47: required from here
36 | edmonds_optimum_branching<true, false, false>(g,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
37 | vertex_indices,
| ~~~~~~~~~~~~~~~
38 | weights,
| ~~~~~~~~
39 | static_cast<Vertex *>(0),
| ~~~~~~~~~~~~~~~~~~~~~~~~~
40 | static_cast<Vertex *>(0),
| ~~~~~~~~~~~~~~~~~~~~~~~~~
41 | std::back_inserter(branching));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
20 | ~usage_requirements() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/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<boost::range_detail::integer_iterator<long unsigned int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int>, boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_color_t, boost::default_color_type>, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::no_property, boost::listS> >]’
37 | ~model()
| ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:512:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
512 | BOOST_CONCEPT_USAGE(InputIterator)
| ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/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> >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/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> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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);
| ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/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) );
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/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;
| ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/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)>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:515:9: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/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<boost::range_detail::integer_iterator<long unsigned int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int>, boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_color_t, boost::default_color_type>, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::no_property, boost::listS> > >]’
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:235:9: required from ‘boost::concepts::EdgeListGraph<G>::~EdgeListGraph() [with G = R_adjacency_list<boost::directedS, double>]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/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<R_adjacency_list<boost::directedS, double> >]’
226 | BOOST_concept(EdgeListGraph, (G)) : Graph< G >
| ^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:50:7: required from ‘void boost::function_requires(Model*) [with Model = concepts::EdgeListGraphConcept<R_adjacency_list<directedS, double> >]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
edmonds_optimum_branching_impl.hpp:523:62: required from ‘void edmonds_optimum_branching(TEdgeListGraph&, TVertexIndexMap, TWeightMap, TInputIterator, TInputIterator, TOutputIterator) [with bool TOptimumIsMaximum = true; bool TAttemptToSpan = false; bool TGraphIsDense = false; TEdgeListGraph = R_adjacency_list<boost::directedS, double>; TVertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>; TWeightMap = boost::adj_list_edge_property_map<boost::directed_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>; TInputIterator = long unsigned int*; TOutputIterator = std::back_insert_iterator<std::vector<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > >]’
523 | function_requires< EdgeListGraphConcept<TEdgeListGraph> >();
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~
edmonds_optimum_branching.cpp:36:47: required from here
36 | edmonds_optimum_branching<true, false, false>(g,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
37 | vertex_indices,
| ~~~~~~~~~~~~~~~
38 | weights,
| ~~~~~~~~
39 | static_cast<Vertex *>(0),
| ~~~~~~~~~~~~~~~~~~~~~~~~~
40 | static_cast<Vertex *>(0),
| ~~~~~~~~~~~~~~~~~~~~~~~~~
41 | std::back_inserter(branching));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/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(); }
| ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/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>]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:515:9: required from ‘boost::InputIterator<TT>::~InputIterator() [with TT = boost::detail::adj_list_edge_iterator<boost::range_detail::integer_iterator<long unsigned int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int>, boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_color_t, boost::default_color_type>, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::no_property, boost::listS> >]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/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<boost::range_detail::integer_iterator<long unsigned int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int>, boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_color_t, boost::default_color_type>, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::no_property, boost::listS> > >]’
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:53:35: required from ‘boost::concepts::MultiPassInputIterator<T>::~MultiPassInputIterator() [with T = boost::detail::adj_list_edge_iterator<boost::range_detail::integer_iterator<long unsigned int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int>, boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_color_t, boost::default_color_type>, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::no_property, boost::listS> >]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/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<boost::range_detail::integer_iterator<long unsigned int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int>, boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_color_t, boost::default_color_type>, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::no_property, boost::listS> > >]’
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:235:9: required from ‘boost::concepts::EdgeListGraph<G>::~EdgeListGraph() [with G = R_adjacency_list<boost::directedS, double>]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/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<R_adjacency_list<boost::directedS, double> >]’
226 | BOOST_concept(EdgeListGraph, (G)) : Graph< G >
| ^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:50:7: required from ‘void boost::function_requires(Model*) [with Model = concepts::EdgeListGraphConcept<R_adjacency_list<directedS, double> >]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
edmonds_optimum_branching_impl.hpp:523:62: required from ‘void edmonds_optimum_branching(TEdgeListGraph&, TVertexIndexMap, TWeightMap, TInputIterator, TInputIterator, TOutputIterator) [with bool TOptimumIsMaximum = true; bool TAttemptToSpan = false; bool TGraphIsDense = false; TEdgeListGraph = R_adjacency_list<boost::directedS, double>; TVertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>; TWeightMap = boost::adj_list_edge_property_map<boost::directed_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>; TInputIterator = long unsigned int*; TOutputIterator = std::back_insert_iterator<std::vector<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > >]’
523 | function_requires< EdgeListGraphConcept<TEdgeListGraph> >();
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~
edmonds_optimum_branching.cpp:36:47: required from here
36 | edmonds_optimum_branching<true, false, false>(g,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
37 | vertex_indices,
| ~~~~~~~~~~~~~~~
38 | weights,
| ~~~~~~~~
39 | static_cast<Vertex *>(0),
| ~~~~~~~~~~~~~~~~~~~~~~~~~
40 | static_cast<Vertex *>(0),
| ~~~~~~~~~~~~~~~~~~~~~~~~~
41 | std::back_inserter(branching));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/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()
| ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
208 | BOOST_CONCEPT_USAGE(Convertible) {
| ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/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>]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/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(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/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> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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);
| ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/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) );
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/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;
| ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/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<boost::range_detail::integer_iterator<long unsigned int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int>, boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_color_t, boost::default_color_type>, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::no_property, boost::listS> > >]’
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:235:9: required from ‘boost::concepts::EdgeListGraph<G>::~EdgeListGraph() [with G = R_adjacency_list<boost::directedS, double>]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/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<R_adjacency_list<boost::directedS, double> >]’
226 | BOOST_concept(EdgeListGraph, (G)) : Graph< G >
| ^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:50:7: required from ‘void boost::function_requires(Model*) [with Model = concepts::EdgeListGraphConcept<R_adjacency_list<directedS, double> >]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
edmonds_optimum_branching_impl.hpp:523:62: required from ‘void edmonds_optimum_branching(TEdgeListGraph&, TVertexIndexMap, TWeightMap, TInputIterator, TInputIterator, TOutputIterator) [with bool TOptimumIsMaximum = true; bool TAttemptToSpan = false; bool TGraphIsDense = false; TEdgeListGraph = R_adjacency_list<boost::directedS, double>; TVertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>; TWeightMap = boost::adj_list_edge_property_map<boost::directed_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>; TInputIterator = long unsigned int*; TOutputIterator = std::back_insert_iterator<std::vector<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > >]’
523 | function_requires< EdgeListGraphConcept<TEdgeListGraph> >();
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~
edmonds_optimum_branching.cpp:36:47: required from here
36 | edmonds_optimum_branching<true, false, false>(g,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
37 | vertex_indices,
| ~~~~~~~~~~~~~~~
38 | weights,
| ~~~~~~~~
39 | static_cast<Vertex *>(0),
| ~~~~~~~~~~~~~~~~~~~~~~~~~
40 | static_cast<Vertex *>(0),
| ~~~~~~~~~~~~~~~~~~~~~~~~~
41 | std::back_inserter(branching));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
20 | ~usage_requirements() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/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()
| ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
208 | BOOST_CONCEPT_USAGE(Convertible) {
| ^~~~~~~~~~~~~~~~~~~
/opt/ohpc/pub/compiler/gcc/14.2.0/bin/aarch64-unknown-linux-gnu-g++ -std=gnu++17 -I"/home/biocbuild/R/R/include" -DNDEBUG -I'/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include' -I/usr/local/include -fPIC -g -O2 -Wall -Werror=format-security -DR_NO_REMAP -c hcs.cpp -o hcs.o
In file included from hcs.cpp:1:
RBGL.hpp:41:9: warning: "R_NO_REMAP" redefined
41 | #define R_NO_REMAP
| ^~~~~~~~~~
<command-line>: note: this is the location of the previous definition
In file included from /home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:22,
from RBGL.hpp:17:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/mpl/assert.hpp:194:21: warning: unnecessary parentheses in declaration of ‘assert_arg’ [-Wparentheses]
194 | failed ************ (Pred::************
| ^~~~~~~~~~~~~~~~~~~
195 | assert_arg( void (*)(Pred), typename assert_arg_pred<Pred>::type )
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
196 | );
| ~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/mpl/assert.hpp:194:21: note: remove parentheses
194 | failed ************ (Pred::************
| ^~~~~~~~~~~~~~~~~~~
| -
195 | assert_arg( void (*)(Pred), typename assert_arg_pred<Pred>::type )
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
196 | );
| ~
| -
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/mpl/assert.hpp:199:21: warning: unnecessary parentheses in declaration of ‘assert_not_arg’ [-Wparentheses]
199 | failed ************ (boost::mpl::not_<Pred>::************
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
200 | assert_not_arg( void (*)(Pred), typename assert_arg_pred_not<Pred>::type )
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
201 | );
| ~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/mpl/assert.hpp:199:21: note: remove parentheses
199 | failed ************ (boost::mpl::not_<Pred>::************
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
| -
200 | assert_not_arg( void (*)(Pred), typename assert_arg_pred_not<Pred>::type )
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
201 | );
| ~
| -
In file included from /home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/smart_ptr/shared_ptr.hpp:17,
from /home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/vector_property_map.hpp:14,
from /home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:598:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/smart_ptr/detail/shared_count.hpp:326:33: warning: ‘template<class> class std::auto_ptr’ is deprecated: use 'std::unique_ptr' instead [-Wdeprecated-declarations]
326 | explicit shared_count( std::auto_ptr<Y> & r ): pi_( new sp_counted_impl_p<Y>( r.get() ) )
| ^~~~~~~~
In file included from /opt/ohpc/pub/compiler/gcc/14.2.0/include/c++/14.2.0/memory:78,
from /home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/smart_ptr/detail/sp_counted_impl.hpp:35,
from /home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/smart_ptr/detail/shared_count.hpp:23:
/opt/ohpc/pub/compiler/gcc/14.2.0/include/c++/14.2.0/bits/unique_ptr.h:59:28: note: declared here
59 | template<typename> class auto_ptr;
| ^~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/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()
| ^~~~~~~~
/opt/ohpc/pub/compiler/gcc/14.2.0/include/c++/14.2.0/bits/unique_ptr.h:59:28: note: declared here
59 | template<typename> class auto_ptr;
| ^~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/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()
| ^~~~~~~~
/opt/ohpc/pub/compiler/gcc/14.2.0/include/c++/14.2.0/bits/unique_ptr.h:59:28: note: declared here
59 | template<typename> class auto_ptr;
| ^~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/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 )
| ^~~~~~~~
/opt/ohpc/pub/compiler/gcc/14.2.0/include/c++/14.2.0/bits/unique_ptr.h:59:28: note: declared here
59 | template<typename> class auto_ptr;
| ^~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/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 )
| ^~~~~~~~
/opt/ohpc/pub/compiler/gcc/14.2.0/include/c++/14.2.0/bits/unique_ptr.h:59:28: note: declared here
59 | template<typename> class auto_ptr;
| ^~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/smart_ptr/shared_ptr.hpp: In member function ‘boost::shared_ptr<T>& boost::shared_ptr<T>::operator=(std::auto_ptr<_Up>&&)’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/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 );
| ^~~~~~~~
/opt/ohpc/pub/compiler/gcc/14.2.0/include/c++/14.2.0/bits/unique_ptr.h:59:28: note: declared here
59 | template<typename> class auto_ptr;
| ^~~~~~~~
In file included from /home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/scoped_ptr.hpp:13,
from /home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/adjacency_list.hpp:22,
from RBGL.hpp:38:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/smart_ptr/scoped_ptr.hpp: At global scope:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/smart_ptr/scoped_ptr.hpp:75:31: warning: ‘template<class> class std::auto_ptr’ is deprecated: use 'std::unique_ptr' instead [-Wdeprecated-declarations]
75 | explicit scoped_ptr( std::auto_ptr<T> p ) noexcept : px( p.release() )
| ^~~~~~~~
/opt/ohpc/pub/compiler/gcc/14.2.0/include/c++/14.2.0/bits/unique_ptr.h:59:28: note: declared here
59 | template<typename> class auto_ptr;
| ^~~~~~~~
In file included from /home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/assert.hpp:35,
from /home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:19:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::concepts::Graph<boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::no_property, boost::listS>, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long unsigned int, long unsigned int&, long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all> > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:66:5: required from ‘struct boost::concepts::Graph<boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::no_property, boost::listS>, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long unsigned int, long unsigned int&, long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:75:1: required from ‘struct boost::concepts::IncidenceGraph<boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::no_property, boost::listS>, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long unsigned int, long unsigned int&, long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >’
75 | BOOST_concept(IncidenceGraph, (G)) : Graph< G >
| ^~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:75:1: required from ‘struct boost::concepts::IncidenceGraphConcept<boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::no_property, boost::listS>, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long unsigned int, long unsigned int&, long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >’
75 | BOOST_concept(IncidenceGraph, (G)) : Graph< G >
| ^~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::concepts::IncidenceGraphConcept<boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::no_property, boost::listS>, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long unsigned int, long unsigned int&, long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >]’
32 | inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
| ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied<boost::concepts::IncidenceGraphConcept<boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::no_property, boost::listS>, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long unsigned int, long unsigned int&, long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all> > >::value’
44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:62:5: required from ‘void boost::breadth_first_visit(const IncidenceGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with IncidenceGraph = filtered_graph<adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, no_property, listS>, is_residual_edge<adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_residual_capacity_t> >, keep_all>; Buffer = queue<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > >; BFSVisitor = bfs_visitor<edge_predecessor_recorder<detail::edge_desc_impl<directed_tag, long unsigned int>*, on_tree_edge> >; ColorMap = default_color_type*; SourceIterator = long unsigned int*]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:136:24: required from ‘void boost::breadth_first_search(const VertexListGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph<adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, no_property, listS>, is_residual_edge<adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_residual_capacity_t> >, keep_all>; SourceIterator = long unsigned int*; Buffer = queue<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > >; BFSVisitor = bfs_visitor<edge_predecessor_recorder<detail::edge_desc_impl<directed_tag, long unsigned int>*, on_tree_edge> >; ColorMap = default_color_type*]’
136 | breadth_first_visit(g, sources_begin, sources_end, Q, vis, color);
| ~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:147:25: required from ‘void boost::breadth_first_search(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph<adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, no_property, listS>, is_residual_edge<adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_residual_capacity_t> >, keep_all>; Buffer = queue<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > >; BFSVisitor = bfs_visitor<edge_predecessor_recorder<detail::edge_desc_impl<directed_tag, long unsigned int>*, on_tree_edge> >; ColorMap = default_color_type*; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
147 | breadth_first_search(g, sources, sources + 1, Q, vis, color);
| ~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/edmonds_karp_max_flow.hpp:101:29: required from ‘typename boost::property_traits<IndexMap>::value_type boost::edmonds_karp_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, ColorMap, PredEdgeMap) [with Graph = adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, no_property, listS>; CapacityEdgeMap = adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map<directed_tag, detail::edge_desc_impl<directed_tag, long unsigned int>, detail::edge_desc_impl<directed_tag, long unsigned int>&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_reverse_t>; ColorMap = default_color_type*; PredEdgeMap = detail::edge_desc_impl<directed_tag, long unsigned int>*; typename property_traits<IndexMap>::value_type = long unsigned int; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
101 | breadth_first_search(detail::residual_graph(g, res), src, Q,
| ~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
102 | make_bfs_visitor(record_edge_predecessors(pred, on_tree_edge())),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
103 | color);
| ~~~~~~
mincut.hpp:78:21: required from ‘typename boost::graph_traits<G>::edges_size_type boost::min_cut(VertexListGraph&, OutputIterator, OutputIterator) [with VertexListGraph = const R_adjacency_list<undirectedS, double>; OutputIterator = std::back_insert_iterator<std::vector<long unsigned int> >; typename graph_traits<G>::edges_size_type = long unsigned int]’
77 | alpha_S_k = edmonds_karp_max_flow
| ~~~~~~~~~~~~~~~~~~~~~
78 | (flow_g, p, k, cap, res_cap, rev_edge, &color[0], &pred[0]);
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
hcs.cpp:299:31: required from here
299 | min_cut(g, std::back_inserter(s_vec),
| ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
300 | std::back_inserter(vs_vec) );
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
In file included from /home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:31,
from /home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:20:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::concepts::Graph<boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::no_property, boost::listS>, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long unsigned int, long unsigned int&, long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >]’
20 | ~usage_requirements() { ((Model*)0)->~Model(); }
| ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::concepts::IncidenceGraph<boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::no_property, boost::listS>, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long unsigned int, long unsigned int&, long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all> > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:87:5: required from ‘struct boost::concepts::IncidenceGraph<boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::no_property, boost::listS>, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long unsigned int, long unsigned int&, long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:75:1: required from ‘struct boost::concepts::IncidenceGraphConcept<boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::no_property, boost::listS>, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long unsigned int, long unsigned int&, long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >’
75 | BOOST_concept(IncidenceGraph, (G)) : Graph< G >
| ^~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::concepts::IncidenceGraphConcept<boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::no_property, boost::listS>, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long unsigned int, long unsigned int&, long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >]’
32 | inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
| ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied<boost::concepts::IncidenceGraphConcept<boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::no_property, boost::listS>, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long unsigned int, long unsigned int&, long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all> > >::value’
44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:62:5: required from ‘void boost::breadth_first_visit(const IncidenceGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with IncidenceGraph = filtered_graph<adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, no_property, listS>, is_residual_edge<adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_residual_capacity_t> >, keep_all>; Buffer = queue<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > >; BFSVisitor = bfs_visitor<edge_predecessor_recorder<detail::edge_desc_impl<directed_tag, long unsigned int>*, on_tree_edge> >; ColorMap = default_color_type*; SourceIterator = long unsigned int*]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:136:24: required from ‘void boost::breadth_first_search(const VertexListGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph<adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, no_property, listS>, is_residual_edge<adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_residual_capacity_t> >, keep_all>; SourceIterator = long unsigned int*; Buffer = queue<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > >; BFSVisitor = bfs_visitor<edge_predecessor_recorder<detail::edge_desc_impl<directed_tag, long unsigned int>*, on_tree_edge> >; ColorMap = default_color_type*]’
136 | breadth_first_visit(g, sources_begin, sources_end, Q, vis, color);
| ~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:147:25: required from ‘void boost::breadth_first_search(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph<adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, no_property, listS>, is_residual_edge<adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_residual_capacity_t> >, keep_all>; Buffer = queue<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > >; BFSVisitor = bfs_visitor<edge_predecessor_recorder<detail::edge_desc_impl<directed_tag, long unsigned int>*, on_tree_edge> >; ColorMap = default_color_type*; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
147 | breadth_first_search(g, sources, sources + 1, Q, vis, color);
| ~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/edmonds_karp_max_flow.hpp:101:29: required from ‘typename boost::property_traits<IndexMap>::value_type boost::edmonds_karp_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, ColorMap, PredEdgeMap) [with Graph = adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, no_property, listS>; CapacityEdgeMap = adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map<directed_tag, detail::edge_desc_impl<directed_tag, long unsigned int>, detail::edge_desc_impl<directed_tag, long unsigned int>&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_reverse_t>; ColorMap = default_color_type*; PredEdgeMap = detail::edge_desc_impl<directed_tag, long unsigned int>*; typename property_traits<IndexMap>::value_type = long unsigned int; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
101 | breadth_first_search(detail::residual_graph(g, res), src, Q,
| ~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
102 | make_bfs_visitor(record_edge_predecessors(pred, on_tree_edge())),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
103 | color);
| ~~~~~~
mincut.hpp:78:21: required from ‘typename boost::graph_traits<G>::edges_size_type boost::min_cut(VertexListGraph&, OutputIterator, OutputIterator) [with VertexListGraph = const R_adjacency_list<undirectedS, double>; OutputIterator = std::back_insert_iterator<std::vector<long unsigned int> >; typename graph_traits<G>::edges_size_type = long unsigned int]’
77 | alpha_S_k = edmonds_karp_max_flow
| ~~~~~~~~~~~~~~~~~~~~~
78 | (flow_g, p, k, cap, res_cap, rev_edge, &color[0], &pred[0]);
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
hcs.cpp:299:31: required from here
299 | min_cut(g, std::back_inserter(s_vec),
| ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
300 | std::back_inserter(vs_vec) );
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::concepts::IncidenceGraph<boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::no_property, boost::listS>, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long unsigned int, long unsigned int&, long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >]’
20 | ~usage_requirements() { ((Model*)0)->~Model(); }
| ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::IncidenceGraphConcept<boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::no_property, boost::listS>, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long unsigned int, long unsigned int&, long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:62:5: required from ‘void boost::breadth_first_visit(const IncidenceGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with IncidenceGraph = filtered_graph<adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, no_property, listS>, is_residual_edge<adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_residual_capacity_t> >, keep_all>; Buffer = queue<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > >; BFSVisitor = bfs_visitor<edge_predecessor_recorder<detail::edge_desc_impl<directed_tag, long unsigned int>*, on_tree_edge> >; ColorMap = default_color_type*; SourceIterator = long unsigned int*]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:136:24: required from ‘void boost::breadth_first_search(const VertexListGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph<adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, no_property, listS>, is_residual_edge<adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_residual_capacity_t> >, keep_all>; SourceIterator = long unsigned int*; Buffer = queue<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > >; BFSVisitor = bfs_visitor<edge_predecessor_recorder<detail::edge_desc_impl<directed_tag, long unsigned int>*, on_tree_edge> >; ColorMap = default_color_type*]’
136 | breadth_first_visit(g, sources_begin, sources_end, Q, vis, color);
| ~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:147:25: required from ‘void boost::breadth_first_search(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph<adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, no_property, listS>, is_residual_edge<adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_residual_capacity_t> >, keep_all>; Buffer = queue<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > >; BFSVisitor = bfs_visitor<edge_predecessor_recorder<detail::edge_desc_impl<directed_tag, long unsigned int>*, on_tree_edge> >; ColorMap = default_color_type*; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
147 | breadth_first_search(g, sources, sources + 1, Q, vis, color);
| ~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/edmonds_karp_max_flow.hpp:101:29: required from ‘typename boost::property_traits<IndexMap>::value_type boost::edmonds_karp_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, ColorMap, PredEdgeMap) [with Graph = adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, no_property, listS>; CapacityEdgeMap = adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map<directed_tag, detail::edge_desc_impl<directed_tag, long unsigned int>, detail::edge_desc_impl<directed_tag, long unsigned int>&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_reverse_t>; ColorMap = default_color_type*; PredEdgeMap = detail::edge_desc_impl<directed_tag, long unsigned int>*; typename property_traits<IndexMap>::value_type = long unsigned int; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
101 | breadth_first_search(detail::residual_graph(g, res), src, Q,
| ~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
102 | make_bfs_visitor(record_edge_predecessors(pred, on_tree_edge())),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
103 | color);
| ~~~~~~
mincut.hpp:78:21: required from ‘typename boost::graph_traits<G>::edges_size_type boost::min_cut(VertexListGraph&, OutputIterator, OutputIterator) [with VertexListGraph = const R_adjacency_list<undirectedS, double>; OutputIterator = std::back_insert_iterator<std::vector<long unsigned int> >; typename graph_traits<G>::edges_size_type = long unsigned int]’
77 | alpha_S_k = edmonds_karp_max_flow
| ~~~~~~~~~~~~~~~~~~~~~
78 | (flow_g, p, k, cap, res_cap, rev_edge, &color[0], &pred[0]);
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
hcs.cpp:299:31: required from here
299 | min_cut(g, std::back_inserter(s_vec),
| ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
300 | std::back_inserter(vs_vec) );
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
In file included from /home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/preprocessor/repetition/enum_binary_params.hpp:15,
from /home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/utility/base_from_member.hpp:15,
from /home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/utility.hpp:15,
from RBGL.hpp:16:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:75:15: note: in a call to non-static member function ‘boost::concepts::IncidenceGraphConcept<boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::no_property, boost::listS>, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long unsigned int, long unsigned int&, long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >::~IncidenceGraphConcept()’
75 | BOOST_concept(IncidenceGraph, (G)) : Graph< G >
| ^~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/preprocessor/cat.hpp:29:34: note: in definition of macro ‘BOOST_PP_CAT_I’
29 | # define BOOST_PP_CAT_I(a, b) a ## b
| ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/concept_def.hpp:23:12: note: in expansion of macro ‘BOOST_PP_CAT’
23 | struct BOOST_PP_CAT(name,Concept) \
| ^~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:75:1: note: in expansion of macro ‘BOOST_concept’
75 | BOOST_concept(IncidenceGraph, (G)) : Graph< G >
| ^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::constraint<Model>::failed() [with Model = boost::BFSVisitorConcept<boost::bfs_visitor<boost::edge_predecessor_recorder<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>*, boost::on_tree_edge> >, boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::no_property, boost::listS>, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long unsigned int, long unsigned int&, long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:65:5: required from ‘void boost::breadth_first_visit(const IncidenceGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with IncidenceGraph = filtered_graph<adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, no_property, listS>, is_residual_edge<adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_residual_capacity_t> >, keep_all>; Buffer = queue<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > >; BFSVisitor = bfs_visitor<edge_predecessor_recorder<detail::edge_desc_impl<directed_tag, long unsigned int>*, on_tree_edge> >; ColorMap = default_color_type*; SourceIterator = long unsigned int*]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:136:24: required from ‘void boost::breadth_first_search(const VertexListGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph<adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, no_property, listS>, is_residual_edge<adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_residual_capacity_t> >, keep_all>; SourceIterator = long unsigned int*; Buffer = queue<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > >; BFSVisitor = bfs_visitor<edge_predecessor_recorder<detail::edge_desc_impl<directed_tag, long unsigned int>*, on_tree_edge> >; ColorMap = default_color_type*]’
136 | breadth_first_visit(g, sources_begin, sources_end, Q, vis, color);
| ~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:147:25: required from ‘void boost::breadth_first_search(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph<adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, no_property, listS>, is_residual_edge<adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_residual_capacity_t> >, keep_all>; Buffer = queue<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > >; BFSVisitor = bfs_visitor<edge_predecessor_recorder<detail::edge_desc_impl<directed_tag, long unsigned int>*, on_tree_edge> >; ColorMap = default_color_type*; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
147 | breadth_first_search(g, sources, sources + 1, Q, vis, color);
| ~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/edmonds_karp_max_flow.hpp:101:29: required from ‘typename boost::property_traits<IndexMap>::value_type boost::edmonds_karp_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, ColorMap, PredEdgeMap) [with Graph = adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, no_property, listS>; CapacityEdgeMap = adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map<directed_tag, detail::edge_desc_impl<directed_tag, long unsigned int>, detail::edge_desc_impl<directed_tag, long unsigned int>&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_reverse_t>; ColorMap = default_color_type*; PredEdgeMap = detail::edge_desc_impl<directed_tag, long unsigned int>*; typename property_traits<IndexMap>::value_type = long unsigned int; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
101 | breadth_first_search(detail::residual_graph(g, res), src, Q,
| ~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
102 | make_bfs_visitor(record_edge_predecessors(pred, on_tree_edge())),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
103 | color);
| ~~~~~~
mincut.hpp:78:21: required from ‘typename boost::graph_traits<G>::edges_size_type boost::min_cut(VertexListGraph&, OutputIterator, OutputIterator) [with VertexListGraph = const R_adjacency_list<undirectedS, double>; OutputIterator = std::back_insert_iterator<std::vector<long unsigned int> >; typename graph_traits<G>::edges_size_type = long unsigned int]’
77 | alpha_S_k = edmonds_karp_max_flow
| ~~~~~~~~~~~~~~~~~~~~~
78 | (flow_g, p, k, cap, res_cap, rev_edge, &color[0], &pred[0]);
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
hcs.cpp:299:31: required from here
299 | min_cut(g, std::back_inserter(s_vec),
| ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
300 | std::back_inserter(vs_vec) );
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:65:52: warning: ‘this’ pointer is null [-Wnonnull]
65 | static void failed() { ((Model*)0)->constraints(); }
| ~~~~~~~~~~~~~~~~~~~~~~~~^~
In file included from /home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/edmonds_karp_max_flow.hpp:22,
from /home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/edge_connectivity.hpp:20,
from mincut.hpp:4,
from hcs.cpp:2:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:37:10: note: in a call to non-static member function ‘void boost::BFSVisitorConcept<Visitor, Graph>::constraints() [with Visitor = boost::bfs_visitor<boost::edge_predecessor_recorder<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>*, boost::on_tree_edge> >; Graph = boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::no_property, boost::listS>, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long unsigned int, long unsigned int&, long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all>]’
37 | void constraints()
| ^~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::constraint<Model>::failed() [with Model = boost::ReadWritePropertyMapConcept<boost::default_color_type*, long unsigned int>]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:66:5: required from ‘void boost::breadth_first_visit(const IncidenceGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with IncidenceGraph = filtered_graph<adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, no_property, listS>, is_residual_edge<adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_residual_capacity_t> >, keep_all>; Buffer = queue<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > >; BFSVisitor = bfs_visitor<edge_predecessor_recorder<detail::edge_desc_impl<directed_tag, long unsigned int>*, on_tree_edge> >; ColorMap = default_color_type*; SourceIterator = long unsigned int*]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:136:24: required from ‘void boost::breadth_first_search(const VertexListGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph<adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, no_property, listS>, is_residual_edge<adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_residual_capacity_t> >, keep_all>; SourceIterator = long unsigned int*; Buffer = queue<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > >; BFSVisitor = bfs_visitor<edge_predecessor_recorder<detail::edge_desc_impl<directed_tag, long unsigned int>*, on_tree_edge> >; ColorMap = default_color_type*]’
136 | breadth_first_visit(g, sources_begin, sources_end, Q, vis, color);
| ~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:147:25: required from ‘void boost::breadth_first_search(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph<adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, no_property, listS>, is_residual_edge<adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_residual_capacity_t> >, keep_all>; Buffer = queue<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > >; BFSVisitor = bfs_visitor<edge_predecessor_recorder<detail::edge_desc_impl<directed_tag, long unsigned int>*, on_tree_edge> >; ColorMap = default_color_type*; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
147 | breadth_first_search(g, sources, sources + 1, Q, vis, color);
| ~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/edmonds_karp_max_flow.hpp:101:29: required from ‘typename boost::property_traits<IndexMap>::value_type boost::edmonds_karp_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, ColorMap, PredEdgeMap) [with Graph = adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, no_property, listS>; CapacityEdgeMap = adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map<directed_tag, detail::edge_desc_impl<directed_tag, long unsigned int>, detail::edge_desc_impl<directed_tag, long unsigned int>&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_reverse_t>; ColorMap = default_color_type*; PredEdgeMap = detail::edge_desc_impl<directed_tag, long unsigned int>*; typename property_traits<IndexMap>::value_type = long unsigned int; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
101 | breadth_first_search(detail::residual_graph(g, res), src, Q,
| ~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
102 | make_bfs_visitor(record_edge_predecessors(pred, on_tree_edge())),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
103 | color);
| ~~~~~~
mincut.hpp:78:21: required from ‘typename boost::graph_traits<G>::edges_size_type boost::min_cut(VertexListGraph&, OutputIterator, OutputIterator) [with VertexListGraph = const R_adjacency_list<undirectedS, double>; OutputIterator = std::back_insert_iterator<std::vector<long unsigned int> >; typename graph_traits<G>::edges_size_type = long unsigned int]’
77 | alpha_S_k = edmonds_karp_max_flow
| ~~~~~~~~~~~~~~~~~~~~~
78 | (flow_g, p, k, cap, res_cap, rev_edge, &color[0], &pred[0]);
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
hcs.cpp:299:31: required from here
299 | min_cut(g, std::back_inserter(s_vec),
| ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
300 | std::back_inserter(vs_vec) );
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:65:52: warning: ‘this’ pointer is null [-Wnonnull]
65 | static void failed() { ((Model*)0)->constraints(); }
| ~~~~~~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/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::default_color_type*; Key = long unsigned int]’
205 | void constraints() {
| ^~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::concepts::Graph<boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::no_property, boost::listS>, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long unsigned int, long unsigned int&, long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::concepts::Graph<boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::no_property, boost::listS>, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long unsigned int, long unsigned int&, long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all> > >]’
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:66:5: required from ‘struct boost::concepts::Graph<boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::no_property, boost::listS>, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long unsigned int, long unsigned int&, long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:75:1: required from ‘struct boost::concepts::IncidenceGraph<boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::no_property, boost::listS>, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long unsigned int, long unsigned int&, long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >’
75 | BOOST_concept(IncidenceGraph, (G)) : Graph< G >
| ^~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:75:1: required from ‘struct boost::concepts::IncidenceGraphConcept<boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::no_property, boost::listS>, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long unsigned int, long unsigned int&, long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >’
75 | BOOST_concept(IncidenceGraph, (G)) : Graph< G >
| ^~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::concepts::IncidenceGraphConcept<boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::no_property, boost::listS>, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long unsigned int, long unsigned int&, long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >]’
32 | inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
| ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:62:5: required from ‘void boost::breadth_first_visit(const IncidenceGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with IncidenceGraph = filtered_graph<adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, no_property, listS>, is_residual_edge<adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_residual_capacity_t> >, keep_all>; Buffer = queue<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > >; BFSVisitor = bfs_visitor<edge_predecessor_recorder<detail::edge_desc_impl<directed_tag, long unsigned int>*, on_tree_edge> >; ColorMap = default_color_type*; SourceIterator = long unsigned int*]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:136:24: required from ‘void boost::breadth_first_search(const VertexListGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph<adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, no_property, listS>, is_residual_edge<adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_residual_capacity_t> >, keep_all>; SourceIterator = long unsigned int*; Buffer = queue<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > >; BFSVisitor = bfs_visitor<edge_predecessor_recorder<detail::edge_desc_impl<directed_tag, long unsigned int>*, on_tree_edge> >; ColorMap = default_color_type*]’
136 | breadth_first_visit(g, sources_begin, sources_end, Q, vis, color);
| ~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:147:25: required from ‘void boost::breadth_first_search(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph<adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, no_property, listS>, is_residual_edge<adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_residual_capacity_t> >, keep_all>; Buffer = queue<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > >; BFSVisitor = bfs_visitor<edge_predecessor_recorder<detail::edge_desc_impl<directed_tag, long unsigned int>*, on_tree_edge> >; ColorMap = default_color_type*; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
147 | breadth_first_search(g, sources, sources + 1, Q, vis, color);
| ~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/edmonds_karp_max_flow.hpp:101:29: required from ‘typename boost::property_traits<IndexMap>::value_type boost::edmonds_karp_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, ColorMap, PredEdgeMap) [with Graph = adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, no_property, listS>; CapacityEdgeMap = adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map<directed_tag, detail::edge_desc_impl<directed_tag, long unsigned int>, detail::edge_desc_impl<directed_tag, long unsigned int>&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_reverse_t>; ColorMap = default_color_type*; PredEdgeMap = detail::edge_desc_impl<directed_tag, long unsigned int>*; typename property_traits<IndexMap>::value_type = long unsigned int; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
101 | breadth_first_search(detail::residual_graph(g, res), src, Q,
| ~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
102 | make_bfs_visitor(record_edge_predecessors(pred, on_tree_edge())),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
103 | color);
| ~~~~~~
mincut.hpp:78:21: required from ‘typename boost::graph_traits<G>::edges_size_type boost::min_cut(VertexListGraph&, OutputIterator, OutputIterator) [with VertexListGraph = const R_adjacency_list<undirectedS, double>; OutputIterator = std::back_insert_iterator<std::vector<long unsigned int> >; typename graph_traits<G>::edges_size_type = long unsigned int]’
77 | alpha_S_k = edmonds_karp_max_flow
| ~~~~~~~~~~~~~~~~~~~~~
78 | (flow_g, p, k, cap, res_cap, rev_edge, &color[0], &pred[0]);
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
hcs.cpp:299:31: required from here
299 | min_cut(g, std::back_inserter(s_vec),
| ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
300 | std::back_inserter(vs_vec) );
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
20 | ~usage_requirements() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::concepts::Graph<G>::~Graph() [with G = boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::no_property, boost::listS>, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long unsigned int, long unsigned int&, long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all>]’
37 | ~model()
| ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:66:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
66 | BOOST_CONCEPT_USAGE(Graph)
| ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::concepts::IncidenceGraph<boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::no_property, boost::listS>, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long unsigned int, long unsigned int&, long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::concepts::IncidenceGraph<boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::no_property, boost::listS>, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long unsigned int, long unsigned int&, long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all> > >]’
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:87:5: required from ‘struct boost::concepts::IncidenceGraph<boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::no_property, boost::listS>, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long unsigned int, long unsigned int&, long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:75:1: required from ‘struct boost::concepts::IncidenceGraphConcept<boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::no_property, boost::listS>, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long unsigned int, long unsigned int&, long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >’
75 | BOOST_concept(IncidenceGraph, (G)) : Graph< G >
| ^~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::concepts::IncidenceGraphConcept<boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::no_property, boost::listS>, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long unsigned int, long unsigned int&, long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >]’
32 | inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
| ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied<boost::concepts::IncidenceGraphConcept<boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::no_property, boost::listS>, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long unsigned int, long unsigned int&, long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all> > >::value’
44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:62:5: required from ‘void boost::breadth_first_visit(const IncidenceGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with IncidenceGraph = filtered_graph<adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, no_property, listS>, is_residual_edge<adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_residual_capacity_t> >, keep_all>; Buffer = queue<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > >; BFSVisitor = bfs_visitor<edge_predecessor_recorder<detail::edge_desc_impl<directed_tag, long unsigned int>*, on_tree_edge> >; ColorMap = default_color_type*; SourceIterator = long unsigned int*]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:136:24: required from ‘void boost::breadth_first_search(const VertexListGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph<adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, no_property, listS>, is_residual_edge<adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_residual_capacity_t> >, keep_all>; SourceIterator = long unsigned int*; Buffer = queue<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > >; BFSVisitor = bfs_visitor<edge_predecessor_recorder<detail::edge_desc_impl<directed_tag, long unsigned int>*, on_tree_edge> >; ColorMap = default_color_type*]’
136 | breadth_first_visit(g, sources_begin, sources_end, Q, vis, color);
| ~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:147:25: required from ‘void boost::breadth_first_search(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph<adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, no_property, listS>, is_residual_edge<adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_residual_capacity_t> >, keep_all>; Buffer = queue<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > >; BFSVisitor = bfs_visitor<edge_predecessor_recorder<detail::edge_desc_impl<directed_tag, long unsigned int>*, on_tree_edge> >; ColorMap = default_color_type*; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
147 | breadth_first_search(g, sources, sources + 1, Q, vis, color);
| ~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/edmonds_karp_max_flow.hpp:101:29: required from ‘typename boost::property_traits<IndexMap>::value_type boost::edmonds_karp_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, ColorMap, PredEdgeMap) [with Graph = adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, no_property, listS>; CapacityEdgeMap = adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map<directed_tag, detail::edge_desc_impl<directed_tag, long unsigned int>, detail::edge_desc_impl<directed_tag, long unsigned int>&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_reverse_t>; ColorMap = default_color_type*; PredEdgeMap = detail::edge_desc_impl<directed_tag, long unsigned int>*; typename property_traits<IndexMap>::value_type = long unsigned int; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
101 | breadth_first_search(detail::residual_graph(g, res), src, Q,
| ~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
102 | make_bfs_visitor(record_edge_predecessors(pred, on_tree_edge())),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
103 | color);
| ~~~~~~
mincut.hpp:78:21: required from ‘typename boost::graph_traits<G>::edges_size_type boost::min_cut(VertexListGraph&, OutputIterator, OutputIterator) [with VertexListGraph = const R_adjacency_list<undirectedS, double>; OutputIterator = std::back_insert_iterator<std::vector<long unsigned int> >; typename graph_traits<G>::edges_size_type = long unsigned int]’
77 | alpha_S_k = edmonds_karp_max_flow
| ~~~~~~~~~~~~~~~~~~~~~
78 | (flow_g, p, k, cap, res_cap, rev_edge, &color[0], &pred[0]);
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
hcs.cpp:299:31: required from here
299 | min_cut(g, std::back_inserter(s_vec),
| ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
300 | std::back_inserter(vs_vec) );
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
20 | ~usage_requirements() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::concepts::IncidenceGraph<G>::~IncidenceGraph() [with G = boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::no_property, boost::listS>, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long unsigned int, long unsigned int&, long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all>]’
37 | ~model()
| ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:87:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
87 | BOOST_CONCEPT_USAGE(IncidenceGraph)
| ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/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::bfs_visitor<boost::edge_predecessor_recorder<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>*, boost::on_tree_edge> > > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:167:5: required from ‘struct boost::CopyConstructible<boost::bfs_visitor<boost::edge_predecessor_recorder<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>*, boost::on_tree_edge> > >’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:165:3: required from ‘struct boost::CopyConstructibleConcept<boost::bfs_visitor<boost::edge_predecessor_recorder<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>*, boost::on_tree_edge> > >’
165 | BOOST_concept(CopyConstructible,(TT))
| ^~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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::bfs_visitor<boost::edge_predecessor_recorder<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>*, boost::on_tree_edge> > >]’
32 | inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
| ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied<boost::CopyConstructibleConcept<boost::bfs_visitor<boost::edge_predecessor_recorder<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>*, boost::on_tree_edge> > > >::value’
44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied<boost::CopyConstructibleConcept<boost::bfs_visitor<boost::edge_predecessor_recorder<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>*, boost::on_tree_edge> > > >’
45 | typedef boost::integral_constant<bool, value> type;
| ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 6 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:65:5: required from ‘void boost::breadth_first_visit(const IncidenceGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with IncidenceGraph = filtered_graph<adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, no_property, listS>, is_residual_edge<adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_residual_capacity_t> >, keep_all>; Buffer = queue<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > >; BFSVisitor = bfs_visitor<edge_predecessor_recorder<detail::edge_desc_impl<directed_tag, long unsigned int>*, on_tree_edge> >; ColorMap = default_color_type*; SourceIterator = long unsigned int*]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:136:24: required from ‘void boost::breadth_first_search(const VertexListGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph<adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, no_property, listS>, is_residual_edge<adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_residual_capacity_t> >, keep_all>; SourceIterator = long unsigned int*; Buffer = queue<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > >; BFSVisitor = bfs_visitor<edge_predecessor_recorder<detail::edge_desc_impl<directed_tag, long unsigned int>*, on_tree_edge> >; ColorMap = default_color_type*]’
136 | breadth_first_visit(g, sources_begin, sources_end, Q, vis, color);
| ~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:147:25: required from ‘void boost::breadth_first_search(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph<adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, no_property, listS>, is_residual_edge<adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_residual_capacity_t> >, keep_all>; Buffer = queue<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > >; BFSVisitor = bfs_visitor<edge_predecessor_recorder<detail::edge_desc_impl<directed_tag, long unsigned int>*, on_tree_edge> >; ColorMap = default_color_type*; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
147 | breadth_first_search(g, sources, sources + 1, Q, vis, color);
| ~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/edmonds_karp_max_flow.hpp:101:29: required from ‘typename boost::property_traits<IndexMap>::value_type boost::edmonds_karp_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, ColorMap, PredEdgeMap) [with Graph = adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, no_property, listS>; CapacityEdgeMap = adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map<directed_tag, detail::edge_desc_impl<directed_tag, long unsigned int>, detail::edge_desc_impl<directed_tag, long unsigned int>&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_reverse_t>; ColorMap = default_color_type*; PredEdgeMap = detail::edge_desc_impl<directed_tag, long unsigned int>*; typename property_traits<IndexMap>::value_type = long unsigned int; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
101 | breadth_first_search(detail::residual_graph(g, res), src, Q,
| ~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
102 | make_bfs_visitor(record_edge_predecessors(pred, on_tree_edge())),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
103 | color);
| ~~~~~~
mincut.hpp:78:21: required from ‘typename boost::graph_traits<G>::edges_size_type boost::min_cut(VertexListGraph&, OutputIterator, OutputIterator) [with VertexListGraph = const R_adjacency_list<undirectedS, double>; OutputIterator = std::back_insert_iterator<std::vector<long unsigned int> >; typename graph_traits<G>::edges_size_type = long unsigned int]’
77 | alpha_S_k = edmonds_karp_max_flow
| ~~~~~~~~~~~~~~~~~~~~~
78 | (flow_g, p, k, cap, res_cap, rev_edge, &color[0], &pred[0]);
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
hcs.cpp:299:31: required from here
299 | min_cut(g, std::back_inserter(s_vec),
| ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
300 | std::back_inserter(vs_vec) );
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/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::bfs_visitor<boost::edge_predecessor_recorder<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>*, boost::on_tree_edge> > >]’
20 | ~usage_requirements() { ((Model*)0)->~Model(); }
| ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/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::bfs_visitor<boost::edge_predecessor_recorder<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>*, boost::on_tree_edge> > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:39:9: required from ‘void boost::BFSVisitorConcept<Visitor, Graph>::constraints() [with Visitor = boost::bfs_visitor<boost::edge_predecessor_recorder<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>*, boost::on_tree_edge> >; Graph = boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::no_property, boost::listS>, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long unsigned int, long unsigned int&, long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all>]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::BFSVisitorConcept<boost::bfs_visitor<boost::edge_predecessor_recorder<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>*, boost::on_tree_edge> >, boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::no_property, boost::listS>, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long unsigned int, long unsigned int&, long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >]’
32 | inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
| ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied<boost::BFSVisitorConcept<boost::bfs_visitor<boost::edge_predecessor_recorder<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>*, boost::on_tree_edge> >, boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::no_property, boost::listS>, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long unsigned int, long unsigned int&, long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all> > >::value’
44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied<boost::BFSVisitorConcept<boost::bfs_visitor<boost::edge_predecessor_recorder<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>*, boost::on_tree_edge> >, boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::no_property, boost::listS>, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long unsigned int, long unsigned int&, long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all> > >’
45 | typedef boost::integral_constant<bool, value> type;
| ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_<void (*)(boost::BFSVisitorConcept<boost::bfs_visitor<boost::edge_predecessor_recorder<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>*, boost::on_tree_edge> >, boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::no_property, boost::listS>, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long unsigned int, long unsigned int&, long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >)>’
72 | struct requirement_<void(*)(Model)>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:65:5: required from ‘void boost::breadth_first_visit(const IncidenceGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with IncidenceGraph = filtered_graph<adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, no_property, listS>, is_residual_edge<adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_residual_capacity_t> >, keep_all>; Buffer = queue<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > >; BFSVisitor = bfs_visitor<edge_predecessor_recorder<detail::edge_desc_impl<directed_tag, long unsigned int>*, on_tree_edge> >; ColorMap = default_color_type*; SourceIterator = long unsigned int*]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:136:24: required from ‘void boost::breadth_first_search(const VertexListGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph<adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, no_property, listS>, is_residual_edge<adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_residual_capacity_t> >, keep_all>; SourceIterator = long unsigned int*; Buffer = queue<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > >; BFSVisitor = bfs_visitor<edge_predecessor_recorder<detail::edge_desc_impl<directed_tag, long unsigned int>*, on_tree_edge> >; ColorMap = default_color_type*]’
136 | breadth_first_visit(g, sources_begin, sources_end, Q, vis, color);
| ~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:147:25: required from ‘void boost::breadth_first_search(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph<adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, no_property, listS>, is_residual_edge<adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_residual_capacity_t> >, keep_all>; Buffer = queue<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > >; BFSVisitor = bfs_visitor<edge_predecessor_recorder<detail::edge_desc_impl<directed_tag, long unsigned int>*, on_tree_edge> >; ColorMap = default_color_type*; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
147 | breadth_first_search(g, sources, sources + 1, Q, vis, color);
| ~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/edmonds_karp_max_flow.hpp:101:29: required from ‘typename boost::property_traits<IndexMap>::value_type boost::edmonds_karp_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, ColorMap, PredEdgeMap) [with Graph = adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, no_property, listS>; CapacityEdgeMap = adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map<directed_tag, detail::edge_desc_impl<directed_tag, long unsigned int>, detail::edge_desc_impl<directed_tag, long unsigned int>&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_reverse_t>; ColorMap = default_color_type*; PredEdgeMap = detail::edge_desc_impl<directed_tag, long unsigned int>*; typename property_traits<IndexMap>::value_type = long unsigned int; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
101 | breadth_first_search(detail::residual_graph(g, res), src, Q,
| ~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
102 | make_bfs_visitor(record_edge_predecessors(pred, on_tree_edge())),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
103 | color);
| ~~~~~~
mincut.hpp:78:21: required from ‘typename boost::graph_traits<G>::edges_size_type boost::min_cut(VertexListGraph&, OutputIterator, OutputIterator) [with VertexListGraph = const R_adjacency_list<undirectedS, double>; OutputIterator = std::back_insert_iterator<std::vector<long unsigned int> >; typename graph_traits<G>::edges_size_type = long unsigned int]’
77 | alpha_S_k = edmonds_karp_max_flow
| ~~~~~~~~~~~~~~~~~~~~~
78 | (flow_g, p, k, cap, res_cap, rev_edge, &color[0], &pred[0]);
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
hcs.cpp:299:31: required from here
299 | min_cut(g, std::back_inserter(s_vec),
| ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
300 | std::back_inserter(vs_vec) );
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:165:17: note: in a call to non-static member function ‘boost::CopyConstructibleConcept<boost::bfs_visitor<boost::edge_predecessor_recorder<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>*, boost::on_tree_edge> > >::~CopyConstructibleConcept()’
165 | BOOST_concept(CopyConstructible,(TT))
| ^~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/preprocessor/cat.hpp:29:34: note: in definition of macro ‘BOOST_PP_CAT_I’
29 | # define BOOST_PP_CAT_I(a, b) a ## b
| ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/concept_def.hpp:23:12: note: in expansion of macro ‘BOOST_PP_CAT’
23 | struct BOOST_PP_CAT(name,Concept) \
| ^~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:165:3: note: in expansion of macro ‘BOOST_concept’
165 | BOOST_concept(CopyConstructible,(TT))
| ^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::constraint<Model>::failed() [with Model = boost::ReadablePropertyMapConcept<boost::default_color_type*, long unsigned int>]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:206:7: required from ‘void boost::ReadWritePropertyMapConcept<PMap, Key>::constraints() [with PMap = boost::default_color_type*; Key = long unsigned int]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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::default_color_type*, long unsigned int>]’
32 | inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
| ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied<boost::ReadWritePropertyMapConcept<boost::default_color_type*, long unsigned int> >::value’
44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied<boost::ReadWritePropertyMapConcept<boost::default_color_type*, long unsigned int> >’
45 | typedef boost::integral_constant<bool, value> type;
| ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_<void (*)(boost::ReadWritePropertyMapConcept<boost::default_color_type*, long unsigned int>)>’
72 | struct requirement_<void(*)(Model)>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:66:5: required from ‘void boost::breadth_first_visit(const IncidenceGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with IncidenceGraph = filtered_graph<adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, no_property, listS>, is_residual_edge<adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_residual_capacity_t> >, keep_all>; Buffer = queue<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > >; BFSVisitor = bfs_visitor<edge_predecessor_recorder<detail::edge_desc_impl<directed_tag, long unsigned int>*, on_tree_edge> >; ColorMap = default_color_type*; SourceIterator = long unsigned int*]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:136:24: required from ‘void boost::breadth_first_search(const VertexListGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph<adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, no_property, listS>, is_residual_edge<adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_residual_capacity_t> >, keep_all>; SourceIterator = long unsigned int*; Buffer = queue<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > >; BFSVisitor = bfs_visitor<edge_predecessor_recorder<detail::edge_desc_impl<directed_tag, long unsigned int>*, on_tree_edge> >; ColorMap = default_color_type*]’
136 | breadth_first_visit(g, sources_begin, sources_end, Q, vis, color);
| ~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:147:25: required from ‘void boost::breadth_first_search(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph<adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, no_property, listS>, is_residual_edge<adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_residual_capacity_t> >, keep_all>; Buffer = queue<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > >; BFSVisitor = bfs_visitor<edge_predecessor_recorder<detail::edge_desc_impl<directed_tag, long unsigned int>*, on_tree_edge> >; ColorMap = default_color_type*; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
147 | breadth_first_search(g, sources, sources + 1, Q, vis, color);
| ~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/edmonds_karp_max_flow.hpp:101:29: required from ‘typename boost::property_traits<IndexMap>::value_type boost::edmonds_karp_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, ColorMap, PredEdgeMap) [with Graph = adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, no_property, listS>; CapacityEdgeMap = adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map<directed_tag, detail::edge_desc_impl<directed_tag, long unsigned int>, detail::edge_desc_impl<directed_tag, long unsigned int>&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_reverse_t>; ColorMap = default_color_type*; PredEdgeMap = detail::edge_desc_impl<directed_tag, long unsigned int>*; typename property_traits<IndexMap>::value_type = long unsigned int; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
101 | breadth_first_search(detail::residual_graph(g, res), src, Q,
| ~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
102 | make_bfs_visitor(record_edge_predecessors(pred, on_tree_edge())),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
103 | color);
| ~~~~~~
mincut.hpp:78:21: required from ‘typename boost::graph_traits<G>::edges_size_type boost::min_cut(VertexListGraph&, OutputIterator, OutputIterator) [with VertexListGraph = const R_adjacency_list<undirectedS, double>; OutputIterator = std::back_insert_iterator<std::vector<long unsigned int> >; typename graph_traits<G>::edges_size_type = long unsigned int]’
77 | alpha_S_k = edmonds_karp_max_flow
| ~~~~~~~~~~~~~~~~~~~~~
78 | (flow_g, p, k, cap, res_cap, rev_edge, &color[0], &pred[0]);
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
hcs.cpp:299:31: required from here
299 | min_cut(g, std::back_inserter(s_vec),
| ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
300 | std::back_inserter(vs_vec) );
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:65:52: warning: ‘this’ pointer is null [-Wnonnull]
65 | static void failed() { ((Model*)0)->constraints(); }
| ~~~~~~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/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::default_color_type*; Key = long unsigned int]’
147 | void constraints() {
| ^~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::constraint<Model>::failed() [with Model = boost::WritablePropertyMapConcept<boost::default_color_type*, long unsigned int>]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:207:7: required from ‘void boost::ReadWritePropertyMapConcept<PMap, Key>::constraints() [with PMap = boost::default_color_type*; Key = long unsigned int]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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::default_color_type*, long unsigned int>]’
32 | inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
| ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied<boost::ReadWritePropertyMapConcept<boost::default_color_type*, long unsigned int> >::value’
44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied<boost::ReadWritePropertyMapConcept<boost::default_color_type*, long unsigned int> >’
45 | typedef boost::integral_constant<bool, value> type;
| ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_<void (*)(boost::ReadWritePropertyMapConcept<boost::default_color_type*, long unsigned int>)>’
72 | struct requirement_<void(*)(Model)>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:66:5: required from ‘void boost::breadth_first_visit(const IncidenceGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with IncidenceGraph = filtered_graph<adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, no_property, listS>, is_residual_edge<adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_residual_capacity_t> >, keep_all>; Buffer = queue<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > >; BFSVisitor = bfs_visitor<edge_predecessor_recorder<detail::edge_desc_impl<directed_tag, long unsigned int>*, on_tree_edge> >; ColorMap = default_color_type*; SourceIterator = long unsigned int*]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:136:24: required from ‘void boost::breadth_first_search(const VertexListGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph<adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, no_property, listS>, is_residual_edge<adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_residual_capacity_t> >, keep_all>; SourceIterator = long unsigned int*; Buffer = queue<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > >; BFSVisitor = bfs_visitor<edge_predecessor_recorder<detail::edge_desc_impl<directed_tag, long unsigned int>*, on_tree_edge> >; ColorMap = default_color_type*]’
136 | breadth_first_visit(g, sources_begin, sources_end, Q, vis, color);
| ~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:147:25: required from ‘void boost::breadth_first_search(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph<adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, no_property, listS>, is_residual_edge<adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_residual_capacity_t> >, keep_all>; Buffer = queue<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > >; BFSVisitor = bfs_visitor<edge_predecessor_recorder<detail::edge_desc_impl<directed_tag, long unsigned int>*, on_tree_edge> >; ColorMap = default_color_type*; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
147 | breadth_first_search(g, sources, sources + 1, Q, vis, color);
| ~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/edmonds_karp_max_flow.hpp:101:29: required from ‘typename boost::property_traits<IndexMap>::value_type boost::edmonds_karp_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, ColorMap, PredEdgeMap) [with Graph = adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, no_property, listS>; CapacityEdgeMap = adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map<directed_tag, detail::edge_desc_impl<directed_tag, long unsigned int>, detail::edge_desc_impl<directed_tag, long unsigned int>&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_reverse_t>; ColorMap = default_color_type*; PredEdgeMap = detail::edge_desc_impl<directed_tag, long unsigned int>*; typename property_traits<IndexMap>::value_type = long unsigned int; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
101 | breadth_first_search(detail::residual_graph(g, res), src, Q,
| ~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
102 | make_bfs_visitor(record_edge_predecessors(pred, on_tree_edge())),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
103 | color);
| ~~~~~~
mincut.hpp:78:21: required from ‘typename boost::graph_traits<G>::edges_size_type boost::min_cut(VertexListGraph&, OutputIterator, OutputIterator) [with VertexListGraph = const R_adjacency_list<undirectedS, double>; OutputIterator = std::back_insert_iterator<std::vector<long unsigned int> >; typename graph_traits<G>::edges_size_type = long unsigned int]’
77 | alpha_S_k = edmonds_karp_max_flow
| ~~~~~~~~~~~~~~~~~~~~~
78 | (flow_g, p, k, cap, res_cap, rev_edge, &color[0], &pred[0]);
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
hcs.cpp:299:31: required from here
299 | min_cut(g, std::back_inserter(s_vec),
| ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
300 | std::back_inserter(vs_vec) );
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:65:52: warning: ‘this’ pointer is null [-Wnonnull]
65 | static void failed() { ((Model*)0)->constraints(); }
| ~~~~~~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/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::default_color_type*; Key = long unsigned int]’
179 | void constraints() {
| ^~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Convertible<boost::lvalue_property_map_tag, boost::read_write_property_map_tag> >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/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> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/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))
| ^~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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);
| ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/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) );
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/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;
| ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 6 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:66:5: required from ‘void boost::breadth_first_visit(const IncidenceGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with IncidenceGraph = filtered_graph<adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, no_property, listS>, is_residual_edge<adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_residual_capacity_t> >, keep_all>; Buffer = queue<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > >; BFSVisitor = bfs_visitor<edge_predecessor_recorder<detail::edge_desc_impl<directed_tag, long unsigned int>*, on_tree_edge> >; ColorMap = default_color_type*; SourceIterator = long unsigned int*]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:136:24: required from ‘void boost::breadth_first_search(const VertexListGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph<adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, no_property, listS>, is_residual_edge<adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_residual_capacity_t> >, keep_all>; SourceIterator = long unsigned int*; Buffer = queue<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > >; BFSVisitor = bfs_visitor<edge_predecessor_recorder<detail::edge_desc_impl<directed_tag, long unsigned int>*, on_tree_edge> >; ColorMap = default_color_type*]’
136 | breadth_first_visit(g, sources_begin, sources_end, Q, vis, color);
| ~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:147:25: required from ‘void boost::breadth_first_search(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph<adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, no_property, listS>, is_residual_edge<adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_residual_capacity_t> >, keep_all>; Buffer = queue<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > >; BFSVisitor = bfs_visitor<edge_predecessor_recorder<detail::edge_desc_impl<directed_tag, long unsigned int>*, on_tree_edge> >; ColorMap = default_color_type*; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
147 | breadth_first_search(g, sources, sources + 1, Q, vis, color);
| ~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/edmonds_karp_max_flow.hpp:101:29: required from ‘typename boost::property_traits<IndexMap>::value_type boost::edmonds_karp_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, ColorMap, PredEdgeMap) [with Graph = adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, no_property, listS>; CapacityEdgeMap = adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map<directed_tag, detail::edge_desc_impl<directed_tag, long unsigned int>, detail::edge_desc_impl<directed_tag, long unsigned int>&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_reverse_t>; ColorMap = default_color_type*; PredEdgeMap = detail::edge_desc_impl<directed_tag, long unsigned int>*; typename property_traits<IndexMap>::value_type = long unsigned int; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
101 | breadth_first_search(detail::residual_graph(g, res), src, Q,
| ~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
102 | make_bfs_visitor(record_edge_predecessors(pred, on_tree_edge())),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
103 | color);
| ~~~~~~
mincut.hpp:78:21: required from ‘typename boost::graph_traits<G>::edges_size_type boost::min_cut(VertexListGraph&, OutputIterator, OutputIterator) [with VertexListGraph = const R_adjacency_list<undirectedS, double>; OutputIterator = std::back_insert_iterator<std::vector<long unsigned int> >; typename graph_traits<G>::edges_size_type = long unsigned int]’
77 | alpha_S_k = edmonds_karp_max_flow
| ~~~~~~~~~~~~~~~~~~~~~
78 | (flow_g, p, k, cap, res_cap, rev_edge, &color[0], &pred[0]);
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
hcs.cpp:299:31: required from here
299 | min_cut(g, std::back_inserter(s_vec),
| ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
300 | std::back_inserter(vs_vec) );
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Convertible<boost::lvalue_property_map_tag, boost::read_write_property_map_tag>]’
20 | ~usage_requirements() { ((Model*)0)->~Model(); }
| ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::ConvertibleConcept<boost::lvalue_property_map_tag, boost::read_write_property_map_tag>]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:208:7: required from ‘void boost::ReadWritePropertyMapConcept<PMap, Key>::constraints() [with PMap = boost::default_color_type*; Key = long unsigned int]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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::default_color_type*, long unsigned int>]’
32 | inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
| ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied<boost::ReadWritePropertyMapConcept<boost::default_color_type*, long unsigned int> >::value’
44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied<boost::ReadWritePropertyMapConcept<boost::default_color_type*, long unsigned int> >’
45 | typedef boost::integral_constant<bool, value> type;
| ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_<void (*)(boost::ReadWritePropertyMapConcept<boost::default_color_type*, long unsigned int>)>’
72 | struct requirement_<void(*)(Model)>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:66:5: required from ‘void boost::breadth_first_visit(const IncidenceGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with IncidenceGraph = filtered_graph<adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, no_property, listS>, is_residual_edge<adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_residual_capacity_t> >, keep_all>; Buffer = queue<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > >; BFSVisitor = bfs_visitor<edge_predecessor_recorder<detail::edge_desc_impl<directed_tag, long unsigned int>*, on_tree_edge> >; ColorMap = default_color_type*; SourceIterator = long unsigned int*]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:136:24: required from ‘void boost::breadth_first_search(const VertexListGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph<adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, no_property, listS>, is_residual_edge<adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_residual_capacity_t> >, keep_all>; SourceIterator = long unsigned int*; Buffer = queue<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > >; BFSVisitor = bfs_visitor<edge_predecessor_recorder<detail::edge_desc_impl<directed_tag, long unsigned int>*, on_tree_edge> >; ColorMap = default_color_type*]’
136 | breadth_first_visit(g, sources_begin, sources_end, Q, vis, color);
| ~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:147:25: required from ‘void boost::breadth_first_search(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph<adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, no_property, listS>, is_residual_edge<adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_residual_capacity_t> >, keep_all>; Buffer = queue<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > >; BFSVisitor = bfs_visitor<edge_predecessor_recorder<detail::edge_desc_impl<directed_tag, long unsigned int>*, on_tree_edge> >; ColorMap = default_color_type*; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
147 | breadth_first_search(g, sources, sources + 1, Q, vis, color);
| ~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/edmonds_karp_max_flow.hpp:101:29: required from ‘typename boost::property_traits<IndexMap>::value_type boost::edmonds_karp_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, ColorMap, PredEdgeMap) [with Graph = adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, no_property, listS>; CapacityEdgeMap = adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map<directed_tag, detail::edge_desc_impl<directed_tag, long unsigned int>, detail::edge_desc_impl<directed_tag, long unsigned int>&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_reverse_t>; ColorMap = default_color_type*; PredEdgeMap = detail::edge_desc_impl<directed_tag, long unsigned int>*; typename property_traits<IndexMap>::value_type = long unsigned int; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
101 | breadth_first_search(detail::residual_graph(g, res), src, Q,
| ~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
102 | make_bfs_visitor(record_edge_predecessors(pred, on_tree_edge())),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
103 | color);
| ~~~~~~
mincut.hpp:78:21: required from ‘typename boost::graph_traits<G>::edges_size_type boost::min_cut(VertexListGraph&, OutputIterator, OutputIterator) [with VertexListGraph = const R_adjacency_list<undirectedS, double>; OutputIterator = std::back_insert_iterator<std::vector<long unsigned int> >; typename graph_traits<G>::edges_size_type = long unsigned int]’
77 | alpha_S_k = edmonds_karp_max_flow
| ~~~~~~~~~~~~~~~~~~~~~
78 | (flow_g, p, k, cap, res_cap, rev_edge, &color[0], &pred[0]);
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
hcs.cpp:299:31: required from here
299 | min_cut(g, std::back_inserter(s_vec),
| ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
300 | std::back_inserter(vs_vec) );
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:206:17: note: in a call to non-static member function ‘boost::ConvertibleConcept<boost::lvalue_property_map_tag, boost::read_write_property_map_tag>::~ConvertibleConcept()’
206 | BOOST_concept(Convertible,(X)(Y))
| ^~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/preprocessor/cat.hpp:29:34: note: in definition of macro ‘BOOST_PP_CAT_I’
29 | # define BOOST_PP_CAT_I(a, b) a ## b
| ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/concept_def.hpp:23:12: note: in expansion of macro ‘BOOST_PP_CAT’
23 | struct BOOST_PP_CAT(name,Concept) \
| ^~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:206:3: note: in expansion of macro ‘BOOST_concept’
206 | BOOST_concept(Convertible,(X)(Y))
| ^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::concepts::MultiPassInputIterator<boost::iterators::filter_iterator<boost::detail::out_edge_predicate<boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long unsigned int, long unsigned int&, long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::no_property, boost::listS>, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long unsigned int, long unsigned int&, long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int> > > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:52:50: required from ‘struct boost::concepts::MultiPassInputIterator<boost::iterators::filter_iterator<boost::detail::out_edge_predicate<boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long unsigned int, long unsigned int&, long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::no_property, boost::listS>, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long unsigned int, long unsigned int&, long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int> > >’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::concepts::MultiPassInputIterator<boost::iterators::filter_iterator<boost::detail::out_edge_predicate<boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long unsigned int, long unsigned int&, long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::no_property, boost::listS>, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long unsigned int, long unsigned int&, long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int> > >]’
32 | inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
| ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied<boost::concepts::MultiPassInputIterator<boost::iterators::filter_iterator<boost::detail::out_edge_predicate<boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long unsigned int, long unsigned int&, long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::no_property, boost::listS>, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long unsigned int, long unsigned int&, long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int> > > >::value’
44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied<boost::concepts::MultiPassInputIterator<boost::iterators::filter_iterator<boost::detail::out_edge_predicate<boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long unsigned int, long unsigned int&, long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::no_property, boost::listS>, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long unsigned int, long unsigned int&, long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int> > > >’
45 | typedef boost::integral_constant<bool, value> type;
| ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_<void (*)(boost::concepts::MultiPassInputIterator<boost::iterators::filter_iterator<boost::detail::out_edge_predicate<boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long unsigned int, long unsigned int&, long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::no_property, boost::listS>, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long unsigned int, long unsigned int&, long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int> > >)>’
72 | struct requirement_<void(*)(Model)>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:89:9: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:62:5: required from ‘void boost::breadth_first_visit(const IncidenceGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with IncidenceGraph = filtered_graph<adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, no_property, listS>, is_residual_edge<adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_residual_capacity_t> >, keep_all>; Buffer = queue<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > >; BFSVisitor = bfs_visitor<edge_predecessor_recorder<detail::edge_desc_impl<directed_tag, long unsigned int>*, on_tree_edge> >; ColorMap = default_color_type*; SourceIterator = long unsigned int*]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:136:24: required from ‘void boost::breadth_first_search(const VertexListGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph<adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, no_property, listS>, is_residual_edge<adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_residual_capacity_t> >, keep_all>; SourceIterator = long unsigned int*; Buffer = queue<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > >; BFSVisitor = bfs_visitor<edge_predecessor_recorder<detail::edge_desc_impl<directed_tag, long unsigned int>*, on_tree_edge> >; ColorMap = default_color_type*]’
136 | breadth_first_visit(g, sources_begin, sources_end, Q, vis, color);
| ~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:147:25: required from ‘void boost::breadth_first_search(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph<adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, no_property, listS>, is_residual_edge<adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_residual_capacity_t> >, keep_all>; Buffer = queue<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > >; BFSVisitor = bfs_visitor<edge_predecessor_recorder<detail::edge_desc_impl<directed_tag, long unsigned int>*, on_tree_edge> >; ColorMap = default_color_type*; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
147 | breadth_first_search(g, sources, sources + 1, Q, vis, color);
| ~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/edmonds_karp_max_flow.hpp:101:29: required from ‘typename boost::property_traits<IndexMap>::value_type boost::edmonds_karp_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, ColorMap, PredEdgeMap) [with Graph = adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, no_property, listS>; CapacityEdgeMap = adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map<directed_tag, detail::edge_desc_impl<directed_tag, long unsigned int>, detail::edge_desc_impl<directed_tag, long unsigned int>&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_reverse_t>; ColorMap = default_color_type*; PredEdgeMap = detail::edge_desc_impl<directed_tag, long unsigned int>*; typename property_traits<IndexMap>::value_type = long unsigned int; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
101 | breadth_first_search(detail::residual_graph(g, res), src, Q,
| ~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
102 | make_bfs_visitor(record_edge_predecessors(pred, on_tree_edge())),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
103 | color);
| ~~~~~~
mincut.hpp:78:21: required from ‘typename boost::graph_traits<G>::edges_size_type boost::min_cut(VertexListGraph&, OutputIterator, OutputIterator) [with VertexListGraph = const R_adjacency_list<undirectedS, double>; OutputIterator = std::back_insert_iterator<std::vector<long unsigned int> >; typename graph_traits<G>::edges_size_type = long unsigned int]’
77 | alpha_S_k = edmonds_karp_max_flow
| ~~~~~~~~~~~~~~~~~~~~~
78 | (flow_g, p, k, cap, res_cap, rev_edge, &color[0], &pred[0]);
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
hcs.cpp:299:31: required from here
299 | min_cut(g, std::back_inserter(s_vec),
| ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
300 | std::back_inserter(vs_vec) );
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::concepts::MultiPassInputIterator<boost::iterators::filter_iterator<boost::detail::out_edge_predicate<boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long unsigned int, long unsigned int&, long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::no_property, boost::listS>, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long unsigned int, long unsigned int&, long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int> > >]’
20 | ~usage_requirements() { ((Model*)0)->~Model(); }
| ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::MultiPassInputIterator<boost::iterators::filter_iterator<boost::detail::out_edge_predicate<boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long unsigned int, long unsigned int&, long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::no_property, boost::listS>, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long unsigned int, long unsigned int&, long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int> > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:89:9: required from ‘boost::concepts::IncidenceGraph<G>::~IncidenceGraph() [with G = boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::no_property, boost::listS>, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long unsigned int, long unsigned int&, long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all>]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:75:1: required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::IncidenceGraphConcept<boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::no_property, boost::listS>, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long unsigned int, long unsigned int&, long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >]’
75 | BOOST_concept(IncidenceGraph, (G)) : Graph< G >
| ^~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:62:5: required from ‘void boost::breadth_first_visit(const IncidenceGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with IncidenceGraph = filtered_graph<adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, no_property, listS>, is_residual_edge<adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_residual_capacity_t> >, keep_all>; Buffer = queue<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > >; BFSVisitor = bfs_visitor<edge_predecessor_recorder<detail::edge_desc_impl<directed_tag, long unsigned int>*, on_tree_edge> >; ColorMap = default_color_type*; SourceIterator = long unsigned int*]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:136:24: required from ‘void boost::breadth_first_search(const VertexListGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph<adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, no_property, listS>, is_residual_edge<adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_residual_capacity_t> >, keep_all>; SourceIterator = long unsigned int*; Buffer = queue<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > >; BFSVisitor = bfs_visitor<edge_predecessor_recorder<detail::edge_desc_impl<directed_tag, long unsigned int>*, on_tree_edge> >; ColorMap = default_color_type*]’
136 | breadth_first_visit(g, sources_begin, sources_end, Q, vis, color);
| ~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:147:25: required from ‘void boost::breadth_first_search(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph<adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, no_property, listS>, is_residual_edge<adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_residual_capacity_t> >, keep_all>; Buffer = queue<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > >; BFSVisitor = bfs_visitor<edge_predecessor_recorder<detail::edge_desc_impl<directed_tag, long unsigned int>*, on_tree_edge> >; ColorMap = default_color_type*; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
147 | breadth_first_search(g, sources, sources + 1, Q, vis, color);
| ~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/edmonds_karp_max_flow.hpp:101:29: required from ‘typename boost::property_traits<IndexMap>::value_type boost::edmonds_karp_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, ColorMap, PredEdgeMap) [with Graph = adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, no_property, listS>; CapacityEdgeMap = adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map<directed_tag, detail::edge_desc_impl<directed_tag, long unsigned int>, detail::edge_desc_impl<directed_tag, long unsigned int>&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_reverse_t>; ColorMap = default_color_type*; PredEdgeMap = detail::edge_desc_impl<directed_tag, long unsigned int>*; typename property_traits<IndexMap>::value_type = long unsigned int; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
101 | breadth_first_search(detail::residual_graph(g, res), src, Q,
| ~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
102 | make_bfs_visitor(record_edge_predecessors(pred, on_tree_edge())),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
103 | color);
| ~~~~~~
mincut.hpp:78:21: required from ‘typename boost::graph_traits<G>::edges_size_type boost::min_cut(VertexListGraph&, OutputIterator, OutputIterator) [with VertexListGraph = const R_adjacency_list<undirectedS, double>; OutputIterator = std::back_insert_iterator<std::vector<long unsigned int> >; typename graph_traits<G>::edges_size_type = long unsigned int]’
77 | alpha_S_k = edmonds_karp_max_flow
| ~~~~~~~~~~~~~~~~~~~~~
78 | (flow_g, p, k, cap, res_cap, rev_edge, &color[0], &pred[0]);
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
hcs.cpp:299:31: required from here
299 | min_cut(g, std::back_inserter(s_vec),
| ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
300 | std::back_inserter(vs_vec) );
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::concepts::MultiPassInputIterator<T>::~MultiPassInputIterator() [with T = boost::iterators::filter_iterator<boost::detail::out_edge_predicate<boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long unsigned int, long unsigned int&, long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::no_property, boost::listS>, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long unsigned int, long unsigned int&, long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int> >]’
37 | ~model()
| ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:52:50: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
52 | BOOST_concept(MultiPassInputIterator, (T)) { BOOST_CONCEPT_USAGE(
| ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::DefaultConstructible<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:137:5: required from ‘struct boost::DefaultConstructible<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> >’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::DefaultConstructible<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> >]’
32 | inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
| ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied<boost::DefaultConstructible<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > >::value’
44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied<boost::DefaultConstructible<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > >’
45 | typedef boost::integral_constant<bool, value> type;
| ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_<void (*)(boost::DefaultConstructible<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> >)>’
72 | struct requirement_<void(*)(Model)>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:90:9: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:62:5: required from ‘void boost::breadth_first_visit(const IncidenceGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with IncidenceGraph = filtered_graph<adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, no_property, listS>, is_residual_edge<adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_residual_capacity_t> >, keep_all>; Buffer = queue<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > >; BFSVisitor = bfs_visitor<edge_predecessor_recorder<detail::edge_desc_impl<directed_tag, long unsigned int>*, on_tree_edge> >; ColorMap = default_color_type*; SourceIterator = long unsigned int*]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:136:24: required from ‘void boost::breadth_first_search(const VertexListGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph<adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, no_property, listS>, is_residual_edge<adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_residual_capacity_t> >, keep_all>; SourceIterator = long unsigned int*; Buffer = queue<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > >; BFSVisitor = bfs_visitor<edge_predecessor_recorder<detail::edge_desc_impl<directed_tag, long unsigned int>*, on_tree_edge> >; ColorMap = default_color_type*]’
136 | breadth_first_visit(g, sources_begin, sources_end, Q, vis, color);
| ~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:147:25: required from ‘void boost::breadth_first_search(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph<adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, no_property, listS>, is_residual_edge<adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_residual_capacity_t> >, keep_all>; Buffer = queue<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > >; BFSVisitor = bfs_visitor<edge_predecessor_recorder<detail::edge_desc_impl<directed_tag, long unsigned int>*, on_tree_edge> >; ColorMap = default_color_type*; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
147 | breadth_first_search(g, sources, sources + 1, Q, vis, color);
| ~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/edmonds_karp_max_flow.hpp:101:29: required from ‘typename boost::property_traits<IndexMap>::value_type boost::edmonds_karp_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, ColorMap, PredEdgeMap) [with Graph = adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, no_property, listS>; CapacityEdgeMap = adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map<directed_tag, detail::edge_desc_impl<directed_tag, long unsigned int>, detail::edge_desc_impl<directed_tag, long unsigned int>&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_reverse_t>; ColorMap = default_color_type*; PredEdgeMap = detail::edge_desc_impl<directed_tag, long unsigned int>*; typename property_traits<IndexMap>::value_type = long unsigned int; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
101 | breadth_first_search(detail::residual_graph(g, res), src, Q,
| ~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
102 | make_bfs_visitor(record_edge_predecessors(pred, on_tree_edge())),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
103 | color);
| ~~~~~~
mincut.hpp:78:21: required from ‘typename boost::graph_traits<G>::edges_size_type boost::min_cut(VertexListGraph&, OutputIterator, OutputIterator) [with VertexListGraph = const R_adjacency_list<undirectedS, double>; OutputIterator = std::back_insert_iterator<std::vector<long unsigned int> >; typename graph_traits<G>::edges_size_type = long unsigned int]’
77 | alpha_S_k = edmonds_karp_max_flow
| ~~~~~~~~~~~~~~~~~~~~~
78 | (flow_g, p, k, cap, res_cap, rev_edge, &color[0], &pred[0]);
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
hcs.cpp:299:31: required from here
299 | min_cut(g, std::back_inserter(s_vec),
| ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
300 | std::back_inserter(vs_vec) );
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::DefaultConstructible<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> >]’
20 | ~usage_requirements() { ((Model*)0)->~Model(); }
| ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::DefaultConstructible<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:90:9: required from ‘boost::concepts::IncidenceGraph<G>::~IncidenceGraph() [with G = boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::no_property, boost::listS>, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long unsigned int, long unsigned int&, long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all>]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:75:1: required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::IncidenceGraphConcept<boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::no_property, boost::listS>, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long unsigned int, long unsigned int&, long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >]’
75 | BOOST_concept(IncidenceGraph, (G)) : Graph< G >
| ^~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:62:5: required from ‘void boost::breadth_first_visit(const IncidenceGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with IncidenceGraph = filtered_graph<adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, no_property, listS>, is_residual_edge<adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_residual_capacity_t> >, keep_all>; Buffer = queue<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > >; BFSVisitor = bfs_visitor<edge_predecessor_recorder<detail::edge_desc_impl<directed_tag, long unsigned int>*, on_tree_edge> >; ColorMap = default_color_type*; SourceIterator = long unsigned int*]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:136:24: required from ‘void boost::breadth_first_search(const VertexListGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph<adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, no_property, listS>, is_residual_edge<adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_residual_capacity_t> >, keep_all>; SourceIterator = long unsigned int*; Buffer = queue<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > >; BFSVisitor = bfs_visitor<edge_predecessor_recorder<detail::edge_desc_impl<directed_tag, long unsigned int>*, on_tree_edge> >; ColorMap = default_color_type*]’
136 | breadth_first_visit(g, sources_begin, sources_end, Q, vis, color);
| ~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:147:25: required from ‘void boost::breadth_first_search(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph<adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, no_property, listS>, is_residual_edge<adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_residual_capacity_t> >, keep_all>; Buffer = queue<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > >; BFSVisitor = bfs_visitor<edge_predecessor_recorder<detail::edge_desc_impl<directed_tag, long unsigned int>*, on_tree_edge> >; ColorMap = default_color_type*; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
147 | breadth_first_search(g, sources, sources + 1, Q, vis, color);
| ~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/edmonds_karp_max_flow.hpp:101:29: required from ‘typename boost::property_traits<IndexMap>::value_type boost::edmonds_karp_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, ColorMap, PredEdgeMap) [with Graph = adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, no_property, listS>; CapacityEdgeMap = adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map<directed_tag, detail::edge_desc_impl<directed_tag, long unsigned int>, detail::edge_desc_impl<directed_tag, long unsigned int>&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_reverse_t>; ColorMap = default_color_type*; PredEdgeMap = detail::edge_desc_impl<directed_tag, long unsigned int>*; typename property_traits<IndexMap>::value_type = long unsigned int; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
101 | breadth_first_search(detail::residual_graph(g, res), src, Q,
| ~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
102 | make_bfs_visitor(record_edge_predecessors(pred, on_tree_edge())),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
103 | color);
| ~~~~~~
mincut.hpp:78:21: required from ‘typename boost::graph_traits<G>::edges_size_type boost::min_cut(VertexListGraph&, OutputIterator, OutputIterator) [with VertexListGraph = const R_adjacency_list<undirectedS, double>; OutputIterator = std::back_insert_iterator<std::vector<long unsigned int> >; typename graph_traits<G>::edges_size_type = long unsigned int]’
77 | alpha_S_k = edmonds_karp_max_flow
| ~~~~~~~~~~~~~~~~~~~~~
78 | (flow_g, p, k, cap, res_cap, rev_edge, &color[0], &pred[0]);
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
hcs.cpp:299:31: required from here
299 | min_cut(g, std::back_inserter(s_vec),
| ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
300 | std::back_inserter(vs_vec) );
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::DefaultConstructible<TT>::~DefaultConstructible() [with TT = boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>]’
37 | ~model()
| ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:137:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
137 | BOOST_CONCEPT_USAGE(DefaultConstructible) {
| ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::EqualityComparable<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> >’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::EqualityComparable<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> >]’
32 | inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
| ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied<boost::EqualityComparable<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > >::value’
44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied<boost::EqualityComparable<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > >’
45 | typedef boost::integral_constant<bool, value> type;
| ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_<void (*)(boost::EqualityComparable<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> >)>’
72 | struct requirement_<void(*)(Model)>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:91:9: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:62:5: required from ‘void boost::breadth_first_visit(const IncidenceGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with IncidenceGraph = filtered_graph<adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, no_property, listS>, is_residual_edge<adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_residual_capacity_t> >, keep_all>; Buffer = queue<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > >; BFSVisitor = bfs_visitor<edge_predecessor_recorder<detail::edge_desc_impl<directed_tag, long unsigned int>*, on_tree_edge> >; ColorMap = default_color_type*; SourceIterator = long unsigned int*]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:136:24: required from ‘void boost::breadth_first_search(const VertexListGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph<adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, no_property, listS>, is_residual_edge<adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_residual_capacity_t> >, keep_all>; SourceIterator = long unsigned int*; Buffer = queue<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > >; BFSVisitor = bfs_visitor<edge_predecessor_recorder<detail::edge_desc_impl<directed_tag, long unsigned int>*, on_tree_edge> >; ColorMap = default_color_type*]’
136 | breadth_first_visit(g, sources_begin, sources_end, Q, vis, color);
| ~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:147:25: required from ‘void boost::breadth_first_search(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph<adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, no_property, listS>, is_residual_edge<adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_residual_capacity_t> >, keep_all>; Buffer = queue<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > >; BFSVisitor = bfs_visitor<edge_predecessor_recorder<detail::edge_desc_impl<directed_tag, long unsigned int>*, on_tree_edge> >; ColorMap = default_color_type*; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
147 | breadth_first_search(g, sources, sources + 1, Q, vis, color);
| ~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/edmonds_karp_max_flow.hpp:101:29: required from ‘typename boost::property_traits<IndexMap>::value_type boost::edmonds_karp_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, ColorMap, PredEdgeMap) [with Graph = adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, no_property, listS>; CapacityEdgeMap = adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map<directed_tag, detail::edge_desc_impl<directed_tag, long unsigned int>, detail::edge_desc_impl<directed_tag, long unsigned int>&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_reverse_t>; ColorMap = default_color_type*; PredEdgeMap = detail::edge_desc_impl<directed_tag, long unsigned int>*; typename property_traits<IndexMap>::value_type = long unsigned int; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
101 | breadth_first_search(detail::residual_graph(g, res), src, Q,
| ~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
102 | make_bfs_visitor(record_edge_predecessors(pred, on_tree_edge())),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
103 | color);
| ~~~~~~
mincut.hpp:78:21: required from ‘typename boost::graph_traits<G>::edges_size_type boost::min_cut(VertexListGraph&, OutputIterator, OutputIterator) [with VertexListGraph = const R_adjacency_list<undirectedS, double>; OutputIterator = std::back_insert_iterator<std::vector<long unsigned int> >; typename graph_traits<G>::edges_size_type = long unsigned int]’
77 | alpha_S_k = edmonds_karp_max_flow
| ~~~~~~~~~~~~~~~~~~~~~
78 | (flow_g, p, k, cap, res_cap, rev_edge, &color[0], &pred[0]);
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
hcs.cpp:299:31: required from here
299 | min_cut(g, std::back_inserter(s_vec),
| ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
300 | std::back_inserter(vs_vec) );
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::EqualityComparable<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> >]’
20 | ~usage_requirements() { ((Model*)0)->~Model(); }
| ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::EqualityComparable<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:91:9: required from ‘boost::concepts::IncidenceGraph<G>::~IncidenceGraph() [with G = boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::no_property, boost::listS>, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long unsigned int, long unsigned int&, long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all>]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:75:1: required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::IncidenceGraphConcept<boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::no_property, boost::listS>, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long unsigned int, long unsigned int&, long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >]’
75 | BOOST_concept(IncidenceGraph, (G)) : Graph< G >
| ^~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:62:5: required from ‘void boost::breadth_first_visit(const IncidenceGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with IncidenceGraph = filtered_graph<adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, no_property, listS>, is_residual_edge<adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_residual_capacity_t> >, keep_all>; Buffer = queue<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > >; BFSVisitor = bfs_visitor<edge_predecessor_recorder<detail::edge_desc_impl<directed_tag, long unsigned int>*, on_tree_edge> >; ColorMap = default_color_type*; SourceIterator = long unsigned int*]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:136:24: required from ‘void boost::breadth_first_search(const VertexListGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph<adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, no_property, listS>, is_residual_edge<adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_residual_capacity_t> >, keep_all>; SourceIterator = long unsigned int*; Buffer = queue<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > >; BFSVisitor = bfs_visitor<edge_predecessor_recorder<detail::edge_desc_impl<directed_tag, long unsigned int>*, on_tree_edge> >; ColorMap = default_color_type*]’
136 | breadth_first_visit(g, sources_begin, sources_end, Q, vis, color);
| ~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:147:25: required from ‘void boost::breadth_first_search(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph<adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, no_property, listS>, is_residual_edge<adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_residual_capacity_t> >, keep_all>; Buffer = queue<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > >; BFSVisitor = bfs_visitor<edge_predecessor_recorder<detail::edge_desc_impl<directed_tag, long unsigned int>*, on_tree_edge> >; ColorMap = default_color_type*; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
147 | breadth_first_search(g, sources, sources + 1, Q, vis, color);
| ~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/edmonds_karp_max_flow.hpp:101:29: required from ‘typename boost::property_traits<IndexMap>::value_type boost::edmonds_karp_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, ColorMap, PredEdgeMap) [with Graph = adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, no_property, listS>; CapacityEdgeMap = adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map<directed_tag, detail::edge_desc_impl<directed_tag, long unsigned int>, detail::edge_desc_impl<directed_tag, long unsigned int>&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_reverse_t>; ColorMap = default_color_type*; PredEdgeMap = detail::edge_desc_impl<directed_tag, long unsigned int>*; typename property_traits<IndexMap>::value_type = long unsigned int; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
101 | breadth_first_search(detail::residual_graph(g, res), src, Q,
| ~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
102 | make_bfs_visitor(record_edge_predecessors(pred, on_tree_edge())),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
103 | color);
| ~~~~~~
mincut.hpp:78:21: required from ‘typename boost::graph_traits<G>::edges_size_type boost::min_cut(VertexListGraph&, OutputIterator, OutputIterator) [with VertexListGraph = const R_adjacency_list<undirectedS, double>; OutputIterator = std::back_insert_iterator<std::vector<long unsigned int> >; typename graph_traits<G>::edges_size_type = long unsigned int]’
77 | alpha_S_k = edmonds_karp_max_flow
| ~~~~~~~~~~~~~~~~~~~~~
78 | (flow_g, p, k, cap, res_cap, rev_edge, &color[0], &pred[0]);
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
hcs.cpp:299:31: required from here
299 | min_cut(g, std::back_inserter(s_vec),
| ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
300 | std::back_inserter(vs_vec) );
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::EqualityComparable<TT>::~EqualityComparable() [with TT = boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>]’
37 | ~model()
| ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:233:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
233 | BOOST_CONCEPT_USAGE(EqualityComparable) {
| ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Assignable<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:145:5: required from ‘struct boost::Assignable<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> >’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::Assignable<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> >]’
32 | inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
| ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied<boost::Assignable<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > >::value’
44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied<boost::Assignable<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > >’
45 | typedef boost::integral_constant<bool, value> type;
| ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_<void (*)(boost::Assignable<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> >)>’
72 | struct requirement_<void(*)(Model)>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:92:9: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:62:5: required from ‘void boost::breadth_first_visit(const IncidenceGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with IncidenceGraph = filtered_graph<adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, no_property, listS>, is_residual_edge<adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_residual_capacity_t> >, keep_all>; Buffer = queue<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > >; BFSVisitor = bfs_visitor<edge_predecessor_recorder<detail::edge_desc_impl<directed_tag, long unsigned int>*, on_tree_edge> >; ColorMap = default_color_type*; SourceIterator = long unsigned int*]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:136:24: required from ‘void boost::breadth_first_search(const VertexListGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph<adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, no_property, listS>, is_residual_edge<adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_residual_capacity_t> >, keep_all>; SourceIterator = long unsigned int*; Buffer = queue<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > >; BFSVisitor = bfs_visitor<edge_predecessor_recorder<detail::edge_desc_impl<directed_tag, long unsigned int>*, on_tree_edge> >; ColorMap = default_color_type*]’
136 | breadth_first_visit(g, sources_begin, sources_end, Q, vis, color);
| ~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:147:25: required from ‘void boost::breadth_first_search(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph<adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, no_property, listS>, is_residual_edge<adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_residual_capacity_t> >, keep_all>; Buffer = queue<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > >; BFSVisitor = bfs_visitor<edge_predecessor_recorder<detail::edge_desc_impl<directed_tag, long unsigned int>*, on_tree_edge> >; ColorMap = default_color_type*; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
147 | breadth_first_search(g, sources, sources + 1, Q, vis, color);
| ~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/edmonds_karp_max_flow.hpp:101:29: required from ‘typename boost::property_traits<IndexMap>::value_type boost::edmonds_karp_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, ColorMap, PredEdgeMap) [with Graph = adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, no_property, listS>; CapacityEdgeMap = adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map<directed_tag, detail::edge_desc_impl<directed_tag, long unsigned int>, detail::edge_desc_impl<directed_tag, long unsigned int>&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_reverse_t>; ColorMap = default_color_type*; PredEdgeMap = detail::edge_desc_impl<directed_tag, long unsigned int>*; typename property_traits<IndexMap>::value_type = long unsigned int; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
101 | breadth_first_search(detail::residual_graph(g, res), src, Q,
| ~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
102 | make_bfs_visitor(record_edge_predecessors(pred, on_tree_edge())),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
103 | color);
| ~~~~~~
mincut.hpp:78:21: required from ‘typename boost::graph_traits<G>::edges_size_type boost::min_cut(VertexListGraph&, OutputIterator, OutputIterator) [with VertexListGraph = const R_adjacency_list<undirectedS, double>; OutputIterator = std::back_insert_iterator<std::vector<long unsigned int> >; typename graph_traits<G>::edges_size_type = long unsigned int]’
77 | alpha_S_k = edmonds_karp_max_flow
| ~~~~~~~~~~~~~~~~~~~~~
78 | (flow_g, p, k, cap, res_cap, rev_edge, &color[0], &pred[0]);
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
hcs.cpp:299:31: required from here
299 | min_cut(g, std::back_inserter(s_vec),
| ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
300 | std::back_inserter(vs_vec) );
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Assignable<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> >]’
20 | ~usage_requirements() { ((Model*)0)->~Model(); }
| ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::Assignable<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:92:9: required from ‘boost::concepts::IncidenceGraph<G>::~IncidenceGraph() [with G = boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::no_property, boost::listS>, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long unsigned int, long unsigned int&, long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all>]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:75:1: required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::IncidenceGraphConcept<boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::no_property, boost::listS>, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long unsigned int, long unsigned int&, long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >]’
75 | BOOST_concept(IncidenceGraph, (G)) : Graph< G >
| ^~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:62:5: required from ‘void boost::breadth_first_visit(const IncidenceGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with IncidenceGraph = filtered_graph<adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, no_property, listS>, is_residual_edge<adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_residual_capacity_t> >, keep_all>; Buffer = queue<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > >; BFSVisitor = bfs_visitor<edge_predecessor_recorder<detail::edge_desc_impl<directed_tag, long unsigned int>*, on_tree_edge> >; ColorMap = default_color_type*; SourceIterator = long unsigned int*]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:136:24: required from ‘void boost::breadth_first_search(const VertexListGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph<adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, no_property, listS>, is_residual_edge<adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_residual_capacity_t> >, keep_all>; SourceIterator = long unsigned int*; Buffer = queue<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > >; BFSVisitor = bfs_visitor<edge_predecessor_recorder<detail::edge_desc_impl<directed_tag, long unsigned int>*, on_tree_edge> >; ColorMap = default_color_type*]’
136 | breadth_first_visit(g, sources_begin, sources_end, Q, vis, color);
| ~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:147:25: required from ‘void boost::breadth_first_search(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph<adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, no_property, listS>, is_residual_edge<adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_residual_capacity_t> >, keep_all>; Buffer = queue<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > >; BFSVisitor = bfs_visitor<edge_predecessor_recorder<detail::edge_desc_impl<directed_tag, long unsigned int>*, on_tree_edge> >; ColorMap = default_color_type*; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
147 | breadth_first_search(g, sources, sources + 1, Q, vis, color);
| ~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/edmonds_karp_max_flow.hpp:101:29: required from ‘typename boost::property_traits<IndexMap>::value_type boost::edmonds_karp_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, ColorMap, PredEdgeMap) [with Graph = adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, no_property, listS>; CapacityEdgeMap = adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map<directed_tag, detail::edge_desc_impl<directed_tag, long unsigned int>, detail::edge_desc_impl<directed_tag, long unsigned int>&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_reverse_t>; ColorMap = default_color_type*; PredEdgeMap = detail::edge_desc_impl<directed_tag, long unsigned int>*; typename property_traits<IndexMap>::value_type = long unsigned int; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
101 | breadth_first_search(detail::residual_graph(g, res), src, Q,
| ~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
102 | make_bfs_visitor(record_edge_predecessors(pred, on_tree_edge())),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
103 | color);
| ~~~~~~
mincut.hpp:78:21: required from ‘typename boost::graph_traits<G>::edges_size_type boost::min_cut(VertexListGraph&, OutputIterator, OutputIterator) [with VertexListGraph = const R_adjacency_list<undirectedS, double>; OutputIterator = std::back_insert_iterator<std::vector<long unsigned int> >; typename graph_traits<G>::edges_size_type = long unsigned int]’
77 | alpha_S_k = edmonds_karp_max_flow
| ~~~~~~~~~~~~~~~~~~~~~
78 | (flow_g, p, k, cap, res_cap, rev_edge, &color[0], &pred[0]);
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
hcs.cpp:299:31: required from here
299 | min_cut(g, std::back_inserter(s_vec),
| ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
300 | std::back_inserter(vs_vec) );
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Assignable<TT>::~Assignable() [with TT = boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>]’
37 | ~model()
| ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:145:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
145 | BOOST_CONCEPT_USAGE(Assignable) {
| ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Convertible<boost::adj_list_dir_traversal_tag, boost::incidence_graph_tag> >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/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> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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);
| ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/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) );
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/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;
| ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/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)>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:93:9: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:62:5: required from ‘void boost::breadth_first_visit(const IncidenceGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with IncidenceGraph = filtered_graph<adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, no_property, listS>, is_residual_edge<adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_residual_capacity_t> >, keep_all>; Buffer = queue<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > >; BFSVisitor = bfs_visitor<edge_predecessor_recorder<detail::edge_desc_impl<directed_tag, long unsigned int>*, on_tree_edge> >; ColorMap = default_color_type*; SourceIterator = long unsigned int*]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:136:24: required from ‘void boost::breadth_first_search(const VertexListGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph<adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, no_property, listS>, is_residual_edge<adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_residual_capacity_t> >, keep_all>; SourceIterator = long unsigned int*; Buffer = queue<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > >; BFSVisitor = bfs_visitor<edge_predecessor_recorder<detail::edge_desc_impl<directed_tag, long unsigned int>*, on_tree_edge> >; ColorMap = default_color_type*]’
136 | breadth_first_visit(g, sources_begin, sources_end, Q, vis, color);
| ~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:147:25: required from ‘void boost::breadth_first_search(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph<adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, no_property, listS>, is_residual_edge<adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_residual_capacity_t> >, keep_all>; Buffer = queue<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > >; BFSVisitor = bfs_visitor<edge_predecessor_recorder<detail::edge_desc_impl<directed_tag, long unsigned int>*, on_tree_edge> >; ColorMap = default_color_type*; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
147 | breadth_first_search(g, sources, sources + 1, Q, vis, color);
| ~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/edmonds_karp_max_flow.hpp:101:29: required from ‘typename boost::property_traits<IndexMap>::value_type boost::edmonds_karp_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, ColorMap, PredEdgeMap) [with Graph = adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, no_property, listS>; CapacityEdgeMap = adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map<directed_tag, detail::edge_desc_impl<directed_tag, long unsigned int>, detail::edge_desc_impl<directed_tag, long unsigned int>&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_reverse_t>; ColorMap = default_color_type*; PredEdgeMap = detail::edge_desc_impl<directed_tag, long unsigned int>*; typename property_traits<IndexMap>::value_type = long unsigned int; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
101 | breadth_first_search(detail::residual_graph(g, res), src, Q,
| ~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
102 | make_bfs_visitor(record_edge_predecessors(pred, on_tree_edge())),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
103 | color);
| ~~~~~~
mincut.hpp:78:21: required from ‘typename boost::graph_traits<G>::edges_size_type boost::min_cut(VertexListGraph&, OutputIterator, OutputIterator) [with VertexListGraph = const R_adjacency_list<undirectedS, double>; OutputIterator = std::back_insert_iterator<std::vector<long unsigned int> >; typename graph_traits<G>::edges_size_type = long unsigned int]’
77 | alpha_S_k = edmonds_karp_max_flow
| ~~~~~~~~~~~~~~~~~~~~~
78 | (flow_g, p, k, cap, res_cap, rev_edge, &color[0], &pred[0]);
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
hcs.cpp:299:31: required from here
299 | min_cut(g, std::back_inserter(s_vec),
| ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
300 | std::back_inserter(vs_vec) );
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Convertible<boost::adj_list_dir_traversal_tag, boost::incidence_graph_tag>]’
20 | ~usage_requirements() { ((Model*)0)->~Model(); }
| ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::Convertible<boost::adj_list_dir_traversal_tag, boost::incidence_graph_tag>]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:93:9: required from ‘boost::concepts::IncidenceGraph<G>::~IncidenceGraph() [with G = boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::no_property, boost::listS>, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long unsigned int, long unsigned int&, long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all>]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:75:1: required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::IncidenceGraphConcept<boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::no_property, boost::listS>, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long unsigned int, long unsigned int&, long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >]’
75 | BOOST_concept(IncidenceGraph, (G)) : Graph< G >
| ^~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:62:5: required from ‘void boost::breadth_first_visit(const IncidenceGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with IncidenceGraph = filtered_graph<adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, no_property, listS>, is_residual_edge<adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_residual_capacity_t> >, keep_all>; Buffer = queue<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > >; BFSVisitor = bfs_visitor<edge_predecessor_recorder<detail::edge_desc_impl<directed_tag, long unsigned int>*, on_tree_edge> >; ColorMap = default_color_type*; SourceIterator = long unsigned int*]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:136:24: required from ‘void boost::breadth_first_search(const VertexListGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph<adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, no_property, listS>, is_residual_edge<adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_residual_capacity_t> >, keep_all>; SourceIterator = long unsigned int*; Buffer = queue<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > >; BFSVisitor = bfs_visitor<edge_predecessor_recorder<detail::edge_desc_impl<directed_tag, long unsigned int>*, on_tree_edge> >; ColorMap = default_color_type*]’
136 | breadth_first_visit(g, sources_begin, sources_end, Q, vis, color);
| ~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:147:25: required from ‘void boost::breadth_first_search(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph<adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, no_property, listS>, is_residual_edge<adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_residual_capacity_t> >, keep_all>; Buffer = queue<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > >; BFSVisitor = bfs_visitor<edge_predecessor_recorder<detail::edge_desc_impl<directed_tag, long unsigned int>*, on_tree_edge> >; ColorMap = default_color_type*; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
147 | breadth_first_search(g, sources, sources + 1, Q, vis, color);
| ~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/edmonds_karp_max_flow.hpp:101:29: required from ‘typename boost::property_traits<IndexMap>::value_type boost::edmonds_karp_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, ColorMap, PredEdgeMap) [with Graph = adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, no_property, listS>; CapacityEdgeMap = adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map<directed_tag, detail::edge_desc_impl<directed_tag, long unsigned int>, detail::edge_desc_impl<directed_tag, long unsigned int>&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_reverse_t>; ColorMap = default_color_type*; PredEdgeMap = detail::edge_desc_impl<directed_tag, long unsigned int>*; typename property_traits<IndexMap>::value_type = long unsigned int; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
101 | breadth_first_search(detail::residual_graph(g, res), src, Q,
| ~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
102 | make_bfs_visitor(record_edge_predecessors(pred, on_tree_edge())),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
103 | color);
| ~~~~~~
mincut.hpp:78:21: required from ‘typename boost::graph_traits<G>::edges_size_type boost::min_cut(VertexListGraph&, OutputIterator, OutputIterator) [with VertexListGraph = const R_adjacency_list<undirectedS, double>; OutputIterator = std::back_insert_iterator<std::vector<long unsigned int> >; typename graph_traits<G>::edges_size_type = long unsigned int]’
77 | alpha_S_k = edmonds_karp_max_flow
| ~~~~~~~~~~~~~~~~~~~~~
78 | (flow_g, p, k, cap, res_cap, rev_edge, &color[0], &pred[0]);
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
hcs.cpp:299:31: required from here
299 | min_cut(g, std::back_inserter(s_vec),
| ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
300 | std::back_inserter(vs_vec) );
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible<X, Y>::~Convertible() [with X = boost::adj_list_dir_traversal_tag; Y = boost::incidence_graph_tag]’
37 | ~model()
| ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
208 | BOOST_CONCEPT_USAGE(Convertible) {
| ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::CopyConstructible<boost::bfs_visitor<boost::edge_predecessor_recorder<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>*, boost::on_tree_edge> > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/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::bfs_visitor<boost::edge_predecessor_recorder<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>*, boost::on_tree_edge> > > >]’
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:167:5: required from ‘struct boost::CopyConstructible<boost::bfs_visitor<boost::edge_predecessor_recorder<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>*, boost::on_tree_edge> > >’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:165:3: required from ‘struct boost::CopyConstructibleConcept<boost::bfs_visitor<boost::edge_predecessor_recorder<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>*, boost::on_tree_edge> > >’
165 | BOOST_concept(CopyConstructible,(TT))
| ^~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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::bfs_visitor<boost::edge_predecessor_recorder<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>*, boost::on_tree_edge> > >]’
32 | inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
| ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied<boost::CopyConstructibleConcept<boost::bfs_visitor<boost::edge_predecessor_recorder<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>*, boost::on_tree_edge> > > >::value’
44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 7 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:65:5: required from ‘void boost::breadth_first_visit(const IncidenceGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with IncidenceGraph = filtered_graph<adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, no_property, listS>, is_residual_edge<adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_residual_capacity_t> >, keep_all>; Buffer = queue<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > >; BFSVisitor = bfs_visitor<edge_predecessor_recorder<detail::edge_desc_impl<directed_tag, long unsigned int>*, on_tree_edge> >; ColorMap = default_color_type*; SourceIterator = long unsigned int*]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:136:24: required from ‘void boost::breadth_first_search(const VertexListGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph<adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, no_property, listS>, is_residual_edge<adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_residual_capacity_t> >, keep_all>; SourceIterator = long unsigned int*; Buffer = queue<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > >; BFSVisitor = bfs_visitor<edge_predecessor_recorder<detail::edge_desc_impl<directed_tag, long unsigned int>*, on_tree_edge> >; ColorMap = default_color_type*]’
136 | breadth_first_visit(g, sources_begin, sources_end, Q, vis, color);
| ~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:147:25: required from ‘void boost::breadth_first_search(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph<adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, no_property, listS>, is_residual_edge<adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_residual_capacity_t> >, keep_all>; Buffer = queue<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > >; BFSVisitor = bfs_visitor<edge_predecessor_recorder<detail::edge_desc_impl<directed_tag, long unsigned int>*, on_tree_edge> >; ColorMap = default_color_type*; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
147 | breadth_first_search(g, sources, sources + 1, Q, vis, color);
| ~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/edmonds_karp_max_flow.hpp:101:29: required from ‘typename boost::property_traits<IndexMap>::value_type boost::edmonds_karp_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, ColorMap, PredEdgeMap) [with Graph = adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, no_property, listS>; CapacityEdgeMap = adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map<directed_tag, detail::edge_desc_impl<directed_tag, long unsigned int>, detail::edge_desc_impl<directed_tag, long unsigned int>&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_reverse_t>; ColorMap = default_color_type*; PredEdgeMap = detail::edge_desc_impl<directed_tag, long unsigned int>*; typename property_traits<IndexMap>::value_type = long unsigned int; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
101 | breadth_first_search(detail::residual_graph(g, res), src, Q,
| ~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
102 | make_bfs_visitor(record_edge_predecessors(pred, on_tree_edge())),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
103 | color);
| ~~~~~~
mincut.hpp:78:21: required from ‘typename boost::graph_traits<G>::edges_size_type boost::min_cut(VertexListGraph&, OutputIterator, OutputIterator) [with VertexListGraph = const R_adjacency_list<undirectedS, double>; OutputIterator = std::back_insert_iterator<std::vector<long unsigned int> >; typename graph_traits<G>::edges_size_type = long unsigned int]’
77 | alpha_S_k = edmonds_karp_max_flow
| ~~~~~~~~~~~~~~~~~~~~~
78 | (flow_g, p, k, cap, res_cap, rev_edge, &color[0], &pred[0]);
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
hcs.cpp:299:31: required from here
299 | min_cut(g, std::back_inserter(s_vec),
| ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
300 | std::back_inserter(vs_vec) );
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
20 | ~usage_requirements() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::CopyConstructible<TT>::~CopyConstructible() [with TT = boost::bfs_visitor<boost::edge_predecessor_recorder<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>*, boost::on_tree_edge> >]’
37 | ~model()
| ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:167:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
167 | BOOST_CONCEPT_USAGE(CopyConstructible) {
| ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Convertible<boost::lvalue_property_map_tag, boost::readable_property_map_tag> >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/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> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/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))
| ^~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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);
| ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/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) );
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/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;
| ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 11 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:66:5: required from ‘void boost::breadth_first_visit(const IncidenceGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with IncidenceGraph = filtered_graph<adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, no_property, listS>, is_residual_edge<adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_residual_capacity_t> >, keep_all>; Buffer = queue<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > >; BFSVisitor = bfs_visitor<edge_predecessor_recorder<detail::edge_desc_impl<directed_tag, long unsigned int>*, on_tree_edge> >; ColorMap = default_color_type*; SourceIterator = long unsigned int*]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:136:24: required from ‘void boost::breadth_first_search(const VertexListGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph<adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, no_property, listS>, is_residual_edge<adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_residual_capacity_t> >, keep_all>; SourceIterator = long unsigned int*; Buffer = queue<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > >; BFSVisitor = bfs_visitor<edge_predecessor_recorder<detail::edge_desc_impl<directed_tag, long unsigned int>*, on_tree_edge> >; ColorMap = default_color_type*]’
136 | breadth_first_visit(g, sources_begin, sources_end, Q, vis, color);
| ~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:147:25: required from ‘void boost::breadth_first_search(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph<adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, no_property, listS>, is_residual_edge<adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_residual_capacity_t> >, keep_all>; Buffer = queue<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > >; BFSVisitor = bfs_visitor<edge_predecessor_recorder<detail::edge_desc_impl<directed_tag, long unsigned int>*, on_tree_edge> >; ColorMap = default_color_type*; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
147 | breadth_first_search(g, sources, sources + 1, Q, vis, color);
| ~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/edmonds_karp_max_flow.hpp:101:29: required from ‘typename boost::property_traits<IndexMap>::value_type boost::edmonds_karp_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, ColorMap, PredEdgeMap) [with Graph = adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, no_property, listS>; CapacityEdgeMap = adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map<directed_tag, detail::edge_desc_impl<directed_tag, long unsigned int>, detail::edge_desc_impl<directed_tag, long unsigned int>&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_reverse_t>; ColorMap = default_color_type*; PredEdgeMap = detail::edge_desc_impl<directed_tag, long unsigned int>*; typename property_traits<IndexMap>::value_type = long unsigned int; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
101 | breadth_first_search(detail::residual_graph(g, res), src, Q,
| ~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
102 | make_bfs_visitor(record_edge_predecessors(pred, on_tree_edge())),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
103 | color);
| ~~~~~~
mincut.hpp:78:21: required from ‘typename boost::graph_traits<G>::edges_size_type boost::min_cut(VertexListGraph&, OutputIterator, OutputIterator) [with VertexListGraph = const R_adjacency_list<undirectedS, double>; OutputIterator = std::back_insert_iterator<std::vector<long unsigned int> >; typename graph_traits<G>::edges_size_type = long unsigned int]’
77 | alpha_S_k = edmonds_karp_max_flow
| ~~~~~~~~~~~~~~~~~~~~~
78 | (flow_g, p, k, cap, res_cap, rev_edge, &color[0], &pred[0]);
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
hcs.cpp:299:31: required from here
299 | min_cut(g, std::back_inserter(s_vec),
| ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
300 | std::back_inserter(vs_vec) );
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Convertible<boost::lvalue_property_map_tag, boost::readable_property_map_tag>]’
20 | ~usage_requirements() { ((Model*)0)->~Model(); }
| ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::ConvertibleConcept<boost::lvalue_property_map_tag, boost::readable_property_map_tag>]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:148:7: required from ‘void boost::ReadablePropertyMapConcept<PMap, Key>::constraints() [with PMap = boost::default_color_type*; Key = long unsigned int]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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::default_color_type*, long unsigned int>]’
32 | inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
| ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied<boost::ReadablePropertyMapConcept<boost::default_color_type*, long unsigned int> >::value’
44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied<boost::ReadablePropertyMapConcept<boost::default_color_type*, long unsigned int> >’
45 | typedef boost::integral_constant<bool, value> type;
| ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_<void (*)(boost::ReadablePropertyMapConcept<boost::default_color_type*, long unsigned int>)>’
72 | struct requirement_<void(*)(Model)>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:206:7: [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:66:5: required from ‘void boost::breadth_first_visit(const IncidenceGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with IncidenceGraph = filtered_graph<adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, no_property, listS>, is_residual_edge<adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_residual_capacity_t> >, keep_all>; Buffer = queue<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > >; BFSVisitor = bfs_visitor<edge_predecessor_recorder<detail::edge_desc_impl<directed_tag, long unsigned int>*, on_tree_edge> >; ColorMap = default_color_type*; SourceIterator = long unsigned int*]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:136:24: required from ‘void boost::breadth_first_search(const VertexListGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph<adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, no_property, listS>, is_residual_edge<adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_residual_capacity_t> >, keep_all>; SourceIterator = long unsigned int*; Buffer = queue<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > >; BFSVisitor = bfs_visitor<edge_predecessor_recorder<detail::edge_desc_impl<directed_tag, long unsigned int>*, on_tree_edge> >; ColorMap = default_color_type*]’
136 | breadth_first_visit(g, sources_begin, sources_end, Q, vis, color);
| ~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:147:25: required from ‘void boost::breadth_first_search(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph<adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, no_property, listS>, is_residual_edge<adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_residual_capacity_t> >, keep_all>; Buffer = queue<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > >; BFSVisitor = bfs_visitor<edge_predecessor_recorder<detail::edge_desc_impl<directed_tag, long unsigned int>*, on_tree_edge> >; ColorMap = default_color_type*; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
147 | breadth_first_search(g, sources, sources + 1, Q, vis, color);
| ~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/edmonds_karp_max_flow.hpp:101:29: required from ‘typename boost::property_traits<IndexMap>::value_type boost::edmonds_karp_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, ColorMap, PredEdgeMap) [with Graph = adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, no_property, listS>; CapacityEdgeMap = adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map<directed_tag, detail::edge_desc_impl<directed_tag, long unsigned int>, detail::edge_desc_impl<directed_tag, long unsigned int>&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_reverse_t>; ColorMap = default_color_type*; PredEdgeMap = detail::edge_desc_impl<directed_tag, long unsigned int>*; typename property_traits<IndexMap>::value_type = long unsigned int; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
101 | breadth_first_search(detail::residual_graph(g, res), src, Q,
| ~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
102 | make_bfs_visitor(record_edge_predecessors(pred, on_tree_edge())),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
103 | color);
| ~~~~~~
mincut.hpp:78:21: required from ‘typename boost::graph_traits<G>::edges_size_type boost::min_cut(VertexListGraph&, OutputIterator, OutputIterator) [with VertexListGraph = const R_adjacency_list<undirectedS, double>; OutputIterator = std::back_insert_iterator<std::vector<long unsigned int> >; typename graph_traits<G>::edges_size_type = long unsigned int]’
77 | alpha_S_k = edmonds_karp_max_flow
| ~~~~~~~~~~~~~~~~~~~~~
78 | (flow_g, p, k, cap, res_cap, rev_edge, &color[0], &pred[0]);
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
hcs.cpp:299:31: required from here
299 | min_cut(g, std::back_inserter(s_vec),
| ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
300 | std::back_inserter(vs_vec) );
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:206:17: note: in a call to non-static member function ‘boost::ConvertibleConcept<boost::lvalue_property_map_tag, boost::readable_property_map_tag>::~ConvertibleConcept()’
206 | BOOST_concept(Convertible,(X)(Y))
| ^~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/preprocessor/cat.hpp:29:34: note: in definition of macro ‘BOOST_PP_CAT_I’
29 | # define BOOST_PP_CAT_I(a, b) a ## b
| ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/concept_def.hpp:23:12: note: in expansion of macro ‘BOOST_PP_CAT’
23 | struct BOOST_PP_CAT(name,Concept) \
| ^~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:206:3: note: in expansion of macro ‘BOOST_concept’
206 | BOOST_concept(Convertible,(X)(Y))
| ^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Convertible<boost::lvalue_property_map_tag, boost::writable_property_map_tag> >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/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> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/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))
| ^~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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);
| ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/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) );
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/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;
| ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 11 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:66:5: required from ‘void boost::breadth_first_visit(const IncidenceGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with IncidenceGraph = filtered_graph<adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, no_property, listS>, is_residual_edge<adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_residual_capacity_t> >, keep_all>; Buffer = queue<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > >; BFSVisitor = bfs_visitor<edge_predecessor_recorder<detail::edge_desc_impl<directed_tag, long unsigned int>*, on_tree_edge> >; ColorMap = default_color_type*; SourceIterator = long unsigned int*]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:136:24: required from ‘void boost::breadth_first_search(const VertexListGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph<adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, no_property, listS>, is_residual_edge<adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_residual_capacity_t> >, keep_all>; SourceIterator = long unsigned int*; Buffer = queue<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > >; BFSVisitor = bfs_visitor<edge_predecessor_recorder<detail::edge_desc_impl<directed_tag, long unsigned int>*, on_tree_edge> >; ColorMap = default_color_type*]’
136 | breadth_first_visit(g, sources_begin, sources_end, Q, vis, color);
| ~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:147:25: required from ‘void boost::breadth_first_search(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph<adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, no_property, listS>, is_residual_edge<adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_residual_capacity_t> >, keep_all>; Buffer = queue<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > >; BFSVisitor = bfs_visitor<edge_predecessor_recorder<detail::edge_desc_impl<directed_tag, long unsigned int>*, on_tree_edge> >; ColorMap = default_color_type*; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
147 | breadth_first_search(g, sources, sources + 1, Q, vis, color);
| ~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/edmonds_karp_max_flow.hpp:101:29: required from ‘typename boost::property_traits<IndexMap>::value_type boost::edmonds_karp_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, ColorMap, PredEdgeMap) [with Graph = adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, no_property, listS>; CapacityEdgeMap = adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map<directed_tag, detail::edge_desc_impl<directed_tag, long unsigned int>, detail::edge_desc_impl<directed_tag, long unsigned int>&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_reverse_t>; ColorMap = default_color_type*; PredEdgeMap = detail::edge_desc_impl<directed_tag, long unsigned int>*; typename property_traits<IndexMap>::value_type = long unsigned int; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
101 | breadth_first_search(detail::residual_graph(g, res), src, Q,
| ~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
102 | make_bfs_visitor(record_edge_predecessors(pred, on_tree_edge())),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
103 | color);
| ~~~~~~
mincut.hpp:78:21: required from ‘typename boost::graph_traits<G>::edges_size_type boost::min_cut(VertexListGraph&, OutputIterator, OutputIterator) [with VertexListGraph = const R_adjacency_list<undirectedS, double>; OutputIterator = std::back_insert_iterator<std::vector<long unsigned int> >; typename graph_traits<G>::edges_size_type = long unsigned int]’
77 | alpha_S_k = edmonds_karp_max_flow
| ~~~~~~~~~~~~~~~~~~~~~
78 | (flow_g, p, k, cap, res_cap, rev_edge, &color[0], &pred[0]);
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
hcs.cpp:299:31: required from here
299 | min_cut(g, std::back_inserter(s_vec),
| ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
300 | std::back_inserter(vs_vec) );
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Convertible<boost::lvalue_property_map_tag, boost::writable_property_map_tag>]’
20 | ~usage_requirements() { ((Model*)0)->~Model(); }
| ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::ConvertibleConcept<boost::lvalue_property_map_tag, boost::writable_property_map_tag>]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:180:7: required from ‘void boost::WritablePropertyMapConcept<PMap, Key>::constraints() [with PMap = boost::default_color_type*; Key = long unsigned int]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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::default_color_type*, long unsigned int>]’
32 | inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
| ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied<boost::WritablePropertyMapConcept<boost::default_color_type*, long unsigned int> >::value’
44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied<boost::WritablePropertyMapConcept<boost::default_color_type*, long unsigned int> >’
45 | typedef boost::integral_constant<bool, value> type;
| ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_<void (*)(boost::WritablePropertyMapConcept<boost::default_color_type*, long unsigned int>)>’
72 | struct requirement_<void(*)(Model)>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:207:7: [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:66:5: required from ‘void boost::breadth_first_visit(const IncidenceGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with IncidenceGraph = filtered_graph<adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, no_property, listS>, is_residual_edge<adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_residual_capacity_t> >, keep_all>; Buffer = queue<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > >; BFSVisitor = bfs_visitor<edge_predecessor_recorder<detail::edge_desc_impl<directed_tag, long unsigned int>*, on_tree_edge> >; ColorMap = default_color_type*; SourceIterator = long unsigned int*]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:136:24: required from ‘void boost::breadth_first_search(const VertexListGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph<adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, no_property, listS>, is_residual_edge<adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_residual_capacity_t> >, keep_all>; SourceIterator = long unsigned int*; Buffer = queue<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > >; BFSVisitor = bfs_visitor<edge_predecessor_recorder<detail::edge_desc_impl<directed_tag, long unsigned int>*, on_tree_edge> >; ColorMap = default_color_type*]’
136 | breadth_first_visit(g, sources_begin, sources_end, Q, vis, color);
| ~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:147:25: required from ‘void boost::breadth_first_search(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph<adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, no_property, listS>, is_residual_edge<adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_residual_capacity_t> >, keep_all>; Buffer = queue<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > >; BFSVisitor = bfs_visitor<edge_predecessor_recorder<detail::edge_desc_impl<directed_tag, long unsigned int>*, on_tree_edge> >; ColorMap = default_color_type*; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
147 | breadth_first_search(g, sources, sources + 1, Q, vis, color);
| ~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/edmonds_karp_max_flow.hpp:101:29: required from ‘typename boost::property_traits<IndexMap>::value_type boost::edmonds_karp_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, ColorMap, PredEdgeMap) [with Graph = adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, no_property, listS>; CapacityEdgeMap = adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map<directed_tag, detail::edge_desc_impl<directed_tag, long unsigned int>, detail::edge_desc_impl<directed_tag, long unsigned int>&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_reverse_t>; ColorMap = default_color_type*; PredEdgeMap = detail::edge_desc_impl<directed_tag, long unsigned int>*; typename property_traits<IndexMap>::value_type = long unsigned int; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
101 | breadth_first_search(detail::residual_graph(g, res), src, Q,
| ~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
102 | make_bfs_visitor(record_edge_predecessors(pred, on_tree_edge())),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
103 | color);
| ~~~~~~
mincut.hpp:78:21: required from ‘typename boost::graph_traits<G>::edges_size_type boost::min_cut(VertexListGraph&, OutputIterator, OutputIterator) [with VertexListGraph = const R_adjacency_list<undirectedS, double>; OutputIterator = std::back_insert_iterator<std::vector<long unsigned int> >; typename graph_traits<G>::edges_size_type = long unsigned int]’
77 | alpha_S_k = edmonds_karp_max_flow
| ~~~~~~~~~~~~~~~~~~~~~
78 | (flow_g, p, k, cap, res_cap, rev_edge, &color[0], &pred[0]);
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
hcs.cpp:299:31: required from here
299 | min_cut(g, std::back_inserter(s_vec),
| ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
300 | std::back_inserter(vs_vec) );
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:206:17: note: in a call to non-static member function ‘boost::ConvertibleConcept<boost::lvalue_property_map_tag, boost::writable_property_map_tag>::~ConvertibleConcept()’
206 | BOOST_concept(Convertible,(X)(Y))
| ^~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/preprocessor/cat.hpp:29:34: note: in definition of macro ‘BOOST_PP_CAT_I’
29 | # define BOOST_PP_CAT_I(a, b) a ## b
| ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/concept_def.hpp:23:12: note: in expansion of macro ‘BOOST_PP_CAT’
23 | struct BOOST_PP_CAT(name,Concept) \
| ^~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:206:3: note: in expansion of macro ‘BOOST_concept’
206 | BOOST_concept(Convertible,(X)(Y))
| ^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Convertible<boost::lvalue_property_map_tag, boost::read_write_property_map_tag>]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/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(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/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> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/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))
| ^~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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);
| ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/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) );
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 7 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:66:5: required from ‘void boost::breadth_first_visit(const IncidenceGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with IncidenceGraph = filtered_graph<adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, no_property, listS>, is_residual_edge<adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_residual_capacity_t> >, keep_all>; Buffer = queue<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > >; BFSVisitor = bfs_visitor<edge_predecessor_recorder<detail::edge_desc_impl<directed_tag, long unsigned int>*, on_tree_edge> >; ColorMap = default_color_type*; SourceIterator = long unsigned int*]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:136:24: required from ‘void boost::breadth_first_search(const VertexListGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph<adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, no_property, listS>, is_residual_edge<adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_residual_capacity_t> >, keep_all>; SourceIterator = long unsigned int*; Buffer = queue<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > >; BFSVisitor = bfs_visitor<edge_predecessor_recorder<detail::edge_desc_impl<directed_tag, long unsigned int>*, on_tree_edge> >; ColorMap = default_color_type*]’
136 | breadth_first_visit(g, sources_begin, sources_end, Q, vis, color);
| ~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:147:25: required from ‘void boost::breadth_first_search(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph<adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, no_property, listS>, is_residual_edge<adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_residual_capacity_t> >, keep_all>; Buffer = queue<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > >; BFSVisitor = bfs_visitor<edge_predecessor_recorder<detail::edge_desc_impl<directed_tag, long unsigned int>*, on_tree_edge> >; ColorMap = default_color_type*; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
147 | breadth_first_search(g, sources, sources + 1, Q, vis, color);
| ~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/edmonds_karp_max_flow.hpp:101:29: required from ‘typename boost::property_traits<IndexMap>::value_type boost::edmonds_karp_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, ColorMap, PredEdgeMap) [with Graph = adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, no_property, listS>; CapacityEdgeMap = adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map<directed_tag, detail::edge_desc_impl<directed_tag, long unsigned int>, detail::edge_desc_impl<directed_tag, long unsigned int>&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_reverse_t>; ColorMap = default_color_type*; PredEdgeMap = detail::edge_desc_impl<directed_tag, long unsigned int>*; typename property_traits<IndexMap>::value_type = long unsigned int; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
101 | breadth_first_search(detail::residual_graph(g, res), src, Q,
| ~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
102 | make_bfs_visitor(record_edge_predecessors(pred, on_tree_edge())),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
103 | color);
| ~~~~~~
mincut.hpp:78:21: required from ‘typename boost::graph_traits<G>::edges_size_type boost::min_cut(VertexListGraph&, OutputIterator, OutputIterator) [with VertexListGraph = const R_adjacency_list<undirectedS, double>; OutputIterator = std::back_insert_iterator<std::vector<long unsigned int> >; typename graph_traits<G>::edges_size_type = long unsigned int]’
77 | alpha_S_k = edmonds_karp_max_flow
| ~~~~~~~~~~~~~~~~~~~~~
78 | (flow_g, p, k, cap, res_cap, rev_edge, &color[0], &pred[0]);
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
hcs.cpp:299:31: required from here
299 | min_cut(g, std::back_inserter(s_vec),
| ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
300 | std::back_inserter(vs_vec) );
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
20 | ~usage_requirements() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible<X, Y>::~Convertible() [with X = boost::lvalue_property_map_tag; Y = boost::read_write_property_map_tag]’
37 | ~model()
| ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
208 | BOOST_CONCEPT_USAGE(Convertible) {
| ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::DefaultConstructible<long unsigned int> >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:137:5: required from ‘struct boost::DefaultConstructible<long unsigned int>’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::DefaultConstructible<long unsigned int>]’
32 | inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
| ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied<boost::DefaultConstructible<long unsigned int> >::value’
44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied<boost::DefaultConstructible<long unsigned int> >’
45 | typedef boost::integral_constant<bool, value> type;
| ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_<void (*)(boost::DefaultConstructible<long unsigned int>)>’
72 | struct requirement_<void(*)(Model)>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:68:9: [ skipping 10 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:62:5: required from ‘void boost::breadth_first_visit(const IncidenceGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with IncidenceGraph = filtered_graph<adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, no_property, listS>, is_residual_edge<adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_residual_capacity_t> >, keep_all>; Buffer = queue<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > >; BFSVisitor = bfs_visitor<edge_predecessor_recorder<detail::edge_desc_impl<directed_tag, long unsigned int>*, on_tree_edge> >; ColorMap = default_color_type*; SourceIterator = long unsigned int*]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:136:24: required from ‘void boost::breadth_first_search(const VertexListGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph<adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, no_property, listS>, is_residual_edge<adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_residual_capacity_t> >, keep_all>; SourceIterator = long unsigned int*; Buffer = queue<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > >; BFSVisitor = bfs_visitor<edge_predecessor_recorder<detail::edge_desc_impl<directed_tag, long unsigned int>*, on_tree_edge> >; ColorMap = default_color_type*]’
136 | breadth_first_visit(g, sources_begin, sources_end, Q, vis, color);
| ~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:147:25: required from ‘void boost::breadth_first_search(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph<adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, no_property, listS>, is_residual_edge<adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_residual_capacity_t> >, keep_all>; Buffer = queue<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > >; BFSVisitor = bfs_visitor<edge_predecessor_recorder<detail::edge_desc_impl<directed_tag, long unsigned int>*, on_tree_edge> >; ColorMap = default_color_type*; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
147 | breadth_first_search(g, sources, sources + 1, Q, vis, color);
| ~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/edmonds_karp_max_flow.hpp:101:29: required from ‘typename boost::property_traits<IndexMap>::value_type boost::edmonds_karp_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, ColorMap, PredEdgeMap) [with Graph = adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, no_property, listS>; CapacityEdgeMap = adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map<directed_tag, detail::edge_desc_impl<directed_tag, long unsigned int>, detail::edge_desc_impl<directed_tag, long unsigned int>&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_reverse_t>; ColorMap = default_color_type*; PredEdgeMap = detail::edge_desc_impl<directed_tag, long unsigned int>*; typename property_traits<IndexMap>::value_type = long unsigned int; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
101 | breadth_first_search(detail::residual_graph(g, res), src, Q,
| ~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
102 | make_bfs_visitor(record_edge_predecessors(pred, on_tree_edge())),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
103 | color);
| ~~~~~~
mincut.hpp:78:21: required from ‘typename boost::graph_traits<G>::edges_size_type boost::min_cut(VertexListGraph&, OutputIterator, OutputIterator) [with VertexListGraph = const R_adjacency_list<undirectedS, double>; OutputIterator = std::back_insert_iterator<std::vector<long unsigned int> >; typename graph_traits<G>::edges_size_type = long unsigned int]’
77 | alpha_S_k = edmonds_karp_max_flow
| ~~~~~~~~~~~~~~~~~~~~~
78 | (flow_g, p, k, cap, res_cap, rev_edge, &color[0], &pred[0]);
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
hcs.cpp:299:31: required from here
299 | min_cut(g, std::back_inserter(s_vec),
| ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
300 | std::back_inserter(vs_vec) );
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::DefaultConstructible<long unsigned int>]’
20 | ~usage_requirements() { ((Model*)0)->~Model(); }
| ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::DefaultConstructible<long unsigned int>]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:68:9: required from ‘boost::concepts::Graph<G>::~Graph() [with G = boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::no_property, boost::listS>, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long unsigned int, long unsigned int&, long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all>]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: required from ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::concepts::Graph<boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::no_property, boost::listS>, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long unsigned int, long unsigned int&, long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >]’
20 | ~usage_requirements() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::concepts::Graph<boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::no_property, boost::listS>, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long unsigned int, long unsigned int&, long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all> > >]’
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:66:5: required from ‘struct boost::concepts::Graph<boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::no_property, boost::listS>, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long unsigned int, long unsigned int&, long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:75:1: required from ‘struct boost::concepts::IncidenceGraph<boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::no_property, boost::listS>, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long unsigned int, long unsigned int&, long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >’
75 | BOOST_concept(IncidenceGraph, (G)) : Graph< G >
| ^~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:75:1: [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:62:5: required from ‘void boost::breadth_first_visit(const IncidenceGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with IncidenceGraph = filtered_graph<adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, no_property, listS>, is_residual_edge<adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_residual_capacity_t> >, keep_all>; Buffer = queue<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > >; BFSVisitor = bfs_visitor<edge_predecessor_recorder<detail::edge_desc_impl<directed_tag, long unsigned int>*, on_tree_edge> >; ColorMap = default_color_type*; SourceIterator = long unsigned int*]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:136:24: required from ‘void boost::breadth_first_search(const VertexListGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph<adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, no_property, listS>, is_residual_edge<adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_residual_capacity_t> >, keep_all>; SourceIterator = long unsigned int*; Buffer = queue<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > >; BFSVisitor = bfs_visitor<edge_predecessor_recorder<detail::edge_desc_impl<directed_tag, long unsigned int>*, on_tree_edge> >; ColorMap = default_color_type*]’
136 | breadth_first_visit(g, sources_begin, sources_end, Q, vis, color);
| ~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:147:25: required from ‘void boost::breadth_first_search(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph<adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, no_property, listS>, is_residual_edge<adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_residual_capacity_t> >, keep_all>; Buffer = queue<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > >; BFSVisitor = bfs_visitor<edge_predecessor_recorder<detail::edge_desc_impl<directed_tag, long unsigned int>*, on_tree_edge> >; ColorMap = default_color_type*; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
147 | breadth_first_search(g, sources, sources + 1, Q, vis, color);
| ~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/edmonds_karp_max_flow.hpp:101:29: required from ‘typename boost::property_traits<IndexMap>::value_type boost::edmonds_karp_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, ColorMap, PredEdgeMap) [with Graph = adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, no_property, listS>; CapacityEdgeMap = adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map<directed_tag, detail::edge_desc_impl<directed_tag, long unsigned int>, detail::edge_desc_impl<directed_tag, long unsigned int>&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_reverse_t>; ColorMap = default_color_type*; PredEdgeMap = detail::edge_desc_impl<directed_tag, long unsigned int>*; typename property_traits<IndexMap>::value_type = long unsigned int; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
101 | breadth_first_search(detail::residual_graph(g, res), src, Q,
| ~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
102 | make_bfs_visitor(record_edge_predecessors(pred, on_tree_edge())),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
103 | color);
| ~~~~~~
mincut.hpp:78:21: required from ‘typename boost::graph_traits<G>::edges_size_type boost::min_cut(VertexListGraph&, OutputIterator, OutputIterator) [with VertexListGraph = const R_adjacency_list<undirectedS, double>; OutputIterator = std::back_insert_iterator<std::vector<long unsigned int> >; typename graph_traits<G>::edges_size_type = long unsigned int]’
77 | alpha_S_k = edmonds_karp_max_flow
| ~~~~~~~~~~~~~~~~~~~~~
78 | (flow_g, p, k, cap, res_cap, rev_edge, &color[0], &pred[0]);
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
hcs.cpp:299:31: required from here
299 | min_cut(g, std::back_inserter(s_vec),
| ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
300 | std::back_inserter(vs_vec) );
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::DefaultConstructible<TT>::~DefaultConstructible() [with TT = long unsigned int]’
37 | ~model()
| ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:137:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
137 | BOOST_CONCEPT_USAGE(DefaultConstructible) {
| ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::EqualityComparable<long unsigned int> >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable<long unsigned int>’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::EqualityComparable<long unsigned int>]’
32 | inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
| ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied<boost::EqualityComparable<long unsigned int> >::value’
44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied<boost::EqualityComparable<long unsigned int> >’
45 | typedef boost::integral_constant<bool, value> type;
| ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_<void (*)(boost::EqualityComparable<long unsigned int>)>’
72 | struct requirement_<void(*)(Model)>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:69:9: [ skipping 10 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:62:5: required from ‘void boost::breadth_first_visit(const IncidenceGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with IncidenceGraph = filtered_graph<adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, no_property, listS>, is_residual_edge<adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_residual_capacity_t> >, keep_all>; Buffer = queue<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > >; BFSVisitor = bfs_visitor<edge_predecessor_recorder<detail::edge_desc_impl<directed_tag, long unsigned int>*, on_tree_edge> >; ColorMap = default_color_type*; SourceIterator = long unsigned int*]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:136:24: required from ‘void boost::breadth_first_search(const VertexListGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph<adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, no_property, listS>, is_residual_edge<adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_residual_capacity_t> >, keep_all>; SourceIterator = long unsigned int*; Buffer = queue<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > >; BFSVisitor = bfs_visitor<edge_predecessor_recorder<detail::edge_desc_impl<directed_tag, long unsigned int>*, on_tree_edge> >; ColorMap = default_color_type*]’
136 | breadth_first_visit(g, sources_begin, sources_end, Q, vis, color);
| ~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:147:25: required from ‘void boost::breadth_first_search(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph<adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, no_property, listS>, is_residual_edge<adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_residual_capacity_t> >, keep_all>; Buffer = queue<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > >; BFSVisitor = bfs_visitor<edge_predecessor_recorder<detail::edge_desc_impl<directed_tag, long unsigned int>*, on_tree_edge> >; ColorMap = default_color_type*; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
147 | breadth_first_search(g, sources, sources + 1, Q, vis, color);
| ~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/edmonds_karp_max_flow.hpp:101:29: required from ‘typename boost::property_traits<IndexMap>::value_type boost::edmonds_karp_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, ColorMap, PredEdgeMap) [with Graph = adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, no_property, listS>; CapacityEdgeMap = adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map<directed_tag, detail::edge_desc_impl<directed_tag, long unsigned int>, detail::edge_desc_impl<directed_tag, long unsigned int>&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_reverse_t>; ColorMap = default_color_type*; PredEdgeMap = detail::edge_desc_impl<directed_tag, long unsigned int>*; typename property_traits<IndexMap>::value_type = long unsigned int; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
101 | breadth_first_search(detail::residual_graph(g, res), src, Q,
| ~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
102 | make_bfs_visitor(record_edge_predecessors(pred, on_tree_edge())),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
103 | color);
| ~~~~~~
mincut.hpp:78:21: required from ‘typename boost::graph_traits<G>::edges_size_type boost::min_cut(VertexListGraph&, OutputIterator, OutputIterator) [with VertexListGraph = const R_adjacency_list<undirectedS, double>; OutputIterator = std::back_insert_iterator<std::vector<long unsigned int> >; typename graph_traits<G>::edges_size_type = long unsigned int]’
77 | alpha_S_k = edmonds_karp_max_flow
| ~~~~~~~~~~~~~~~~~~~~~
78 | (flow_g, p, k, cap, res_cap, rev_edge, &color[0], &pred[0]);
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
hcs.cpp:299:31: required from here
299 | min_cut(g, std::back_inserter(s_vec),
| ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
300 | std::back_inserter(vs_vec) );
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::EqualityComparable<long unsigned int>]’
20 | ~usage_requirements() { ((Model*)0)->~Model(); }
| ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::EqualityComparable<long unsigned int>]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:69:9: required from ‘boost::concepts::Graph<G>::~Graph() [with G = boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::no_property, boost::listS>, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long unsigned int, long unsigned int&, long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all>]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: required from ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::concepts::Graph<boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::no_property, boost::listS>, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long unsigned int, long unsigned int&, long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >]’
20 | ~usage_requirements() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::concepts::Graph<boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::no_property, boost::listS>, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long unsigned int, long unsigned int&, long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all> > >]’
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:66:5: required from ‘struct boost::concepts::Graph<boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::no_property, boost::listS>, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long unsigned int, long unsigned int&, long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:75:1: required from ‘struct boost::concepts::IncidenceGraph<boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::no_property, boost::listS>, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long unsigned int, long unsigned int&, long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >’
75 | BOOST_concept(IncidenceGraph, (G)) : Graph< G >
| ^~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:75:1: [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:62:5: required from ‘void boost::breadth_first_visit(const IncidenceGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with IncidenceGraph = filtered_graph<adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, no_property, listS>, is_residual_edge<adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_residual_capacity_t> >, keep_all>; Buffer = queue<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > >; BFSVisitor = bfs_visitor<edge_predecessor_recorder<detail::edge_desc_impl<directed_tag, long unsigned int>*, on_tree_edge> >; ColorMap = default_color_type*; SourceIterator = long unsigned int*]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:136:24: required from ‘void boost::breadth_first_search(const VertexListGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph<adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, no_property, listS>, is_residual_edge<adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_residual_capacity_t> >, keep_all>; SourceIterator = long unsigned int*; Buffer = queue<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > >; BFSVisitor = bfs_visitor<edge_predecessor_recorder<detail::edge_desc_impl<directed_tag, long unsigned int>*, on_tree_edge> >; ColorMap = default_color_type*]’
136 | breadth_first_visit(g, sources_begin, sources_end, Q, vis, color);
| ~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:147:25: required from ‘void boost::breadth_first_search(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph<adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, no_property, listS>, is_residual_edge<adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_residual_capacity_t> >, keep_all>; Buffer = queue<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > >; BFSVisitor = bfs_visitor<edge_predecessor_recorder<detail::edge_desc_impl<directed_tag, long unsigned int>*, on_tree_edge> >; ColorMap = default_color_type*; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
147 | breadth_first_search(g, sources, sources + 1, Q, vis, color);
| ~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/edmonds_karp_max_flow.hpp:101:29: required from ‘typename boost::property_traits<IndexMap>::value_type boost::edmonds_karp_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, ColorMap, PredEdgeMap) [with Graph = adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, no_property, listS>; CapacityEdgeMap = adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map<directed_tag, detail::edge_desc_impl<directed_tag, long unsigned int>, detail::edge_desc_impl<directed_tag, long unsigned int>&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_reverse_t>; ColorMap = default_color_type*; PredEdgeMap = detail::edge_desc_impl<directed_tag, long unsigned int>*; typename property_traits<IndexMap>::value_type = long unsigned int; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
101 | breadth_first_search(detail::residual_graph(g, res), src, Q,
| ~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
102 | make_bfs_visitor(record_edge_predecessors(pred, on_tree_edge())),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
103 | color);
| ~~~~~~
mincut.hpp:78:21: required from ‘typename boost::graph_traits<G>::edges_size_type boost::min_cut(VertexListGraph&, OutputIterator, OutputIterator) [with VertexListGraph = const R_adjacency_list<undirectedS, double>; OutputIterator = std::back_insert_iterator<std::vector<long unsigned int> >; typename graph_traits<G>::edges_size_type = long unsigned int]’
77 | alpha_S_k = edmonds_karp_max_flow
| ~~~~~~~~~~~~~~~~~~~~~
78 | (flow_g, p, k, cap, res_cap, rev_edge, &color[0], &pred[0]);
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
hcs.cpp:299:31: required from here
299 | min_cut(g, std::back_inserter(s_vec),
| ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
300 | std::back_inserter(vs_vec) );
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::EqualityComparable<TT>::~EqualityComparable() [with TT = long unsigned int]’
37 | ~model()
| ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:233:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
233 | BOOST_CONCEPT_USAGE(EqualityComparable) {
| ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Assignable<long unsigned int> >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:145:5: required from ‘struct boost::Assignable<long unsigned int>’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::Assignable<long unsigned int>]’
32 | inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
| ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied<boost::Assignable<long unsigned int> >::value’
44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied<boost::Assignable<long unsigned int> >’
45 | typedef boost::integral_constant<bool, value> type;
| ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_<void (*)(boost::Assignable<long unsigned int>)>’
72 | struct requirement_<void(*)(Model)>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:70:9: [ skipping 10 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:62:5: required from ‘void boost::breadth_first_visit(const IncidenceGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with IncidenceGraph = filtered_graph<adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, no_property, listS>, is_residual_edge<adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_residual_capacity_t> >, keep_all>; Buffer = queue<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > >; BFSVisitor = bfs_visitor<edge_predecessor_recorder<detail::edge_desc_impl<directed_tag, long unsigned int>*, on_tree_edge> >; ColorMap = default_color_type*; SourceIterator = long unsigned int*]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:136:24: required from ‘void boost::breadth_first_search(const VertexListGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph<adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, no_property, listS>, is_residual_edge<adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_residual_capacity_t> >, keep_all>; SourceIterator = long unsigned int*; Buffer = queue<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > >; BFSVisitor = bfs_visitor<edge_predecessor_recorder<detail::edge_desc_impl<directed_tag, long unsigned int>*, on_tree_edge> >; ColorMap = default_color_type*]’
136 | breadth_first_visit(g, sources_begin, sources_end, Q, vis, color);
| ~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:147:25: required from ‘void boost::breadth_first_search(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph<adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, no_property, listS>, is_residual_edge<adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_residual_capacity_t> >, keep_all>; Buffer = queue<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > >; BFSVisitor = bfs_visitor<edge_predecessor_recorder<detail::edge_desc_impl<directed_tag, long unsigned int>*, on_tree_edge> >; ColorMap = default_color_type*; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
147 | breadth_first_search(g, sources, sources + 1, Q, vis, color);
| ~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/edmonds_karp_max_flow.hpp:101:29: required from ‘typename boost::property_traits<IndexMap>::value_type boost::edmonds_karp_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, ColorMap, PredEdgeMap) [with Graph = adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, no_property, listS>; CapacityEdgeMap = adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map<directed_tag, detail::edge_desc_impl<directed_tag, long unsigned int>, detail::edge_desc_impl<directed_tag, long unsigned int>&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_reverse_t>; ColorMap = default_color_type*; PredEdgeMap = detail::edge_desc_impl<directed_tag, long unsigned int>*; typename property_traits<IndexMap>::value_type = long unsigned int; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
101 | breadth_first_search(detail::residual_graph(g, res), src, Q,
| ~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
102 | make_bfs_visitor(record_edge_predecessors(pred, on_tree_edge())),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
103 | color);
| ~~~~~~
mincut.hpp:78:21: required from ‘typename boost::graph_traits<G>::edges_size_type boost::min_cut(VertexListGraph&, OutputIterator, OutputIterator) [with VertexListGraph = const R_adjacency_list<undirectedS, double>; OutputIterator = std::back_insert_iterator<std::vector<long unsigned int> >; typename graph_traits<G>::edges_size_type = long unsigned int]’
77 | alpha_S_k = edmonds_karp_max_flow
| ~~~~~~~~~~~~~~~~~~~~~
78 | (flow_g, p, k, cap, res_cap, rev_edge, &color[0], &pred[0]);
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
hcs.cpp:299:31: required from here
299 | min_cut(g, std::back_inserter(s_vec),
| ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
300 | std::back_inserter(vs_vec) );
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Assignable<long unsigned int>]’
20 | ~usage_requirements() { ((Model*)0)->~Model(); }
| ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::Assignable<long unsigned int>]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:70:9: required from ‘boost::concepts::Graph<G>::~Graph() [with G = boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::no_property, boost::listS>, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long unsigned int, long unsigned int&, long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all>]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: required from ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::concepts::Graph<boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::no_property, boost::listS>, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long unsigned int, long unsigned int&, long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >]’
20 | ~usage_requirements() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::concepts::Graph<boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::no_property, boost::listS>, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long unsigned int, long unsigned int&, long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all> > >]’
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:66:5: required from ‘struct boost::concepts::Graph<boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::no_property, boost::listS>, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long unsigned int, long unsigned int&, long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:75:1: required from ‘struct boost::concepts::IncidenceGraph<boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::no_property, boost::listS>, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long unsigned int, long unsigned int&, long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >’
75 | BOOST_concept(IncidenceGraph, (G)) : Graph< G >
| ^~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:75:1: [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:62:5: required from ‘void boost::breadth_first_visit(const IncidenceGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with IncidenceGraph = filtered_graph<adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, no_property, listS>, is_residual_edge<adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_residual_capacity_t> >, keep_all>; Buffer = queue<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > >; BFSVisitor = bfs_visitor<edge_predecessor_recorder<detail::edge_desc_impl<directed_tag, long unsigned int>*, on_tree_edge> >; ColorMap = default_color_type*; SourceIterator = long unsigned int*]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:136:24: required from ‘void boost::breadth_first_search(const VertexListGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph<adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, no_property, listS>, is_residual_edge<adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_residual_capacity_t> >, keep_all>; SourceIterator = long unsigned int*; Buffer = queue<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > >; BFSVisitor = bfs_visitor<edge_predecessor_recorder<detail::edge_desc_impl<directed_tag, long unsigned int>*, on_tree_edge> >; ColorMap = default_color_type*]’
136 | breadth_first_visit(g, sources_begin, sources_end, Q, vis, color);
| ~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:147:25: required from ‘void boost::breadth_first_search(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph<adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, no_property, listS>, is_residual_edge<adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_residual_capacity_t> >, keep_all>; Buffer = queue<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > >; BFSVisitor = bfs_visitor<edge_predecessor_recorder<detail::edge_desc_impl<directed_tag, long unsigned int>*, on_tree_edge> >; ColorMap = default_color_type*; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
147 | breadth_first_search(g, sources, sources + 1, Q, vis, color);
| ~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/edmonds_karp_max_flow.hpp:101:29: required from ‘typename boost::property_traits<IndexMap>::value_type boost::edmonds_karp_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, ColorMap, PredEdgeMap) [with Graph = adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, no_property, listS>; CapacityEdgeMap = adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map<directed_tag, detail::edge_desc_impl<directed_tag, long unsigned int>, detail::edge_desc_impl<directed_tag, long unsigned int>&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_reverse_t>; ColorMap = default_color_type*; PredEdgeMap = detail::edge_desc_impl<directed_tag, long unsigned int>*; typename property_traits<IndexMap>::value_type = long unsigned int; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
101 | breadth_first_search(detail::residual_graph(g, res), src, Q,
| ~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
102 | make_bfs_visitor(record_edge_predecessors(pred, on_tree_edge())),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
103 | color);
| ~~~~~~
mincut.hpp:78:21: required from ‘typename boost::graph_traits<G>::edges_size_type boost::min_cut(VertexListGraph&, OutputIterator, OutputIterator) [with VertexListGraph = const R_adjacency_list<undirectedS, double>; OutputIterator = std::back_insert_iterator<std::vector<long unsigned int> >; typename graph_traits<G>::edges_size_type = long unsigned int]’
77 | alpha_S_k = edmonds_karp_max_flow
| ~~~~~~~~~~~~~~~~~~~~~
78 | (flow_g, p, k, cap, res_cap, rev_edge, &color[0], &pred[0]);
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
hcs.cpp:299:31: required from here
299 | min_cut(g, std::back_inserter(s_vec),
| ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
300 | std::back_inserter(vs_vec) );
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Assignable<TT>::~Assignable() [with TT = long unsigned int]’
37 | ~model()
| ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:145:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
145 | BOOST_CONCEPT_USAGE(Assignable) {
| ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::concepts::MultiPassInputIterator<boost::iterators::filter_iterator<boost::detail::out_edge_predicate<boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long unsigned int, long unsigned int&, long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::no_property, boost::listS>, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long unsigned int, long unsigned int&, long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int> > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::concepts::MultiPassInputIterator<boost::iterators::filter_iterator<boost::detail::out_edge_predicate<boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long unsigned int, long unsigned int&, long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::no_property, boost::listS>, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long unsigned int, long unsigned int&, long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int> > > >]’
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:52:50: required from ‘struct boost::concepts::MultiPassInputIterator<boost::iterators::filter_iterator<boost::detail::out_edge_predicate<boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long unsigned int, long unsigned int&, long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::no_property, boost::listS>, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long unsigned int, long unsigned int&, long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int> > >’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::concepts::MultiPassInputIterator<boost::iterators::filter_iterator<boost::detail::out_edge_predicate<boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long unsigned int, long unsigned int&, long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::no_property, boost::listS>, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long unsigned int, long unsigned int&, long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int> > >]’
32 | inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
| ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied<boost::concepts::MultiPassInputIterator<boost::iterators::filter_iterator<boost::detail::out_edge_predicate<boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long unsigned int, long unsigned int&, long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::no_property, boost::listS>, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long unsigned int, long unsigned int&, long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int> > > >::value’
44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied<boost::concepts::MultiPassInputIterator<boost::iterators::filter_iterator<boost::detail::out_edge_predicate<boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long unsigned int, long unsigned int&, long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::no_property, boost::listS>, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long unsigned int, long unsigned int&, long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int> > > >’
45 | typedef boost::integral_constant<bool, value> type;
| ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:62:5: required from ‘void boost::breadth_first_visit(const IncidenceGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with IncidenceGraph = filtered_graph<adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, no_property, listS>, is_residual_edge<adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_residual_capacity_t> >, keep_all>; Buffer = queue<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > >; BFSVisitor = bfs_visitor<edge_predecessor_recorder<detail::edge_desc_impl<directed_tag, long unsigned int>*, on_tree_edge> >; ColorMap = default_color_type*; SourceIterator = long unsigned int*]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:136:24: required from ‘void boost::breadth_first_search(const VertexListGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph<adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, no_property, listS>, is_residual_edge<adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_residual_capacity_t> >, keep_all>; SourceIterator = long unsigned int*; Buffer = queue<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > >; BFSVisitor = bfs_visitor<edge_predecessor_recorder<detail::edge_desc_impl<directed_tag, long unsigned int>*, on_tree_edge> >; ColorMap = default_color_type*]’
136 | breadth_first_visit(g, sources_begin, sources_end, Q, vis, color);
| ~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:147:25: required from ‘void boost::breadth_first_search(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph<adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, no_property, listS>, is_residual_edge<adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_residual_capacity_t> >, keep_all>; Buffer = queue<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > >; BFSVisitor = bfs_visitor<edge_predecessor_recorder<detail::edge_desc_impl<directed_tag, long unsigned int>*, on_tree_edge> >; ColorMap = default_color_type*; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
147 | breadth_first_search(g, sources, sources + 1, Q, vis, color);
| ~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/edmonds_karp_max_flow.hpp:101:29: required from ‘typename boost::property_traits<IndexMap>::value_type boost::edmonds_karp_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, ColorMap, PredEdgeMap) [with Graph = adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, no_property, listS>; CapacityEdgeMap = adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map<directed_tag, detail::edge_desc_impl<directed_tag, long unsigned int>, detail::edge_desc_impl<directed_tag, long unsigned int>&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_reverse_t>; ColorMap = default_color_type*; PredEdgeMap = detail::edge_desc_impl<directed_tag, long unsigned int>*; typename property_traits<IndexMap>::value_type = long unsigned int; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
101 | breadth_first_search(detail::residual_graph(g, res), src, Q,
| ~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
102 | make_bfs_visitor(record_edge_predecessors(pred, on_tree_edge())),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
103 | color);
| ~~~~~~
mincut.hpp:78:21: required from ‘typename boost::graph_traits<G>::edges_size_type boost::min_cut(VertexListGraph&, OutputIterator, OutputIterator) [with VertexListGraph = const R_adjacency_list<undirectedS, double>; OutputIterator = std::back_insert_iterator<std::vector<long unsigned int> >; typename graph_traits<G>::edges_size_type = long unsigned int]’
77 | alpha_S_k = edmonds_karp_max_flow
| ~~~~~~~~~~~~~~~~~~~~~
78 | (flow_g, p, k, cap, res_cap, rev_edge, &color[0], &pred[0]);
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
hcs.cpp:299:31: required from here
299 | min_cut(g, std::back_inserter(s_vec),
| ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
300 | std::back_inserter(vs_vec) );
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
20 | ~usage_requirements() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::concepts::MultiPassInputIterator<T>::~MultiPassInputIterator() [with T = boost::iterators::filter_iterator<boost::detail::out_edge_predicate<boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long unsigned int, long unsigned int&, long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::no_property, boost::listS>, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long unsigned int, long unsigned int&, long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int> >]’
37 | ~model()
| ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:52:50: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
52 | BOOST_concept(MultiPassInputIterator, (T)) { BOOST_CONCEPT_USAGE(
| ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::DefaultConstructible<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::DefaultConstructible<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > >]’
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:137:5: required from ‘struct boost::DefaultConstructible<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> >’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::DefaultConstructible<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> >]’
32 | inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
| ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied<boost::DefaultConstructible<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > >::value’
44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied<boost::DefaultConstructible<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > >’
45 | typedef boost::integral_constant<bool, value> type;
| ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:62:5: required from ‘void boost::breadth_first_visit(const IncidenceGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with IncidenceGraph = filtered_graph<adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, no_property, listS>, is_residual_edge<adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_residual_capacity_t> >, keep_all>; Buffer = queue<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > >; BFSVisitor = bfs_visitor<edge_predecessor_recorder<detail::edge_desc_impl<directed_tag, long unsigned int>*, on_tree_edge> >; ColorMap = default_color_type*; SourceIterator = long unsigned int*]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:136:24: required from ‘void boost::breadth_first_search(const VertexListGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph<adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, no_property, listS>, is_residual_edge<adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_residual_capacity_t> >, keep_all>; SourceIterator = long unsigned int*; Buffer = queue<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > >; BFSVisitor = bfs_visitor<edge_predecessor_recorder<detail::edge_desc_impl<directed_tag, long unsigned int>*, on_tree_edge> >; ColorMap = default_color_type*]’
136 | breadth_first_visit(g, sources_begin, sources_end, Q, vis, color);
| ~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:147:25: required from ‘void boost::breadth_first_search(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph<adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, no_property, listS>, is_residual_edge<adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_residual_capacity_t> >, keep_all>; Buffer = queue<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > >; BFSVisitor = bfs_visitor<edge_predecessor_recorder<detail::edge_desc_impl<directed_tag, long unsigned int>*, on_tree_edge> >; ColorMap = default_color_type*; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
147 | breadth_first_search(g, sources, sources + 1, Q, vis, color);
| ~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/edmonds_karp_max_flow.hpp:101:29: required from ‘typename boost::property_traits<IndexMap>::value_type boost::edmonds_karp_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, ColorMap, PredEdgeMap) [with Graph = adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, no_property, listS>; CapacityEdgeMap = adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map<directed_tag, detail::edge_desc_impl<directed_tag, long unsigned int>, detail::edge_desc_impl<directed_tag, long unsigned int>&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_reverse_t>; ColorMap = default_color_type*; PredEdgeMap = detail::edge_desc_impl<directed_tag, long unsigned int>*; typename property_traits<IndexMap>::value_type = long unsigned int; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
101 | breadth_first_search(detail::residual_graph(g, res), src, Q,
| ~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
102 | make_bfs_visitor(record_edge_predecessors(pred, on_tree_edge())),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
103 | color);
| ~~~~~~
mincut.hpp:78:21: required from ‘typename boost::graph_traits<G>::edges_size_type boost::min_cut(VertexListGraph&, OutputIterator, OutputIterator) [with VertexListGraph = const R_adjacency_list<undirectedS, double>; OutputIterator = std::back_insert_iterator<std::vector<long unsigned int> >; typename graph_traits<G>::edges_size_type = long unsigned int]’
77 | alpha_S_k = edmonds_karp_max_flow
| ~~~~~~~~~~~~~~~~~~~~~
78 | (flow_g, p, k, cap, res_cap, rev_edge, &color[0], &pred[0]);
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
hcs.cpp:299:31: required from here
299 | min_cut(g, std::back_inserter(s_vec),
| ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
300 | std::back_inserter(vs_vec) );
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
20 | ~usage_requirements() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::DefaultConstructible<TT>::~DefaultConstructible() [with TT = boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>]’
37 | ~model()
| ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:137:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
137 | BOOST_CONCEPT_USAGE(DefaultConstructible) {
| ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::EqualityComparable<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::EqualityComparable<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > >]’
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> >’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::EqualityComparable<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> >]’
32 | inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
| ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied<boost::EqualityComparable<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > >::value’
44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied<boost::EqualityComparable<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > >’
45 | typedef boost::integral_constant<bool, value> type;
| ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:62:5: required from ‘void boost::breadth_first_visit(const IncidenceGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with IncidenceGraph = filtered_graph<adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, no_property, listS>, is_residual_edge<adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_residual_capacity_t> >, keep_all>; Buffer = queue<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > >; BFSVisitor = bfs_visitor<edge_predecessor_recorder<detail::edge_desc_impl<directed_tag, long unsigned int>*, on_tree_edge> >; ColorMap = default_color_type*; SourceIterator = long unsigned int*]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:136:24: required from ‘void boost::breadth_first_search(const VertexListGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph<adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, no_property, listS>, is_residual_edge<adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_residual_capacity_t> >, keep_all>; SourceIterator = long unsigned int*; Buffer = queue<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > >; BFSVisitor = bfs_visitor<edge_predecessor_recorder<detail::edge_desc_impl<directed_tag, long unsigned int>*, on_tree_edge> >; ColorMap = default_color_type*]’
136 | breadth_first_visit(g, sources_begin, sources_end, Q, vis, color);
| ~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:147:25: required from ‘void boost::breadth_first_search(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph<adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, no_property, listS>, is_residual_edge<adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_residual_capacity_t> >, keep_all>; Buffer = queue<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > >; BFSVisitor = bfs_visitor<edge_predecessor_recorder<detail::edge_desc_impl<directed_tag, long unsigned int>*, on_tree_edge> >; ColorMap = default_color_type*; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
147 | breadth_first_search(g, sources, sources + 1, Q, vis, color);
| ~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/edmonds_karp_max_flow.hpp:101:29: required from ‘typename boost::property_traits<IndexMap>::value_type boost::edmonds_karp_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, ColorMap, PredEdgeMap) [with Graph = adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, no_property, listS>; CapacityEdgeMap = adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map<directed_tag, detail::edge_desc_impl<directed_tag, long unsigned int>, detail::edge_desc_impl<directed_tag, long unsigned int>&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_reverse_t>; ColorMap = default_color_type*; PredEdgeMap = detail::edge_desc_impl<directed_tag, long unsigned int>*; typename property_traits<IndexMap>::value_type = long unsigned int; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
101 | breadth_first_search(detail::residual_graph(g, res), src, Q,
| ~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
102 | make_bfs_visitor(record_edge_predecessors(pred, on_tree_edge())),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
103 | color);
| ~~~~~~
mincut.hpp:78:21: required from ‘typename boost::graph_traits<G>::edges_size_type boost::min_cut(VertexListGraph&, OutputIterator, OutputIterator) [with VertexListGraph = const R_adjacency_list<undirectedS, double>; OutputIterator = std::back_insert_iterator<std::vector<long unsigned int> >; typename graph_traits<G>::edges_size_type = long unsigned int]’
77 | alpha_S_k = edmonds_karp_max_flow
| ~~~~~~~~~~~~~~~~~~~~~
78 | (flow_g, p, k, cap, res_cap, rev_edge, &color[0], &pred[0]);
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
hcs.cpp:299:31: required from here
299 | min_cut(g, std::back_inserter(s_vec),
| ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
300 | std::back_inserter(vs_vec) );
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
20 | ~usage_requirements() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::EqualityComparable<TT>::~EqualityComparable() [with TT = boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>]’
37 | ~model()
| ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:233:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
233 | BOOST_CONCEPT_USAGE(EqualityComparable) {
| ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Assignable<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Assignable<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > >]’
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:145:5: required from ‘struct boost::Assignable<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> >’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::Assignable<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> >]’
32 | inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
| ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied<boost::Assignable<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > >::value’
44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied<boost::Assignable<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > >’
45 | typedef boost::integral_constant<bool, value> type;
| ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:62:5: required from ‘void boost::breadth_first_visit(const IncidenceGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with IncidenceGraph = filtered_graph<adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, no_property, listS>, is_residual_edge<adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_residual_capacity_t> >, keep_all>; Buffer = queue<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > >; BFSVisitor = bfs_visitor<edge_predecessor_recorder<detail::edge_desc_impl<directed_tag, long unsigned int>*, on_tree_edge> >; ColorMap = default_color_type*; SourceIterator = long unsigned int*]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:136:24: required from ‘void boost::breadth_first_search(const VertexListGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph<adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, no_property, listS>, is_residual_edge<adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_residual_capacity_t> >, keep_all>; SourceIterator = long unsigned int*; Buffer = queue<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > >; BFSVisitor = bfs_visitor<edge_predecessor_recorder<detail::edge_desc_impl<directed_tag, long unsigned int>*, on_tree_edge> >; ColorMap = default_color_type*]’
136 | breadth_first_visit(g, sources_begin, sources_end, Q, vis, color);
| ~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:147:25: required from ‘void boost::breadth_first_search(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph<adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, no_property, listS>, is_residual_edge<adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_residual_capacity_t> >, keep_all>; Buffer = queue<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > >; BFSVisitor = bfs_visitor<edge_predecessor_recorder<detail::edge_desc_impl<directed_tag, long unsigned int>*, on_tree_edge> >; ColorMap = default_color_type*; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
147 | breadth_first_search(g, sources, sources + 1, Q, vis, color);
| ~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/edmonds_karp_max_flow.hpp:101:29: required from ‘typename boost::property_traits<IndexMap>::value_type boost::edmonds_karp_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, ColorMap, PredEdgeMap) [with Graph = adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, no_property, listS>; CapacityEdgeMap = adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map<directed_tag, detail::edge_desc_impl<directed_tag, long unsigned int>, detail::edge_desc_impl<directed_tag, long unsigned int>&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_reverse_t>; ColorMap = default_color_type*; PredEdgeMap = detail::edge_desc_impl<directed_tag, long unsigned int>*; typename property_traits<IndexMap>::value_type = long unsigned int; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
101 | breadth_first_search(detail::residual_graph(g, res), src, Q,
| ~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
102 | make_bfs_visitor(record_edge_predecessors(pred, on_tree_edge())),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
103 | color);
| ~~~~~~
mincut.hpp:78:21: required from ‘typename boost::graph_traits<G>::edges_size_type boost::min_cut(VertexListGraph&, OutputIterator, OutputIterator) [with VertexListGraph = const R_adjacency_list<undirectedS, double>; OutputIterator = std::back_insert_iterator<std::vector<long unsigned int> >; typename graph_traits<G>::edges_size_type = long unsigned int]’
77 | alpha_S_k = edmonds_karp_max_flow
| ~~~~~~~~~~~~~~~~~~~~~
78 | (flow_g, p, k, cap, res_cap, rev_edge, &color[0], &pred[0]);
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
hcs.cpp:299:31: required from here
299 | min_cut(g, std::back_inserter(s_vec),
| ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
300 | std::back_inserter(vs_vec) );
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
20 | ~usage_requirements() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Assignable<TT>::~Assignable() [with TT = boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>]’
37 | ~model()
| ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:145:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
145 | BOOST_CONCEPT_USAGE(Assignable) {
| ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Convertible<boost::adj_list_dir_traversal_tag, boost::incidence_graph_tag>]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/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(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/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> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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);
| ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/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) );
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/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;
| ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:62:5: required from ‘void boost::breadth_first_visit(const IncidenceGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with IncidenceGraph = filtered_graph<adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, no_property, listS>, is_residual_edge<adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_residual_capacity_t> >, keep_all>; Buffer = queue<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > >; BFSVisitor = bfs_visitor<edge_predecessor_recorder<detail::edge_desc_impl<directed_tag, long unsigned int>*, on_tree_edge> >; ColorMap = default_color_type*; SourceIterator = long unsigned int*]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:136:24: required from ‘void boost::breadth_first_search(const VertexListGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph<adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, no_property, listS>, is_residual_edge<adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_residual_capacity_t> >, keep_all>; SourceIterator = long unsigned int*; Buffer = queue<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > >; BFSVisitor = bfs_visitor<edge_predecessor_recorder<detail::edge_desc_impl<directed_tag, long unsigned int>*, on_tree_edge> >; ColorMap = default_color_type*]’
136 | breadth_first_visit(g, sources_begin, sources_end, Q, vis, color);
| ~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:147:25: required from ‘void boost::breadth_first_search(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph<adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, no_property, listS>, is_residual_edge<adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_residual_capacity_t> >, keep_all>; Buffer = queue<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > >; BFSVisitor = bfs_visitor<edge_predecessor_recorder<detail::edge_desc_impl<directed_tag, long unsigned int>*, on_tree_edge> >; ColorMap = default_color_type*; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
147 | breadth_first_search(g, sources, sources + 1, Q, vis, color);
| ~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/edmonds_karp_max_flow.hpp:101:29: required from ‘typename boost::property_traits<IndexMap>::value_type boost::edmonds_karp_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, ColorMap, PredEdgeMap) [with Graph = adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, no_property, listS>; CapacityEdgeMap = adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map<directed_tag, detail::edge_desc_impl<directed_tag, long unsigned int>, detail::edge_desc_impl<directed_tag, long unsigned int>&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_reverse_t>; ColorMap = default_color_type*; PredEdgeMap = detail::edge_desc_impl<directed_tag, long unsigned int>*; typename property_traits<IndexMap>::value_type = long unsigned int; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
101 | breadth_first_search(detail::residual_graph(g, res), src, Q,
| ~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
102 | make_bfs_visitor(record_edge_predecessors(pred, on_tree_edge())),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
103 | color);
| ~~~~~~
mincut.hpp:78:21: required from ‘typename boost::graph_traits<G>::edges_size_type boost::min_cut(VertexListGraph&, OutputIterator, OutputIterator) [with VertexListGraph = const R_adjacency_list<undirectedS, double>; OutputIterator = std::back_insert_iterator<std::vector<long unsigned int> >; typename graph_traits<G>::edges_size_type = long unsigned int]’
77 | alpha_S_k = edmonds_karp_max_flow
| ~~~~~~~~~~~~~~~~~~~~~
78 | (flow_g, p, k, cap, res_cap, rev_edge, &color[0], &pred[0]);
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
hcs.cpp:299:31: required from here
299 | min_cut(g, std::back_inserter(s_vec),
| ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
300 | std::back_inserter(vs_vec) );
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
20 | ~usage_requirements() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible<X, Y>::~Convertible() [with X = boost::adj_list_dir_traversal_tag; Y = boost::incidence_graph_tag]’
37 | ~model()
| ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
208 | BOOST_CONCEPT_USAGE(Convertible) {
| ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Convertible<boost::lvalue_property_map_tag, boost::readable_property_map_tag>]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/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(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/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> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/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))
| ^~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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);
| ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/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) );
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 12 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:66:5: required from ‘void boost::breadth_first_visit(const IncidenceGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with IncidenceGraph = filtered_graph<adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, no_property, listS>, is_residual_edge<adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_residual_capacity_t> >, keep_all>; Buffer = queue<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > >; BFSVisitor = bfs_visitor<edge_predecessor_recorder<detail::edge_desc_impl<directed_tag, long unsigned int>*, on_tree_edge> >; ColorMap = default_color_type*; SourceIterator = long unsigned int*]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:136:24: required from ‘void boost::breadth_first_search(const VertexListGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph<adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, no_property, listS>, is_residual_edge<adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_residual_capacity_t> >, keep_all>; SourceIterator = long unsigned int*; Buffer = queue<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > >; BFSVisitor = bfs_visitor<edge_predecessor_recorder<detail::edge_desc_impl<directed_tag, long unsigned int>*, on_tree_edge> >; ColorMap = default_color_type*]’
136 | breadth_first_visit(g, sources_begin, sources_end, Q, vis, color);
| ~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:147:25: required from ‘void boost::breadth_first_search(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph<adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, no_property, listS>, is_residual_edge<adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_residual_capacity_t> >, keep_all>; Buffer = queue<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > >; BFSVisitor = bfs_visitor<edge_predecessor_recorder<detail::edge_desc_impl<directed_tag, long unsigned int>*, on_tree_edge> >; ColorMap = default_color_type*; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
147 | breadth_first_search(g, sources, sources + 1, Q, vis, color);
| ~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/edmonds_karp_max_flow.hpp:101:29: required from ‘typename boost::property_traits<IndexMap>::value_type boost::edmonds_karp_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, ColorMap, PredEdgeMap) [with Graph = adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, no_property, listS>; CapacityEdgeMap = adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map<directed_tag, detail::edge_desc_impl<directed_tag, long unsigned int>, detail::edge_desc_impl<directed_tag, long unsigned int>&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_reverse_t>; ColorMap = default_color_type*; PredEdgeMap = detail::edge_desc_impl<directed_tag, long unsigned int>*; typename property_traits<IndexMap>::value_type = long unsigned int; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
101 | breadth_first_search(detail::residual_graph(g, res), src, Q,
| ~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
102 | make_bfs_visitor(record_edge_predecessors(pred, on_tree_edge())),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
103 | color);
| ~~~~~~
mincut.hpp:78:21: required from ‘typename boost::graph_traits<G>::edges_size_type boost::min_cut(VertexListGraph&, OutputIterator, OutputIterator) [with VertexListGraph = const R_adjacency_list<undirectedS, double>; OutputIterator = std::back_insert_iterator<std::vector<long unsigned int> >; typename graph_traits<G>::edges_size_type = long unsigned int]’
77 | alpha_S_k = edmonds_karp_max_flow
| ~~~~~~~~~~~~~~~~~~~~~
78 | (flow_g, p, k, cap, res_cap, rev_edge, &color[0], &pred[0]);
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
hcs.cpp:299:31: required from here
299 | min_cut(g, std::back_inserter(s_vec),
| ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
300 | std::back_inserter(vs_vec) );
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
20 | ~usage_requirements() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible<X, Y>::~Convertible() [with X = boost::lvalue_property_map_tag; Y = boost::readable_property_map_tag]’
37 | ~model()
| ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
208 | BOOST_CONCEPT_USAGE(Convertible) {
| ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Convertible<boost::lvalue_property_map_tag, boost::writable_property_map_tag>]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/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(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/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> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/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))
| ^~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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);
| ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/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) );
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 12 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:66:5: required from ‘void boost::breadth_first_visit(const IncidenceGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with IncidenceGraph = filtered_graph<adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, no_property, listS>, is_residual_edge<adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_residual_capacity_t> >, keep_all>; Buffer = queue<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > >; BFSVisitor = bfs_visitor<edge_predecessor_recorder<detail::edge_desc_impl<directed_tag, long unsigned int>*, on_tree_edge> >; ColorMap = default_color_type*; SourceIterator = long unsigned int*]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:136:24: required from ‘void boost::breadth_first_search(const VertexListGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph<adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, no_property, listS>, is_residual_edge<adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_residual_capacity_t> >, keep_all>; SourceIterator = long unsigned int*; Buffer = queue<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > >; BFSVisitor = bfs_visitor<edge_predecessor_recorder<detail::edge_desc_impl<directed_tag, long unsigned int>*, on_tree_edge> >; ColorMap = default_color_type*]’
136 | breadth_first_visit(g, sources_begin, sources_end, Q, vis, color);
| ~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:147:25: required from ‘void boost::breadth_first_search(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph<adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, no_property, listS>, is_residual_edge<adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_residual_capacity_t> >, keep_all>; Buffer = queue<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > >; BFSVisitor = bfs_visitor<edge_predecessor_recorder<detail::edge_desc_impl<directed_tag, long unsigned int>*, on_tree_edge> >; ColorMap = default_color_type*; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
147 | breadth_first_search(g, sources, sources + 1, Q, vis, color);
| ~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/edmonds_karp_max_flow.hpp:101:29: required from ‘typename boost::property_traits<IndexMap>::value_type boost::edmonds_karp_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, ColorMap, PredEdgeMap) [with Graph = adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, no_property, listS>; CapacityEdgeMap = adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map<directed_tag, detail::edge_desc_impl<directed_tag, long unsigned int>, detail::edge_desc_impl<directed_tag, long unsigned int>&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_reverse_t>; ColorMap = default_color_type*; PredEdgeMap = detail::edge_desc_impl<directed_tag, long unsigned int>*; typename property_traits<IndexMap>::value_type = long unsigned int; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
101 | breadth_first_search(detail::residual_graph(g, res), src, Q,
| ~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
102 | make_bfs_visitor(record_edge_predecessors(pred, on_tree_edge())),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
103 | color);
| ~~~~~~
mincut.hpp:78:21: required from ‘typename boost::graph_traits<G>::edges_size_type boost::min_cut(VertexListGraph&, OutputIterator, OutputIterator) [with VertexListGraph = const R_adjacency_list<undirectedS, double>; OutputIterator = std::back_insert_iterator<std::vector<long unsigned int> >; typename graph_traits<G>::edges_size_type = long unsigned int]’
77 | alpha_S_k = edmonds_karp_max_flow
| ~~~~~~~~~~~~~~~~~~~~~
78 | (flow_g, p, k, cap, res_cap, rev_edge, &color[0], &pred[0]);
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
hcs.cpp:299:31: required from here
299 | min_cut(g, std::back_inserter(s_vec),
| ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
300 | std::back_inserter(vs_vec) );
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
20 | ~usage_requirements() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible<X, Y>::~Convertible() [with X = boost::lvalue_property_map_tag; Y = boost::writable_property_map_tag]’
37 | ~model()
| ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
208 | BOOST_CONCEPT_USAGE(Convertible) {
| ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::DefaultConstructible<long unsigned int>]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::DefaultConstructible<long unsigned int> >]’
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:137:5: required from ‘struct boost::DefaultConstructible<long unsigned int>’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::DefaultConstructible<long unsigned int>]’
32 | inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
| ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied<boost::DefaultConstructible<long unsigned int> >::value’
44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied<boost::DefaultConstructible<long unsigned int> >’
45 | typedef boost::integral_constant<bool, value> type;
| ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 11 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:62:5: required from ‘void boost::breadth_first_visit(const IncidenceGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with IncidenceGraph = filtered_graph<adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, no_property, listS>, is_residual_edge<adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_residual_capacity_t> >, keep_all>; Buffer = queue<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > >; BFSVisitor = bfs_visitor<edge_predecessor_recorder<detail::edge_desc_impl<directed_tag, long unsigned int>*, on_tree_edge> >; ColorMap = default_color_type*; SourceIterator = long unsigned int*]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:136:24: required from ‘void boost::breadth_first_search(const VertexListGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph<adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, no_property, listS>, is_residual_edge<adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_residual_capacity_t> >, keep_all>; SourceIterator = long unsigned int*; Buffer = queue<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > >; BFSVisitor = bfs_visitor<edge_predecessor_recorder<detail::edge_desc_impl<directed_tag, long unsigned int>*, on_tree_edge> >; ColorMap = default_color_type*]’
136 | breadth_first_visit(g, sources_begin, sources_end, Q, vis, color);
| ~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:147:25: required from ‘void boost::breadth_first_search(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph<adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, no_property, listS>, is_residual_edge<adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_residual_capacity_t> >, keep_all>; Buffer = queue<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > >; BFSVisitor = bfs_visitor<edge_predecessor_recorder<detail::edge_desc_impl<directed_tag, long unsigned int>*, on_tree_edge> >; ColorMap = default_color_type*; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
147 | breadth_first_search(g, sources, sources + 1, Q, vis, color);
| ~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/edmonds_karp_max_flow.hpp:101:29: required from ‘typename boost::property_traits<IndexMap>::value_type boost::edmonds_karp_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, ColorMap, PredEdgeMap) [with Graph = adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, no_property, listS>; CapacityEdgeMap = adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map<directed_tag, detail::edge_desc_impl<directed_tag, long unsigned int>, detail::edge_desc_impl<directed_tag, long unsigned int>&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_reverse_t>; ColorMap = default_color_type*; PredEdgeMap = detail::edge_desc_impl<directed_tag, long unsigned int>*; typename property_traits<IndexMap>::value_type = long unsigned int; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
101 | breadth_first_search(detail::residual_graph(g, res), src, Q,
| ~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
102 | make_bfs_visitor(record_edge_predecessors(pred, on_tree_edge())),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
103 | color);
| ~~~~~~
mincut.hpp:78:21: required from ‘typename boost::graph_traits<G>::edges_size_type boost::min_cut(VertexListGraph&, OutputIterator, OutputIterator) [with VertexListGraph = const R_adjacency_list<undirectedS, double>; OutputIterator = std::back_insert_iterator<std::vector<long unsigned int> >; typename graph_traits<G>::edges_size_type = long unsigned int]’
77 | alpha_S_k = edmonds_karp_max_flow
| ~~~~~~~~~~~~~~~~~~~~~
78 | (flow_g, p, k, cap, res_cap, rev_edge, &color[0], &pred[0]);
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
hcs.cpp:299:31: required from here
299 | min_cut(g, std::back_inserter(s_vec),
| ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
300 | std::back_inserter(vs_vec) );
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
20 | ~usage_requirements() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::DefaultConstructible<TT>::~DefaultConstructible() [with TT = long unsigned int]’
37 | ~model()
| ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:137:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
137 | BOOST_CONCEPT_USAGE(DefaultConstructible) {
| ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::EqualityComparable<long unsigned int>]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::EqualityComparable<long unsigned int> >]’
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable<long unsigned int>’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::EqualityComparable<long unsigned int>]’
32 | inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
| ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied<boost::EqualityComparable<long unsigned int> >::value’
44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied<boost::EqualityComparable<long unsigned int> >’
45 | typedef boost::integral_constant<bool, value> type;
| ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 11 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:62:5: required from ‘void boost::breadth_first_visit(const IncidenceGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with IncidenceGraph = filtered_graph<adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, no_property, listS>, is_residual_edge<adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_residual_capacity_t> >, keep_all>; Buffer = queue<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > >; BFSVisitor = bfs_visitor<edge_predecessor_recorder<detail::edge_desc_impl<directed_tag, long unsigned int>*, on_tree_edge> >; ColorMap = default_color_type*; SourceIterator = long unsigned int*]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:136:24: required from ‘void boost::breadth_first_search(const VertexListGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph<adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, no_property, listS>, is_residual_edge<adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_residual_capacity_t> >, keep_all>; SourceIterator = long unsigned int*; Buffer = queue<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > >; BFSVisitor = bfs_visitor<edge_predecessor_recorder<detail::edge_desc_impl<directed_tag, long unsigned int>*, on_tree_edge> >; ColorMap = default_color_type*]’
136 | breadth_first_visit(g, sources_begin, sources_end, Q, vis, color);
| ~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:147:25: required from ‘void boost::breadth_first_search(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph<adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, no_property, listS>, is_residual_edge<adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_residual_capacity_t> >, keep_all>; Buffer = queue<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > >; BFSVisitor = bfs_visitor<edge_predecessor_recorder<detail::edge_desc_impl<directed_tag, long unsigned int>*, on_tree_edge> >; ColorMap = default_color_type*; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
147 | breadth_first_search(g, sources, sources + 1, Q, vis, color);
| ~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/edmonds_karp_max_flow.hpp:101:29: required from ‘typename boost::property_traits<IndexMap>::value_type boost::edmonds_karp_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, ColorMap, PredEdgeMap) [with Graph = adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, no_property, listS>; CapacityEdgeMap = adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map<directed_tag, detail::edge_desc_impl<directed_tag, long unsigned int>, detail::edge_desc_impl<directed_tag, long unsigned int>&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_reverse_t>; ColorMap = default_color_type*; PredEdgeMap = detail::edge_desc_impl<directed_tag, long unsigned int>*; typename property_traits<IndexMap>::value_type = long unsigned int; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
101 | breadth_first_search(detail::residual_graph(g, res), src, Q,
| ~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
102 | make_bfs_visitor(record_edge_predecessors(pred, on_tree_edge())),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
103 | color);
| ~~~~~~
mincut.hpp:78:21: required from ‘typename boost::graph_traits<G>::edges_size_type boost::min_cut(VertexListGraph&, OutputIterator, OutputIterator) [with VertexListGraph = const R_adjacency_list<undirectedS, double>; OutputIterator = std::back_insert_iterator<std::vector<long unsigned int> >; typename graph_traits<G>::edges_size_type = long unsigned int]’
77 | alpha_S_k = edmonds_karp_max_flow
| ~~~~~~~~~~~~~~~~~~~~~
78 | (flow_g, p, k, cap, res_cap, rev_edge, &color[0], &pred[0]);
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
hcs.cpp:299:31: required from here
299 | min_cut(g, std::back_inserter(s_vec),
| ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
300 | std::back_inserter(vs_vec) );
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
20 | ~usage_requirements() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::EqualityComparable<TT>::~EqualityComparable() [with TT = long unsigned int]’
37 | ~model()
| ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:233:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
233 | BOOST_CONCEPT_USAGE(EqualityComparable) {
| ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Assignable<long unsigned int>]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Assignable<long unsigned int> >]’
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:145:5: required from ‘struct boost::Assignable<long unsigned int>’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::Assignable<long unsigned int>]’
32 | inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
| ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied<boost::Assignable<long unsigned int> >::value’
44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied<boost::Assignable<long unsigned int> >’
45 | typedef boost::integral_constant<bool, value> type;
| ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 11 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:62:5: required from ‘void boost::breadth_first_visit(const IncidenceGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with IncidenceGraph = filtered_graph<adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, no_property, listS>, is_residual_edge<adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_residual_capacity_t> >, keep_all>; Buffer = queue<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > >; BFSVisitor = bfs_visitor<edge_predecessor_recorder<detail::edge_desc_impl<directed_tag, long unsigned int>*, on_tree_edge> >; ColorMap = default_color_type*; SourceIterator = long unsigned int*]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:136:24: required from ‘void boost::breadth_first_search(const VertexListGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph<adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, no_property, listS>, is_residual_edge<adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_residual_capacity_t> >, keep_all>; SourceIterator = long unsigned int*; Buffer = queue<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > >; BFSVisitor = bfs_visitor<edge_predecessor_recorder<detail::edge_desc_impl<directed_tag, long unsigned int>*, on_tree_edge> >; ColorMap = default_color_type*]’
136 | breadth_first_visit(g, sources_begin, sources_end, Q, vis, color);
| ~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:147:25: required from ‘void boost::breadth_first_search(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph<adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, no_property, listS>, is_residual_edge<adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_residual_capacity_t> >, keep_all>; Buffer = queue<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > >; BFSVisitor = bfs_visitor<edge_predecessor_recorder<detail::edge_desc_impl<directed_tag, long unsigned int>*, on_tree_edge> >; ColorMap = default_color_type*; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
147 | breadth_first_search(g, sources, sources + 1, Q, vis, color);
| ~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/edmonds_karp_max_flow.hpp:101:29: required from ‘typename boost::property_traits<IndexMap>::value_type boost::edmonds_karp_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, ColorMap, PredEdgeMap) [with Graph = adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, no_property, listS>; CapacityEdgeMap = adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map<directed_tag, detail::edge_desc_impl<directed_tag, long unsigned int>, detail::edge_desc_impl<directed_tag, long unsigned int>&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_reverse_t>; ColorMap = default_color_type*; PredEdgeMap = detail::edge_desc_impl<directed_tag, long unsigned int>*; typename property_traits<IndexMap>::value_type = long unsigned int; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
101 | breadth_first_search(detail::residual_graph(g, res), src, Q,
| ~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
102 | make_bfs_visitor(record_edge_predecessors(pred, on_tree_edge())),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
103 | color);
| ~~~~~~
mincut.hpp:78:21: required from ‘typename boost::graph_traits<G>::edges_size_type boost::min_cut(VertexListGraph&, OutputIterator, OutputIterator) [with VertexListGraph = const R_adjacency_list<undirectedS, double>; OutputIterator = std::back_insert_iterator<std::vector<long unsigned int> >; typename graph_traits<G>::edges_size_type = long unsigned int]’
77 | alpha_S_k = edmonds_karp_max_flow
| ~~~~~~~~~~~~~~~~~~~~~
78 | (flow_g, p, k, cap, res_cap, rev_edge, &color[0], &pred[0]);
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
hcs.cpp:299:31: required from here
299 | min_cut(g, std::back_inserter(s_vec),
| ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
300 | std::back_inserter(vs_vec) );
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
20 | ~usage_requirements() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Assignable<TT>::~Assignable() [with TT = long unsigned int]’
37 | ~model()
| ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:145:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
145 | BOOST_CONCEPT_USAGE(Assignable) {
| ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Assignable<boost::iterators::filter_iterator<boost::detail::out_edge_predicate<boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long unsigned int, long unsigned int&, long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::no_property, boost::listS>, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long unsigned int, long unsigned int&, long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int> > > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:145:5: required from ‘struct boost::Assignable<boost::iterators::filter_iterator<boost::detail::out_edge_predicate<boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long unsigned int, long unsigned int&, long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::no_property, boost::listS>, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long unsigned int, long unsigned int&, long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int> > >’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator<boost::iterators::filter_iterator<boost::detail::out_edge_predicate<boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long unsigned int, long unsigned int&, long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::no_property, boost::listS>, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long unsigned int, long unsigned int&, long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int> > >’
502 | BOOST_concept(InputIterator,(TT))
| ^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::InputIterator<boost::iterators::filter_iterator<boost::detail::out_edge_predicate<boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long unsigned int, long unsigned int&, long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::no_property, boost::listS>, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long unsigned int, long unsigned int&, long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int> > >]’
32 | inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
| ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied<boost::InputIterator<boost::iterators::filter_iterator<boost::detail::out_edge_predicate<boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long unsigned int, long unsigned int&, long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::no_property, boost::listS>, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long unsigned int, long unsigned int&, long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int> > > >::value’
44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied<boost::InputIterator<boost::iterators::filter_iterator<boost::detail::out_edge_predicate<boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long unsigned int, long unsigned int&, long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::no_property, boost::listS>, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long unsigned int, long unsigned int&, long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int> > > >’
45 | typedef boost::integral_constant<bool, value> type;
| ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:62:5: required from ‘void boost::breadth_first_visit(const IncidenceGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with IncidenceGraph = filtered_graph<adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, no_property, listS>, is_residual_edge<adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_residual_capacity_t> >, keep_all>; Buffer = queue<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > >; BFSVisitor = bfs_visitor<edge_predecessor_recorder<detail::edge_desc_impl<directed_tag, long unsigned int>*, on_tree_edge> >; ColorMap = default_color_type*; SourceIterator = long unsigned int*]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:136:24: required from ‘void boost::breadth_first_search(const VertexListGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph<adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, no_property, listS>, is_residual_edge<adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_residual_capacity_t> >, keep_all>; SourceIterator = long unsigned int*; Buffer = queue<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > >; BFSVisitor = bfs_visitor<edge_predecessor_recorder<detail::edge_desc_impl<directed_tag, long unsigned int>*, on_tree_edge> >; ColorMap = default_color_type*]’
136 | breadth_first_visit(g, sources_begin, sources_end, Q, vis, color);
| ~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:147:25: required from ‘void boost::breadth_first_search(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph<adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, no_property, listS>, is_residual_edge<adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_residual_capacity_t> >, keep_all>; Buffer = queue<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > >; BFSVisitor = bfs_visitor<edge_predecessor_recorder<detail::edge_desc_impl<directed_tag, long unsigned int>*, on_tree_edge> >; ColorMap = default_color_type*; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
147 | breadth_first_search(g, sources, sources + 1, Q, vis, color);
| ~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/edmonds_karp_max_flow.hpp:101:29: required from ‘typename boost::property_traits<IndexMap>::value_type boost::edmonds_karp_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, ColorMap, PredEdgeMap) [with Graph = adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, no_property, listS>; CapacityEdgeMap = adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map<directed_tag, detail::edge_desc_impl<directed_tag, long unsigned int>, detail::edge_desc_impl<directed_tag, long unsigned int>&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_reverse_t>; ColorMap = default_color_type*; PredEdgeMap = detail::edge_desc_impl<directed_tag, long unsigned int>*; typename property_traits<IndexMap>::value_type = long unsigned int; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
101 | breadth_first_search(detail::residual_graph(g, res), src, Q,
| ~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
102 | make_bfs_visitor(record_edge_predecessors(pred, on_tree_edge())),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
103 | color);
| ~~~~~~
mincut.hpp:78:21: required from ‘typename boost::graph_traits<G>::edges_size_type boost::min_cut(VertexListGraph&, OutputIterator, OutputIterator) [with VertexListGraph = const R_adjacency_list<undirectedS, double>; OutputIterator = std::back_insert_iterator<std::vector<long unsigned int> >; typename graph_traits<G>::edges_size_type = long unsigned int]’
77 | alpha_S_k = edmonds_karp_max_flow
| ~~~~~~~~~~~~~~~~~~~~~
78 | (flow_g, p, k, cap, res_cap, rev_edge, &color[0], &pred[0]);
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
hcs.cpp:299:31: required from here
299 | min_cut(g, std::back_inserter(s_vec),
| ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
300 | std::back_inserter(vs_vec) );
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Assignable<boost::iterators::filter_iterator<boost::detail::out_edge_predicate<boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long unsigned int, long unsigned int&, long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::no_property, boost::listS>, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long unsigned int, long unsigned int&, long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int> > >]’
20 | ~usage_requirements() { ((Model*)0)->~Model(); }
| ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::EqualityComparable<boost::iterators::filter_iterator<boost::detail::out_edge_predicate<boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long unsigned int, long unsigned int&, long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::no_property, boost::listS>, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long unsigned int, long unsigned int&, long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int> > > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable<boost::iterators::filter_iterator<boost::detail::out_edge_predicate<boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long unsigned int, long unsigned int&, long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::no_property, boost::listS>, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long unsigned int, long unsigned int&, long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int> > >’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator<boost::iterators::filter_iterator<boost::detail::out_edge_predicate<boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long unsigned int, long unsigned int&, long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::no_property, boost::listS>, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long unsigned int, long unsigned int&, long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int> > >’
502 | BOOST_concept(InputIterator,(TT))
| ^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::InputIterator<boost::iterators::filter_iterator<boost::detail::out_edge_predicate<boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long unsigned int, long unsigned int&, long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::no_property, boost::listS>, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long unsigned int, long unsigned int&, long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int> > >]’
32 | inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
| ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied<boost::InputIterator<boost::iterators::filter_iterator<boost::detail::out_edge_predicate<boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long unsigned int, long unsigned int&, long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::no_property, boost::listS>, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long unsigned int, long unsigned int&, long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int> > > >::value’
44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied<boost::InputIterator<boost::iterators::filter_iterator<boost::detail::out_edge_predicate<boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long unsigned int, long unsigned int&, long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::no_property, boost::listS>, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long unsigned int, long unsigned int&, long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int> > > >’
45 | typedef boost::integral_constant<bool, value> type;
| ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:62:5: required from ‘void boost::breadth_first_visit(const IncidenceGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with IncidenceGraph = filtered_graph<adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, no_property, listS>, is_residual_edge<adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_residual_capacity_t> >, keep_all>; Buffer = queue<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > >; BFSVisitor = bfs_visitor<edge_predecessor_recorder<detail::edge_desc_impl<directed_tag, long unsigned int>*, on_tree_edge> >; ColorMap = default_color_type*; SourceIterator = long unsigned int*]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:136:24: required from ‘void boost::breadth_first_search(const VertexListGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph<adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, no_property, listS>, is_residual_edge<adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_residual_capacity_t> >, keep_all>; SourceIterator = long unsigned int*; Buffer = queue<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > >; BFSVisitor = bfs_visitor<edge_predecessor_recorder<detail::edge_desc_impl<directed_tag, long unsigned int>*, on_tree_edge> >; ColorMap = default_color_type*]’
136 | breadth_first_visit(g, sources_begin, sources_end, Q, vis, color);
| ~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:147:25: required from ‘void boost::breadth_first_search(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph<adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, no_property, listS>, is_residual_edge<adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_residual_capacity_t> >, keep_all>; Buffer = queue<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > >; BFSVisitor = bfs_visitor<edge_predecessor_recorder<detail::edge_desc_impl<directed_tag, long unsigned int>*, on_tree_edge> >; ColorMap = default_color_type*; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
147 | breadth_first_search(g, sources, sources + 1, Q, vis, color);
| ~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/edmonds_karp_max_flow.hpp:101:29: required from ‘typename boost::property_traits<IndexMap>::value_type boost::edmonds_karp_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, ColorMap, PredEdgeMap) [with Graph = adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, no_property, listS>; CapacityEdgeMap = adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map<directed_tag, detail::edge_desc_impl<directed_tag, long unsigned int>, detail::edge_desc_impl<directed_tag, long unsigned int>&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_reverse_t>; ColorMap = default_color_type*; PredEdgeMap = detail::edge_desc_impl<directed_tag, long unsigned int>*; typename property_traits<IndexMap>::value_type = long unsigned int; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
101 | breadth_first_search(detail::residual_graph(g, res), src, Q,
| ~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
102 | make_bfs_visitor(record_edge_predecessors(pred, on_tree_edge())),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
103 | color);
| ~~~~~~
mincut.hpp:78:21: required from ‘typename boost::graph_traits<G>::edges_size_type boost::min_cut(VertexListGraph&, OutputIterator, OutputIterator) [with VertexListGraph = const R_adjacency_list<undirectedS, double>; OutputIterator = std::back_insert_iterator<std::vector<long unsigned int> >; typename graph_traits<G>::edges_size_type = long unsigned int]’
77 | alpha_S_k = edmonds_karp_max_flow
| ~~~~~~~~~~~~~~~~~~~~~
78 | (flow_g, p, k, cap, res_cap, rev_edge, &color[0], &pred[0]);
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
hcs.cpp:299:31: required from here
299 | min_cut(g, std::back_inserter(s_vec),
| ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
300 | std::back_inserter(vs_vec) );
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::EqualityComparable<boost::iterators::filter_iterator<boost::detail::out_edge_predicate<boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long unsigned int, long unsigned int&, long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::no_property, boost::listS>, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long unsigned int, long unsigned int&, long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int> > >]’
20 | ~usage_requirements() { ((Model*)0)->~Model(); }
| ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::InputIterator<boost::iterators::filter_iterator<boost::detail::out_edge_predicate<boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long unsigned int, long unsigned int&, long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::no_property, boost::listS>, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long unsigned int, long unsigned int&, long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int> > > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:512:7: required from ‘struct boost::InputIterator<boost::iterators::filter_iterator<boost::detail::out_edge_predicate<boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long unsigned int, long unsigned int&, long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::no_property, boost::listS>, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long unsigned int, long unsigned int&, long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int> > >’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::InputIterator<boost::iterators::filter_iterator<boost::detail::out_edge_predicate<boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long unsigned int, long unsigned int&, long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::no_property, boost::listS>, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long unsigned int, long unsigned int&, long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int> > >]’
32 | inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
| ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied<boost::InputIterator<boost::iterators::filter_iterator<boost::detail::out_edge_predicate<boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long unsigned int, long unsigned int&, long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::no_property, boost::listS>, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long unsigned int, long unsigned int&, long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int> > > >::value’
44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied<boost::InputIterator<boost::iterators::filter_iterator<boost::detail::out_edge_predicate<boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long unsigned int, long unsigned int&, long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::no_property, boost::listS>, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long unsigned int, long unsigned int&, long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int> > > >’
45 | typedef boost::integral_constant<bool, value> type;
| ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_<void (*)(boost::InputIterator<boost::iterators::filter_iterator<boost::detail::out_edge_predicate<boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long unsigned int, long unsigned int&, long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::no_property, boost::listS>, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long unsigned int, long unsigned int&, long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int> > >)>’
72 | struct requirement_<void(*)(Model)>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:53:35: [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:62:5: required from ‘void boost::breadth_first_visit(const IncidenceGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with IncidenceGraph = filtered_graph<adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, no_property, listS>, is_residual_edge<adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_residual_capacity_t> >, keep_all>; Buffer = queue<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > >; BFSVisitor = bfs_visitor<edge_predecessor_recorder<detail::edge_desc_impl<directed_tag, long unsigned int>*, on_tree_edge> >; ColorMap = default_color_type*; SourceIterator = long unsigned int*]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:136:24: required from ‘void boost::breadth_first_search(const VertexListGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph<adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, no_property, listS>, is_residual_edge<adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_residual_capacity_t> >, keep_all>; SourceIterator = long unsigned int*; Buffer = queue<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > >; BFSVisitor = bfs_visitor<edge_predecessor_recorder<detail::edge_desc_impl<directed_tag, long unsigned int>*, on_tree_edge> >; ColorMap = default_color_type*]’
136 | breadth_first_visit(g, sources_begin, sources_end, Q, vis, color);
| ~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:147:25: required from ‘void boost::breadth_first_search(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph<adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, no_property, listS>, is_residual_edge<adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_residual_capacity_t> >, keep_all>; Buffer = queue<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > >; BFSVisitor = bfs_visitor<edge_predecessor_recorder<detail::edge_desc_impl<directed_tag, long unsigned int>*, on_tree_edge> >; ColorMap = default_color_type*; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
147 | breadth_first_search(g, sources, sources + 1, Q, vis, color);
| ~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/edmonds_karp_max_flow.hpp:101:29: required from ‘typename boost::property_traits<IndexMap>::value_type boost::edmonds_karp_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, ColorMap, PredEdgeMap) [with Graph = adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, no_property, listS>; CapacityEdgeMap = adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map<directed_tag, detail::edge_desc_impl<directed_tag, long unsigned int>, detail::edge_desc_impl<directed_tag, long unsigned int>&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_reverse_t>; ColorMap = default_color_type*; PredEdgeMap = detail::edge_desc_impl<directed_tag, long unsigned int>*; typename property_traits<IndexMap>::value_type = long unsigned int; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
101 | breadth_first_search(detail::residual_graph(g, res), src, Q,
| ~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
102 | make_bfs_visitor(record_edge_predecessors(pred, on_tree_edge())),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
103 | color);
| ~~~~~~
mincut.hpp:78:21: required from ‘typename boost::graph_traits<G>::edges_size_type boost::min_cut(VertexListGraph&, OutputIterator, OutputIterator) [with VertexListGraph = const R_adjacency_list<undirectedS, double>; OutputIterator = std::back_insert_iterator<std::vector<long unsigned int> >; typename graph_traits<G>::edges_size_type = long unsigned int]’
77 | alpha_S_k = edmonds_karp_max_flow
| ~~~~~~~~~~~~~~~~~~~~~
78 | (flow_g, p, k, cap, res_cap, rev_edge, &color[0], &pred[0]);
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
hcs.cpp:299:31: required from here
299 | min_cut(g, std::back_inserter(s_vec),
| ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
300 | std::back_inserter(vs_vec) );
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::InputIterator<boost::iterators::filter_iterator<boost::detail::out_edge_predicate<boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long unsigned int, long unsigned int&, long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::no_property, boost::listS>, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long unsigned int, long unsigned int&, long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int> > >]’
20 | ~usage_requirements() { ((Model*)0)->~Model(); }
| ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::InputIterator<boost::iterators::filter_iterator<boost::detail::out_edge_predicate<boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long unsigned int, long unsigned int&, long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::no_property, boost::listS>, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long unsigned int, long unsigned int&, long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int> > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:53:35: required from ‘boost::concepts::MultiPassInputIterator<T>::~MultiPassInputIterator() [with T = boost::iterators::filter_iterator<boost::detail::out_edge_predicate<boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long unsigned int, long unsigned int&, long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::no_property, boost::listS>, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long unsigned int, long unsigned int&, long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int> >]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::MultiPassInputIterator<boost::iterators::filter_iterator<boost::detail::out_edge_predicate<boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long unsigned int, long unsigned int&, long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::no_property, boost::listS>, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long unsigned int, long unsigned int&, long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int> > >]’
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:89:9: required from ‘boost::concepts::IncidenceGraph<G>::~IncidenceGraph() [with G = boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::no_property, boost::listS>, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long unsigned int, long unsigned int&, long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all>]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:75:1: required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::IncidenceGraphConcept<boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::no_property, boost::listS>, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long unsigned int, long unsigned int&, long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >]’
75 | BOOST_concept(IncidenceGraph, (G)) : Graph< G >
| ^~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:62:5: required from ‘void boost::breadth_first_visit(const IncidenceGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with IncidenceGraph = filtered_graph<adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, no_property, listS>, is_residual_edge<adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_residual_capacity_t> >, keep_all>; Buffer = queue<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > >; BFSVisitor = bfs_visitor<edge_predecessor_recorder<detail::edge_desc_impl<directed_tag, long unsigned int>*, on_tree_edge> >; ColorMap = default_color_type*; SourceIterator = long unsigned int*]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:136:24: required from ‘void boost::breadth_first_search(const VertexListGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph<adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, no_property, listS>, is_residual_edge<adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_residual_capacity_t> >, keep_all>; SourceIterator = long unsigned int*; Buffer = queue<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > >; BFSVisitor = bfs_visitor<edge_predecessor_recorder<detail::edge_desc_impl<directed_tag, long unsigned int>*, on_tree_edge> >; ColorMap = default_color_type*]’
136 | breadth_first_visit(g, sources_begin, sources_end, Q, vis, color);
| ~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:147:25: required from ‘void boost::breadth_first_search(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph<adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, no_property, listS>, is_residual_edge<adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_residual_capacity_t> >, keep_all>; Buffer = queue<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > >; BFSVisitor = bfs_visitor<edge_predecessor_recorder<detail::edge_desc_impl<directed_tag, long unsigned int>*, on_tree_edge> >; ColorMap = default_color_type*; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
147 | breadth_first_search(g, sources, sources + 1, Q, vis, color);
| ~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/edmonds_karp_max_flow.hpp:101:29: required from ‘typename boost::property_traits<IndexMap>::value_type boost::edmonds_karp_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, ColorMap, PredEdgeMap) [with Graph = adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, no_property, listS>; CapacityEdgeMap = adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map<directed_tag, detail::edge_desc_impl<directed_tag, long unsigned int>, detail::edge_desc_impl<directed_tag, long unsigned int>&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_reverse_t>; ColorMap = default_color_type*; PredEdgeMap = detail::edge_desc_impl<directed_tag, long unsigned int>*; typename property_traits<IndexMap>::value_type = long unsigned int; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
101 | breadth_first_search(detail::residual_graph(g, res), src, Q,
| ~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
102 | make_bfs_visitor(record_edge_predecessors(pred, on_tree_edge())),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
103 | color);
| ~~~~~~
mincut.hpp:78:21: required from ‘typename boost::graph_traits<G>::edges_size_type boost::min_cut(VertexListGraph&, OutputIterator, OutputIterator) [with VertexListGraph = const R_adjacency_list<undirectedS, double>; OutputIterator = std::back_insert_iterator<std::vector<long unsigned int> >; typename graph_traits<G>::edges_size_type = long unsigned int]’
77 | alpha_S_k = edmonds_karp_max_flow
| ~~~~~~~~~~~~~~~~~~~~~
78 | (flow_g, p, k, cap, res_cap, rev_edge, &color[0], &pred[0]);
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
hcs.cpp:299:31: required from here
299 | min_cut(g, std::back_inserter(s_vec),
| ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
300 | std::back_inserter(vs_vec) );
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::InputIterator<TT>::~InputIterator() [with TT = boost::iterators::filter_iterator<boost::detail::out_edge_predicate<boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long unsigned int, long unsigned int&, long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::no_property, boost::listS>, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long unsigned int, long unsigned int&, long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int> >]’
37 | ~model()
| ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:512:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
512 | BOOST_CONCEPT_USAGE(InputIterator)
| ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Assignable<boost::iterators::filter_iterator<boost::detail::out_edge_predicate<boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long unsigned int, long unsigned int&, long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::no_property, boost::listS>, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long unsigned int, long unsigned int&, long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int> > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Assignable<boost::iterators::filter_iterator<boost::detail::out_edge_predicate<boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long unsigned int, long unsigned int&, long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::no_property, boost::listS>, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long unsigned int, long unsigned int&, long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int> > > >]’
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:145:5: required from ‘struct boost::Assignable<boost::iterators::filter_iterator<boost::detail::out_edge_predicate<boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long unsigned int, long unsigned int&, long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::no_property, boost::listS>, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long unsigned int, long unsigned int&, long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int> > >’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator<boost::iterators::filter_iterator<boost::detail::out_edge_predicate<boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long unsigned int, long unsigned int&, long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::no_property, boost::listS>, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long unsigned int, long unsigned int&, long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int> > >’
502 | BOOST_concept(InputIterator,(TT))
| ^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::InputIterator<boost::iterators::filter_iterator<boost::detail::out_edge_predicate<boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long unsigned int, long unsigned int&, long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::no_property, boost::listS>, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long unsigned int, long unsigned int&, long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int> > >]’
32 | inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
| ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied<boost::InputIterator<boost::iterators::filter_iterator<boost::detail::out_edge_predicate<boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long unsigned int, long unsigned int&, long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::no_property, boost::listS>, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long unsigned int, long unsigned int&, long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int> > > >::value’
44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 6 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:62:5: required from ‘void boost::breadth_first_visit(const IncidenceGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with IncidenceGraph = filtered_graph<adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, no_property, listS>, is_residual_edge<adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_residual_capacity_t> >, keep_all>; Buffer = queue<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > >; BFSVisitor = bfs_visitor<edge_predecessor_recorder<detail::edge_desc_impl<directed_tag, long unsigned int>*, on_tree_edge> >; ColorMap = default_color_type*; SourceIterator = long unsigned int*]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:136:24: required from ‘void boost::breadth_first_search(const VertexListGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph<adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, no_property, listS>, is_residual_edge<adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_residual_capacity_t> >, keep_all>; SourceIterator = long unsigned int*; Buffer = queue<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > >; BFSVisitor = bfs_visitor<edge_predecessor_recorder<detail::edge_desc_impl<directed_tag, long unsigned int>*, on_tree_edge> >; ColorMap = default_color_type*]’
136 | breadth_first_visit(g, sources_begin, sources_end, Q, vis, color);
| ~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:147:25: required from ‘void boost::breadth_first_search(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph<adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, no_property, listS>, is_residual_edge<adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_residual_capacity_t> >, keep_all>; Buffer = queue<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > >; BFSVisitor = bfs_visitor<edge_predecessor_recorder<detail::edge_desc_impl<directed_tag, long unsigned int>*, on_tree_edge> >; ColorMap = default_color_type*; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
147 | breadth_first_search(g, sources, sources + 1, Q, vis, color);
| ~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/edmonds_karp_max_flow.hpp:101:29: required from ‘typename boost::property_traits<IndexMap>::value_type boost::edmonds_karp_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, ColorMap, PredEdgeMap) [with Graph = adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, no_property, listS>; CapacityEdgeMap = adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map<directed_tag, detail::edge_desc_impl<directed_tag, long unsigned int>, detail::edge_desc_impl<directed_tag, long unsigned int>&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_reverse_t>; ColorMap = default_color_type*; PredEdgeMap = detail::edge_desc_impl<directed_tag, long unsigned int>*; typename property_traits<IndexMap>::value_type = long unsigned int; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
101 | breadth_first_search(detail::residual_graph(g, res), src, Q,
| ~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
102 | make_bfs_visitor(record_edge_predecessors(pred, on_tree_edge())),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
103 | color);
| ~~~~~~
mincut.hpp:78:21: required from ‘typename boost::graph_traits<G>::edges_size_type boost::min_cut(VertexListGraph&, OutputIterator, OutputIterator) [with VertexListGraph = const R_adjacency_list<undirectedS, double>; OutputIterator = std::back_insert_iterator<std::vector<long unsigned int> >; typename graph_traits<G>::edges_size_type = long unsigned int]’
77 | alpha_S_k = edmonds_karp_max_flow
| ~~~~~~~~~~~~~~~~~~~~~
78 | (flow_g, p, k, cap, res_cap, rev_edge, &color[0], &pred[0]);
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
hcs.cpp:299:31: required from here
299 | min_cut(g, std::back_inserter(s_vec),
| ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
300 | std::back_inserter(vs_vec) );
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
20 | ~usage_requirements() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Assignable<TT>::~Assignable() [with TT = boost::iterators::filter_iterator<boost::detail::out_edge_predicate<boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long unsigned int, long unsigned int&, long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::no_property, boost::listS>, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long unsigned int, long unsigned int&, long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int> >]’
37 | ~model()
| ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:145:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
145 | BOOST_CONCEPT_USAGE(Assignable) {
| ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::EqualityComparable<boost::iterators::filter_iterator<boost::detail::out_edge_predicate<boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long unsigned int, long unsigned int&, long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::no_property, boost::listS>, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long unsigned int, long unsigned int&, long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int> > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::EqualityComparable<boost::iterators::filter_iterator<boost::detail::out_edge_predicate<boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long unsigned int, long unsigned int&, long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::no_property, boost::listS>, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long unsigned int, long unsigned int&, long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int> > > >]’
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable<boost::iterators::filter_iterator<boost::detail::out_edge_predicate<boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long unsigned int, long unsigned int&, long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::no_property, boost::listS>, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long unsigned int, long unsigned int&, long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int> > >’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator<boost::iterators::filter_iterator<boost::detail::out_edge_predicate<boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long unsigned int, long unsigned int&, long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::no_property, boost::listS>, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long unsigned int, long unsigned int&, long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int> > >’
502 | BOOST_concept(InputIterator,(TT))
| ^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::InputIterator<boost::iterators::filter_iterator<boost::detail::out_edge_predicate<boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long unsigned int, long unsigned int&, long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::no_property, boost::listS>, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long unsigned int, long unsigned int&, long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int> > >]’
32 | inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
| ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied<boost::InputIterator<boost::iterators::filter_iterator<boost::detail::out_edge_predicate<boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long unsigned int, long unsigned int&, long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::no_property, boost::listS>, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long unsigned int, long unsigned int&, long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int> > > >::value’
44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 6 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:62:5: required from ‘void boost::breadth_first_visit(const IncidenceGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with IncidenceGraph = filtered_graph<adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, no_property, listS>, is_residual_edge<adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_residual_capacity_t> >, keep_all>; Buffer = queue<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > >; BFSVisitor = bfs_visitor<edge_predecessor_recorder<detail::edge_desc_impl<directed_tag, long unsigned int>*, on_tree_edge> >; ColorMap = default_color_type*; SourceIterator = long unsigned int*]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:136:24: required from ‘void boost::breadth_first_search(const VertexListGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph<adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, no_property, listS>, is_residual_edge<adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_residual_capacity_t> >, keep_all>; SourceIterator = long unsigned int*; Buffer = queue<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > >; BFSVisitor = bfs_visitor<edge_predecessor_recorder<detail::edge_desc_impl<directed_tag, long unsigned int>*, on_tree_edge> >; ColorMap = default_color_type*]’
136 | breadth_first_visit(g, sources_begin, sources_end, Q, vis, color);
| ~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:147:25: required from ‘void boost::breadth_first_search(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph<adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, no_property, listS>, is_residual_edge<adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_residual_capacity_t> >, keep_all>; Buffer = queue<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > >; BFSVisitor = bfs_visitor<edge_predecessor_recorder<detail::edge_desc_impl<directed_tag, long unsigned int>*, on_tree_edge> >; ColorMap = default_color_type*; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
147 | breadth_first_search(g, sources, sources + 1, Q, vis, color);
| ~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/edmonds_karp_max_flow.hpp:101:29: required from ‘typename boost::property_traits<IndexMap>::value_type boost::edmonds_karp_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, ColorMap, PredEdgeMap) [with Graph = adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, no_property, listS>; CapacityEdgeMap = adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map<directed_tag, detail::edge_desc_impl<directed_tag, long unsigned int>, detail::edge_desc_impl<directed_tag, long unsigned int>&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_reverse_t>; ColorMap = default_color_type*; PredEdgeMap = detail::edge_desc_impl<directed_tag, long unsigned int>*; typename property_traits<IndexMap>::value_type = long unsigned int; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
101 | breadth_first_search(detail::residual_graph(g, res), src, Q,
| ~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
102 | make_bfs_visitor(record_edge_predecessors(pred, on_tree_edge())),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
103 | color);
| ~~~~~~
mincut.hpp:78:21: required from ‘typename boost::graph_traits<G>::edges_size_type boost::min_cut(VertexListGraph&, OutputIterator, OutputIterator) [with VertexListGraph = const R_adjacency_list<undirectedS, double>; OutputIterator = std::back_insert_iterator<std::vector<long unsigned int> >; typename graph_traits<G>::edges_size_type = long unsigned int]’
77 | alpha_S_k = edmonds_karp_max_flow
| ~~~~~~~~~~~~~~~~~~~~~
78 | (flow_g, p, k, cap, res_cap, rev_edge, &color[0], &pred[0]);
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
hcs.cpp:299:31: required from here
299 | min_cut(g, std::back_inserter(s_vec),
| ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
300 | std::back_inserter(vs_vec) );
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
20 | ~usage_requirements() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::EqualityComparable<TT>::~EqualityComparable() [with TT = boost::iterators::filter_iterator<boost::detail::out_edge_predicate<boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long unsigned int, long unsigned int&, long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::no_property, boost::listS>, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long unsigned int, long unsigned int&, long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int> >]’
37 | ~model()
| ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:233:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
233 | BOOST_CONCEPT_USAGE(EqualityComparable) {
| ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::InputIterator<boost::iterators::filter_iterator<boost::detail::out_edge_predicate<boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long unsigned int, long unsigned int&, long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::no_property, boost::listS>, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long unsigned int, long unsigned int&, long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int> > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::InputIterator<boost::iterators::filter_iterator<boost::detail::out_edge_predicate<boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long unsigned int, long unsigned int&, long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::no_property, boost::listS>, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long unsigned int, long unsigned int&, long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int> > > >]’
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:512:7: required from ‘struct boost::InputIterator<boost::iterators::filter_iterator<boost::detail::out_edge_predicate<boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long unsigned int, long unsigned int&, long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::no_property, boost::listS>, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long unsigned int, long unsigned int&, long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int> > >’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::InputIterator<boost::iterators::filter_iterator<boost::detail::out_edge_predicate<boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long unsigned int, long unsigned int&, long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::no_property, boost::listS>, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long unsigned int, long unsigned int&, long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int> > >]’
32 | inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
| ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied<boost::InputIterator<boost::iterators::filter_iterator<boost::detail::out_edge_predicate<boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long unsigned int, long unsigned int&, long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::no_property, boost::listS>, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long unsigned int, long unsigned int&, long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int> > > >::value’
44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied<boost::InputIterator<boost::iterators::filter_iterator<boost::detail::out_edge_predicate<boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long unsigned int, long unsigned int&, long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::no_property, boost::listS>, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long unsigned int, long unsigned int&, long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int> > > >’
45 | typedef boost::integral_constant<bool, value> type;
| ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:62:5: required from ‘void boost::breadth_first_visit(const IncidenceGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with IncidenceGraph = filtered_graph<adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, no_property, listS>, is_residual_edge<adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_residual_capacity_t> >, keep_all>; Buffer = queue<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > >; BFSVisitor = bfs_visitor<edge_predecessor_recorder<detail::edge_desc_impl<directed_tag, long unsigned int>*, on_tree_edge> >; ColorMap = default_color_type*; SourceIterator = long unsigned int*]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:136:24: required from ‘void boost::breadth_first_search(const VertexListGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph<adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, no_property, listS>, is_residual_edge<adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_residual_capacity_t> >, keep_all>; SourceIterator = long unsigned int*; Buffer = queue<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > >; BFSVisitor = bfs_visitor<edge_predecessor_recorder<detail::edge_desc_impl<directed_tag, long unsigned int>*, on_tree_edge> >; ColorMap = default_color_type*]’
136 | breadth_first_visit(g, sources_begin, sources_end, Q, vis, color);
| ~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:147:25: required from ‘void boost::breadth_first_search(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph<adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, no_property, listS>, is_residual_edge<adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_residual_capacity_t> >, keep_all>; Buffer = queue<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > >; BFSVisitor = bfs_visitor<edge_predecessor_recorder<detail::edge_desc_impl<directed_tag, long unsigned int>*, on_tree_edge> >; ColorMap = default_color_type*; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
147 | breadth_first_search(g, sources, sources + 1, Q, vis, color);
| ~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/edmonds_karp_max_flow.hpp:101:29: required from ‘typename boost::property_traits<IndexMap>::value_type boost::edmonds_karp_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, ColorMap, PredEdgeMap) [with Graph = adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, no_property, listS>; CapacityEdgeMap = adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map<directed_tag, detail::edge_desc_impl<directed_tag, long unsigned int>, detail::edge_desc_impl<directed_tag, long unsigned int>&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_reverse_t>; ColorMap = default_color_type*; PredEdgeMap = detail::edge_desc_impl<directed_tag, long unsigned int>*; typename property_traits<IndexMap>::value_type = long unsigned int; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
101 | breadth_first_search(detail::residual_graph(g, res), src, Q,
| ~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
102 | make_bfs_visitor(record_edge_predecessors(pred, on_tree_edge())),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
103 | color);
| ~~~~~~
mincut.hpp:78:21: required from ‘typename boost::graph_traits<G>::edges_size_type boost::min_cut(VertexListGraph&, OutputIterator, OutputIterator) [with VertexListGraph = const R_adjacency_list<undirectedS, double>; OutputIterator = std::back_insert_iterator<std::vector<long unsigned int> >; typename graph_traits<G>::edges_size_type = long unsigned int]’
77 | alpha_S_k = edmonds_karp_max_flow
| ~~~~~~~~~~~~~~~~~~~~~
78 | (flow_g, p, k, cap, res_cap, rev_edge, &color[0], &pred[0]);
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
hcs.cpp:299:31: required from here
299 | min_cut(g, std::back_inserter(s_vec),
| ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
300 | std::back_inserter(vs_vec) );
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
20 | ~usage_requirements() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::InputIterator<TT>::~InputIterator() [with TT = boost::iterators::filter_iterator<boost::detail::out_edge_predicate<boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long unsigned int, long unsigned int&, long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::no_property, boost::listS>, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long unsigned int, long unsigned int&, long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int> >]’
37 | ~model()
| ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:512:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
512 | BOOST_CONCEPT_USAGE(InputIterator)
| ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::SignedInteger<long int>]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:514:9: required from ‘boost::InputIterator<TT>::~InputIterator() [with TT = boost::iterators::filter_iterator<boost::detail::out_edge_predicate<boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long unsigned int, long unsigned int&, long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::no_property, boost::listS>, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long unsigned int, long unsigned int&, long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int> >]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::InputIterator<boost::iterators::filter_iterator<boost::detail::out_edge_predicate<boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long unsigned int, long unsigned int&, long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::no_property, boost::listS>, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long unsigned int, long unsigned int&, long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int> > >]’
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:53:35: required from ‘boost::concepts::MultiPassInputIterator<T>::~MultiPassInputIterator() [with T = boost::iterators::filter_iterator<boost::detail::out_edge_predicate<boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long unsigned int, long unsigned int&, long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::no_property, boost::listS>, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long unsigned int, long unsigned int&, long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int> >]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::MultiPassInputIterator<boost::iterators::filter_iterator<boost::detail::out_edge_predicate<boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long unsigned int, long unsigned int&, long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::no_property, boost::listS>, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long unsigned int, long unsigned int&, long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int> > >]’
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:89:9: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:62:5: required from ‘void boost::breadth_first_visit(const IncidenceGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with IncidenceGraph = filtered_graph<adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, no_property, listS>, is_residual_edge<adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_residual_capacity_t> >, keep_all>; Buffer = queue<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > >; BFSVisitor = bfs_visitor<edge_predecessor_recorder<detail::edge_desc_impl<directed_tag, long unsigned int>*, on_tree_edge> >; ColorMap = default_color_type*; SourceIterator = long unsigned int*]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:136:24: required from ‘void boost::breadth_first_search(const VertexListGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph<adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, no_property, listS>, is_residual_edge<adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_residual_capacity_t> >, keep_all>; SourceIterator = long unsigned int*; Buffer = queue<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > >; BFSVisitor = bfs_visitor<edge_predecessor_recorder<detail::edge_desc_impl<directed_tag, long unsigned int>*, on_tree_edge> >; ColorMap = default_color_type*]’
136 | breadth_first_visit(g, sources_begin, sources_end, Q, vis, color);
| ~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:147:25: required from ‘void boost::breadth_first_search(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph<adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, no_property, listS>, is_residual_edge<adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_residual_capacity_t> >, keep_all>; Buffer = queue<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > >; BFSVisitor = bfs_visitor<edge_predecessor_recorder<detail::edge_desc_impl<directed_tag, long unsigned int>*, on_tree_edge> >; ColorMap = default_color_type*; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
147 | breadth_first_search(g, sources, sources + 1, Q, vis, color);
| ~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/edmonds_karp_max_flow.hpp:101:29: required from ‘typename boost::property_traits<IndexMap>::value_type boost::edmonds_karp_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, ColorMap, PredEdgeMap) [with Graph = adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, no_property, listS>; CapacityEdgeMap = adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map<directed_tag, detail::edge_desc_impl<directed_tag, long unsigned int>, detail::edge_desc_impl<directed_tag, long unsigned int>&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_reverse_t>; ColorMap = default_color_type*; PredEdgeMap = detail::edge_desc_impl<directed_tag, long unsigned int>*; typename property_traits<IndexMap>::value_type = long unsigned int; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
101 | breadth_first_search(detail::residual_graph(g, res), src, Q,
| ~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
102 | make_bfs_visitor(record_edge_predecessors(pred, on_tree_edge())),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
103 | color);
| ~~~~~~
mincut.hpp:78:21: required from ‘typename boost::graph_traits<G>::edges_size_type boost::min_cut(VertexListGraph&, OutputIterator, OutputIterator) [with VertexListGraph = const R_adjacency_list<undirectedS, double>; OutputIterator = std::back_insert_iterator<std::vector<long unsigned int> >; typename graph_traits<G>::edges_size_type = long unsigned int]’
77 | alpha_S_k = edmonds_karp_max_flow
| ~~~~~~~~~~~~~~~~~~~~~
78 | (flow_g, p, k, cap, res_cap, rev_edge, &color[0], &pred[0]);
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
hcs.cpp:299:31: required from here
299 | min_cut(g, std::back_inserter(s_vec),
| ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
300 | std::back_inserter(vs_vec) );
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:107:22: note: in a call to non-static member function ‘boost::SignedInteger<long int>::~SignedInteger()’
107 | template <> struct SignedInteger<long> {};
| ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Convertible<boost::iterators::detail::iterator_category_with_traversal<std::input_iterator_tag, boost::iterators::bidirectional_traversal_tag>, std::input_iterator_tag> >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible<boost::iterators::detail::iterator_category_with_traversal<std::input_iterator_tag, boost::iterators::bidirectional_traversal_tag>, std::input_iterator_tag>’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::Convertible<boost::iterators::detail::iterator_category_with_traversal<std::input_iterator_tag, boost::iterators::bidirectional_traversal_tag>, std::input_iterator_tag>]’
32 | inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
| ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied<boost::Convertible<boost::iterators::detail::iterator_category_with_traversal<std::input_iterator_tag, boost::iterators::bidirectional_traversal_tag>, std::input_iterator_tag> >::value’
44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied<boost::Convertible<boost::iterators::detail::iterator_category_with_traversal<std::input_iterator_tag, boost::iterators::bidirectional_traversal_tag>, std::input_iterator_tag> >’
45 | typedef boost::integral_constant<bool, value> type;
| ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_<void (*)(boost::Convertible<boost::iterators::detail::iterator_category_with_traversal<std::input_iterator_tag, boost::iterators::bidirectional_traversal_tag>, std::input_iterator_tag>)>’
72 | struct requirement_<void(*)(Model)>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:515:9: [ skipping 6 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:62:5: required from ‘void boost::breadth_first_visit(const IncidenceGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with IncidenceGraph = filtered_graph<adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, no_property, listS>, is_residual_edge<adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_residual_capacity_t> >, keep_all>; Buffer = queue<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > >; BFSVisitor = bfs_visitor<edge_predecessor_recorder<detail::edge_desc_impl<directed_tag, long unsigned int>*, on_tree_edge> >; ColorMap = default_color_type*; SourceIterator = long unsigned int*]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:136:24: required from ‘void boost::breadth_first_search(const VertexListGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph<adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, no_property, listS>, is_residual_edge<adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_residual_capacity_t> >, keep_all>; SourceIterator = long unsigned int*; Buffer = queue<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > >; BFSVisitor = bfs_visitor<edge_predecessor_recorder<detail::edge_desc_impl<directed_tag, long unsigned int>*, on_tree_edge> >; ColorMap = default_color_type*]’
136 | breadth_first_visit(g, sources_begin, sources_end, Q, vis, color);
| ~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:147:25: required from ‘void boost::breadth_first_search(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph<adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, no_property, listS>, is_residual_edge<adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_residual_capacity_t> >, keep_all>; Buffer = queue<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > >; BFSVisitor = bfs_visitor<edge_predecessor_recorder<detail::edge_desc_impl<directed_tag, long unsigned int>*, on_tree_edge> >; ColorMap = default_color_type*; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
147 | breadth_first_search(g, sources, sources + 1, Q, vis, color);
| ~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/edmonds_karp_max_flow.hpp:101:29: required from ‘typename boost::property_traits<IndexMap>::value_type boost::edmonds_karp_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, ColorMap, PredEdgeMap) [with Graph = adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, no_property, listS>; CapacityEdgeMap = adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map<directed_tag, detail::edge_desc_impl<directed_tag, long unsigned int>, detail::edge_desc_impl<directed_tag, long unsigned int>&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_reverse_t>; ColorMap = default_color_type*; PredEdgeMap = detail::edge_desc_impl<directed_tag, long unsigned int>*; typename property_traits<IndexMap>::value_type = long unsigned int; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
101 | breadth_first_search(detail::residual_graph(g, res), src, Q,
| ~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
102 | make_bfs_visitor(record_edge_predecessors(pred, on_tree_edge())),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
103 | color);
| ~~~~~~
mincut.hpp:78:21: required from ‘typename boost::graph_traits<G>::edges_size_type boost::min_cut(VertexListGraph&, OutputIterator, OutputIterator) [with VertexListGraph = const R_adjacency_list<undirectedS, double>; OutputIterator = std::back_insert_iterator<std::vector<long unsigned int> >; typename graph_traits<G>::edges_size_type = long unsigned int]’
77 | alpha_S_k = edmonds_karp_max_flow
| ~~~~~~~~~~~~~~~~~~~~~
78 | (flow_g, p, k, cap, res_cap, rev_edge, &color[0], &pred[0]);
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
hcs.cpp:299:31: required from here
299 | min_cut(g, std::back_inserter(s_vec),
| ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
300 | std::back_inserter(vs_vec) );
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Convertible<boost::iterators::detail::iterator_category_with_traversal<std::input_iterator_tag, boost::iterators::bidirectional_traversal_tag>, std::input_iterator_tag>]’
20 | ~usage_requirements() { ((Model*)0)->~Model(); }
| ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::Convertible<boost::iterators::detail::iterator_category_with_traversal<std::input_iterator_tag, boost::iterators::bidirectional_traversal_tag>, std::input_iterator_tag>]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:515:9: required from ‘boost::InputIterator<TT>::~InputIterator() [with TT = boost::iterators::filter_iterator<boost::detail::out_edge_predicate<boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long unsigned int, long unsigned int&, long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::no_property, boost::listS>, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long unsigned int, long unsigned int&, long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int> >]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::InputIterator<boost::iterators::filter_iterator<boost::detail::out_edge_predicate<boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long unsigned int, long unsigned int&, long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::no_property, boost::listS>, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long unsigned int, long unsigned int&, long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int> > >]’
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:53:35: required from ‘boost::concepts::MultiPassInputIterator<T>::~MultiPassInputIterator() [with T = boost::iterators::filter_iterator<boost::detail::out_edge_predicate<boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long unsigned int, long unsigned int&, long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::no_property, boost::listS>, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long unsigned int, long unsigned int&, long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int> >]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::MultiPassInputIterator<boost::iterators::filter_iterator<boost::detail::out_edge_predicate<boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long unsigned int, long unsigned int&, long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::no_property, boost::listS>, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long unsigned int, long unsigned int&, long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int> > >]’
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:89:9: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:62:5: required from ‘void boost::breadth_first_visit(const IncidenceGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with IncidenceGraph = filtered_graph<adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, no_property, listS>, is_residual_edge<adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_residual_capacity_t> >, keep_all>; Buffer = queue<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > >; BFSVisitor = bfs_visitor<edge_predecessor_recorder<detail::edge_desc_impl<directed_tag, long unsigned int>*, on_tree_edge> >; ColorMap = default_color_type*; SourceIterator = long unsigned int*]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:136:24: required from ‘void boost::breadth_first_search(const VertexListGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph<adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, no_property, listS>, is_residual_edge<adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_residual_capacity_t> >, keep_all>; SourceIterator = long unsigned int*; Buffer = queue<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > >; BFSVisitor = bfs_visitor<edge_predecessor_recorder<detail::edge_desc_impl<directed_tag, long unsigned int>*, on_tree_edge> >; ColorMap = default_color_type*]’
136 | breadth_first_visit(g, sources_begin, sources_end, Q, vis, color);
| ~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:147:25: required from ‘void boost::breadth_first_search(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph<adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, no_property, listS>, is_residual_edge<adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_residual_capacity_t> >, keep_all>; Buffer = queue<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > >; BFSVisitor = bfs_visitor<edge_predecessor_recorder<detail::edge_desc_impl<directed_tag, long unsigned int>*, on_tree_edge> >; ColorMap = default_color_type*; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
147 | breadth_first_search(g, sources, sources + 1, Q, vis, color);
| ~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/edmonds_karp_max_flow.hpp:101:29: required from ‘typename boost::property_traits<IndexMap>::value_type boost::edmonds_karp_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, ColorMap, PredEdgeMap) [with Graph = adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, no_property, listS>; CapacityEdgeMap = adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map<directed_tag, detail::edge_desc_impl<directed_tag, long unsigned int>, detail::edge_desc_impl<directed_tag, long unsigned int>&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_reverse_t>; ColorMap = default_color_type*; PredEdgeMap = detail::edge_desc_impl<directed_tag, long unsigned int>*; typename property_traits<IndexMap>::value_type = long unsigned int; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
101 | breadth_first_search(detail::residual_graph(g, res), src, Q,
| ~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
102 | make_bfs_visitor(record_edge_predecessors(pred, on_tree_edge())),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
103 | color);
| ~~~~~~
mincut.hpp:78:21: required from ‘typename boost::graph_traits<G>::edges_size_type boost::min_cut(VertexListGraph&, OutputIterator, OutputIterator) [with VertexListGraph = const R_adjacency_list<undirectedS, double>; OutputIterator = std::back_insert_iterator<std::vector<long unsigned int> >; typename graph_traits<G>::edges_size_type = long unsigned int]’
77 | alpha_S_k = edmonds_karp_max_flow
| ~~~~~~~~~~~~~~~~~~~~~
78 | (flow_g, p, k, cap, res_cap, rev_edge, &color[0], &pred[0]);
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
hcs.cpp:299:31: required from here
299 | min_cut(g, std::back_inserter(s_vec),
| ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
300 | std::back_inserter(vs_vec) );
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible<X, Y>::~Convertible() [with X = boost::iterators::detail::iterator_category_with_traversal<std::input_iterator_tag, boost::iterators::bidirectional_traversal_tag>; Y = std::input_iterator_tag]’
37 | ~model()
| ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
208 | BOOST_CONCEPT_USAGE(Convertible) {
| ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Convertible<boost::iterators::detail::iterator_category_with_traversal<std::input_iterator_tag, boost::iterators::bidirectional_traversal_tag>, std::input_iterator_tag>]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Convertible<boost::iterators::detail::iterator_category_with_traversal<std::input_iterator_tag, boost::iterators::bidirectional_traversal_tag>, std::input_iterator_tag> >]’
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible<boost::iterators::detail::iterator_category_with_traversal<std::input_iterator_tag, boost::iterators::bidirectional_traversal_tag>, std::input_iterator_tag>’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::Convertible<boost::iterators::detail::iterator_category_with_traversal<std::input_iterator_tag, boost::iterators::bidirectional_traversal_tag>, std::input_iterator_tag>]’
32 | inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
| ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied<boost::Convertible<boost::iterators::detail::iterator_category_with_traversal<std::input_iterator_tag, boost::iterators::bidirectional_traversal_tag>, std::input_iterator_tag> >::value’
44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied<boost::Convertible<boost::iterators::detail::iterator_category_with_traversal<std::input_iterator_tag, boost::iterators::bidirectional_traversal_tag>, std::input_iterator_tag> >’
45 | typedef boost::integral_constant<bool, value> type;
| ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 7 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:62:5: required from ‘void boost::breadth_first_visit(const IncidenceGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with IncidenceGraph = filtered_graph<adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, no_property, listS>, is_residual_edge<adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_residual_capacity_t> >, keep_all>; Buffer = queue<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > >; BFSVisitor = bfs_visitor<edge_predecessor_recorder<detail::edge_desc_impl<directed_tag, long unsigned int>*, on_tree_edge> >; ColorMap = default_color_type*; SourceIterator = long unsigned int*]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:136:24: required from ‘void boost::breadth_first_search(const VertexListGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph<adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, no_property, listS>, is_residual_edge<adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_residual_capacity_t> >, keep_all>; SourceIterator = long unsigned int*; Buffer = queue<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > >; BFSVisitor = bfs_visitor<edge_predecessor_recorder<detail::edge_desc_impl<directed_tag, long unsigned int>*, on_tree_edge> >; ColorMap = default_color_type*]’
136 | breadth_first_visit(g, sources_begin, sources_end, Q, vis, color);
| ~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:147:25: required from ‘void boost::breadth_first_search(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph<adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, no_property, listS>, is_residual_edge<adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_residual_capacity_t> >, keep_all>; Buffer = queue<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > >; BFSVisitor = bfs_visitor<edge_predecessor_recorder<detail::edge_desc_impl<directed_tag, long unsigned int>*, on_tree_edge> >; ColorMap = default_color_type*; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
147 | breadth_first_search(g, sources, sources + 1, Q, vis, color);
| ~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/edmonds_karp_max_flow.hpp:101:29: required from ‘typename boost::property_traits<IndexMap>::value_type boost::edmonds_karp_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, ColorMap, PredEdgeMap) [with Graph = adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, no_property, listS>; CapacityEdgeMap = adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map<directed_tag, detail::edge_desc_impl<directed_tag, long unsigned int>, detail::edge_desc_impl<directed_tag, long unsigned int>&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_reverse_t>; ColorMap = default_color_type*; PredEdgeMap = detail::edge_desc_impl<directed_tag, long unsigned int>*; typename property_traits<IndexMap>::value_type = long unsigned int; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
101 | breadth_first_search(detail::residual_graph(g, res), src, Q,
| ~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
102 | make_bfs_visitor(record_edge_predecessors(pred, on_tree_edge())),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
103 | color);
| ~~~~~~
mincut.hpp:78:21: required from ‘typename boost::graph_traits<G>::edges_size_type boost::min_cut(VertexListGraph&, OutputIterator, OutputIterator) [with VertexListGraph = const R_adjacency_list<undirectedS, double>; OutputIterator = std::back_insert_iterator<std::vector<long unsigned int> >; typename graph_traits<G>::edges_size_type = long unsigned int]’
77 | alpha_S_k = edmonds_karp_max_flow
| ~~~~~~~~~~~~~~~~~~~~~
78 | (flow_g, p, k, cap, res_cap, rev_edge, &color[0], &pred[0]);
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
hcs.cpp:299:31: required from here
299 | min_cut(g, std::back_inserter(s_vec),
| ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
300 | std::back_inserter(vs_vec) );
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
20 | ~usage_requirements() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible<X, Y>::~Convertible() [with X = boost::iterators::detail::iterator_category_with_traversal<std::input_iterator_tag, boost::iterators::bidirectional_traversal_tag>; Y = std::input_iterator_tag]’
37 | ~model()
| ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/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 /opt/ohpc/pub/compiler/gcc/14.2.0/include/c++/14.2.0/set:62,
from /home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/adjacency_list.hpp:18:
In member function ‘std::pair<std::_Rb_tree_iterator<_Val>, bool> std::_Rb_tree<_Key, _Val, _KeyOfValue, _Compare, _Alloc>::_M_insert_unique(_Arg&&) [with _Arg = const long unsigned int&; _Key = long unsigned int; _Val = long unsigned int; _KeyOfValue = std::_Identity<long unsigned int>; _Compare = std::less<long unsigned int>; _Alloc = std::allocator<long unsigned int>]’,
inlined from ‘std::pair<typename std::_Rb_tree<_Key, _Key, std::_Identity<_Tp>, _Compare, typename __gnu_cxx::__alloc_traits<_Alloc>::rebind<_Key>::other>::const_iterator, bool> std::set<_Key, _Compare, _Alloc>::insert(const value_type&) [with _Key = long unsigned int; _Compare = std::less<long unsigned int>; _Alloc = std::allocator<long unsigned int>]’ at /opt/ohpc/pub/compiler/gcc/14.2.0/include/c++/14.2.0/bits/stl_set.h:514:25,
inlined from ‘typename boost::graph_traits<G>::edges_size_type boost::min_cut(VertexListGraph&, OutputIterator, OutputIterator) [with VertexListGraph = const R_adjacency_list<undirectedS, double>; OutputIterator = std::back_insert_iterator<std::vector<long unsigned int> >]’ at mincut.hpp:67:13:
/opt/ohpc/pub/compiler/gcc/14.2.0/include/c++/14.2.0/bits/stl_tree.h:2167:35: warning: ‘p’ may be used uninitialized [-Wmaybe-uninitialized]
2167 | = _M_get_insert_unique_pos(_KeyOfValue()(__v));
| ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/edge_connectivity.hpp: In function ‘typename boost::graph_traits<G>::edges_size_type boost::min_cut(VertexListGraph&, OutputIterator, OutputIterator) [with VertexListGraph = const R_adjacency_list<undirectedS, double>; OutputIterator = std::back_insert_iterator<std::vector<long unsigned int> >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/edge_connectivity.hpp:34:44: note: ‘p’ was declared here
34 | typename Traits::vertex_descriptor p;
| ^
In file included from /opt/ohpc/pub/compiler/gcc/14.2.0/include/c++/14.2.0/string:51,
from /opt/ohpc/pub/compiler/gcc/14.2.0/include/c++/14.2.0/bits/locale_classes.h:40,
from /opt/ohpc/pub/compiler/gcc/14.2.0/include/c++/14.2.0/bits/ios_base.h:41,
from /opt/ohpc/pub/compiler/gcc/14.2.0/include/c++/14.2.0/ios:44,
from /opt/ohpc/pub/compiler/gcc/14.2.0/include/c++/14.2.0/ostream:40,
from /opt/ohpc/pub/compiler/gcc/14.2.0/include/c++/14.2.0/iostream:41,
from RBGL.hpp:7:
In static member function ‘static _Up* std::__copy_move<_IsMove, true, std::random_access_iterator_tag>::__copy_m(_Tp*, _Tp*, _Up*) [with _Tp = const int; _Up = int; bool _IsMove = false]’,
inlined from ‘_OI std::__copy_move_a2(_II, _II, _OI) [with bool _IsMove = false; _II = const int*; _OI = int*]’ at /opt/ohpc/pub/compiler/gcc/14.2.0/include/c++/14.2.0/bits/stl_algobase.h:521:30,
inlined from ‘_OI std::__copy_move_a1(_II, _II, _OI) [with bool _IsMove = false; _II = const int*; _OI = int*]’ at /opt/ohpc/pub/compiler/gcc/14.2.0/include/c++/14.2.0/bits/stl_algobase.h:548:42,
inlined from ‘_OI std::__copy_move_a(_II, _II, _OI) [with bool _IsMove = false; _II = __gnu_cxx::__normal_iterator<const int*, vector<int> >; _OI = int*]’ at /opt/ohpc/pub/compiler/gcc/14.2.0/include/c++/14.2.0/bits/stl_algobase.h:555:31,
inlined from ‘_OI std::copy(_II, _II, _OI) [with _II = __gnu_cxx::__normal_iterator<const int*, vector<int> >; _OI = int*]’ at /opt/ohpc/pub/compiler/gcc/14.2.0/include/c++/14.2.0/bits/stl_algobase.h:651:7,
inlined from ‘static _ForwardIterator std::__uninitialized_copy<true>::__uninit_copy(_InputIterator, _InputIterator, _ForwardIterator) [with _InputIterator = __gnu_cxx::__normal_iterator<const int*, std::vector<int> >; _ForwardIterator = int*]’ at /opt/ohpc/pub/compiler/gcc/14.2.0/include/c++/14.2.0/bits/stl_uninitialized.h:147:27,
inlined from ‘_ForwardIterator std::uninitialized_copy(_InputIterator, _InputIterator, _ForwardIterator) [with _InputIterator = __gnu_cxx::__normal_iterator<const int*, vector<int> >; _ForwardIterator = int*]’ at /opt/ohpc/pub/compiler/gcc/14.2.0/include/c++/14.2.0/bits/stl_uninitialized.h:185:15,
inlined from ‘_ForwardIterator std::__uninitialized_copy_a(_InputIterator, _InputIterator, _ForwardIterator, allocator<_Tp>&) [with _InputIterator = __gnu_cxx::__normal_iterator<const int*, vector<int> >; _ForwardIterator = int*; _Tp = int]’ at /opt/ohpc/pub/compiler/gcc/14.2.0/include/c++/14.2.0/bits/stl_uninitialized.h:373:37,
inlined from ‘std::vector<_Tp, _Alloc>::vector(const std::vector<_Tp, _Alloc>&) [with _Tp = int; _Alloc = std::allocator<int>]’ at /opt/ohpc/pub/compiler/gcc/14.2.0/include/c++/14.2.0/bits/stl_vector.h:606:31,
inlined from ‘void std::__new_allocator<_Tp>::construct(_Up*, _Args&& ...) [with _Up = std::vector<int>; _Args = {const std::vector<int, std::allocator<int> >&}; _Tp = std::vector<int>]’ at /opt/ohpc/pub/compiler/gcc/14.2.0/include/c++/14.2.0/bits/new_allocator.h:191:4,
inlined from ‘static void std::allocator_traits<std::allocator<_CharT> >::construct(allocator_type&, _Up*, _Args&& ...) [with _Up = std::vector<int>; _Args = {const std::vector<int, std::allocator<int> >&}; _Tp = std::vector<int>]’ at /opt/ohpc/pub/compiler/gcc/14.2.0/include/c++/14.2.0/bits/alloc_traits.h:534:17,
inlined from ‘void std::vector<_Tp, _Alloc>::push_back(const value_type&) [with _Tp = std::vector<int>; _Alloc = std::allocator<std::vector<int> >]’ at /opt/ohpc/pub/compiler/gcc/14.2.0/include/c++/14.2.0/bits/stl_vector.h:1288:30,
inlined from ‘void HCS_internal(const Graph_ud&, V_Label&, ClusterResult&)’ at hcs.cpp:310:27:
/opt/ohpc/pub/compiler/gcc/14.2.0/include/c++/14.2.0/bits/stl_algobase.h:452:30: warning: ‘void* __builtin_memmove(void*, const void*, long unsigned int)’ forming offset 4 is out of the bounds [0, 4] [-Warray-bounds=]
452 | __builtin_memmove(__result, __first, sizeof(_Tp) * _Num);
| ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/opt/ohpc/pub/compiler/gcc/14.2.0/bin/aarch64-unknown-linux-gnu-g++ -std=gnu++17 -I"/home/biocbuild/R/R/include" -DNDEBUG -I'/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include' -I/usr/local/include -fPIC -g -O2 -Wall -Werror=format-security -DR_NO_REMAP -c incrConnComp.cpp -o incrConnComp.o
In file included from incrConnComp.cpp:1:
RBGL.hpp:41:9: warning: "R_NO_REMAP" redefined
41 | #define R_NO_REMAP
| ^~~~~~~~~~
<command-line>: note: this is the location of the previous definition
In file included from /home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:22,
from RBGL.hpp:17:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/mpl/assert.hpp:194:21: warning: unnecessary parentheses in declaration of ‘assert_arg’ [-Wparentheses]
194 | failed ************ (Pred::************
| ^~~~~~~~~~~~~~~~~~~
195 | assert_arg( void (*)(Pred), typename assert_arg_pred<Pred>::type )
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
196 | );
| ~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/mpl/assert.hpp:194:21: note: remove parentheses
194 | failed ************ (Pred::************
| ^~~~~~~~~~~~~~~~~~~
| -
195 | assert_arg( void (*)(Pred), typename assert_arg_pred<Pred>::type )
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
196 | );
| ~
| -
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/mpl/assert.hpp:199:21: warning: unnecessary parentheses in declaration of ‘assert_not_arg’ [-Wparentheses]
199 | failed ************ (boost::mpl::not_<Pred>::************
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
200 | assert_not_arg( void (*)(Pred), typename assert_arg_pred_not<Pred>::type )
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
201 | );
| ~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/mpl/assert.hpp:199:21: note: remove parentheses
199 | failed ************ (boost::mpl::not_<Pred>::************
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
| -
200 | assert_not_arg( void (*)(Pred), typename assert_arg_pred_not<Pred>::type )
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
201 | );
| ~
| -
In file included from /home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/smart_ptr/shared_ptr.hpp:17,
from /home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/vector_property_map.hpp:14,
from /home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:598:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/smart_ptr/detail/shared_count.hpp:326:33: warning: ‘template<class> class std::auto_ptr’ is deprecated: use 'std::unique_ptr' instead [-Wdeprecated-declarations]
326 | explicit shared_count( std::auto_ptr<Y> & r ): pi_( new sp_counted_impl_p<Y>( r.get() ) )
| ^~~~~~~~
In file included from /opt/ohpc/pub/compiler/gcc/14.2.0/include/c++/14.2.0/memory:78,
from /home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/smart_ptr/detail/sp_counted_impl.hpp:35,
from /home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/smart_ptr/detail/shared_count.hpp:23:
/opt/ohpc/pub/compiler/gcc/14.2.0/include/c++/14.2.0/bits/unique_ptr.h:59:28: note: declared here
59 | template<typename> class auto_ptr;
| ^~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/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()
| ^~~~~~~~
/opt/ohpc/pub/compiler/gcc/14.2.0/include/c++/14.2.0/bits/unique_ptr.h:59:28: note: declared here
59 | template<typename> class auto_ptr;
| ^~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/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()
| ^~~~~~~~
/opt/ohpc/pub/compiler/gcc/14.2.0/include/c++/14.2.0/bits/unique_ptr.h:59:28: note: declared here
59 | template<typename> class auto_ptr;
| ^~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/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 )
| ^~~~~~~~
/opt/ohpc/pub/compiler/gcc/14.2.0/include/c++/14.2.0/bits/unique_ptr.h:59:28: note: declared here
59 | template<typename> class auto_ptr;
| ^~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/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 )
| ^~~~~~~~
/opt/ohpc/pub/compiler/gcc/14.2.0/include/c++/14.2.0/bits/unique_ptr.h:59:28: note: declared here
59 | template<typename> class auto_ptr;
| ^~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/smart_ptr/shared_ptr.hpp: In member function ‘boost::shared_ptr<T>& boost::shared_ptr<T>::operator=(std::auto_ptr<_Up>&&)’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/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 );
| ^~~~~~~~
/opt/ohpc/pub/compiler/gcc/14.2.0/include/c++/14.2.0/bits/unique_ptr.h:59:28: note: declared here
59 | template<typename> class auto_ptr;
| ^~~~~~~~
In file included from /home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/scoped_ptr.hpp:13,
from /home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/adjacency_list.hpp:22,
from RBGL.hpp:38:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/smart_ptr/scoped_ptr.hpp: At global scope:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/smart_ptr/scoped_ptr.hpp:75:31: warning: ‘template<class> class std::auto_ptr’ is deprecated: use 'std::unique_ptr' instead [-Wdeprecated-declarations]
75 | explicit scoped_ptr( std::auto_ptr<T> p ) noexcept : px( p.release() )
| ^~~~~~~~
/opt/ohpc/pub/compiler/gcc/14.2.0/include/c++/14.2.0/bits/unique_ptr.h:59:28: note: declared here
59 | template<typename> class auto_ptr;
| ^~~~~~~~
In file included from incrConnComp.cpp:2:
incrConnComp.cpp: In function ‘SEXPREC* BGL_incr_comp_internal(SEXP, SEXP, SEXP, E_IC_METHOD)’:
incrConnComp.cpp:74:39: warning: unused variable ‘child_index’ [-Wunused-variable]
74 | BOOST_FOREACH(VertexIndex child_index, components[current_index]) {
| ^~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/foreach.hpp:1114:14: note: in definition of macro ‘BOOST_FOREACH’
1114 | for (VAR = BOOST_FOREACH_DEREF(COL); !BOOST_FOREACH_ID(_foreach_continue); BOOST_FOREACH_ID(_foreach_continue) = true)
| ^~~
/opt/ohpc/pub/compiler/gcc/14.2.0/bin/aarch64-unknown-linux-gnu-g++ -std=gnu++17 -I"/home/biocbuild/R/R/include" -DNDEBUG -I'/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include' -I/usr/local/include -fPIC -g -O2 -Wall -Werror=format-security -DR_NO_REMAP -c interfaces.cpp -o interfaces.o
In file included from interfaces.cpp:1:
RBGL.hpp:41:9: warning: "R_NO_REMAP" redefined
41 | #define R_NO_REMAP
| ^~~~~~~~~~
<command-line>: note: this is the location of the previous definition
In file included from /home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:22,
from RBGL.hpp:17:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/mpl/assert.hpp:194:21: warning: unnecessary parentheses in declaration of ‘assert_arg’ [-Wparentheses]
194 | failed ************ (Pred::************
| ^~~~~~~~~~~~~~~~~~~
195 | assert_arg( void (*)(Pred), typename assert_arg_pred<Pred>::type )
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
196 | );
| ~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/mpl/assert.hpp:194:21: note: remove parentheses
194 | failed ************ (Pred::************
| ^~~~~~~~~~~~~~~~~~~
| -
195 | assert_arg( void (*)(Pred), typename assert_arg_pred<Pred>::type )
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
196 | );
| ~
| -
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/mpl/assert.hpp:199:21: warning: unnecessary parentheses in declaration of ‘assert_not_arg’ [-Wparentheses]
199 | failed ************ (boost::mpl::not_<Pred>::************
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
200 | assert_not_arg( void (*)(Pred), typename assert_arg_pred_not<Pred>::type )
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
201 | );
| ~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/mpl/assert.hpp:199:21: note: remove parentheses
199 | failed ************ (boost::mpl::not_<Pred>::************
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
| -
200 | assert_not_arg( void (*)(Pred), typename assert_arg_pred_not<Pred>::type )
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
201 | );
| ~
| -
In file included from /home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/smart_ptr/shared_ptr.hpp:17,
from /home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/vector_property_map.hpp:14,
from /home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:598:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/smart_ptr/detail/shared_count.hpp:326:33: warning: ‘template<class> class std::auto_ptr’ is deprecated: use 'std::unique_ptr' instead [-Wdeprecated-declarations]
326 | explicit shared_count( std::auto_ptr<Y> & r ): pi_( new sp_counted_impl_p<Y>( r.get() ) )
| ^~~~~~~~
In file included from /opt/ohpc/pub/compiler/gcc/14.2.0/include/c++/14.2.0/memory:78,
from /home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/smart_ptr/detail/sp_counted_impl.hpp:35,
from /home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/smart_ptr/detail/shared_count.hpp:23:
/opt/ohpc/pub/compiler/gcc/14.2.0/include/c++/14.2.0/bits/unique_ptr.h:59:28: note: declared here
59 | template<typename> class auto_ptr;
| ^~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/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()
| ^~~~~~~~
/opt/ohpc/pub/compiler/gcc/14.2.0/include/c++/14.2.0/bits/unique_ptr.h:59:28: note: declared here
59 | template<typename> class auto_ptr;
| ^~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/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()
| ^~~~~~~~
/opt/ohpc/pub/compiler/gcc/14.2.0/include/c++/14.2.0/bits/unique_ptr.h:59:28: note: declared here
59 | template<typename> class auto_ptr;
| ^~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/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 )
| ^~~~~~~~
/opt/ohpc/pub/compiler/gcc/14.2.0/include/c++/14.2.0/bits/unique_ptr.h:59:28: note: declared here
59 | template<typename> class auto_ptr;
| ^~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/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 )
| ^~~~~~~~
/opt/ohpc/pub/compiler/gcc/14.2.0/include/c++/14.2.0/bits/unique_ptr.h:59:28: note: declared here
59 | template<typename> class auto_ptr;
| ^~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/smart_ptr/shared_ptr.hpp: In member function ‘boost::shared_ptr<T>& boost::shared_ptr<T>::operator=(std::auto_ptr<_Up>&&)’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/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 );
| ^~~~~~~~
/opt/ohpc/pub/compiler/gcc/14.2.0/include/c++/14.2.0/bits/unique_ptr.h:59:28: note: declared here
59 | template<typename> class auto_ptr;
| ^~~~~~~~
In file included from /home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/scoped_ptr.hpp:13,
from /home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/adjacency_list.hpp:22,
from RBGL.hpp:38:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/smart_ptr/scoped_ptr.hpp: At global scope:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/smart_ptr/scoped_ptr.hpp:75:31: warning: ‘template<class> class std::auto_ptr’ is deprecated: use 'std::unique_ptr' instead [-Wdeprecated-declarations]
75 | explicit scoped_ptr( std::auto_ptr<T> p ) noexcept : px( p.release() )
| ^~~~~~~~
/opt/ohpc/pub/compiler/gcc/14.2.0/include/c++/14.2.0/bits/unique_ptr.h:59:28: note: declared here
59 | template<typename> class auto_ptr;
| ^~~~~~~~
interfaces.cpp: In function ‘SEXPREC* BGL_tsort_D(SEXP, SEXP, SEXP)’:
interfaces.cpp:81:17: warning: catching polymorphic type ‘struct boost::not_a_dag’ by value [-Wcatch-value=]
81 | catch ( not_a_dag )
| ^~~~~~~~~
interfaces.cpp:57:60: warning: typedef ‘Edge’ locally defined but not used [-Wunused-local-typedefs]
57 | typedef graph_traits < Graph_dd >::edge_descriptor Edge;
| ^~~~
interfaces.cpp:61:62: warning: typedef ‘Color’ locally defined but not used [-Wunused-local-typedefs]
61 | typedef property_map<Graph_dd, vertex_color_t>::type Color;
| ^~~~~
interfaces.cpp: In function ‘SEXPREC* BGL_bfs_D(SEXP, SEXP, SEXP, SEXP, SEXP)’:
interfaces.cpp:98:60: warning: typedef ‘Edge’ locally defined but not used [-Wunused-local-typedefs]
98 | typedef graph_traits < Graph_dd >::edge_descriptor Edge;
| ^~~~
interfaces.cpp:99:62: warning: typedef ‘Vertex’ locally defined but not used [-Wunused-local-typedefs]
99 | typedef graph_traits < Graph_dd >::vertex_descriptor Vertex;
| ^~~~~~
interfaces.cpp: In function ‘SEXPREC* BGL_dfs_D(SEXP, SEXP, SEXP, SEXP)’:
interfaces.cpp:142:60: warning: typedef ‘Edge’ locally defined but not used [-Wunused-local-typedefs]
142 | typedef graph_traits < Graph_dd >::edge_descriptor Edge;
| ^~~~
interfaces.cpp:143:62: warning: typedef ‘Vertex’ locally defined but not used [-Wunused-local-typedefs]
143 | typedef graph_traits < Graph_dd >::vertex_descriptor Vertex;
| ^~~~~~
interfaces.cpp: In function ‘SEXPREC* BGL_connected_components_U(SEXP, SEXP, SEXP, SEXP)’:
interfaces.cpp:198:60: warning: typedef ‘Edge’ locally defined but not used [-Wunused-local-typedefs]
198 | typedef graph_traits < Graph_ud >::edge_descriptor Edge;
| ^~~~
interfaces.cpp:199:62: warning: typedef ‘Vertex’ locally defined but not used [-Wunused-local-typedefs]
199 | typedef graph_traits < Graph_ud >::vertex_descriptor Vertex;
| ^~~~~~
interfaces.cpp: In function ‘SEXPREC* BGL_strong_components_D(SEXP, SEXP, SEXP, SEXP)’:
interfaces.cpp:225:60: warning: typedef ‘Edge’ locally defined but not used [-Wunused-local-typedefs]
225 | typedef graph_traits < Graph_dd >::edge_descriptor Edge;
| ^~~~
interfaces.cpp:226:62: warning: typedef ‘Vertex’ locally defined but not used [-Wunused-local-typedefs]
226 | typedef graph_traits < Graph_dd >::vertex_descriptor Vertex;
| ^~~~~~
interfaces.cpp: In function ‘SEXPREC* BGL_biconnected_components_U(SEXP, SEXP, SEXP, SEXP)’:
interfaces.cpp:252:60: warning: typedef ‘Edge’ locally defined but not used [-Wunused-local-typedefs]
252 | typedef graph_traits < Graph_ud >::edge_descriptor Edge;
| ^~~~
interfaces.cpp:253:62: warning: typedef ‘Vertex’ locally defined but not used [-Wunused-local-typedefs]
253 | typedef graph_traits < Graph_ud >::vertex_descriptor Vertex;
| ^~~~~~
interfaces.cpp: In function ‘SEXPREC* BGL_articulation_points_U(SEXP, SEXP, SEXP, SEXP)’:
interfaces.cpp:295:60: warning: typedef ‘Edge’ locally defined but not used [-Wunused-local-typedefs]
295 | typedef graph_traits < Graph_ud >::edge_descriptor Edge;
| ^~~~
interfaces.cpp: In function ‘SEXPREC* BGL_edge_connectivity_U(SEXP, SEXP, SEXP, SEXP)’:
interfaces.cpp:320:62: warning: typedef ‘Vertex’ locally defined but not used [-Wunused-local-typedefs]
320 | typedef graph_traits < Graph_ud >::vertex_descriptor Vertex;
| ^~~~~~
interfaces.cpp: In function ‘SEXPREC* BGL_sequential_vertex_coloring(SEXP, SEXP, SEXP)’:
interfaces.cpp:360:60: warning: typedef ‘Edge’ locally defined but not used [-Wunused-local-typedefs]
360 | typedef graph_traits < Graph_ud >::edge_descriptor Edge;
| ^~~~
interfaces.cpp:361:62: warning: typedef ‘Vertex’ locally defined but not used [-Wunused-local-typedefs]
361 | typedef graph_traits < Graph_ud >::vertex_descriptor Vertex;
| ^~~~~~
In file included from /home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/assert.hpp:35,
from /home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:19:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::constraint<Model>::failed() [with Model = boost::WritablePropertyMapConcept<int*, long unsigned int>]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/connected_components.hpp:76:5: required from ‘typename boost::property_traits<IndexMap>::value_type boost::connected_components(const Graph&, ComponentMap, typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = R_adjacency_list<undirectedS, double>; ComponentMap = int*; typename property_traits<IndexMap>::value_type = int; typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits<Graph>::traversal_category = undir_adj_list_traversal_tag]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
interfaces.cpp:205:29: required from here
205 | connected_components(g, &component[0]);
| ~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:65:52: warning: ‘this’ pointer is null [-Wnonnull]
65 | static void failed() { ((Model*)0)->constraints(); }
| ~~~~~~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:179:10: note: in a call to non-static member function ‘void boost::WritablePropertyMapConcept<PMap, Key>::constraints() [with PMap = int*; Key = long unsigned int]’
179 | void constraints() {
| ^~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Convertible<boost::lvalue_property_map_tag, boost::writable_property_map_tag> >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/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> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/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))
| ^~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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);
| ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/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) );
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/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;
| ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::WritablePropertyMapConcept<int*, long unsigned int>]’
32 | inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
| ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied<boost::WritablePropertyMapConcept<int*, long unsigned int> >::value’
44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied<boost::WritablePropertyMapConcept<int*, long unsigned int> >’
45 | typedef boost::integral_constant<bool, value> type;
| ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_<void (*)(boost::WritablePropertyMapConcept<int*, long unsigned int>)>’
72 | struct requirement_<void(*)(Model)>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/connected_components.hpp:76:5: required from ‘typename boost::property_traits<IndexMap>::value_type boost::connected_components(const Graph&, ComponentMap, typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = R_adjacency_list<undirectedS, double>; ComponentMap = int*; typename property_traits<IndexMap>::value_type = int; typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits<Graph>::traversal_category = undir_adj_list_traversal_tag]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
interfaces.cpp:205:29: required from here
205 | connected_components(g, &component[0]);
| ~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
In file included from /home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:31,
from /home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:20:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Convertible<boost::lvalue_property_map_tag, boost::writable_property_map_tag>]’
20 | ~usage_requirements() { ((Model*)0)->~Model(); }
| ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::ConvertibleConcept<boost::lvalue_property_map_tag, boost::writable_property_map_tag>]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:180:7: required from ‘void boost::WritablePropertyMapConcept<PMap, Key>::constraints() [with PMap = int*; Key = long unsigned int]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::WritablePropertyMapConcept<int*, long unsigned int>]’
32 | inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
| ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied<boost::WritablePropertyMapConcept<int*, long unsigned int> >::value’
44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied<boost::WritablePropertyMapConcept<int*, long unsigned int> >’
45 | typedef boost::integral_constant<bool, value> type;
| ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_<void (*)(boost::WritablePropertyMapConcept<int*, long unsigned int>)>’
72 | struct requirement_<void(*)(Model)>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/connected_components.hpp:76:5: required from ‘typename boost::property_traits<IndexMap>::value_type boost::connected_components(const Graph&, ComponentMap, typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = R_adjacency_list<undirectedS, double>; ComponentMap = int*; typename property_traits<IndexMap>::value_type = int; typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits<Graph>::traversal_category = undir_adj_list_traversal_tag]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
interfaces.cpp:205:29: required from here
205 | connected_components(g, &component[0]);
| ~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
In file included from /home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/preprocessor/repetition/enum_binary_params.hpp:15,
from /home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/utility/base_from_member.hpp:15,
from /home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/utility.hpp:15,
from RBGL.hpp:16:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:206:17: note: in a call to non-static member function ‘boost::ConvertibleConcept<boost::lvalue_property_map_tag, boost::writable_property_map_tag>::~ConvertibleConcept()’
206 | BOOST_concept(Convertible,(X)(Y))
| ^~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/preprocessor/cat.hpp:29:34: note: in definition of macro ‘BOOST_PP_CAT_I’
29 | # define BOOST_PP_CAT_I(a, b) a ## b
| ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/concept_def.hpp:23:12: note: in expansion of macro ‘BOOST_PP_CAT’
23 | struct BOOST_PP_CAT(name,Concept) \
| ^~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:206:3: note: in expansion of macro ‘BOOST_concept’
206 | BOOST_concept(Convertible,(X)(Y))
| ^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Assignable<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:145:5: required from ‘struct boost::Assignable<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > >’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > >’
502 | BOOST_concept(InputIterator,(TT))
| ^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:540:3: required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > >’
540 | BOOST_concept(ForwardIterator,(TT))
| ^~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > >’
568 | BOOST_concept(BidirectionalIterator,(TT))
| ^~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > >’
597 | BOOST_concept(RandomAccessIterator,(TT))
| ^~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied<boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > > >::value’
44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied<boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > > >’
45 | typedef boost::integral_constant<bool, value> type;
| ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_<void (*)(boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > >)>’
72 | struct requirement_<void(*)(Model)>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map<RAIter, ID, Value, Value&> boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >; Value = long unsigned int; ID = typed_identity_property_map<long unsigned int>]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/sequential_vertex_coloring.hpp:120:35: required from ‘typename boost::property_traits<IndexMap>::value_type boost::sequential_vertex_coloring(const VertexListGraph&, ColorMap) [with VertexListGraph = R_adjacency_list<undirectedS, double>; ColorMap = iterator_property_map<long unsigned int*, vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int> >; typename property_traits<IndexMap>::value_type = long unsigned int]’
120 | make_iterator_property_map(order.begin(), identity_property_map(),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
121 | graph_traits< VertexListGraph >::null_vertex()),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
interfaces.cpp:370:56: required from here
370 | Vertex_Size_Type n = sequential_vertex_coloring( g, color );
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Assignable<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > >]’
20 | ~usage_requirements() { ((Model*)0)->~Model(); }
| ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::EqualityComparable<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > >’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > >’
502 | BOOST_concept(InputIterator,(TT))
| ^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:540:3: required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > >’
540 | BOOST_concept(ForwardIterator,(TT))
| ^~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > >’
568 | BOOST_concept(BidirectionalIterator,(TT))
| ^~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > >’
597 | BOOST_concept(RandomAccessIterator,(TT))
| ^~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied<boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > > >::value’
44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied<boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > > >’
45 | typedef boost::integral_constant<bool, value> type;
| ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_<void (*)(boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > >)>’
72 | struct requirement_<void(*)(Model)>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map<RAIter, ID, Value, Value&> boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >; Value = long unsigned int; ID = typed_identity_property_map<long unsigned int>]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/sequential_vertex_coloring.hpp:120:35: required from ‘typename boost::property_traits<IndexMap>::value_type boost::sequential_vertex_coloring(const VertexListGraph&, ColorMap) [with VertexListGraph = R_adjacency_list<undirectedS, double>; ColorMap = iterator_property_map<long unsigned int*, vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int> >; typename property_traits<IndexMap>::value_type = long unsigned int]’
120 | make_iterator_property_map(order.begin(), identity_property_map(),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
121 | graph_traits< VertexListGraph >::null_vertex()),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
interfaces.cpp:370:56: required from here
370 | Vertex_Size_Type n = sequential_vertex_coloring( g, color );
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::EqualityComparable<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > >]’
20 | ~usage_requirements() { ((Model*)0)->~Model(); }
| ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::InputIterator<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:512:7: required from ‘struct boost::InputIterator<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > >’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:540:3: required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > >’
540 | BOOST_concept(ForwardIterator,(TT))
| ^~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > >’
568 | BOOST_concept(BidirectionalIterator,(TT))
| ^~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > >’
597 | BOOST_concept(RandomAccessIterator,(TT))
| ^~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied<boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > > >::value’
44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied<boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > > >’
45 | typedef boost::integral_constant<bool, value> type;
| ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_<void (*)(boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > >)>’
72 | struct requirement_<void(*)(Model)>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map<RAIter, ID, Value, Value&> boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >; Value = long unsigned int; ID = typed_identity_property_map<long unsigned int>]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/sequential_vertex_coloring.hpp:120:35: required from ‘typename boost::property_traits<IndexMap>::value_type boost::sequential_vertex_coloring(const VertexListGraph&, ColorMap) [with VertexListGraph = R_adjacency_list<undirectedS, double>; ColorMap = iterator_property_map<long unsigned int*, vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int> >; typename property_traits<IndexMap>::value_type = long unsigned int]’
120 | make_iterator_property_map(order.begin(), identity_property_map(),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
121 | graph_traits< VertexListGraph >::null_vertex()),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
interfaces.cpp:370:56: required from here
370 | Vertex_Size_Type n = sequential_vertex_coloring( g, color );
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::InputIterator<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > >]’
20 | ~usage_requirements() { ((Model*)0)->~Model(); }
| ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::ForwardIterator<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:543:7: required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > >’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > >’
568 | BOOST_concept(BidirectionalIterator,(TT))
| ^~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > >’
597 | BOOST_concept(RandomAccessIterator,(TT))
| ^~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > >’
597 | BOOST_concept(RandomAccessIterator,(TT))
| ^~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > >]’
32 | inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
| ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied<boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > > >::value’
44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied<boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > > >’
45 | typedef boost::integral_constant<bool, value> type;
| ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_<void (*)(boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > >)>’
72 | struct requirement_<void(*)(Model)>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map<RAIter, ID, Value, Value&> boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >; Value = long unsigned int; ID = typed_identity_property_map<long unsigned int>]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/sequential_vertex_coloring.hpp:120:35: required from ‘typename boost::property_traits<IndexMap>::value_type boost::sequential_vertex_coloring(const VertexListGraph&, ColorMap) [with VertexListGraph = R_adjacency_list<undirectedS, double>; ColorMap = iterator_property_map<long unsigned int*, vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int> >; typename property_traits<IndexMap>::value_type = long unsigned int]’
120 | make_iterator_property_map(order.begin(), identity_property_map(),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
121 | graph_traits< VertexListGraph >::null_vertex()),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
interfaces.cpp:370:56: required from here
370 | Vertex_Size_Type n = sequential_vertex_coloring( g, color );
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::ForwardIterator<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > >]’
20 | ~usage_requirements() { ((Model*)0)->~Model(); }
| ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::BidirectionalIterator<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:571:7: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > >’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > >’
597 | BOOST_concept(RandomAccessIterator,(TT))
| ^~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > >’
597 | BOOST_concept(RandomAccessIterator,(TT))
| ^~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > >]’
32 | inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
| ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied<boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > > >::value’
44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied<boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > > >’
45 | typedef boost::integral_constant<bool, value> type;
| ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_<void (*)(boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > >)>’
72 | struct requirement_<void(*)(Model)>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map<RAIter, ID, Value, Value&> boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >; Value = long unsigned int; ID = typed_identity_property_map<long unsigned int>]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/sequential_vertex_coloring.hpp:120:35: required from ‘typename boost::property_traits<IndexMap>::value_type boost::sequential_vertex_coloring(const VertexListGraph&, ColorMap) [with VertexListGraph = R_adjacency_list<undirectedS, double>; ColorMap = iterator_property_map<long unsigned int*, vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int> >; typename property_traits<IndexMap>::value_type = long unsigned int]’
120 | make_iterator_property_map(order.begin(), identity_property_map(),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
121 | graph_traits< VertexListGraph >::null_vertex()),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
interfaces.cpp:370:56: required from here
370 | Vertex_Size_Type n = sequential_vertex_coloring( g, color );
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::BidirectionalIterator<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > >]’
20 | ~usage_requirements() { ((Model*)0)->~Model(); }
| ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Comparable<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:253:5: required from ‘struct boost::Comparable<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > >’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > >’
597 | BOOST_concept(RandomAccessIterator,(TT))
| ^~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > >’
597 | BOOST_concept(RandomAccessIterator,(TT))
| ^~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > >]’
32 | inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
| ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied<boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > > >::value’
44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied<boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > > >’
45 | typedef boost::integral_constant<bool, value> type;
| ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_<void (*)(boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > >)>’
72 | struct requirement_<void(*)(Model)>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map<RAIter, ID, Value, Value&> boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >; Value = long unsigned int; ID = typed_identity_property_map<long unsigned int>]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/sequential_vertex_coloring.hpp:120:35: required from ‘typename boost::property_traits<IndexMap>::value_type boost::sequential_vertex_coloring(const VertexListGraph&, ColorMap) [with VertexListGraph = R_adjacency_list<undirectedS, double>; ColorMap = iterator_property_map<long unsigned int*, vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int> >; typename property_traits<IndexMap>::value_type = long unsigned int]’
120 | make_iterator_property_map(order.begin(), identity_property_map(),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
121 | graph_traits< VertexListGraph >::null_vertex()),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
interfaces.cpp:370:56: required from here
370 | Vertex_Size_Type n = sequential_vertex_coloring( g, color );
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Comparable<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > >]’
20 | ~usage_requirements() { ((Model*)0)->~Model(); }
| ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::RandomAccessIterator<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:601:7: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > >’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > >’
597 | BOOST_concept(RandomAccessIterator,(TT))
| ^~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > >]’
32 | inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
| ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied<boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > > >::value’
44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied<boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > > >’
45 | typedef boost::integral_constant<bool, value> type;
| ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_<void (*)(boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > >)>’
72 | struct requirement_<void(*)(Model)>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map<RAIter, ID, Value, Value&> boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >; Value = long unsigned int; ID = typed_identity_property_map<long unsigned int>]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/sequential_vertex_coloring.hpp:120:35: required from ‘typename boost::property_traits<IndexMap>::value_type boost::sequential_vertex_coloring(const VertexListGraph&, ColorMap) [with VertexListGraph = R_adjacency_list<undirectedS, double>; ColorMap = iterator_property_map<long unsigned int*, vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int> >; typename property_traits<IndexMap>::value_type = long unsigned int]’
120 | make_iterator_property_map(order.begin(), identity_property_map(),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
121 | graph_traits< VertexListGraph >::null_vertex()),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
interfaces.cpp:370:56: required from here
370 | Vertex_Size_Type n = sequential_vertex_coloring( g, color );
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::RandomAccessIterator<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > >]’
20 | ~usage_requirements() { ((Model*)0)->~Model(); }
| ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map<RAIter, ID, Value, Value&> boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >; Value = long unsigned int; ID = typed_identity_property_map<long unsigned int>]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/sequential_vertex_coloring.hpp:120:35: required from ‘typename boost::property_traits<IndexMap>::value_type boost::sequential_vertex_coloring(const VertexListGraph&, ColorMap) [with VertexListGraph = R_adjacency_list<undirectedS, double>; ColorMap = iterator_property_map<long unsigned int*, vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int> >; typename property_traits<IndexMap>::value_type = long unsigned int]’
120 | make_iterator_property_map(order.begin(), identity_property_map(),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
121 | graph_traits< VertexListGraph >::null_vertex()),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
interfaces.cpp:370:56: required from here
370 | Vertex_Size_Type n = sequential_vertex_coloring( g, color );
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:17: note: in a call to non-static member function ‘boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > >::~RandomAccessIteratorConcept()’
597 | BOOST_concept(RandomAccessIterator,(TT))
| ^~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/preprocessor/cat.hpp:29:34: note: in definition of macro ‘BOOST_PP_CAT_I’
29 | # define BOOST_PP_CAT_I(a, b) a ## b
| ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/concept_def.hpp:23:12: note: in expansion of macro ‘BOOST_PP_CAT’
23 | struct BOOST_PP_CAT(name,Concept) \
| ^~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3: note: in expansion of macro ‘BOOST_concept’
597 | BOOST_concept(RandomAccessIterator,(TT))
| ^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Convertible<boost::lvalue_property_map_tag, boost::writable_property_map_tag>]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/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(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/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> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/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))
| ^~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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);
| ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/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) );
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::WritablePropertyMapConcept<int*, long unsigned int>]’
32 | inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
| ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied<boost::WritablePropertyMapConcept<int*, long unsigned int> >::value’
44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied<boost::WritablePropertyMapConcept<int*, long unsigned int> >’
45 | typedef boost::integral_constant<bool, value> type;
| ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_<void (*)(boost::WritablePropertyMapConcept<int*, long unsigned int>)>’
72 | struct requirement_<void(*)(Model)>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/connected_components.hpp:76:5: required from ‘typename boost::property_traits<IndexMap>::value_type boost::connected_components(const Graph&, ComponentMap, typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = R_adjacency_list<undirectedS, double>; ComponentMap = int*; typename property_traits<IndexMap>::value_type = int; typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits<Graph>::traversal_category = undir_adj_list_traversal_tag]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
interfaces.cpp:205:29: required from here
205 | connected_components(g, &component[0]);
| ~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
20 | ~usage_requirements() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible<X, Y>::~Convertible() [with X = boost::lvalue_property_map_tag; Y = boost::writable_property_map_tag]’
37 | ~model()
| ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
208 | BOOST_CONCEPT_USAGE(Convertible) {
| ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Assignable<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Assignable<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > > >]’
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:145:5: required from ‘struct boost::Assignable<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > >’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > >’
502 | BOOST_concept(InputIterator,(TT))
| ^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:540:3: required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > >’
540 | BOOST_concept(ForwardIterator,(TT))
| ^~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > >’
568 | BOOST_concept(BidirectionalIterator,(TT))
| ^~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied<boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > > >::value’
44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied<boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > > >’
45 | typedef boost::integral_constant<bool, value> type;
| ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_<void (*)(boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > >)>’
72 | struct requirement_<void(*)(Model)>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map<RAIter, ID, Value, Value&> boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >; Value = long unsigned int; ID = typed_identity_property_map<long unsigned int>]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/sequential_vertex_coloring.hpp:120:35: required from ‘typename boost::property_traits<IndexMap>::value_type boost::sequential_vertex_coloring(const VertexListGraph&, ColorMap) [with VertexListGraph = R_adjacency_list<undirectedS, double>; ColorMap = iterator_property_map<long unsigned int*, vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int> >; typename property_traits<IndexMap>::value_type = long unsigned int]’
120 | make_iterator_property_map(order.begin(), identity_property_map(),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
121 | graph_traits< VertexListGraph >::null_vertex()),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
interfaces.cpp:370:56: required from here
370 | Vertex_Size_Type n = sequential_vertex_coloring( g, color );
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
20 | ~usage_requirements() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Assignable<TT>::~Assignable() [with TT = __gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >]’
37 | ~model()
| ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:145:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
145 | BOOST_CONCEPT_USAGE(Assignable) {
| ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::EqualityComparable<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::EqualityComparable<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > > >]’
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > >’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > >’
502 | BOOST_concept(InputIterator,(TT))
| ^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:540:3: required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > >’
540 | BOOST_concept(ForwardIterator,(TT))
| ^~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > >’
568 | BOOST_concept(BidirectionalIterator,(TT))
| ^~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied<boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > > >::value’
44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied<boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > > >’
45 | typedef boost::integral_constant<bool, value> type;
| ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_<void (*)(boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > >)>’
72 | struct requirement_<void(*)(Model)>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map<RAIter, ID, Value, Value&> boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >; Value = long unsigned int; ID = typed_identity_property_map<long unsigned int>]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/sequential_vertex_coloring.hpp:120:35: required from ‘typename boost::property_traits<IndexMap>::value_type boost::sequential_vertex_coloring(const VertexListGraph&, ColorMap) [with VertexListGraph = R_adjacency_list<undirectedS, double>; ColorMap = iterator_property_map<long unsigned int*, vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int> >; typename property_traits<IndexMap>::value_type = long unsigned int]’
120 | make_iterator_property_map(order.begin(), identity_property_map(),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
121 | graph_traits< VertexListGraph >::null_vertex()),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
interfaces.cpp:370:56: required from here
370 | Vertex_Size_Type n = sequential_vertex_coloring( g, color );
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
20 | ~usage_requirements() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::EqualityComparable<TT>::~EqualityComparable() [with TT = __gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >]’
37 | ~model()
| ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:233:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
233 | BOOST_CONCEPT_USAGE(EqualityComparable) {
| ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::InputIterator<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::InputIterator<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > > >]’
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:512:7: required from ‘struct boost::InputIterator<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > >’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:540:3: required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > >’
540 | BOOST_concept(ForwardIterator,(TT))
| ^~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > >’
568 | BOOST_concept(BidirectionalIterator,(TT))
| ^~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > >’
597 | BOOST_concept(RandomAccessIterator,(TT))
| ^~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied<boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > > >::value’
44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied<boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > > >’
45 | typedef boost::integral_constant<bool, value> type;
| ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_<void (*)(boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > >)>’
72 | struct requirement_<void(*)(Model)>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map<RAIter, ID, Value, Value&> boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >; Value = long unsigned int; ID = typed_identity_property_map<long unsigned int>]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/sequential_vertex_coloring.hpp:120:35: required from ‘typename boost::property_traits<IndexMap>::value_type boost::sequential_vertex_coloring(const VertexListGraph&, ColorMap) [with VertexListGraph = R_adjacency_list<undirectedS, double>; ColorMap = iterator_property_map<long unsigned int*, vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int> >; typename property_traits<IndexMap>::value_type = long unsigned int]’
120 | make_iterator_property_map(order.begin(), identity_property_map(),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
121 | graph_traits< VertexListGraph >::null_vertex()),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
interfaces.cpp:370:56: required from here
370 | Vertex_Size_Type n = sequential_vertex_coloring( g, color );
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
20 | ~usage_requirements() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::InputIterator<TT>::~InputIterator() [with TT = __gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >]’
37 | ~model()
| ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:512:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
512 | BOOST_CONCEPT_USAGE(InputIterator)
| ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::ForwardIterator<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::ForwardIterator<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > > >]’
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:543:7: required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > >’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > >’
568 | BOOST_concept(BidirectionalIterator,(TT))
| ^~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > >’
597 | BOOST_concept(RandomAccessIterator,(TT))
| ^~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied<boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > > >::value’
44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied<boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > > >’
45 | typedef boost::integral_constant<bool, value> type;
| ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_<void (*)(boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > >)>’
72 | struct requirement_<void(*)(Model)>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map<RAIter, ID, Value, Value&> boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >; Value = long unsigned int; ID = typed_identity_property_map<long unsigned int>]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/sequential_vertex_coloring.hpp:120:35: required from ‘typename boost::property_traits<IndexMap>::value_type boost::sequential_vertex_coloring(const VertexListGraph&, ColorMap) [with VertexListGraph = R_adjacency_list<undirectedS, double>; ColorMap = iterator_property_map<long unsigned int*, vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int> >; typename property_traits<IndexMap>::value_type = long unsigned int]’
120 | make_iterator_property_map(order.begin(), identity_property_map(),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
121 | graph_traits< VertexListGraph >::null_vertex()),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
interfaces.cpp:370:56: required from here
370 | Vertex_Size_Type n = sequential_vertex_coloring( g, color );
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
20 | ~usage_requirements() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::ForwardIterator<TT>::~ForwardIterator() [with TT = __gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >]’
37 | ~model()
| ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:543:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
543 | BOOST_CONCEPT_USAGE(ForwardIterator)
| ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::BidirectionalIterator<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::BidirectionalIterator<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > > >]’
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:571:7: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > >’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > >’
597 | BOOST_concept(RandomAccessIterator,(TT))
| ^~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > >’
597 | BOOST_concept(RandomAccessIterator,(TT))
| ^~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > >]’
32 | inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
| ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied<boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > > >::value’
44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied<boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > > >’
45 | typedef boost::integral_constant<bool, value> type;
| ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_<void (*)(boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > >)>’
72 | struct requirement_<void(*)(Model)>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map<RAIter, ID, Value, Value&> boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >; Value = long unsigned int; ID = typed_identity_property_map<long unsigned int>]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/sequential_vertex_coloring.hpp:120:35: required from ‘typename boost::property_traits<IndexMap>::value_type boost::sequential_vertex_coloring(const VertexListGraph&, ColorMap) [with VertexListGraph = R_adjacency_list<undirectedS, double>; ColorMap = iterator_property_map<long unsigned int*, vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int> >; typename property_traits<IndexMap>::value_type = long unsigned int]’
120 | make_iterator_property_map(order.begin(), identity_property_map(),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
121 | graph_traits< VertexListGraph >::null_vertex()),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
interfaces.cpp:370:56: required from here
370 | Vertex_Size_Type n = sequential_vertex_coloring( g, color );
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
20 | ~usage_requirements() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::BidirectionalIterator<TT>::~BidirectionalIterator() [with TT = __gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >]’
37 | ~model()
| ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:571:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
571 | BOOST_CONCEPT_USAGE(BidirectionalIterator)
| ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Comparable<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Comparable<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > > >]’
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:253:5: required from ‘struct boost::Comparable<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > >’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > >’
597 | BOOST_concept(RandomAccessIterator,(TT))
| ^~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > >’
597 | BOOST_concept(RandomAccessIterator,(TT))
| ^~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > >]’
32 | inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
| ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied<boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > > >::value’
44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied<boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > > >’
45 | typedef boost::integral_constant<bool, value> type;
| ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_<void (*)(boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > >)>’
72 | struct requirement_<void(*)(Model)>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map<RAIter, ID, Value, Value&> boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >; Value = long unsigned int; ID = typed_identity_property_map<long unsigned int>]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/sequential_vertex_coloring.hpp:120:35: required from ‘typename boost::property_traits<IndexMap>::value_type boost::sequential_vertex_coloring(const VertexListGraph&, ColorMap) [with VertexListGraph = R_adjacency_list<undirectedS, double>; ColorMap = iterator_property_map<long unsigned int*, vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int> >; typename property_traits<IndexMap>::value_type = long unsigned int]’
120 | make_iterator_property_map(order.begin(), identity_property_map(),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
121 | graph_traits< VertexListGraph >::null_vertex()),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
interfaces.cpp:370:56: required from here
370 | Vertex_Size_Type n = sequential_vertex_coloring( g, color );
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
20 | ~usage_requirements() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Comparable<TT>::~Comparable() [with TT = __gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >]’
37 | ~model()
| ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:253:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
253 | BOOST_CONCEPT_USAGE(Comparable) {
| ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::RandomAccessIterator<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::RandomAccessIterator<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > > >]’
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:601:7: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > >’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > >’
597 | BOOST_concept(RandomAccessIterator,(TT))
| ^~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > >]’
32 | inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
| ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied<boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > > >::value’
44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied<boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > > >’
45 | typedef boost::integral_constant<bool, value> type;
| ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_<void (*)(boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > >)>’
72 | struct requirement_<void(*)(Model)>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map<RAIter, ID, Value, Value&> boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >; Value = long unsigned int; ID = typed_identity_property_map<long unsigned int>]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/sequential_vertex_coloring.hpp:120:35: required from ‘typename boost::property_traits<IndexMap>::value_type boost::sequential_vertex_coloring(const VertexListGraph&, ColorMap) [with VertexListGraph = R_adjacency_list<undirectedS, double>; ColorMap = iterator_property_map<long unsigned int*, vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int> >; typename property_traits<IndexMap>::value_type = long unsigned int]’
120 | make_iterator_property_map(order.begin(), identity_property_map(),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
121 | graph_traits< VertexListGraph >::null_vertex()),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
interfaces.cpp:370:56: required from here
370 | Vertex_Size_Type n = sequential_vertex_coloring( g, color );
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
20 | ~usage_requirements() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::RandomAccessIterator<TT>::~RandomAccessIterator() [with TT = __gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >]’
37 | ~model()
| ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:601:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
601 | BOOST_CONCEPT_USAGE(RandomAccessIterator)
| ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::constraint<Model>::failed() [with Model = boost::DFSVisitorConcept<dfs_time_visitor<long unsigned int*>, R_adjacency_list<boost::directedS, double> >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:130:9: required from ‘void boost::depth_first_search(const VertexListGraph&, DFSVisitor, ColorMap, typename graph_traits<Graph>::vertex_descriptor) [with VertexListGraph = R_adjacency_list<directedS, double>; DFSVisitor = dfs_time_visitor<long unsigned int*>; ColorMap = shared_array_property_map<default_color_type, vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int> >; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/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 dfs_time_visitor<long unsigned int*> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; Graph = R_adjacency_list<boost::directedS, double>]’
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)]);
| ~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/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 = R_adjacency_list<boost::directedS, double>; ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<keywords::tag::visitor, const dfs_time_visitor<long unsigned 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); \
| ~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/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 = R_adjacency_list<directedS, double>; P = dfs_time_visitor<long unsigned 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 dfs_time_visitor<long unsigned 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); \
| ~~~~~~~~~
interfaces.cpp:158:27: required from here
158 | depth_first_search(g, visitor(vis));
| ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/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 interfaces.cpp:3:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/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 = dfs_time_visitor<long unsigned int*>; Graph = R_adjacency_list<boost::directedS, double>]’
39 | void constraints()
| ^~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Convertible<std::random_access_iterator_tag, std::random_access_iterator_tag> >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/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> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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);
| ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/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) );
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/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;
| ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/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)>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:603:11: required from ‘boost::RandomAccessIterator<TT>::~RandomAccessIterator() [with TT = __gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3: required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > >]’
597 | BOOST_concept(RandomAccessIterator,(TT))
| ^~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map<RAIter, ID, Value, Value&> boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >; Value = long unsigned int; ID = typed_identity_property_map<long unsigned int>]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/sequential_vertex_coloring.hpp:120:35: required from ‘typename boost::property_traits<IndexMap>::value_type boost::sequential_vertex_coloring(const VertexListGraph&, ColorMap) [with VertexListGraph = R_adjacency_list<undirectedS, double>; ColorMap = iterator_property_map<long unsigned int*, vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int> >; typename property_traits<IndexMap>::value_type = long unsigned int]’
120 | make_iterator_property_map(order.begin(), identity_property_map(),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
121 | graph_traits< VertexListGraph >::null_vertex()),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
interfaces.cpp:370:56: required from here
370 | Vertex_Size_Type n = sequential_vertex_coloring( g, color );
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Convertible<std::random_access_iterator_tag, std::random_access_iterator_tag>]’
20 | ~usage_requirements() { ((Model*)0)->~Model(); }
| ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::Convertible<std::random_access_iterator_tag, std::random_access_iterator_tag>]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:603:11: required from ‘boost::RandomAccessIterator<TT>::~RandomAccessIterator() [with TT = __gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3: required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > >]’
597 | BOOST_concept(RandomAccessIterator,(TT))
| ^~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map<RAIter, ID, Value, Value&> boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >; Value = long unsigned int; ID = typed_identity_property_map<long unsigned int>]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/sequential_vertex_coloring.hpp:120:35: required from ‘typename boost::property_traits<IndexMap>::value_type boost::sequential_vertex_coloring(const VertexListGraph&, ColorMap) [with VertexListGraph = R_adjacency_list<undirectedS, double>; ColorMap = iterator_property_map<long unsigned int*, vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int> >; typename property_traits<IndexMap>::value_type = long unsigned int]’
120 | make_iterator_property_map(order.begin(), identity_property_map(),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
121 | graph_traits< VertexListGraph >::null_vertex()),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
interfaces.cpp:370:56: required from here
370 | Vertex_Size_Type n = sequential_vertex_coloring( g, color );
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible<X, Y>::~Convertible() [with X = std::random_access_iterator_tag; Y = std::random_access_iterator_tag]’
37 | ~model()
| ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
208 | BOOST_CONCEPT_USAGE(Convertible) {
| ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/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<dfs_time_visitor<long unsigned int*> > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:167:5: required from ‘struct boost::CopyConstructible<dfs_time_visitor<long unsigned int*> >’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:165:3: required from ‘struct boost::CopyConstructibleConcept<dfs_time_visitor<long unsigned int*> >’
165 | BOOST_concept(CopyConstructible,(TT))
| ^~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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<dfs_time_visitor<long unsigned int*> >]’
32 | inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
| ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied<boost::CopyConstructibleConcept<dfs_time_visitor<long unsigned int*> > >::value’
44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied<boost::CopyConstructibleConcept<dfs_time_visitor<long unsigned int*> > >’
45 | typedef boost::integral_constant<bool, value> type;
| ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_<void (*)(boost::DFSVisitorConcept<dfs_time_visitor<long unsigned int*>, R_adjacency_list<boost::directedS, double> >)>’
72 | struct requirement_<void(*)(Model)>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:130:9: required from ‘void boost::depth_first_search(const VertexListGraph&, DFSVisitor, ColorMap, typename graph_traits<Graph>::vertex_descriptor) [with VertexListGraph = R_adjacency_list<directedS, double>; DFSVisitor = dfs_time_visitor<long unsigned int*>; ColorMap = shared_array_property_map<default_color_type, vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int> >; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/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 dfs_time_visitor<long unsigned int*> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; Graph = R_adjacency_list<boost::directedS, double>]’
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)]);
| ~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/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 = R_adjacency_list<boost::directedS, double>; ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<keywords::tag::visitor, const dfs_time_visitor<long unsigned 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); \
| ~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/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 = R_adjacency_list<directedS, double>; P = dfs_time_visitor<long unsigned 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 dfs_time_visitor<long unsigned 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); \
| ~~~~~~~~~
interfaces.cpp:158:27: required from here
158 | depth_first_search(g, visitor(vis));
| ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/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<dfs_time_visitor<long unsigned int*> >]’
20 | ~usage_requirements() { ((Model*)0)->~Model(); }
| ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::CopyConstructibleConcept<dfs_time_visitor<long unsigned int*> >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:41:9: required from ‘void boost::DFSVisitorConcept<Visitor, Graph>::constraints() [with Visitor = dfs_time_visitor<long unsigned int*>; Graph = R_adjacency_list<boost::directedS, double>]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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<dfs_time_visitor<long unsigned int*>, R_adjacency_list<boost::directedS, double> >]’
32 | inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
| ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied<boost::DFSVisitorConcept<dfs_time_visitor<long unsigned int*>, R_adjacency_list<boost::directedS, double> > >::value’
44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied<boost::DFSVisitorConcept<dfs_time_visitor<long unsigned int*>, R_adjacency_list<boost::directedS, double> > >’
45 | typedef boost::integral_constant<bool, value> type;
| ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_<void (*)(boost::DFSVisitorConcept<dfs_time_visitor<long unsigned int*>, R_adjacency_list<boost::directedS, double> >)>’
72 | struct requirement_<void(*)(Model)>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:130:9: required from ‘void boost::depth_first_search(const VertexListGraph&, DFSVisitor, ColorMap, typename graph_traits<Graph>::vertex_descriptor) [with VertexListGraph = R_adjacency_list<directedS, double>; DFSVisitor = dfs_time_visitor<long unsigned int*>; ColorMap = shared_array_property_map<default_color_type, vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int> >; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/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 dfs_time_visitor<long unsigned int*> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; Graph = R_adjacency_list<boost::directedS, double>]’
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)]);
| ~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/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 = R_adjacency_list<boost::directedS, double>; ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<keywords::tag::visitor, const dfs_time_visitor<long unsigned 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); \
| ~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/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 = R_adjacency_list<directedS, double>; P = dfs_time_visitor<long unsigned 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 dfs_time_visitor<long unsigned 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); \
| ~~~~~~~~~
interfaces.cpp:158:27: required from here
158 | depth_first_search(g, visitor(vis));
| ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:165:17: note: in a call to non-static member function ‘boost::CopyConstructibleConcept<dfs_time_visitor<long unsigned int*> >::~CopyConstructibleConcept()’
165 | BOOST_concept(CopyConstructible,(TT))
| ^~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/preprocessor/cat.hpp:29:34: note: in definition of macro ‘BOOST_PP_CAT_I’
29 | # define BOOST_PP_CAT_I(a, b) a ## b
| ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/concept_def.hpp:23:12: note: in expansion of macro ‘BOOST_PP_CAT’
23 | struct BOOST_PP_CAT(name,Concept) \
| ^~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:165:3: note: in expansion of macro ‘BOOST_concept’
165 | BOOST_concept(CopyConstructible,(TT))
| ^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/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<R_adjacency_list<boost::directedS, double> > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:66:5: required from ‘struct boost::concepts::Graph<R_adjacency_list<boost::directedS, double> >’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:75:1: required from ‘struct boost::concepts::IncidenceGraph<R_adjacency_list<boost::directedS, double> >’
75 | BOOST_concept(IncidenceGraph, (G)) : Graph< G >
| ^~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:75:1: required from ‘struct boost::concepts::IncidenceGraphConcept<R_adjacency_list<boost::directedS, double> >’
75 | BOOST_concept(IncidenceGraph, (G)) : Graph< G >
| ^~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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<R_adjacency_list<boost::directedS, double> >]’
32 | inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
| ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied<boost::concepts::IncidenceGraphConcept<R_adjacency_list<boost::directedS, double> > >::value’
44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:129:9: required from ‘void boost::detail::depth_first_visit_impl(const IncidenceGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, DFSVisitor&, ColorMap, TerminatorFunc) [with IncidenceGraph = R_adjacency_list<boost::directedS, double>; DFSVisitor = dfs_time_visitor<long unsigned int*>; ColorMap = boost::shared_array_property_map<boost::default_color_type, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int> >; TerminatorFunc = nontruth2; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:286:39: required from ‘void boost::depth_first_search(const VertexListGraph&, DFSVisitor, ColorMap, typename graph_traits<Graph>::vertex_descriptor) [with VertexListGraph = R_adjacency_list<directedS, double>; DFSVisitor = dfs_time_visitor<long unsigned int*>; ColorMap = shared_array_property_map<default_color_type, vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int> >; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
286 | detail::depth_first_visit_impl(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
287 | g, start_vertex, vis, color, detail::nontruth2());
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/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 dfs_time_visitor<long unsigned int*> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; Graph = R_adjacency_list<boost::directedS, double>]’
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)]);
| ~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/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 = R_adjacency_list<boost::directedS, double>; ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<keywords::tag::visitor, const dfs_time_visitor<long unsigned 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); \
| ~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/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 = R_adjacency_list<directedS, double>; P = dfs_time_visitor<long unsigned 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 dfs_time_visitor<long unsigned 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); \
| ~~~~~~~~~
interfaces.cpp:158:27: required from here
158 | depth_first_search(g, visitor(vis));
| ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/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<R_adjacency_list<boost::directedS, double> >]’
20 | ~usage_requirements() { ((Model*)0)->~Model(); }
| ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/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<R_adjacency_list<boost::directedS, double> > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:87:5: required from ‘struct boost::concepts::IncidenceGraph<R_adjacency_list<boost::directedS, double> >’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:75:1: required from ‘struct boost::concepts::IncidenceGraphConcept<R_adjacency_list<boost::directedS, double> >’
75 | BOOST_concept(IncidenceGraph, (G)) : Graph< G >
| ^~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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<R_adjacency_list<boost::directedS, double> >]’
32 | inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
| ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied<boost::concepts::IncidenceGraphConcept<R_adjacency_list<boost::directedS, double> > >::value’
44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:129:9: required from ‘void boost::detail::depth_first_visit_impl(const IncidenceGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, DFSVisitor&, ColorMap, TerminatorFunc) [with IncidenceGraph = R_adjacency_list<boost::directedS, double>; DFSVisitor = dfs_time_visitor<long unsigned int*>; ColorMap = boost::shared_array_property_map<boost::default_color_type, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int> >; TerminatorFunc = nontruth2; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:286:39: required from ‘void boost::depth_first_search(const VertexListGraph&, DFSVisitor, ColorMap, typename graph_traits<Graph>::vertex_descriptor) [with VertexListGraph = R_adjacency_list<directedS, double>; DFSVisitor = dfs_time_visitor<long unsigned int*>; ColorMap = shared_array_property_map<default_color_type, vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int> >; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
286 | detail::depth_first_visit_impl(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
287 | g, start_vertex, vis, color, detail::nontruth2());
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/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 dfs_time_visitor<long unsigned int*> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; Graph = R_adjacency_list<boost::directedS, double>]’
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)]);
| ~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/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 = R_adjacency_list<boost::directedS, double>; ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<keywords::tag::visitor, const dfs_time_visitor<long unsigned 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); \
| ~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/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 = R_adjacency_list<directedS, double>; P = dfs_time_visitor<long unsigned 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 dfs_time_visitor<long unsigned 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); \
| ~~~~~~~~~
interfaces.cpp:158:27: required from here
158 | depth_first_search(g, visitor(vis));
| ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/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<R_adjacency_list<boost::directedS, double> >]’
20 | ~usage_requirements() { ((Model*)0)->~Model(); }
| ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/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<R_adjacency_list<boost::directedS, double> >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:129:9: required from ‘void boost::detail::depth_first_visit_impl(const IncidenceGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, DFSVisitor&, ColorMap, TerminatorFunc) [with IncidenceGraph = R_adjacency_list<boost::directedS, double>; DFSVisitor = dfs_time_visitor<long unsigned int*>; ColorMap = boost::shared_array_property_map<boost::default_color_type, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int> >; TerminatorFunc = nontruth2; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:286:39: required from ‘void boost::depth_first_search(const VertexListGraph&, DFSVisitor, ColorMap, typename graph_traits<Graph>::vertex_descriptor) [with VertexListGraph = R_adjacency_list<directedS, double>; DFSVisitor = dfs_time_visitor<long unsigned int*>; ColorMap = shared_array_property_map<default_color_type, vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int> >; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
286 | detail::depth_first_visit_impl(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
287 | g, start_vertex, vis, color, detail::nontruth2());
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/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 dfs_time_visitor<long unsigned int*> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; Graph = R_adjacency_list<boost::directedS, double>]’
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)]);
| ~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/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 = R_adjacency_list<boost::directedS, double>; ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<keywords::tag::visitor, const dfs_time_visitor<long unsigned 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); \
| ~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/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 = R_adjacency_list<directedS, double>; P = dfs_time_visitor<long unsigned 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 dfs_time_visitor<long unsigned 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); \
| ~~~~~~~~~
interfaces.cpp:158:27: required from here
158 | depth_first_search(g, visitor(vis));
| ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:75:15: note: in a call to non-static member function ‘boost::concepts::IncidenceGraphConcept<R_adjacency_list<boost::directedS, double> >::~IncidenceGraphConcept()’
75 | BOOST_concept(IncidenceGraph, (G)) : Graph< G >
| ^~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/preprocessor/cat.hpp:29:34: note: in definition of macro ‘BOOST_PP_CAT_I’
29 | # define BOOST_PP_CAT_I(a, b) a ## b
| ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/concept_def.hpp:23:12: note: in expansion of macro ‘BOOST_PP_CAT’
23 | struct BOOST_PP_CAT(name,Concept) \
| ^~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:75:1: note: in expansion of macro ‘BOOST_concept’
75 | BOOST_concept(IncidenceGraph, (G)) : Graph< G >
| ^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::constraint<Model>::failed() [with Model = boost::ReadWritePropertyMapConcept<boost::shared_array_property_map<boost::default_color_type, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int> >, long unsigned int>]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:134:9: required from ‘void boost::detail::depth_first_visit_impl(const IncidenceGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, DFSVisitor&, ColorMap, TerminatorFunc) [with IncidenceGraph = R_adjacency_list<boost::directedS, double>; DFSVisitor = dfs_time_visitor<long unsigned int*>; ColorMap = boost::shared_array_property_map<boost::default_color_type, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int> >; TerminatorFunc = nontruth2; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:286:39: required from ‘void boost::depth_first_search(const VertexListGraph&, DFSVisitor, ColorMap, typename graph_traits<Graph>::vertex_descriptor) [with VertexListGraph = R_adjacency_list<directedS, double>; DFSVisitor = dfs_time_visitor<long unsigned int*>; ColorMap = shared_array_property_map<default_color_type, vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int> >; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
286 | detail::depth_first_visit_impl(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
287 | g, start_vertex, vis, color, detail::nontruth2());
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/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 dfs_time_visitor<long unsigned int*> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; Graph = R_adjacency_list<boost::directedS, double>]’
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)]);
| ~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/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 = R_adjacency_list<boost::directedS, double>; ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<keywords::tag::visitor, const dfs_time_visitor<long unsigned 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); \
| ~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/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 = R_adjacency_list<directedS, double>; P = dfs_time_visitor<long unsigned 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 dfs_time_visitor<long unsigned 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); \
| ~~~~~~~~~
interfaces.cpp:158:27: required from here
158 | depth_first_search(g, visitor(vis));
| ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:65:52: warning: ‘this’ pointer is null [-Wnonnull]
65 | static void failed() { ((Model*)0)->constraints(); }
| ~~~~~~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:205:10: note: in a call to non-static member function ‘void boost::ReadWritePropertyMapConcept<PMap, Key>::constraints() [with PMap = boost::shared_array_property_map<boost::default_color_type, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int> >; Key = long unsigned int]’
205 | void constraints() {
| ^~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::EqualityComparable<boost::default_color_type> >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable<boost::default_color_type>’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:502:1: required from ‘struct boost::concepts::ColorValue<boost::default_color_type>’
502 | BOOST_concept(ColorValue, (C))
| ^~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:502:1: required from ‘struct boost::concepts::ColorValueConcept<boost::default_color_type>’
502 | BOOST_concept(ColorValue, (C))
| ^~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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);
| ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/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) );
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:136:9: required from ‘void boost::detail::depth_first_visit_impl(const IncidenceGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, DFSVisitor&, ColorMap, TerminatorFunc) [with IncidenceGraph = R_adjacency_list<boost::directedS, double>; DFSVisitor = dfs_time_visitor<long unsigned int*>; ColorMap = boost::shared_array_property_map<boost::default_color_type, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int> >; TerminatorFunc = nontruth2; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:286:39: required from ‘void boost::depth_first_search(const VertexListGraph&, DFSVisitor, ColorMap, typename graph_traits<Graph>::vertex_descriptor) [with VertexListGraph = R_adjacency_list<directedS, double>; DFSVisitor = dfs_time_visitor<long unsigned int*>; ColorMap = shared_array_property_map<default_color_type, vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int> >; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
286 | detail::depth_first_visit_impl(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
287 | g, start_vertex, vis, color, detail::nontruth2());
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/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 dfs_time_visitor<long unsigned int*> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; Graph = R_adjacency_list<boost::directedS, double>]’
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)]);
| ~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/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 = R_adjacency_list<boost::directedS, double>; ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<keywords::tag::visitor, const dfs_time_visitor<long unsigned 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); \
| ~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/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 = R_adjacency_list<directedS, double>; P = dfs_time_visitor<long unsigned 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 dfs_time_visitor<long unsigned 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); \
| ~~~~~~~~~
interfaces.cpp:158:27: required from here
158 | depth_first_search(g, visitor(vis));
| ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::EqualityComparable<boost::default_color_type>]’
20 | ~usage_requirements() { ((Model*)0)->~Model(); }
| ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::DefaultConstructible<boost::default_color_type> >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:137:5: required from ‘struct boost::DefaultConstructible<boost::default_color_type>’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:502:1: required from ‘struct boost::concepts::ColorValue<boost::default_color_type>’
502 | BOOST_concept(ColorValue, (C))
| ^~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:502:1: required from ‘struct boost::concepts::ColorValueConcept<boost::default_color_type>’
502 | BOOST_concept(ColorValue, (C))
| ^~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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);
| ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/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) );
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:136:9: required from ‘void boost::detail::depth_first_visit_impl(const IncidenceGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, DFSVisitor&, ColorMap, TerminatorFunc) [with IncidenceGraph = R_adjacency_list<boost::directedS, double>; DFSVisitor = dfs_time_visitor<long unsigned int*>; ColorMap = boost::shared_array_property_map<boost::default_color_type, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int> >; TerminatorFunc = nontruth2; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:286:39: required from ‘void boost::depth_first_search(const VertexListGraph&, DFSVisitor, ColorMap, typename graph_traits<Graph>::vertex_descriptor) [with VertexListGraph = R_adjacency_list<directedS, double>; DFSVisitor = dfs_time_visitor<long unsigned int*>; ColorMap = shared_array_property_map<default_color_type, vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int> >; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
286 | detail::depth_first_visit_impl(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
287 | g, start_vertex, vis, color, detail::nontruth2());
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/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 dfs_time_visitor<long unsigned int*> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; Graph = R_adjacency_list<boost::directedS, double>]’
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)]);
| ~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/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 = R_adjacency_list<boost::directedS, double>; ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<keywords::tag::visitor, const dfs_time_visitor<long unsigned 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); \
| ~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/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 = R_adjacency_list<directedS, double>; P = dfs_time_visitor<long unsigned 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 dfs_time_visitor<long unsigned 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); \
| ~~~~~~~~~
interfaces.cpp:158:27: required from here
158 | depth_first_search(g, visitor(vis));
| ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::DefaultConstructible<boost::default_color_type>]’
20 | ~usage_requirements() { ((Model*)0)->~Model(); }
| ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::concepts::ColorValue<boost::default_color_type> >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/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> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:502:1: required from ‘struct boost::concepts::ColorValueConcept<boost::default_color_type>’
502 | BOOST_concept(ColorValue, (C))
| ^~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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);
| ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/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) );
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:136:9: required from ‘void boost::detail::depth_first_visit_impl(const IncidenceGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, DFSVisitor&, ColorMap, TerminatorFunc) [with IncidenceGraph = R_adjacency_list<boost::directedS, double>; DFSVisitor = dfs_time_visitor<long unsigned int*>; ColorMap = boost::shared_array_property_map<boost::default_color_type, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int> >; TerminatorFunc = nontruth2; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:286:39: required from ‘void boost::depth_first_search(const VertexListGraph&, DFSVisitor, ColorMap, typename graph_traits<Graph>::vertex_descriptor) [with VertexListGraph = R_adjacency_list<directedS, double>; DFSVisitor = dfs_time_visitor<long unsigned int*>; ColorMap = shared_array_property_map<default_color_type, vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int> >; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
286 | detail::depth_first_visit_impl(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
287 | g, start_vertex, vis, color, detail::nontruth2());
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/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 dfs_time_visitor<long unsigned int*> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; Graph = R_adjacency_list<boost::directedS, double>]’
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)]);
| ~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/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 = R_adjacency_list<boost::directedS, double>; ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<keywords::tag::visitor, const dfs_time_visitor<long unsigned 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); \
| ~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/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 = R_adjacency_list<directedS, double>; P = dfs_time_visitor<long unsigned 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 dfs_time_visitor<long unsigned 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); \
| ~~~~~~~~~
interfaces.cpp:158:27: required from here
158 | depth_first_search(g, visitor(vis));
| ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::concepts::ColorValue<boost::default_color_type>]’
20 | ~usage_requirements() { ((Model*)0)->~Model(); }
| ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::ColorValueConcept<boost::default_color_type>]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:136:9: required from ‘void boost::detail::depth_first_visit_impl(const IncidenceGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, DFSVisitor&, ColorMap, TerminatorFunc) [with IncidenceGraph = R_adjacency_list<boost::directedS, double>; DFSVisitor = dfs_time_visitor<long unsigned int*>; ColorMap = boost::shared_array_property_map<boost::default_color_type, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int> >; TerminatorFunc = nontruth2; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:286:39: required from ‘void boost::depth_first_search(const VertexListGraph&, DFSVisitor, ColorMap, typename graph_traits<Graph>::vertex_descriptor) [with VertexListGraph = R_adjacency_list<directedS, double>; DFSVisitor = dfs_time_visitor<long unsigned int*>; ColorMap = shared_array_property_map<default_color_type, vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int> >; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
286 | detail::depth_first_visit_impl(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
287 | g, start_vertex, vis, color, detail::nontruth2());
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/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 dfs_time_visitor<long unsigned int*> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; Graph = R_adjacency_list<boost::directedS, double>]’
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)]);
| ~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/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 = R_adjacency_list<boost::directedS, double>; ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<keywords::tag::visitor, const dfs_time_visitor<long unsigned 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); \
| ~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/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 = R_adjacency_list<directedS, double>; P = dfs_time_visitor<long unsigned 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 dfs_time_visitor<long unsigned 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); \
| ~~~~~~~~~
interfaces.cpp:158:27: required from here
158 | depth_first_search(g, visitor(vis));
| ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:502:15: note: in a call to non-static member function ‘boost::concepts::ColorValueConcept<boost::default_color_type>::~ColorValueConcept()’
502 | BOOST_concept(ColorValue, (C))
| ^~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/preprocessor/cat.hpp:29:34: note: in definition of macro ‘BOOST_PP_CAT_I’
29 | # define BOOST_PP_CAT_I(a, b) a ## b
| ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/concept_def.hpp:23:12: note: in expansion of macro ‘BOOST_PP_CAT’
23 | struct BOOST_PP_CAT(name,Concept) \
| ^~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:502:1: note: in expansion of macro ‘BOOST_concept’
502 | BOOST_concept(ColorValue, (C))
| ^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::constraint<Model>::failed() [with Model = boost::DFSVisitorConcept<boost::detail::components_recorder<int*>, R_adjacency_list<boost::undirectedS, double> >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:130:9: required from ‘void boost::depth_first_search(const VertexListGraph&, DFSVisitor, ColorMap, typename graph_traits<Graph>::vertex_descriptor) [with VertexListGraph = R_adjacency_list<undirectedS, double>; DFSVisitor = detail::components_recorder<int*>; ColorMap = shared_array_property_map<default_color_type, vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int> >; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:397:42: required from ‘void boost::graph::detail::depth_first_search_impl<Graph>::operator()(const Graph&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<boost::graph::keywords::tag::visitor, const boost::detail::components_recorder<int*> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; Graph = R_adjacency_list<boost::undirectedS, double>]’
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)]);
| ~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/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 = R_adjacency_list<boost::undirectedS, double>; ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<keywords::tag::visitor, const boost::detail::components_recorder<int*> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; typename boost::result_of<detail::depth_first_search_impl<Param0>(Param0, const ArgPack&)>::type = void]’
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); \
| ~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/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 = R_adjacency_list<undirectedS, double>; P = detail::components_recorder<int*>; T = graph_visitor_t; R = no_property; typename result_of<graph::detail::depth_first_search_impl<Param0>(Param0, const typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<T, Tag, Base> >::type&)>::type = void; typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<T, Tag, Base> >::type = parameter::aux::arg_list<parameter::aux::tagged_argument<graph::keywords::tag::visitor, const detail::components_recorder<int*> >, parameter::aux::empty_arg_list, std::integral_constant<bool, true> >]’
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); \
| ~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/connected_components.hpp:106:23: required from ‘typename boost::property_traits<IndexMap>::value_type boost::connected_components(const Graph&, ComponentMap, typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = R_adjacency_list<undirectedS, double>; ComponentMap = int*; typename property_traits<IndexMap>::value_type = int; typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits<Graph>::traversal_category = undir_adj_list_traversal_tag]’
106 | depth_first_search(g, visitor(vis));
| ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~
interfaces.cpp:205:29: required from here
205 | connected_components(g, &component[0]);
| ~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:65:52: warning: ‘this’ pointer is null [-Wnonnull]
65 | static void failed() { ((Model*)0)->constraints(); }
| ~~~~~~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:39:10: note: in a call to non-static member function ‘void boost::DFSVisitorConcept<Visitor, Graph>::constraints() [with Visitor = boost::detail::components_recorder<int*>; Graph = R_adjacency_list<boost::undirectedS, double>]’
39 | void constraints()
| ^~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::concepts::Graph<boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::no_property, boost::listS>, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long unsigned int, long unsigned int&, long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all> > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:66:5: required from ‘struct boost::concepts::Graph<boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::no_property, boost::listS>, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long unsigned int, long unsigned int&, long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:75:1: required from ‘struct boost::concepts::IncidenceGraph<boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::no_property, boost::listS>, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long unsigned int, long unsigned int&, long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >’
75 | BOOST_concept(IncidenceGraph, (G)) : Graph< G >
| ^~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:75:1: required from ‘struct boost::concepts::IncidenceGraphConcept<boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::no_property, boost::listS>, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long unsigned int, long unsigned int&, long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >’
75 | BOOST_concept(IncidenceGraph, (G)) : Graph< G >
| ^~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::concepts::IncidenceGraphConcept<boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::no_property, boost::listS>, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long unsigned int, long unsigned int&, long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >]’
32 | inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
| ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied<boost::concepts::IncidenceGraphConcept<boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::no_property, boost::listS>, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long unsigned int, long unsigned int&, long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all> > >::value’
44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:129:9: required from ‘void boost::breadth_first_visit(const IncidenceGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with IncidenceGraph = filtered_graph<adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, no_property, listS>, is_residual_edge<adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_residual_capacity_t> >, keep_all>; Buffer = queue<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > >; BFSVisitor = bfs_visitor<edge_predecessor_recorder<detail::edge_desc_impl<directed_tag, long unsigned int>*, on_tree_edge> >; ColorMap = default_color_type*; SourceIterator = long unsigned int*]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:136:24: required from ‘void boost::breadth_first_search(const VertexListGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph<adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, no_property, listS>, is_residual_edge<adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_residual_capacity_t> >, keep_all>; SourceIterator = long unsigned int*; Buffer = queue<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > >; BFSVisitor = bfs_visitor<edge_predecessor_recorder<detail::edge_desc_impl<directed_tag, long unsigned int>*, on_tree_edge> >; ColorMap = default_color_type*]’
136 | breadth_first_visit(g, sources_begin, sources_end, Q, vis, color);
| ~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:147:25: required from ‘void boost::breadth_first_search(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph<adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, no_property, listS>, is_residual_edge<adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_residual_capacity_t> >, keep_all>; Buffer = queue<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > >; BFSVisitor = bfs_visitor<edge_predecessor_recorder<detail::edge_desc_impl<directed_tag, long unsigned int>*, on_tree_edge> >; ColorMap = default_color_type*; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
147 | breadth_first_search(g, sources, sources + 1, Q, vis, color);
| ~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/edmonds_karp_max_flow.hpp:101:29: required from ‘typename boost::property_traits<IndexMap>::value_type boost::edmonds_karp_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, ColorMap, PredEdgeMap) [with Graph = adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, no_property, listS>; CapacityEdgeMap = adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map<directed_tag, detail::edge_desc_impl<directed_tag, long unsigned int>, detail::edge_desc_impl<directed_tag, long unsigned int>&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_reverse_t>; ColorMap = default_color_type*; PredEdgeMap = detail::edge_desc_impl<directed_tag, long unsigned int>*; typename property_traits<IndexMap>::value_type = long unsigned int; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
101 | breadth_first_search(detail::residual_graph(g, res), src, Q,
| ~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
102 | make_bfs_visitor(record_edge_predecessors(pred, on_tree_edge())),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
103 | color);
| ~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/edge_connectivity.hpp:146:42: required from ‘typename boost::graph_traits<G>::degree_size_type boost::edge_connectivity(VertexListGraph&, OutputIterator) [with VertexListGraph = R_adjacency_list<undirectedS, double>; OutputIterator = std::back_insert_iterator<std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int> > >; typename graph_traits<G>::degree_size_type = long unsigned int]’
146 | alpha_S_k = edmonds_karp_max_flow(
| ~~~~~~~~~~~~~~~~~~~~~^
147 | flow_g, p, k, cap, res_cap, rev_edge, &color[0], &pred[0]);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
interfaces.cpp:326:34: required from here
326 | dst c = edge_connectivity( g, std::back_inserter(disconnecting_set) );
| ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::concepts::Graph<boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::no_property, boost::listS>, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long unsigned int, long unsigned int&, long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >]’
20 | ~usage_requirements() { ((Model*)0)->~Model(); }
| ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::concepts::IncidenceGraph<boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::no_property, boost::listS>, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long unsigned int, long unsigned int&, long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all> > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:87:5: required from ‘struct boost::concepts::IncidenceGraph<boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::no_property, boost::listS>, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long unsigned int, long unsigned int&, long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:75:1: required from ‘struct boost::concepts::IncidenceGraphConcept<boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::no_property, boost::listS>, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long unsigned int, long unsigned int&, long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >’
75 | BOOST_concept(IncidenceGraph, (G)) : Graph< G >
| ^~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::concepts::IncidenceGraphConcept<boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::no_property, boost::listS>, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long unsigned int, long unsigned int&, long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >]’
32 | inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
| ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied<boost::concepts::IncidenceGraphConcept<boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::no_property, boost::listS>, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long unsigned int, long unsigned int&, long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all> > >::value’
44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:129:9: required from ‘void boost::breadth_first_visit(const IncidenceGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with IncidenceGraph = filtered_graph<adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, no_property, listS>, is_residual_edge<adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_residual_capacity_t> >, keep_all>; Buffer = queue<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > >; BFSVisitor = bfs_visitor<edge_predecessor_recorder<detail::edge_desc_impl<directed_tag, long unsigned int>*, on_tree_edge> >; ColorMap = default_color_type*; SourceIterator = long unsigned int*]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:136:24: required from ‘void boost::breadth_first_search(const VertexListGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph<adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, no_property, listS>, is_residual_edge<adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_residual_capacity_t> >, keep_all>; SourceIterator = long unsigned int*; Buffer = queue<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > >; BFSVisitor = bfs_visitor<edge_predecessor_recorder<detail::edge_desc_impl<directed_tag, long unsigned int>*, on_tree_edge> >; ColorMap = default_color_type*]’
136 | breadth_first_visit(g, sources_begin, sources_end, Q, vis, color);
| ~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:147:25: required from ‘void boost::breadth_first_search(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph<adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, no_property, listS>, is_residual_edge<adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_residual_capacity_t> >, keep_all>; Buffer = queue<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > >; BFSVisitor = bfs_visitor<edge_predecessor_recorder<detail::edge_desc_impl<directed_tag, long unsigned int>*, on_tree_edge> >; ColorMap = default_color_type*; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
147 | breadth_first_search(g, sources, sources + 1, Q, vis, color);
| ~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/edmonds_karp_max_flow.hpp:101:29: required from ‘typename boost::property_traits<IndexMap>::value_type boost::edmonds_karp_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, ColorMap, PredEdgeMap) [with Graph = adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, no_property, listS>; CapacityEdgeMap = adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map<directed_tag, detail::edge_desc_impl<directed_tag, long unsigned int>, detail::edge_desc_impl<directed_tag, long unsigned int>&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_reverse_t>; ColorMap = default_color_type*; PredEdgeMap = detail::edge_desc_impl<directed_tag, long unsigned int>*; typename property_traits<IndexMap>::value_type = long unsigned int; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
101 | breadth_first_search(detail::residual_graph(g, res), src, Q,
| ~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
102 | make_bfs_visitor(record_edge_predecessors(pred, on_tree_edge())),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
103 | color);
| ~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/edge_connectivity.hpp:146:42: required from ‘typename boost::graph_traits<G>::degree_size_type boost::edge_connectivity(VertexListGraph&, OutputIterator) [with VertexListGraph = R_adjacency_list<undirectedS, double>; OutputIterator = std::back_insert_iterator<std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int> > >; typename graph_traits<G>::degree_size_type = long unsigned int]’
146 | alpha_S_k = edmonds_karp_max_flow(
| ~~~~~~~~~~~~~~~~~~~~~^
147 | flow_g, p, k, cap, res_cap, rev_edge, &color[0], &pred[0]);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
interfaces.cpp:326:34: required from here
326 | dst c = edge_connectivity( g, std::back_inserter(disconnecting_set) );
| ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::concepts::IncidenceGraph<boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::no_property, boost::listS>, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long unsigned int, long unsigned int&, long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >]’
20 | ~usage_requirements() { ((Model*)0)->~Model(); }
| ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::IncidenceGraphConcept<boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::no_property, boost::listS>, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long unsigned int, long unsigned int&, long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:129:9: required from ‘void boost::breadth_first_visit(const IncidenceGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with IncidenceGraph = filtered_graph<adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, no_property, listS>, is_residual_edge<adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_residual_capacity_t> >, keep_all>; Buffer = queue<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > >; BFSVisitor = bfs_visitor<edge_predecessor_recorder<detail::edge_desc_impl<directed_tag, long unsigned int>*, on_tree_edge> >; ColorMap = default_color_type*; SourceIterator = long unsigned int*]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:136:24: required from ‘void boost::breadth_first_search(const VertexListGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph<adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, no_property, listS>, is_residual_edge<adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_residual_capacity_t> >, keep_all>; SourceIterator = long unsigned int*; Buffer = queue<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > >; BFSVisitor = bfs_visitor<edge_predecessor_recorder<detail::edge_desc_impl<directed_tag, long unsigned int>*, on_tree_edge> >; ColorMap = default_color_type*]’
136 | breadth_first_visit(g, sources_begin, sources_end, Q, vis, color);
| ~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:147:25: required from ‘void boost::breadth_first_search(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph<adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, no_property, listS>, is_residual_edge<adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_residual_capacity_t> >, keep_all>; Buffer = queue<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > >; BFSVisitor = bfs_visitor<edge_predecessor_recorder<detail::edge_desc_impl<directed_tag, long unsigned int>*, on_tree_edge> >; ColorMap = default_color_type*; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
147 | breadth_first_search(g, sources, sources + 1, Q, vis, color);
| ~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/edmonds_karp_max_flow.hpp:101:29: required from ‘typename boost::property_traits<IndexMap>::value_type boost::edmonds_karp_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, ColorMap, PredEdgeMap) [with Graph = adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, no_property, listS>; CapacityEdgeMap = adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map<directed_tag, detail::edge_desc_impl<directed_tag, long unsigned int>, detail::edge_desc_impl<directed_tag, long unsigned int>&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_reverse_t>; ColorMap = default_color_type*; PredEdgeMap = detail::edge_desc_impl<directed_tag, long unsigned int>*; typename property_traits<IndexMap>::value_type = long unsigned int; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
101 | breadth_first_search(detail::residual_graph(g, res), src, Q,
| ~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
102 | make_bfs_visitor(record_edge_predecessors(pred, on_tree_edge())),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
103 | color);
| ~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/edge_connectivity.hpp:146:42: required from ‘typename boost::graph_traits<G>::degree_size_type boost::edge_connectivity(VertexListGraph&, OutputIterator) [with VertexListGraph = R_adjacency_list<undirectedS, double>; OutputIterator = std::back_insert_iterator<std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int> > >; typename graph_traits<G>::degree_size_type = long unsigned int]’
146 | alpha_S_k = edmonds_karp_max_flow(
| ~~~~~~~~~~~~~~~~~~~~~^
147 | flow_g, p, k, cap, res_cap, rev_edge, &color[0], &pred[0]);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
interfaces.cpp:326:34: required from here
326 | dst c = edge_connectivity( g, std::back_inserter(disconnecting_set) );
| ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:75:15: note: in a call to non-static member function ‘boost::concepts::IncidenceGraphConcept<boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::no_property, boost::listS>, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long unsigned int, long unsigned int&, long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >::~IncidenceGraphConcept()’
75 | BOOST_concept(IncidenceGraph, (G)) : Graph< G >
| ^~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/preprocessor/cat.hpp:29:34: note: in definition of macro ‘BOOST_PP_CAT_I’
29 | # define BOOST_PP_CAT_I(a, b) a ## b
| ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/concept_def.hpp:23:12: note: in expansion of macro ‘BOOST_PP_CAT’
23 | struct BOOST_PP_CAT(name,Concept) \
| ^~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:75:1: note: in expansion of macro ‘BOOST_concept’
75 | BOOST_concept(IncidenceGraph, (G)) : Graph< G >
| ^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::constraint<Model>::failed() [with Model = boost::BFSVisitorConcept<boost::bfs_visitor<boost::edge_predecessor_recorder<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>*, boost::on_tree_edge> >, boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::no_property, boost::listS>, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long unsigned int, long unsigned int&, long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:65:5: required from ‘void boost::breadth_first_visit(const IncidenceGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with IncidenceGraph = filtered_graph<adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, no_property, listS>, is_residual_edge<adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_residual_capacity_t> >, keep_all>; Buffer = queue<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > >; BFSVisitor = bfs_visitor<edge_predecessor_recorder<detail::edge_desc_impl<directed_tag, long unsigned int>*, on_tree_edge> >; ColorMap = default_color_type*; SourceIterator = long unsigned int*]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:136:24: required from ‘void boost::breadth_first_search(const VertexListGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph<adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, no_property, listS>, is_residual_edge<adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_residual_capacity_t> >, keep_all>; SourceIterator = long unsigned int*; Buffer = queue<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > >; BFSVisitor = bfs_visitor<edge_predecessor_recorder<detail::edge_desc_impl<directed_tag, long unsigned int>*, on_tree_edge> >; ColorMap = default_color_type*]’
136 | breadth_first_visit(g, sources_begin, sources_end, Q, vis, color);
| ~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:147:25: required from ‘void boost::breadth_first_search(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph<adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, no_property, listS>, is_residual_edge<adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_residual_capacity_t> >, keep_all>; Buffer = queue<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > >; BFSVisitor = bfs_visitor<edge_predecessor_recorder<detail::edge_desc_impl<directed_tag, long unsigned int>*, on_tree_edge> >; ColorMap = default_color_type*; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
147 | breadth_first_search(g, sources, sources + 1, Q, vis, color);
| ~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/edmonds_karp_max_flow.hpp:101:29: required from ‘typename boost::property_traits<IndexMap>::value_type boost::edmonds_karp_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, ColorMap, PredEdgeMap) [with Graph = adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, no_property, listS>; CapacityEdgeMap = adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map<directed_tag, detail::edge_desc_impl<directed_tag, long unsigned int>, detail::edge_desc_impl<directed_tag, long unsigned int>&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_reverse_t>; ColorMap = default_color_type*; PredEdgeMap = detail::edge_desc_impl<directed_tag, long unsigned int>*; typename property_traits<IndexMap>::value_type = long unsigned int; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
101 | breadth_first_search(detail::residual_graph(g, res), src, Q,
| ~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
102 | make_bfs_visitor(record_edge_predecessors(pred, on_tree_edge())),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
103 | color);
| ~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/edge_connectivity.hpp:146:42: required from ‘typename boost::graph_traits<G>::degree_size_type boost::edge_connectivity(VertexListGraph&, OutputIterator) [with VertexListGraph = R_adjacency_list<undirectedS, double>; OutputIterator = std::back_insert_iterator<std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int> > >; typename graph_traits<G>::degree_size_type = long unsigned int]’
146 | alpha_S_k = edmonds_karp_max_flow(
| ~~~~~~~~~~~~~~~~~~~~~^
147 | flow_g, p, k, cap, res_cap, rev_edge, &color[0], &pred[0]);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
interfaces.cpp:326:34: required from here
326 | dst c = edge_connectivity( g, std::back_inserter(disconnecting_set) );
| ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/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 interfaces.cpp:4:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:37:10: note: in a call to non-static member function ‘void boost::BFSVisitorConcept<Visitor, Graph>::constraints() [with Visitor = boost::bfs_visitor<boost::edge_predecessor_recorder<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>*, boost::on_tree_edge> >; Graph = boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::no_property, boost::listS>, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long unsigned int, long unsigned int&, long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all>]’
37 | void constraints()
| ^~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::constraint<Model>::failed() [with Model = boost::ReadWritePropertyMapConcept<boost::default_color_type*, long unsigned int>]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:66:5: required from ‘void boost::breadth_first_visit(const IncidenceGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with IncidenceGraph = filtered_graph<adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, no_property, listS>, is_residual_edge<adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_residual_capacity_t> >, keep_all>; Buffer = queue<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > >; BFSVisitor = bfs_visitor<edge_predecessor_recorder<detail::edge_desc_impl<directed_tag, long unsigned int>*, on_tree_edge> >; ColorMap = default_color_type*; SourceIterator = long unsigned int*]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:136:24: required from ‘void boost::breadth_first_search(const VertexListGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph<adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, no_property, listS>, is_residual_edge<adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_residual_capacity_t> >, keep_all>; SourceIterator = long unsigned int*; Buffer = queue<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > >; BFSVisitor = bfs_visitor<edge_predecessor_recorder<detail::edge_desc_impl<directed_tag, long unsigned int>*, on_tree_edge> >; ColorMap = default_color_type*]’
136 | breadth_first_visit(g, sources_begin, sources_end, Q, vis, color);
| ~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:147:25: required from ‘void boost::breadth_first_search(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph<adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, no_property, listS>, is_residual_edge<adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_residual_capacity_t> >, keep_all>; Buffer = queue<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > >; BFSVisitor = bfs_visitor<edge_predecessor_recorder<detail::edge_desc_impl<directed_tag, long unsigned int>*, on_tree_edge> >; ColorMap = default_color_type*; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
147 | breadth_first_search(g, sources, sources + 1, Q, vis, color);
| ~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/edmonds_karp_max_flow.hpp:101:29: required from ‘typename boost::property_traits<IndexMap>::value_type boost::edmonds_karp_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, ColorMap, PredEdgeMap) [with Graph = adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, no_property, listS>; CapacityEdgeMap = adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map<directed_tag, detail::edge_desc_impl<directed_tag, long unsigned int>, detail::edge_desc_impl<directed_tag, long unsigned int>&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_reverse_t>; ColorMap = default_color_type*; PredEdgeMap = detail::edge_desc_impl<directed_tag, long unsigned int>*; typename property_traits<IndexMap>::value_type = long unsigned int; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
101 | breadth_first_search(detail::residual_graph(g, res), src, Q,
| ~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
102 | make_bfs_visitor(record_edge_predecessors(pred, on_tree_edge())),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
103 | color);
| ~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/edge_connectivity.hpp:146:42: required from ‘typename boost::graph_traits<G>::degree_size_type boost::edge_connectivity(VertexListGraph&, OutputIterator) [with VertexListGraph = R_adjacency_list<undirectedS, double>; OutputIterator = std::back_insert_iterator<std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int> > >; typename graph_traits<G>::degree_size_type = long unsigned int]’
146 | alpha_S_k = edmonds_karp_max_flow(
| ~~~~~~~~~~~~~~~~~~~~~^
147 | flow_g, p, k, cap, res_cap, rev_edge, &color[0], &pred[0]);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
interfaces.cpp:326:34: required from here
326 | dst c = edge_connectivity( g, std::back_inserter(disconnecting_set) );
| ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:65:52: warning: ‘this’ pointer is null [-Wnonnull]
65 | static void failed() { ((Model*)0)->constraints(); }
| ~~~~~~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/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::default_color_type*; Key = long unsigned int]’
205 | void constraints() {
| ^~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::SignedInteger<long int>]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:514:9: required from ‘boost::InputIterator<TT>::~InputIterator() [with TT = __gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: required from ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::InputIterator<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > >]’
20 | ~usage_requirements() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::InputIterator<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > > >]’
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:512:7: required from ‘struct boost::InputIterator<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > >’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:540:3: required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > >’
540 | BOOST_concept(ForwardIterator,(TT))
| ^~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:568:3: [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied<boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > > >::value’
44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied<boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > > >’
45 | typedef boost::integral_constant<bool, value> type;
| ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_<void (*)(boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > >)>’
72 | struct requirement_<void(*)(Model)>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map<RAIter, ID, Value, Value&> boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >; Value = long unsigned int; ID = typed_identity_property_map<long unsigned int>]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/sequential_vertex_coloring.hpp:120:35: required from ‘typename boost::property_traits<IndexMap>::value_type boost::sequential_vertex_coloring(const VertexListGraph&, ColorMap) [with VertexListGraph = R_adjacency_list<undirectedS, double>; ColorMap = iterator_property_map<long unsigned int*, vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int> >; typename property_traits<IndexMap>::value_type = long unsigned int]’
120 | make_iterator_property_map(order.begin(), identity_property_map(),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
121 | graph_traits< VertexListGraph >::null_vertex()),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
interfaces.cpp:370:56: required from here
370 | Vertex_Size_Type n = sequential_vertex_coloring( g, color );
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:107:22: note: in a call to non-static member function ‘boost::SignedInteger<long int>::~SignedInteger()’
107 | template <> struct SignedInteger<long> {};
| ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Convertible<std::random_access_iterator_tag, std::input_iterator_tag> >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/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> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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);
| ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/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) );
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/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;
| ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/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)>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:515:9: [ skipping 9 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied<boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > > >::value’
44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied<boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > > >’
45 | typedef boost::integral_constant<bool, value> type;
| ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_<void (*)(boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > >)>’
72 | struct requirement_<void(*)(Model)>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map<RAIter, ID, Value, Value&> boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >; Value = long unsigned int; ID = typed_identity_property_map<long unsigned int>]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/sequential_vertex_coloring.hpp:120:35: required from ‘typename boost::property_traits<IndexMap>::value_type boost::sequential_vertex_coloring(const VertexListGraph&, ColorMap) [with VertexListGraph = R_adjacency_list<undirectedS, double>; ColorMap = iterator_property_map<long unsigned int*, vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int> >; typename property_traits<IndexMap>::value_type = long unsigned int]’
120 | make_iterator_property_map(order.begin(), identity_property_map(),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
121 | graph_traits< VertexListGraph >::null_vertex()),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
interfaces.cpp:370:56: required from here
370 | Vertex_Size_Type n = sequential_vertex_coloring( g, color );
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Convertible<std::random_access_iterator_tag, std::input_iterator_tag>]’
20 | ~usage_requirements() { ((Model*)0)->~Model(); }
| ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::Convertible<std::random_access_iterator_tag, std::input_iterator_tag>]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:515:9: required from ‘boost::InputIterator<TT>::~InputIterator() [with TT = __gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: required from ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::InputIterator<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > >]’
20 | ~usage_requirements() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::InputIterator<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > > >]’
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:512:7: required from ‘struct boost::InputIterator<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > >’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:540:3: required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > >’
540 | BOOST_concept(ForwardIterator,(TT))
| ^~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:568:3: [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied<boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > > >::value’
44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied<boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > > >’
45 | typedef boost::integral_constant<bool, value> type;
| ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_<void (*)(boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > >)>’
72 | struct requirement_<void(*)(Model)>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map<RAIter, ID, Value, Value&> boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >; Value = long unsigned int; ID = typed_identity_property_map<long unsigned int>]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/sequential_vertex_coloring.hpp:120:35: required from ‘typename boost::property_traits<IndexMap>::value_type boost::sequential_vertex_coloring(const VertexListGraph&, ColorMap) [with VertexListGraph = R_adjacency_list<undirectedS, double>; ColorMap = iterator_property_map<long unsigned int*, vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int> >; typename property_traits<IndexMap>::value_type = long unsigned int]’
120 | make_iterator_property_map(order.begin(), identity_property_map(),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
121 | graph_traits< VertexListGraph >::null_vertex()),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
interfaces.cpp:370:56: required from here
370 | Vertex_Size_Type n = sequential_vertex_coloring( g, color );
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible<X, Y>::~Convertible() [with X = std::random_access_iterator_tag; Y = std::input_iterator_tag]’
37 | ~model()
| ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
208 | BOOST_CONCEPT_USAGE(Convertible) {
| ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Convertible<std::random_access_iterator_tag, std::forward_iterator_tag> >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/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> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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);
| ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/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) );
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/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;
| ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/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)>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:545:11: [ skipping 8 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied<boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > > >::value’
44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied<boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > > >’
45 | typedef boost::integral_constant<bool, value> type;
| ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_<void (*)(boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > >)>’
72 | struct requirement_<void(*)(Model)>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map<RAIter, ID, Value, Value&> boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >; Value = long unsigned int; ID = typed_identity_property_map<long unsigned int>]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/sequential_vertex_coloring.hpp:120:35: required from ‘typename boost::property_traits<IndexMap>::value_type boost::sequential_vertex_coloring(const VertexListGraph&, ColorMap) [with VertexListGraph = R_adjacency_list<undirectedS, double>; ColorMap = iterator_property_map<long unsigned int*, vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int> >; typename property_traits<IndexMap>::value_type = long unsigned int]’
120 | make_iterator_property_map(order.begin(), identity_property_map(),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
121 | graph_traits< VertexListGraph >::null_vertex()),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
interfaces.cpp:370:56: required from here
370 | Vertex_Size_Type n = sequential_vertex_coloring( g, color );
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Convertible<std::random_access_iterator_tag, std::forward_iterator_tag>]’
20 | ~usage_requirements() { ((Model*)0)->~Model(); }
| ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::Convertible<std::random_access_iterator_tag, std::forward_iterator_tag>]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:545:11: required from ‘boost::ForwardIterator<TT>::~ForwardIterator() [with TT = __gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: required from ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::ForwardIterator<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > >]’
20 | ~usage_requirements() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::ForwardIterator<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > > >]’
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:543:7: required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > >’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > >’
568 | BOOST_concept(BidirectionalIterator,(TT))
| ^~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied<boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > > >::value’
44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied<boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > > >’
45 | typedef boost::integral_constant<bool, value> type;
| ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_<void (*)(boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > >)>’
72 | struct requirement_<void(*)(Model)>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map<RAIter, ID, Value, Value&> boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >; Value = long unsigned int; ID = typed_identity_property_map<long unsigned int>]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/sequential_vertex_coloring.hpp:120:35: required from ‘typename boost::property_traits<IndexMap>::value_type boost::sequential_vertex_coloring(const VertexListGraph&, ColorMap) [with VertexListGraph = R_adjacency_list<undirectedS, double>; ColorMap = iterator_property_map<long unsigned int*, vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int> >; typename property_traits<IndexMap>::value_type = long unsigned int]’
120 | make_iterator_property_map(order.begin(), identity_property_map(),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
121 | graph_traits< VertexListGraph >::null_vertex()),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
interfaces.cpp:370:56: required from here
370 | Vertex_Size_Type n = sequential_vertex_coloring( g, color );
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible<X, Y>::~Convertible() [with X = std::random_access_iterator_tag; Y = std::forward_iterator_tag]’
37 | ~model()
| ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
208 | BOOST_CONCEPT_USAGE(Convertible) {
| ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Convertible<std::random_access_iterator_tag, std::bidirectional_iterator_tag> >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/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> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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);
| ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/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) );
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/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;
| ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/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)>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:573:11: [ skipping 7 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied<boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > > >::value’
44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied<boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > > >’
45 | typedef boost::integral_constant<bool, value> type;
| ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_<void (*)(boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > >)>’
72 | struct requirement_<void(*)(Model)>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map<RAIter, ID, Value, Value&> boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >; Value = long unsigned int; ID = typed_identity_property_map<long unsigned int>]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/sequential_vertex_coloring.hpp:120:35: required from ‘typename boost::property_traits<IndexMap>::value_type boost::sequential_vertex_coloring(const VertexListGraph&, ColorMap) [with VertexListGraph = R_adjacency_list<undirectedS, double>; ColorMap = iterator_property_map<long unsigned int*, vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int> >; typename property_traits<IndexMap>::value_type = long unsigned int]’
120 | make_iterator_property_map(order.begin(), identity_property_map(),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
121 | graph_traits< VertexListGraph >::null_vertex()),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
interfaces.cpp:370:56: required from here
370 | Vertex_Size_Type n = sequential_vertex_coloring( g, color );
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Convertible<std::random_access_iterator_tag, std::bidirectional_iterator_tag>]’
20 | ~usage_requirements() { ((Model*)0)->~Model(); }
| ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::Convertible<std::random_access_iterator_tag, std::bidirectional_iterator_tag>]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:573:11: required from ‘boost::BidirectionalIterator<TT>::~BidirectionalIterator() [with TT = __gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: required from ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::BidirectionalIterator<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > >]’
20 | ~usage_requirements() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::BidirectionalIterator<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > > >]’
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:571:7: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > >’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > >’
597 | BOOST_concept(RandomAccessIterator,(TT))
| ^~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied<boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > > >::value’
44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied<boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > > >’
45 | typedef boost::integral_constant<bool, value> type;
| ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_<void (*)(boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > >)>’
72 | struct requirement_<void(*)(Model)>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map<RAIter, ID, Value, Value&> boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >; Value = long unsigned int; ID = typed_identity_property_map<long unsigned int>]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/sequential_vertex_coloring.hpp:120:35: required from ‘typename boost::property_traits<IndexMap>::value_type boost::sequential_vertex_coloring(const VertexListGraph&, ColorMap) [with VertexListGraph = R_adjacency_list<undirectedS, double>; ColorMap = iterator_property_map<long unsigned int*, vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int> >; typename property_traits<IndexMap>::value_type = long unsigned int]’
120 | make_iterator_property_map(order.begin(), identity_property_map(),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
121 | graph_traits< VertexListGraph >::null_vertex()),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
interfaces.cpp:370:56: required from here
370 | Vertex_Size_Type n = sequential_vertex_coloring( g, color );
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible<X, Y>::~Convertible() [with X = std::random_access_iterator_tag; Y = std::bidirectional_iterator_tag]’
37 | ~model()
| ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
208 | BOOST_CONCEPT_USAGE(Convertible) {
| ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Convertible<std::random_access_iterator_tag, std::random_access_iterator_tag>]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/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(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/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> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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);
| ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/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) );
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/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;
| ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/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)>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:603:11: required from ‘boost::RandomAccessIterator<TT>::~RandomAccessIterator() [with TT = __gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3: required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > >]’
597 | BOOST_concept(RandomAccessIterator,(TT))
| ^~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map<RAIter, ID, Value, Value&> boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >; Value = long unsigned int; ID = typed_identity_property_map<long unsigned int>]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/sequential_vertex_coloring.hpp:120:35: required from ‘typename boost::property_traits<IndexMap>::value_type boost::sequential_vertex_coloring(const VertexListGraph&, ColorMap) [with VertexListGraph = R_adjacency_list<undirectedS, double>; ColorMap = iterator_property_map<long unsigned int*, vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int> >; typename property_traits<IndexMap>::value_type = long unsigned int]’
120 | make_iterator_property_map(order.begin(), identity_property_map(),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
121 | graph_traits< VertexListGraph >::null_vertex()),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
interfaces.cpp:370:56: required from here
370 | Vertex_Size_Type n = sequential_vertex_coloring( g, color );
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
20 | ~usage_requirements() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible<X, Y>::~Convertible() [with X = std::random_access_iterator_tag; Y = std::random_access_iterator_tag]’
37 | ~model()
| ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
208 | BOOST_CONCEPT_USAGE(Convertible) {
| ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::constraint<Model>::failed() [with Model = boost::DFSVisitorConcept<boost::topo_sort_visitor<std::front_insert_iterator<std::__cxx11::list<long unsigned int> > >, R_adjacency_list<boost::directedS, double> >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:130:9: required from ‘void boost::depth_first_search(const VertexListGraph&, DFSVisitor, ColorMap, typename graph_traits<Graph>::vertex_descriptor) [with VertexListGraph = R_adjacency_list<directedS, double>; DFSVisitor = topo_sort_visitor<std::front_insert_iterator<std::__cxx11::list<long unsigned int> > >; ColorMap = shared_array_property_map<default_color_type, vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int> >; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:397:42: required from ‘void boost::graph::detail::depth_first_search_impl<Graph>::operator()(const Graph&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<boost::graph::keywords::tag::visitor, const boost::topo_sort_visitor<std::front_insert_iterator<std::__cxx11::list<long unsigned int> > > >, boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<boost::graph::keywords::tag::buffer, const int>, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >, std::integral_constant<bool, true> >; Graph = R_adjacency_list<boost::directedS, double>]’
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)]);
| ~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/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 = R_adjacency_list<boost::directedS, double>; ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<keywords::tag::visitor, const boost::topo_sort_visitor<std::front_insert_iterator<std::__cxx11::list<long unsigned int> > > >, boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<keywords::tag::buffer, const int>, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >, std::integral_constant<bool, true> >; typename boost::result_of<detail::depth_first_search_impl<Param0>(Param0, const ArgPack&)>::type = void]’
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); \
| ~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/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 = R_adjacency_list<directedS, double>; P = topo_sort_visitor<std::front_insert_iterator<std::__cxx11::list<long unsigned int> > >; T = graph_visitor_t; R = bgl_named_params<int, buffer_param_t>; typename result_of<graph::detail::depth_first_search_impl<Param0>(Param0, const typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<T, Tag, Base> >::type&)>::type = void; typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<T, Tag, Base> >::type = parameter::aux::arg_list<parameter::aux::tagged_argument<graph::keywords::tag::visitor, const topo_sort_visitor<std::front_insert_iterator<std::__cxx11::list<long unsigned int> > > >, parameter::aux::arg_list<parameter::aux::tagged_argument<graph::keywords::tag::buffer, const int>, parameter::aux::empty_arg_list, std::integral_constant<bool, true> >, std::integral_constant<bool, true> >]’
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); \
| ~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/topological_sort.hpp:69:23: required from ‘void boost::topological_sort(VertexListGraph&, OutputIterator, const bgl_named_params<P, T, R>&) [with VertexListGraph = R_adjacency_list<directedS, double>; OutputIterator = std::front_insert_iterator<std::__cxx11::list<long unsigned int> >; P = int; T = buffer_param_t; R = no_property]’
69 | depth_first_search(g, params.visitor(TopoVisitor(result)));
| ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/topological_sort.hpp:75:21: required from ‘void boost::topological_sort(VertexListGraph&, OutputIterator) [with VertexListGraph = R_adjacency_list<directedS, double>; OutputIterator = std::front_insert_iterator<std::__cxx11::list<long unsigned int> >]’
75 | topological_sort(
| ~~~~~~~~~~~~~~~~^
76 | g, result, bgl_named_params< int, buffer_param_t >(0)); // bogus
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
interfaces.cpp:71:29: required from here
71 | topological_sort(g, std::front_inserter(tsord));
| ~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:65:52: warning: ‘this’ pointer is null [-Wnonnull]
65 | static void failed() { ((Model*)0)->constraints(); }
| ~~~~~~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:39:10: note: in a call to non-static member function ‘void boost::DFSVisitorConcept<Visitor, Graph>::constraints() [with Visitor = boost::topo_sort_visitor<std::front_insert_iterator<std::__cxx11::list<long unsigned int> > >; Graph = R_adjacency_list<boost::directedS, double>]’
39 | void constraints()
| ^~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::constraint<Model>::failed() [with Model = boost::BFSVisitorConcept<bfs_time_visitor<long unsigned int*>, R_adjacency_list<boost::directedS, double> >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:65:5: required from ‘void boost::breadth_first_visit(const IncidenceGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with IncidenceGraph = R_adjacency_list<directedS, double>; Buffer = queue<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > >; BFSVisitor = bfs_time_visitor<long unsigned int*>; ColorMap = two_bit_color_map<vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int> >; SourceIterator = long unsigned int*]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:136:24: required from ‘void boost::breadth_first_search(const VertexListGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = R_adjacency_list<directedS, double>; SourceIterator = long unsigned int*; Buffer = queue<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > >; BFSVisitor = bfs_time_visitor<long unsigned int*>; ColorMap = two_bit_color_map<vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int> >]’
136 | breadth_first_visit(g, sources_begin, sources_end, Q, vis, color);
| ~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:147:25: required from ‘void boost::breadth_first_search(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = R_adjacency_list<directedS, double>; Buffer = queue<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > >; BFSVisitor = bfs_time_visitor<long unsigned int*>; ColorMap = two_bit_color_map<vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int> >; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
147 | breadth_first_search(g, sources, sources + 1, Q, vis, color);
| ~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:262:29: required from ‘void boost::detail::bfs_helper(VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, ColorMap, BFSVisitor, const boost::bgl_named_params<P, T, R>&, mpl_::false_) [with VertexListGraph = R_adjacency_list<boost::directedS, double>; ColorMap = boost::two_bit_color_map<boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int> >; BFSVisitor = bfs_time_visitor<long unsigned int*>; P = bfs_time_visitor<long unsigned int*>; T = boost::graph_visitor_t; R = boost::no_property; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int; mpl_::false_ = mpl_::bool_<false>]’
262 | breadth_first_search(g, s,
| ~~~~~~~~~~~~~~~~~~~~^~~~~~
263 | choose_param(get_param(params, buffer_param_t()), boost::ref(Q))
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
264 | .get(),
| ~~~~~~~
265 | vis, color);
| ~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:309:23: required from ‘static void boost::detail::bfs_dispatch<boost::param_not_found>::apply(VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, const boost::bgl_named_params<T, Tag, Base>&, boost::param_not_found) [with VertexListGraph = R_adjacency_list<boost::directedS, double>; P = bfs_time_visitor<long unsigned int*>; T = boost::graph_visitor_t; R = boost::no_property; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’
309 | bfs_helper(g, s,
| ~~~~~~~~~~^~~~~~
310 | make_two_bit_color_map(num_vertices(g),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
311 | choose_const_pmap(
| ~~~~~~~~~~~~~~~~~~
312 | get_param(params, vertex_index), g, vertex_index)),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
313 | choose_param(get_param(params, graph_visitor),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
314 | make_bfs_visitor(null_vis)),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~
315 | params,
| ~~~~~~~
316 | boost::mpl::bool_<
| ~~~~~~~~~~~~~~~~~~
317 | boost::is_base_and_derived< distributed_graph_tag,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
318 | typename graph_traits<
| ~~~~~~~~~~~~~~~~~~~~~~
319 | VertexListGraph >::traversal_category >::value >());
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:339:37: required from ‘void boost::breadth_first_search(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with VertexListGraph = R_adjacency_list<directedS, double>; P = bfs_time_visitor<long unsigned int*>; T = graph_visitor_t; R = no_property; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
339 | detail::bfs_dispatch< C >::apply(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
340 | ng, s, params, get_param(params, vertex_color));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
interfaces.cpp:113:29: required from here
113 | breadth_first_search(g, vertex((int)INTEGER(init_ind)[0], g), visitor(vis));
| ~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:65:52: warning: ‘this’ pointer is null [-Wnonnull]
65 | static void failed() { ((Model*)0)->constraints(); }
| ~~~~~~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:37:10: note: in a call to non-static member function ‘void boost::BFSVisitorConcept<Visitor, Graph>::constraints() [with Visitor = bfs_time_visitor<long unsigned int*>; Graph = R_adjacency_list<boost::directedS, double>]’
37 | void constraints()
| ^~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::constraint<Model>::failed() [with Model = boost::ReadWritePropertyMapConcept<boost::two_bit_color_map<boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int> >, long unsigned int>]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:66:5: required from ‘void boost::breadth_first_visit(const IncidenceGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with IncidenceGraph = R_adjacency_list<directedS, double>; Buffer = queue<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > >; BFSVisitor = bfs_time_visitor<long unsigned int*>; ColorMap = two_bit_color_map<vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int> >; SourceIterator = long unsigned int*]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:136:24: required from ‘void boost::breadth_first_search(const VertexListGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = R_adjacency_list<directedS, double>; SourceIterator = long unsigned int*; Buffer = queue<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > >; BFSVisitor = bfs_time_visitor<long unsigned int*>; ColorMap = two_bit_color_map<vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int> >]’
136 | breadth_first_visit(g, sources_begin, sources_end, Q, vis, color);
| ~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:147:25: required from ‘void boost::breadth_first_search(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = R_adjacency_list<directedS, double>; Buffer = queue<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > >; BFSVisitor = bfs_time_visitor<long unsigned int*>; ColorMap = two_bit_color_map<vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int> >; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
147 | breadth_first_search(g, sources, sources + 1, Q, vis, color);
| ~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:262:29: required from ‘void boost::detail::bfs_helper(VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, ColorMap, BFSVisitor, const boost::bgl_named_params<P, T, R>&, mpl_::false_) [with VertexListGraph = R_adjacency_list<boost::directedS, double>; ColorMap = boost::two_bit_color_map<boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int> >; BFSVisitor = bfs_time_visitor<long unsigned int*>; P = bfs_time_visitor<long unsigned int*>; T = boost::graph_visitor_t; R = boost::no_property; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int; mpl_::false_ = mpl_::bool_<false>]’
262 | breadth_first_search(g, s,
| ~~~~~~~~~~~~~~~~~~~~^~~~~~
263 | choose_param(get_param(params, buffer_param_t()), boost::ref(Q))
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
264 | .get(),
| ~~~~~~~
265 | vis, color);
| ~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:309:23: required from ‘static void boost::detail::bfs_dispatch<boost::param_not_found>::apply(VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, const boost::bgl_named_params<T, Tag, Base>&, boost::param_not_found) [with VertexListGraph = R_adjacency_list<boost::directedS, double>; P = bfs_time_visitor<long unsigned int*>; T = boost::graph_visitor_t; R = boost::no_property; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’
309 | bfs_helper(g, s,
| ~~~~~~~~~~^~~~~~
310 | make_two_bit_color_map(num_vertices(g),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
311 | choose_const_pmap(
| ~~~~~~~~~~~~~~~~~~
312 | get_param(params, vertex_index), g, vertex_index)),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
313 | choose_param(get_param(params, graph_visitor),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
314 | make_bfs_visitor(null_vis)),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~
315 | params,
| ~~~~~~~
316 | boost::mpl::bool_<
| ~~~~~~~~~~~~~~~~~~
317 | boost::is_base_and_derived< distributed_graph_tag,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
318 | typename graph_traits<
| ~~~~~~~~~~~~~~~~~~~~~~
319 | VertexListGraph >::traversal_category >::value >());
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:339:37: required from ‘void boost::breadth_first_search(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with VertexListGraph = R_adjacency_list<directedS, double>; P = bfs_time_visitor<long unsigned int*>; T = graph_visitor_t; R = no_property; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
339 | detail::bfs_dispatch< C >::apply(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
340 | ng, s, params, get_param(params, vertex_color));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
interfaces.cpp:113:29: required from here
113 | breadth_first_search(g, vertex((int)INTEGER(init_ind)[0], g), visitor(vis));
| ~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:65:52: warning: ‘this’ pointer is null [-Wnonnull]
65 | static void failed() { ((Model*)0)->constraints(); }
| ~~~~~~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:205:10: note: in a call to non-static member function ‘void boost::ReadWritePropertyMapConcept<PMap, Key>::constraints() [with PMap = boost::two_bit_color_map<boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int> >; Key = long unsigned int]’
205 | void constraints() {
| ^~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::CopyConstructible<dfs_time_visitor<long unsigned int*> >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/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<dfs_time_visitor<long unsigned int*> > >]’
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:167:5: required from ‘struct boost::CopyConstructible<dfs_time_visitor<long unsigned int*> >’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:165:3: required from ‘struct boost::CopyConstructibleConcept<dfs_time_visitor<long unsigned int*> >’
165 | BOOST_concept(CopyConstructible,(TT))
| ^~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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<dfs_time_visitor<long unsigned int*> >]’
32 | inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
| ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied<boost::CopyConstructibleConcept<dfs_time_visitor<long unsigned int*> > >::value’
44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 6 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_<void (*)(boost::DFSVisitorConcept<dfs_time_visitor<long unsigned int*>, R_adjacency_list<boost::directedS, double> >)>’
72 | struct requirement_<void(*)(Model)>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:130:9: required from ‘void boost::depth_first_search(const VertexListGraph&, DFSVisitor, ColorMap, typename graph_traits<Graph>::vertex_descriptor) [with VertexListGraph = R_adjacency_list<directedS, double>; DFSVisitor = dfs_time_visitor<long unsigned int*>; ColorMap = shared_array_property_map<default_color_type, vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int> >; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/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 dfs_time_visitor<long unsigned int*> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; Graph = R_adjacency_list<boost::directedS, double>]’
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)]);
| ~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/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 = R_adjacency_list<boost::directedS, double>; ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<keywords::tag::visitor, const dfs_time_visitor<long unsigned 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); \
| ~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/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 = R_adjacency_list<directedS, double>; P = dfs_time_visitor<long unsigned 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 dfs_time_visitor<long unsigned 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); \
| ~~~~~~~~~
interfaces.cpp:158:27: required from here
158 | depth_first_search(g, visitor(vis));
| ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
20 | ~usage_requirements() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::CopyConstructible<TT>::~CopyConstructible() [with TT = dfs_time_visitor<long unsigned int*>]’
37 | ~model()
| ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:167:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
167 | BOOST_CONCEPT_USAGE(CopyConstructible) {
| ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::concepts::Graph<R_adjacency_list<boost::directedS, double> >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/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<R_adjacency_list<boost::directedS, double> > >]’
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:66:5: required from ‘struct boost::concepts::Graph<R_adjacency_list<boost::directedS, double> >’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:75:1: required from ‘struct boost::concepts::IncidenceGraph<R_adjacency_list<boost::directedS, double> >’
75 | BOOST_concept(IncidenceGraph, (G)) : Graph< G >
| ^~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:75:1: required from ‘struct boost::concepts::IncidenceGraphConcept<R_adjacency_list<boost::directedS, double> >’
75 | BOOST_concept(IncidenceGraph, (G)) : Graph< G >
| ^~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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<R_adjacency_list<boost::directedS, double> >]’
32 | inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
| ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:129:9: required from ‘void boost::detail::depth_first_visit_impl(const IncidenceGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, DFSVisitor&, ColorMap, TerminatorFunc) [with IncidenceGraph = R_adjacency_list<boost::directedS, double>; DFSVisitor = dfs_time_visitor<long unsigned int*>; ColorMap = boost::shared_array_property_map<boost::default_color_type, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int> >; TerminatorFunc = nontruth2; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:286:39: required from ‘void boost::depth_first_search(const VertexListGraph&, DFSVisitor, ColorMap, typename graph_traits<Graph>::vertex_descriptor) [with VertexListGraph = R_adjacency_list<directedS, double>; DFSVisitor = dfs_time_visitor<long unsigned int*>; ColorMap = shared_array_property_map<default_color_type, vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int> >; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
286 | detail::depth_first_visit_impl(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
287 | g, start_vertex, vis, color, detail::nontruth2());
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/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 dfs_time_visitor<long unsigned int*> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; Graph = R_adjacency_list<boost::directedS, double>]’
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)]);
| ~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/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 = R_adjacency_list<boost::directedS, double>; ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<keywords::tag::visitor, const dfs_time_visitor<long unsigned 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); \
| ~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/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 = R_adjacency_list<directedS, double>; P = dfs_time_visitor<long unsigned 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 dfs_time_visitor<long unsigned 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); \
| ~~~~~~~~~
interfaces.cpp:158:27: required from here
158 | depth_first_search(g, visitor(vis));
| ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
20 | ~usage_requirements() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::concepts::Graph<G>::~Graph() [with G = R_adjacency_list<boost::directedS, double>]’
37 | ~model()
| ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:66:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
66 | BOOST_CONCEPT_USAGE(Graph)
| ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::concepts::IncidenceGraph<R_adjacency_list<boost::directedS, double> >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/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<R_adjacency_list<boost::directedS, double> > >]’
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:87:5: required from ‘struct boost::concepts::IncidenceGraph<R_adjacency_list<boost::directedS, double> >’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:75:1: required from ‘struct boost::concepts::IncidenceGraphConcept<R_adjacency_list<boost::directedS, double> >’
75 | BOOST_concept(IncidenceGraph, (G)) : Graph< G >
| ^~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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<R_adjacency_list<boost::directedS, double> >]’
32 | inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
| ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied<boost::concepts::IncidenceGraphConcept<R_adjacency_list<boost::directedS, double> > >::value’
44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:129:9: required from ‘void boost::detail::depth_first_visit_impl(const IncidenceGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, DFSVisitor&, ColorMap, TerminatorFunc) [with IncidenceGraph = R_adjacency_list<boost::directedS, double>; DFSVisitor = dfs_time_visitor<long unsigned int*>; ColorMap = boost::shared_array_property_map<boost::default_color_type, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int> >; TerminatorFunc = nontruth2; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:286:39: required from ‘void boost::depth_first_search(const VertexListGraph&, DFSVisitor, ColorMap, typename graph_traits<Graph>::vertex_descriptor) [with VertexListGraph = R_adjacency_list<directedS, double>; DFSVisitor = dfs_time_visitor<long unsigned int*>; ColorMap = shared_array_property_map<default_color_type, vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int> >; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
286 | detail::depth_first_visit_impl(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
287 | g, start_vertex, vis, color, detail::nontruth2());
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/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 dfs_time_visitor<long unsigned int*> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; Graph = R_adjacency_list<boost::directedS, double>]’
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)]);
| ~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/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 = R_adjacency_list<boost::directedS, double>; ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<keywords::tag::visitor, const dfs_time_visitor<long unsigned 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); \
| ~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/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 = R_adjacency_list<directedS, double>; P = dfs_time_visitor<long unsigned 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 dfs_time_visitor<long unsigned 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); \
| ~~~~~~~~~
interfaces.cpp:158:27: required from here
158 | depth_first_search(g, visitor(vis));
| ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
20 | ~usage_requirements() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::concepts::IncidenceGraph<G>::~IncidenceGraph() [with G = R_adjacency_list<boost::directedS, double>]’
37 | ~model()
| ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:87:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
87 | BOOST_CONCEPT_USAGE(IncidenceGraph)
| ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::constraint<Model>::failed() [with Model = boost::ReadablePropertyMapConcept<boost::shared_array_property_map<boost::default_color_type, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int> >, long unsigned int>]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:206:7: required from ‘void boost::ReadWritePropertyMapConcept<PMap, Key>::constraints() [with PMap = boost::shared_array_property_map<boost::default_color_type, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int> >; Key = long unsigned int]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::ReadWritePropertyMapConcept<boost::shared_array_property_map<boost::default_color_type, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int> >, long unsigned int>]’
32 | inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
| ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied<boost::ReadWritePropertyMapConcept<boost::shared_array_property_map<boost::default_color_type, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int> >, long unsigned int> >::value’
44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied<boost::ReadWritePropertyMapConcept<boost::shared_array_property_map<boost::default_color_type, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int> >, long unsigned int> >’
45 | typedef boost::integral_constant<bool, value> type;
| ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/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::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int> >, long unsigned int>)>’
72 | struct requirement_<void(*)(Model)>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:134:9: required from ‘void boost::detail::depth_first_visit_impl(const IncidenceGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, DFSVisitor&, ColorMap, TerminatorFunc) [with IncidenceGraph = R_adjacency_list<boost::directedS, double>; DFSVisitor = dfs_time_visitor<long unsigned int*>; ColorMap = boost::shared_array_property_map<boost::default_color_type, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int> >; TerminatorFunc = nontruth2; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:286:39: required from ‘void boost::depth_first_search(const VertexListGraph&, DFSVisitor, ColorMap, typename graph_traits<Graph>::vertex_descriptor) [with VertexListGraph = R_adjacency_list<directedS, double>; DFSVisitor = dfs_time_visitor<long unsigned int*>; ColorMap = shared_array_property_map<default_color_type, vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int> >; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
286 | detail::depth_first_visit_impl(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
287 | g, start_vertex, vis, color, detail::nontruth2());
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/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 dfs_time_visitor<long unsigned int*> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; Graph = R_adjacency_list<boost::directedS, double>]’
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)]);
| ~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/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 = R_adjacency_list<boost::directedS, double>; ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<keywords::tag::visitor, const dfs_time_visitor<long unsigned 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); \
| ~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/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 = R_adjacency_list<directedS, double>; P = dfs_time_visitor<long unsigned 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 dfs_time_visitor<long unsigned 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); \
| ~~~~~~~~~
interfaces.cpp:158:27: required from here
158 | depth_first_search(g, visitor(vis));
| ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:65:52: warning: ‘this’ pointer is null [-Wnonnull]
65 | static void failed() { ((Model*)0)->constraints(); }
| ~~~~~~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:147:10: note: in a call to non-static member function ‘void boost::ReadablePropertyMapConcept<PMap, Key>::constraints() [with PMap = boost::shared_array_property_map<boost::default_color_type, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int> >; Key = long unsigned int]’
147 | void constraints() {
| ^~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::constraint<Model>::failed() [with Model = boost::WritablePropertyMapConcept<boost::shared_array_property_map<boost::default_color_type, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int> >, long unsigned int>]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:207:7: required from ‘void boost::ReadWritePropertyMapConcept<PMap, Key>::constraints() [with PMap = boost::shared_array_property_map<boost::default_color_type, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int> >; Key = long unsigned int]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::ReadWritePropertyMapConcept<boost::shared_array_property_map<boost::default_color_type, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int> >, long unsigned int>]’
32 | inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
| ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied<boost::ReadWritePropertyMapConcept<boost::shared_array_property_map<boost::default_color_type, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int> >, long unsigned int> >::value’
44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied<boost::ReadWritePropertyMapConcept<boost::shared_array_property_map<boost::default_color_type, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int> >, long unsigned int> >’
45 | typedef boost::integral_constant<bool, value> type;
| ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/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::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int> >, long unsigned int>)>’
72 | struct requirement_<void(*)(Model)>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:134:9: required from ‘void boost::detail::depth_first_visit_impl(const IncidenceGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, DFSVisitor&, ColorMap, TerminatorFunc) [with IncidenceGraph = R_adjacency_list<boost::directedS, double>; DFSVisitor = dfs_time_visitor<long unsigned int*>; ColorMap = boost::shared_array_property_map<boost::default_color_type, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int> >; TerminatorFunc = nontruth2; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:286:39: required from ‘void boost::depth_first_search(const VertexListGraph&, DFSVisitor, ColorMap, typename graph_traits<Graph>::vertex_descriptor) [with VertexListGraph = R_adjacency_list<directedS, double>; DFSVisitor = dfs_time_visitor<long unsigned int*>; ColorMap = shared_array_property_map<default_color_type, vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int> >; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
286 | detail::depth_first_visit_impl(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
287 | g, start_vertex, vis, color, detail::nontruth2());
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/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 dfs_time_visitor<long unsigned int*> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; Graph = R_adjacency_list<boost::directedS, double>]’
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)]);
| ~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/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 = R_adjacency_list<boost::directedS, double>; ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<keywords::tag::visitor, const dfs_time_visitor<long unsigned 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); \
| ~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/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 = R_adjacency_list<directedS, double>; P = dfs_time_visitor<long unsigned 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 dfs_time_visitor<long unsigned 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); \
| ~~~~~~~~~
interfaces.cpp:158:27: required from here
158 | depth_first_search(g, visitor(vis));
| ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:65:52: warning: ‘this’ pointer is null [-Wnonnull]
65 | static void failed() { ((Model*)0)->constraints(); }
| ~~~~~~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:179:10: note: in a call to non-static member function ‘void boost::WritablePropertyMapConcept<PMap, Key>::constraints() [with PMap = boost::shared_array_property_map<boost::default_color_type, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int> >; Key = long unsigned int]’
179 | void constraints() {
| ^~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Convertible<boost::lvalue_property_map_tag, boost::read_write_property_map_tag> >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/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> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/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))
| ^~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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);
| ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/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) );
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/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;
| ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 6 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:134:9: required from ‘void boost::detail::depth_first_visit_impl(const IncidenceGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, DFSVisitor&, ColorMap, TerminatorFunc) [with IncidenceGraph = R_adjacency_list<boost::directedS, double>; DFSVisitor = dfs_time_visitor<long unsigned int*>; ColorMap = boost::shared_array_property_map<boost::default_color_type, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int> >; TerminatorFunc = nontruth2; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:286:39: required from ‘void boost::depth_first_search(const VertexListGraph&, DFSVisitor, ColorMap, typename graph_traits<Graph>::vertex_descriptor) [with VertexListGraph = R_adjacency_list<directedS, double>; DFSVisitor = dfs_time_visitor<long unsigned int*>; ColorMap = shared_array_property_map<default_color_type, vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int> >; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
286 | detail::depth_first_visit_impl(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
287 | g, start_vertex, vis, color, detail::nontruth2());
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/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 dfs_time_visitor<long unsigned int*> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; Graph = R_adjacency_list<boost::directedS, double>]’
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)]);
| ~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/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 = R_adjacency_list<boost::directedS, double>; ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<keywords::tag::visitor, const dfs_time_visitor<long unsigned 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); \
| ~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/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 = R_adjacency_list<directedS, double>; P = dfs_time_visitor<long unsigned 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 dfs_time_visitor<long unsigned 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); \
| ~~~~~~~~~
interfaces.cpp:158:27: required from here
158 | depth_first_search(g, visitor(vis));
| ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Convertible<boost::lvalue_property_map_tag, boost::read_write_property_map_tag>]’
20 | ~usage_requirements() { ((Model*)0)->~Model(); }
| ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::ConvertibleConcept<boost::lvalue_property_map_tag, boost::read_write_property_map_tag>]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/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::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int> >; Key = long unsigned int]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::ReadWritePropertyMapConcept<boost::shared_array_property_map<boost::default_color_type, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int> >, long unsigned int>]’
32 | inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
| ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied<boost::ReadWritePropertyMapConcept<boost::shared_array_property_map<boost::default_color_type, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int> >, long unsigned int> >::value’
44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied<boost::ReadWritePropertyMapConcept<boost::shared_array_property_map<boost::default_color_type, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int> >, long unsigned int> >’
45 | typedef boost::integral_constant<bool, value> type;
| ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/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::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int> >, long unsigned int>)>’
72 | struct requirement_<void(*)(Model)>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:134:9: required from ‘void boost::detail::depth_first_visit_impl(const IncidenceGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, DFSVisitor&, ColorMap, TerminatorFunc) [with IncidenceGraph = R_adjacency_list<boost::directedS, double>; DFSVisitor = dfs_time_visitor<long unsigned int*>; ColorMap = boost::shared_array_property_map<boost::default_color_type, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int> >; TerminatorFunc = nontruth2; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:286:39: required from ‘void boost::depth_first_search(const VertexListGraph&, DFSVisitor, ColorMap, typename graph_traits<Graph>::vertex_descriptor) [with VertexListGraph = R_adjacency_list<directedS, double>; DFSVisitor = dfs_time_visitor<long unsigned int*>; ColorMap = shared_array_property_map<default_color_type, vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int> >; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
286 | detail::depth_first_visit_impl(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
287 | g, start_vertex, vis, color, detail::nontruth2());
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/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 dfs_time_visitor<long unsigned int*> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; Graph = R_adjacency_list<boost::directedS, double>]’
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)]);
| ~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/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 = R_adjacency_list<boost::directedS, double>; ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<keywords::tag::visitor, const dfs_time_visitor<long unsigned 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); \
| ~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/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 = R_adjacency_list<directedS, double>; P = dfs_time_visitor<long unsigned 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 dfs_time_visitor<long unsigned 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); \
| ~~~~~~~~~
interfaces.cpp:158:27: required from here
158 | depth_first_search(g, visitor(vis));
| ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:206:17: note: in a call to non-static member function ‘boost::ConvertibleConcept<boost::lvalue_property_map_tag, boost::read_write_property_map_tag>::~ConvertibleConcept()’
206 | BOOST_concept(Convertible,(X)(Y))
| ^~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/preprocessor/cat.hpp:29:34: note: in definition of macro ‘BOOST_PP_CAT_I’
29 | # define BOOST_PP_CAT_I(a, b) a ## b
| ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/concept_def.hpp:23:12: note: in expansion of macro ‘BOOST_PP_CAT’
23 | struct BOOST_PP_CAT(name,Concept) \
| ^~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:206:3: note: in expansion of macro ‘BOOST_concept’
206 | BOOST_concept(Convertible,(X)(Y))
| ^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::EqualityComparable<boost::default_color_type>]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/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(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable<boost::default_color_type>’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:502:1: required from ‘struct boost::concepts::ColorValue<boost::default_color_type>’
502 | BOOST_concept(ColorValue, (C))
| ^~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:502:1: required from ‘struct boost::concepts::ColorValueConcept<boost::default_color_type>’
502 | BOOST_concept(ColorValue, (C))
| ^~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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);
| ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:136:9: required from ‘void boost::detail::depth_first_visit_impl(const IncidenceGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, DFSVisitor&, ColorMap, TerminatorFunc) [with IncidenceGraph = R_adjacency_list<boost::directedS, double>; DFSVisitor = dfs_time_visitor<long unsigned int*>; ColorMap = boost::shared_array_property_map<boost::default_color_type, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int> >; TerminatorFunc = nontruth2; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:286:39: required from ‘void boost::depth_first_search(const VertexListGraph&, DFSVisitor, ColorMap, typename graph_traits<Graph>::vertex_descriptor) [with VertexListGraph = R_adjacency_list<directedS, double>; DFSVisitor = dfs_time_visitor<long unsigned int*>; ColorMap = shared_array_property_map<default_color_type, vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int> >; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
286 | detail::depth_first_visit_impl(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
287 | g, start_vertex, vis, color, detail::nontruth2());
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/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 dfs_time_visitor<long unsigned int*> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; Graph = R_adjacency_list<boost::directedS, double>]’
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)]);
| ~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/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 = R_adjacency_list<boost::directedS, double>; ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<keywords::tag::visitor, const dfs_time_visitor<long unsigned 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); \
| ~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/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 = R_adjacency_list<directedS, double>; P = dfs_time_visitor<long unsigned 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 dfs_time_visitor<long unsigned 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); \
| ~~~~~~~~~
interfaces.cpp:158:27: required from here
158 | depth_first_search(g, visitor(vis));
| ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
20 | ~usage_requirements() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::EqualityComparable<TT>::~EqualityComparable() [with TT = boost::default_color_type]’
37 | ~model()
| ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:233:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
233 | BOOST_CONCEPT_USAGE(EqualityComparable) {
| ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::DefaultConstructible<boost::default_color_type>]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/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(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:137:5: required from ‘struct boost::DefaultConstructible<boost::default_color_type>’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:502:1: required from ‘struct boost::concepts::ColorValue<boost::default_color_type>’
502 | BOOST_concept(ColorValue, (C))
| ^~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:502:1: required from ‘struct boost::concepts::ColorValueConcept<boost::default_color_type>’
502 | BOOST_concept(ColorValue, (C))
| ^~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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);
| ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:136:9: required from ‘void boost::detail::depth_first_visit_impl(const IncidenceGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, DFSVisitor&, ColorMap, TerminatorFunc) [with IncidenceGraph = R_adjacency_list<boost::directedS, double>; DFSVisitor = dfs_time_visitor<long unsigned int*>; ColorMap = boost::shared_array_property_map<boost::default_color_type, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int> >; TerminatorFunc = nontruth2; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:286:39: required from ‘void boost::depth_first_search(const VertexListGraph&, DFSVisitor, ColorMap, typename graph_traits<Graph>::vertex_descriptor) [with VertexListGraph = R_adjacency_list<directedS, double>; DFSVisitor = dfs_time_visitor<long unsigned int*>; ColorMap = shared_array_property_map<default_color_type, vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int> >; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
286 | detail::depth_first_visit_impl(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
287 | g, start_vertex, vis, color, detail::nontruth2());
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/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 dfs_time_visitor<long unsigned int*> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; Graph = R_adjacency_list<boost::directedS, double>]’
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)]);
| ~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/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 = R_adjacency_list<boost::directedS, double>; ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<keywords::tag::visitor, const dfs_time_visitor<long unsigned 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); \
| ~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/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 = R_adjacency_list<directedS, double>; P = dfs_time_visitor<long unsigned 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 dfs_time_visitor<long unsigned 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); \
| ~~~~~~~~~
interfaces.cpp:158:27: required from here
158 | depth_first_search(g, visitor(vis));
| ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
20 | ~usage_requirements() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::DefaultConstructible<TT>::~DefaultConstructible() [with TT = boost::default_color_type]’
37 | ~model()
| ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:137:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
137 | BOOST_CONCEPT_USAGE(DefaultConstructible) {
| ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::concepts::ColorValue<boost::default_color_type>]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/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(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/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> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:502:1: required from ‘struct boost::concepts::ColorValueConcept<boost::default_color_type>’
502 | BOOST_concept(ColorValue, (C))
| ^~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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);
| ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/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) );
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:136:9: required from ‘void boost::detail::depth_first_visit_impl(const IncidenceGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, DFSVisitor&, ColorMap, TerminatorFunc) [with IncidenceGraph = R_adjacency_list<boost::directedS, double>; DFSVisitor = dfs_time_visitor<long unsigned int*>; ColorMap = boost::shared_array_property_map<boost::default_color_type, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int> >; TerminatorFunc = nontruth2; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:286:39: required from ‘void boost::depth_first_search(const VertexListGraph&, DFSVisitor, ColorMap, typename graph_traits<Graph>::vertex_descriptor) [with VertexListGraph = R_adjacency_list<directedS, double>; DFSVisitor = dfs_time_visitor<long unsigned int*>; ColorMap = shared_array_property_map<default_color_type, vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int> >; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
286 | detail::depth_first_visit_impl(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
287 | g, start_vertex, vis, color, detail::nontruth2());
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/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 dfs_time_visitor<long unsigned int*> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; Graph = R_adjacency_list<boost::directedS, double>]’
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)]);
| ~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/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 = R_adjacency_list<boost::directedS, double>; ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<keywords::tag::visitor, const dfs_time_visitor<long unsigned 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); \
| ~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/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 = R_adjacency_list<directedS, double>; P = dfs_time_visitor<long unsigned 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 dfs_time_visitor<long unsigned 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); \
| ~~~~~~~~~
interfaces.cpp:158:27: required from here
158 | depth_first_search(g, visitor(vis));
| ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
20 | ~usage_requirements() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::concepts::ColorValue<C>::~ColorValue() [with C = boost::default_color_type]’
37 | ~model()
| ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:505:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
505 | BOOST_CONCEPT_USAGE(ColorValue)
| ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::CopyConstructible<boost::detail::components_recorder<int*> > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:167:5: required from ‘struct boost::CopyConstructible<boost::detail::components_recorder<int*> >’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:165:3: required from ‘struct boost::CopyConstructibleConcept<boost::detail::components_recorder<int*> >’
165 | BOOST_concept(CopyConstructible,(TT))
| ^~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::CopyConstructibleConcept<boost::detail::components_recorder<int*> >]’
32 | inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
| ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied<boost::CopyConstructibleConcept<boost::detail::components_recorder<int*> > >::value’
44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied<boost::CopyConstructibleConcept<boost::detail::components_recorder<int*> > >’
45 | typedef boost::integral_constant<bool, value> type;
| ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 6 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:130:9: required from ‘void boost::depth_first_search(const VertexListGraph&, DFSVisitor, ColorMap, typename graph_traits<Graph>::vertex_descriptor) [with VertexListGraph = R_adjacency_list<undirectedS, double>; DFSVisitor = detail::components_recorder<int*>; ColorMap = shared_array_property_map<default_color_type, vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int> >; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:397:42: required from ‘void boost::graph::detail::depth_first_search_impl<Graph>::operator()(const Graph&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<boost::graph::keywords::tag::visitor, const boost::detail::components_recorder<int*> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; Graph = R_adjacency_list<boost::undirectedS, double>]’
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)]);
| ~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/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 = R_adjacency_list<boost::undirectedS, double>; ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<keywords::tag::visitor, const boost::detail::components_recorder<int*> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; typename boost::result_of<detail::depth_first_search_impl<Param0>(Param0, const ArgPack&)>::type = void]’
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); \
| ~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/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 = R_adjacency_list<undirectedS, double>; P = detail::components_recorder<int*>; T = graph_visitor_t; R = no_property; typename result_of<graph::detail::depth_first_search_impl<Param0>(Param0, const typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<T, Tag, Base> >::type&)>::type = void; typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<T, Tag, Base> >::type = parameter::aux::arg_list<parameter::aux::tagged_argument<graph::keywords::tag::visitor, const detail::components_recorder<int*> >, parameter::aux::empty_arg_list, std::integral_constant<bool, true> >]’
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); \
| ~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/connected_components.hpp:106:23: required from ‘typename boost::property_traits<IndexMap>::value_type boost::connected_components(const Graph&, ComponentMap, typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = R_adjacency_list<undirectedS, double>; ComponentMap = int*; typename property_traits<IndexMap>::value_type = int; typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits<Graph>::traversal_category = undir_adj_list_traversal_tag]’
106 | depth_first_search(g, visitor(vis));
| ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~
interfaces.cpp:205:29: required from here
205 | connected_components(g, &component[0]);
| ~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::CopyConstructible<boost::detail::components_recorder<int*> >]’
20 | ~usage_requirements() { ((Model*)0)->~Model(); }
| ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::CopyConstructibleConcept<boost::detail::components_recorder<int*> >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:41:9: required from ‘void boost::DFSVisitorConcept<Visitor, Graph>::constraints() [with Visitor = boost::detail::components_recorder<int*>; Graph = R_adjacency_list<boost::undirectedS, double>]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::DFSVisitorConcept<boost::detail::components_recorder<int*>, R_adjacency_list<boost::undirectedS, double> >]’
32 | inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
| ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied<boost::DFSVisitorConcept<boost::detail::components_recorder<int*>, R_adjacency_list<boost::undirectedS, double> > >::value’
44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied<boost::DFSVisitorConcept<boost::detail::components_recorder<int*>, R_adjacency_list<boost::undirectedS, double> > >’
45 | typedef boost::integral_constant<bool, value> type;
| ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_<void (*)(boost::DFSVisitorConcept<boost::detail::components_recorder<int*>, R_adjacency_list<boost::undirectedS, double> >)>’
72 | struct requirement_<void(*)(Model)>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:130:9: required from ‘void boost::depth_first_search(const VertexListGraph&, DFSVisitor, ColorMap, typename graph_traits<Graph>::vertex_descriptor) [with VertexListGraph = R_adjacency_list<undirectedS, double>; DFSVisitor = detail::components_recorder<int*>; ColorMap = shared_array_property_map<default_color_type, vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int> >; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:397:42: required from ‘void boost::graph::detail::depth_first_search_impl<Graph>::operator()(const Graph&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<boost::graph::keywords::tag::visitor, const boost::detail::components_recorder<int*> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; Graph = R_adjacency_list<boost::undirectedS, double>]’
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)]);
| ~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/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 = R_adjacency_list<boost::undirectedS, double>; ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<keywords::tag::visitor, const boost::detail::components_recorder<int*> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; typename boost::result_of<detail::depth_first_search_impl<Param0>(Param0, const ArgPack&)>::type = void]’
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); \
| ~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/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 = R_adjacency_list<undirectedS, double>; P = detail::components_recorder<int*>; T = graph_visitor_t; R = no_property; typename result_of<graph::detail::depth_first_search_impl<Param0>(Param0, const typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<T, Tag, Base> >::type&)>::type = void; typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<T, Tag, Base> >::type = parameter::aux::arg_list<parameter::aux::tagged_argument<graph::keywords::tag::visitor, const detail::components_recorder<int*> >, parameter::aux::empty_arg_list, std::integral_constant<bool, true> >]’
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); \
| ~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/connected_components.hpp:106:23: required from ‘typename boost::property_traits<IndexMap>::value_type boost::connected_components(const Graph&, ComponentMap, typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = R_adjacency_list<undirectedS, double>; ComponentMap = int*; typename property_traits<IndexMap>::value_type = int; typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits<Graph>::traversal_category = undir_adj_list_traversal_tag]’
106 | depth_first_search(g, visitor(vis));
| ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~
interfaces.cpp:205:29: required from here
205 | connected_components(g, &component[0]);
| ~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:165:17: note: in a call to non-static member function ‘boost::CopyConstructibleConcept<boost::detail::components_recorder<int*> >::~CopyConstructibleConcept()’
165 | BOOST_concept(CopyConstructible,(TT))
| ^~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/preprocessor/cat.hpp:29:34: note: in definition of macro ‘BOOST_PP_CAT_I’
29 | # define BOOST_PP_CAT_I(a, b) a ## b
| ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/concept_def.hpp:23:12: note: in expansion of macro ‘BOOST_PP_CAT’
23 | struct BOOST_PP_CAT(name,Concept) \
| ^~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:165:3: note: in expansion of macro ‘BOOST_concept’
165 | BOOST_concept(CopyConstructible,(TT))
| ^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/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<R_adjacency_list<boost::undirectedS, double> > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:66:5: required from ‘struct boost::concepts::Graph<R_adjacency_list<boost::undirectedS, double> >’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:75:1: required from ‘struct boost::concepts::IncidenceGraph<R_adjacency_list<boost::undirectedS, double> >’
75 | BOOST_concept(IncidenceGraph, (G)) : Graph< G >
| ^~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:75:1: required from ‘struct boost::concepts::IncidenceGraphConcept<R_adjacency_list<boost::undirectedS, double> >’
75 | BOOST_concept(IncidenceGraph, (G)) : Graph< G >
| ^~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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<R_adjacency_list<boost::undirectedS, double> >]’
32 | inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
| ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied<boost::concepts::IncidenceGraphConcept<R_adjacency_list<boost::undirectedS, double> > >::value’
44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:286:39: required from ‘void boost::depth_first_search(const VertexListGraph&, DFSVisitor, ColorMap, typename graph_traits<Graph>::vertex_descriptor) [with VertexListGraph = R_adjacency_list<undirectedS, double>; DFSVisitor = detail::components_recorder<int*>; ColorMap = shared_array_property_map<default_color_type, vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int> >; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
286 | detail::depth_first_visit_impl(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
287 | g, start_vertex, vis, color, detail::nontruth2());
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:397:42: required from ‘void boost::graph::detail::depth_first_search_impl<Graph>::operator()(const Graph&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<boost::graph::keywords::tag::visitor, const boost::detail::components_recorder<int*> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; Graph = R_adjacency_list<boost::undirectedS, double>]’
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)]);
| ~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/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 = R_adjacency_list<boost::undirectedS, double>; ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<keywords::tag::visitor, const boost::detail::components_recorder<int*> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; typename boost::result_of<detail::depth_first_search_impl<Param0>(Param0, const ArgPack&)>::type = void]’
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); \
| ~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/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 = R_adjacency_list<undirectedS, double>; P = detail::components_recorder<int*>; T = graph_visitor_t; R = no_property; typename result_of<graph::detail::depth_first_search_impl<Param0>(Param0, const typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<T, Tag, Base> >::type&)>::type = void; typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<T, Tag, Base> >::type = parameter::aux::arg_list<parameter::aux::tagged_argument<graph::keywords::tag::visitor, const detail::components_recorder<int*> >, parameter::aux::empty_arg_list, std::integral_constant<bool, true> >]’
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); \
| ~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/connected_components.hpp:106:23: required from ‘typename boost::property_traits<IndexMap>::value_type boost::connected_components(const Graph&, ComponentMap, typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = R_adjacency_list<undirectedS, double>; ComponentMap = int*; typename property_traits<IndexMap>::value_type = int; typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits<Graph>::traversal_category = undir_adj_list_traversal_tag]’
106 | depth_first_search(g, visitor(vis));
| ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~
interfaces.cpp:205:29: required from here
205 | connected_components(g, &component[0]);
| ~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/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<R_adjacency_list<boost::undirectedS, double> >]’
20 | ~usage_requirements() { ((Model*)0)->~Model(); }
| ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/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<R_adjacency_list<boost::undirectedS, double> > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:87:5: required from ‘struct boost::concepts::IncidenceGraph<R_adjacency_list<boost::undirectedS, double> >’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:75:1: required from ‘struct boost::concepts::IncidenceGraphConcept<R_adjacency_list<boost::undirectedS, double> >’
75 | BOOST_concept(IncidenceGraph, (G)) : Graph< G >
| ^~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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<R_adjacency_list<boost::undirectedS, double> >]’
32 | inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
| ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied<boost::concepts::IncidenceGraphConcept<R_adjacency_list<boost::undirectedS, double> > >::value’
44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied<boost::concepts::IncidenceGraphConcept<R_adjacency_list<boost::undirectedS, double> > >’
45 | typedef boost::integral_constant<bool, value> type;
| ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:286:39: required from ‘void boost::depth_first_search(const VertexListGraph&, DFSVisitor, ColorMap, typename graph_traits<Graph>::vertex_descriptor) [with VertexListGraph = R_adjacency_list<undirectedS, double>; DFSVisitor = detail::components_recorder<int*>; ColorMap = shared_array_property_map<default_color_type, vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int> >; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
286 | detail::depth_first_visit_impl(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
287 | g, start_vertex, vis, color, detail::nontruth2());
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:397:42: required from ‘void boost::graph::detail::depth_first_search_impl<Graph>::operator()(const Graph&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<boost::graph::keywords::tag::visitor, const boost::detail::components_recorder<int*> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; Graph = R_adjacency_list<boost::undirectedS, double>]’
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)]);
| ~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/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 = R_adjacency_list<boost::undirectedS, double>; ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<keywords::tag::visitor, const boost::detail::components_recorder<int*> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; typename boost::result_of<detail::depth_first_search_impl<Param0>(Param0, const ArgPack&)>::type = void]’
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); \
| ~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/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 = R_adjacency_list<undirectedS, double>; P = detail::components_recorder<int*>; T = graph_visitor_t; R = no_property; typename result_of<graph::detail::depth_first_search_impl<Param0>(Param0, const typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<T, Tag, Base> >::type&)>::type = void; typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<T, Tag, Base> >::type = parameter::aux::arg_list<parameter::aux::tagged_argument<graph::keywords::tag::visitor, const detail::components_recorder<int*> >, parameter::aux::empty_arg_list, std::integral_constant<bool, true> >]’
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); \
| ~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/connected_components.hpp:106:23: required from ‘typename boost::property_traits<IndexMap>::value_type boost::connected_components(const Graph&, ComponentMap, typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = R_adjacency_list<undirectedS, double>; ComponentMap = int*; typename property_traits<IndexMap>::value_type = int; typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits<Graph>::traversal_category = undir_adj_list_traversal_tag]’
106 | depth_first_search(g, visitor(vis));
| ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~
interfaces.cpp:205:29: required from here
205 | connected_components(g, &component[0]);
| ~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/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<R_adjacency_list<boost::undirectedS, double> >]’
20 | ~usage_requirements() { ((Model*)0)->~Model(); }
| ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/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<R_adjacency_list<boost::undirectedS, double> >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:129:9: required from ‘void boost::detail::depth_first_visit_impl(const IncidenceGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, DFSVisitor&, ColorMap, TerminatorFunc) [with IncidenceGraph = R_adjacency_list<boost::undirectedS, double>; DFSVisitor = components_recorder<int*>; ColorMap = boost::shared_array_property_map<boost::default_color_type, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int> >; TerminatorFunc = nontruth2; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:286:39: required from ‘void boost::depth_first_search(const VertexListGraph&, DFSVisitor, ColorMap, typename graph_traits<Graph>::vertex_descriptor) [with VertexListGraph = R_adjacency_list<undirectedS, double>; DFSVisitor = detail::components_recorder<int*>; ColorMap = shared_array_property_map<default_color_type, vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int> >; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
286 | detail::depth_first_visit_impl(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
287 | g, start_vertex, vis, color, detail::nontruth2());
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:397:42: required from ‘void boost::graph::detail::depth_first_search_impl<Graph>::operator()(const Graph&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<boost::graph::keywords::tag::visitor, const boost::detail::components_recorder<int*> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; Graph = R_adjacency_list<boost::undirectedS, double>]’
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)]);
| ~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/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 = R_adjacency_list<boost::undirectedS, double>; ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<keywords::tag::visitor, const boost::detail::components_recorder<int*> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; typename boost::result_of<detail::depth_first_search_impl<Param0>(Param0, const ArgPack&)>::type = void]’
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); \
| ~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/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 = R_adjacency_list<undirectedS, double>; P = detail::components_recorder<int*>; T = graph_visitor_t; R = no_property; typename result_of<graph::detail::depth_first_search_impl<Param0>(Param0, const typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<T, Tag, Base> >::type&)>::type = void; typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<T, Tag, Base> >::type = parameter::aux::arg_list<parameter::aux::tagged_argument<graph::keywords::tag::visitor, const detail::components_recorder<int*> >, parameter::aux::empty_arg_list, std::integral_constant<bool, true> >]’
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); \
| ~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/connected_components.hpp:106:23: required from ‘typename boost::property_traits<IndexMap>::value_type boost::connected_components(const Graph&, ComponentMap, typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = R_adjacency_list<undirectedS, double>; ComponentMap = int*; typename property_traits<IndexMap>::value_type = int; typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits<Graph>::traversal_category = undir_adj_list_traversal_tag]’
106 | depth_first_search(g, visitor(vis));
| ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~
interfaces.cpp:205:29: required from here
205 | connected_components(g, &component[0]);
| ~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:75:15: note: in a call to non-static member function ‘boost::concepts::IncidenceGraphConcept<R_adjacency_list<boost::undirectedS, double> >::~IncidenceGraphConcept()’
75 | BOOST_concept(IncidenceGraph, (G)) : Graph< G >
| ^~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/preprocessor/cat.hpp:29:34: note: in definition of macro ‘BOOST_PP_CAT_I’
29 | # define BOOST_PP_CAT_I(a, b) a ## b
| ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/concept_def.hpp:23:12: note: in expansion of macro ‘BOOST_PP_CAT’
23 | struct BOOST_PP_CAT(name,Concept) \
| ^~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:75:1: note: in expansion of macro ‘BOOST_concept’
75 | BOOST_concept(IncidenceGraph, (G)) : Graph< G >
| ^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/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<R_adjacency_list<boost::undirectedS, double> > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:182:5: required from ‘struct boost::concepts::VertexListGraph<R_adjacency_list<boost::undirectedS, double> >’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:176:1: required from ‘struct boost::concepts::VertexListGraphConcept<R_adjacency_list<boost::undirectedS, double> >’
176 | BOOST_concept(VertexListGraph, (G)) : Graph< G >
| ^~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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<R_adjacency_list<boost::undirectedS, double> >]’
32 | inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
| ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied<boost::concepts::VertexListGraphConcept<R_adjacency_list<boost::undirectedS, double> > >::value’
44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied<boost::concepts::VertexListGraphConcept<R_adjacency_list<boost::undirectedS, double> > >’
45 | typedef boost::integral_constant<bool, value> type;
| ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/biconnected_components.hpp:250:47: required from ‘static std::pair<long unsigned int, OutputIterator> boost::detail::bicomp_dispatch3<boost::param_not_found>::apply(const Graph&, ComponentMap, OutputIterator, VertexIndexMap, DiscoverTimeMap, LowPointMap, const boost::bgl_named_params<P, T, R>&, boost::param_not_found) [with Graph = R_adjacency_list<boost::undirectedS, double>; ComponentMap = boost::dummy_property_map; OutputIterator = std::back_insert_iterator<std::vector<long unsigned int> >; VertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>; DiscoverTimeMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; LowPointMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; P = int; T = boost::buffer_param_t; R = boost::no_property]’
250 | return biconnected_components_impl(g, comp, out, index_map, dtm,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
251 | lowpt,
| ~~~~~~
252 | make_iterator_property_map(pred.begin(), index_map, vert),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
253 | choose_param(get_param(params, graph_visitor),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
254 | make_dfs_visitor(null_visitor())));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/biconnected_components.hpp:295:60: required from ‘static std::pair<long unsigned int, OutputIterator> boost::detail::bicomp_dispatch2<boost::param_not_found>::apply(const Graph&, ComponentMap, OutputIterator, VertexIndexMap, DiscoverTimeMap, const boost::bgl_named_params<P, T, R>&, boost::param_not_found) [with Graph = R_adjacency_list<boost::undirectedS, double>; ComponentMap = boost::dummy_property_map; OutputIterator = std::back_insert_iterator<std::vector<long unsigned int> >; VertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>; DiscoverTimeMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; P = int; T = boost::buffer_param_t; R = boost::no_property]’
295 | return bicomp_dispatch3< dispatch_type >::apply(g, comp, out,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
296 | index_map, dtm,
| ~~~~~~~~~~~~~~~
297 | make_iterator_property_map(lowpt.begin(), index_map, vst),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
298 | params, get_param(params, vertex_predecessor));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/biconnected_components.hpp:336:60: required from ‘static std::pair<long unsigned int, OutputIterator> boost::detail::bicomp_dispatch1<boost::param_not_found>::apply(const Graph&, ComponentMap, OutputIterator, VertexIndexMap, const boost::bgl_named_params<P, T, R>&, boost::param_not_found) [with Graph = R_adjacency_list<boost::undirectedS, double>; ComponentMap = boost::dummy_property_map; OutputIterator = std::back_insert_iterator<std::vector<long unsigned int> >; VertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>; P = int; T = boost::buffer_param_t; R = boost::no_property]’
336 | return bicomp_dispatch2< dispatch_type >::apply(g, comp, out,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
337 | index_map,
| ~~~~~~~~~~
338 | make_iterator_property_map(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~
339 | discover_time.begin(), index_map, vst),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
340 | params, get_param(params, vertex_lowpoint));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/biconnected_components.hpp:368:60: required from ‘std::pair<long unsigned int, OutputIterator> boost::biconnected_components(const Graph&, ComponentMap, OutputIterator, const bgl_named_params<P, T, R>&) [with Graph = R_adjacency_list<undirectedS, double>; ComponentMap = dummy_property_map; OutputIterator = std::back_insert_iterator<std::vector<long unsigned int> >; P = int; T = buffer_param_t; R = no_property]’
368 | return detail::bicomp_dispatch1< dispatch_type >::apply(g, comp, out,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
369 | choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
370 | params, get_param(params, vertex_discover_time));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/biconnected_components.hpp:433:34: required from ‘OutputIterator boost::articulation_points(const Graph&, OutputIterator) [with Graph = R_adjacency_list<undirectedS, double>; OutputIterator = std::back_insert_iterator<std::vector<long unsigned int> >]’
433 | return biconnected_components(g, dummy_property_map(), out,
| ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
434 | bgl_named_params< int, buffer_param_t >(0))
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
interfaces.cpp:300:28: required from here
300 | articulation_points(g, std::back_inserter(art_points));
| ~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/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<R_adjacency_list<boost::undirectedS, double> >]’
20 | ~usage_requirements() { ((Model*)0)->~Model(); }
| ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/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<R_adjacency_list<boost::undirectedS, double> >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/biconnected_components.hpp:188:9: required from ‘std::pair<long unsigned int, OutputIterator> boost::detail::biconnected_components_impl(const Graph&, ComponentMap, OutputIterator, VertexIndexMap, DiscoverTimeMap, LowPointMap, PredecessorMap, DFSVisitor) [with Graph = R_adjacency_list<boost::undirectedS, double>; ComponentMap = boost::dummy_property_map; OutputIterator = std::back_insert_iterator<std::vector<long unsigned int> >; VertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>; DiscoverTimeMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; LowPointMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; PredecessorMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; DFSVisitor = boost::dfs_visitor<>]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/biconnected_components.hpp:250:47: required from ‘static std::pair<long unsigned int, OutputIterator> boost::detail::bicomp_dispatch3<boost::param_not_found>::apply(const Graph&, ComponentMap, OutputIterator, VertexIndexMap, DiscoverTimeMap, LowPointMap, const boost::bgl_named_params<P, T, R>&, boost::param_not_found) [with Graph = R_adjacency_list<boost::undirectedS, double>; ComponentMap = boost::dummy_property_map; OutputIterator = std::back_insert_iterator<std::vector<long unsigned int> >; VertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>; DiscoverTimeMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; LowPointMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; P = int; T = boost::buffer_param_t; R = boost::no_property]’
250 | return biconnected_components_impl(g, comp, out, index_map, dtm,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
251 | lowpt,
| ~~~~~~
252 | make_iterator_property_map(pred.begin(), index_map, vert),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
253 | choose_param(get_param(params, graph_visitor),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
254 | make_dfs_visitor(null_visitor())));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/biconnected_components.hpp:295:60: required from ‘static std::pair<long unsigned int, OutputIterator> boost::detail::bicomp_dispatch2<boost::param_not_found>::apply(const Graph&, ComponentMap, OutputIterator, VertexIndexMap, DiscoverTimeMap, const boost::bgl_named_params<P, T, R>&, boost::param_not_found) [with Graph = R_adjacency_list<boost::undirectedS, double>; ComponentMap = boost::dummy_property_map; OutputIterator = std::back_insert_iterator<std::vector<long unsigned int> >; VertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>; DiscoverTimeMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; P = int; T = boost::buffer_param_t; R = boost::no_property]’
295 | return bicomp_dispatch3< dispatch_type >::apply(g, comp, out,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
296 | index_map, dtm,
| ~~~~~~~~~~~~~~~
297 | make_iterator_property_map(lowpt.begin(), index_map, vst),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
298 | params, get_param(params, vertex_predecessor));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/biconnected_components.hpp:336:60: required from ‘static std::pair<long unsigned int, OutputIterator> boost::detail::bicomp_dispatch1<boost::param_not_found>::apply(const Graph&, ComponentMap, OutputIterator, VertexIndexMap, const boost::bgl_named_params<P, T, R>&, boost::param_not_found) [with Graph = R_adjacency_list<boost::undirectedS, double>; ComponentMap = boost::dummy_property_map; OutputIterator = std::back_insert_iterator<std::vector<long unsigned int> >; VertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>; P = int; T = boost::buffer_param_t; R = boost::no_property]’
336 | return bicomp_dispatch2< dispatch_type >::apply(g, comp, out,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
337 | index_map,
| ~~~~~~~~~~
338 | make_iterator_property_map(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~
339 | discover_time.begin(), index_map, vst),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
340 | params, get_param(params, vertex_lowpoint));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/biconnected_components.hpp:368:60: required from ‘std::pair<long unsigned int, OutputIterator> boost::biconnected_components(const Graph&, ComponentMap, OutputIterator, const bgl_named_params<P, T, R>&) [with Graph = R_adjacency_list<undirectedS, double>; ComponentMap = dummy_property_map; OutputIterator = std::back_insert_iterator<std::vector<long unsigned int> >; P = int; T = buffer_param_t; R = no_property]’
368 | return detail::bicomp_dispatch1< dispatch_type >::apply(g, comp, out,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
369 | choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
370 | params, get_param(params, vertex_discover_time));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/biconnected_components.hpp:433:34: required from ‘OutputIterator boost::articulation_points(const Graph&, OutputIterator) [with Graph = R_adjacency_list<undirectedS, double>; OutputIterator = std::back_insert_iterator<std::vector<long unsigned int> >]’
433 | return biconnected_components(g, dummy_property_map(), out,
| ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
434 | bgl_named_params< int, buffer_param_t >(0))
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
interfaces.cpp:300:28: required from here
300 | articulation_points(g, std::back_inserter(art_points));
| ~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:176:15: note: in a call to non-static member function ‘boost::concepts::VertexListGraphConcept<R_adjacency_list<boost::undirectedS, double> >::~VertexListGraphConcept()’
176 | BOOST_concept(VertexListGraph, (G)) : Graph< G >
| ^~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/preprocessor/cat.hpp:29:34: note: in definition of macro ‘BOOST_PP_CAT_I’
29 | # define BOOST_PP_CAT_I(a, b) a ## b
| ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/concept_def.hpp:23:12: note: in expansion of macro ‘BOOST_PP_CAT’
23 | struct BOOST_PP_CAT(name,Concept) \
| ^~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:176:1: note: in expansion of macro ‘BOOST_concept’
176 | BOOST_concept(VertexListGraph, (G)) : Graph< G >
| ^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::constraint<Model>::failed() [with Model = boost::WritablePropertyMapConcept<boost::dummy_property_map, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/biconnected_components.hpp:190:9: required from ‘std::pair<long unsigned int, OutputIterator> boost::detail::biconnected_components_impl(const Graph&, ComponentMap, OutputIterator, VertexIndexMap, DiscoverTimeMap, LowPointMap, PredecessorMap, DFSVisitor) [with Graph = R_adjacency_list<boost::undirectedS, double>; ComponentMap = boost::dummy_property_map; OutputIterator = std::back_insert_iterator<std::vector<long unsigned int> >; VertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>; DiscoverTimeMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; LowPointMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; PredecessorMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; DFSVisitor = boost::dfs_visitor<>]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/biconnected_components.hpp:250:47: required from ‘static std::pair<long unsigned int, OutputIterator> boost::detail::bicomp_dispatch3<boost::param_not_found>::apply(const Graph&, ComponentMap, OutputIterator, VertexIndexMap, DiscoverTimeMap, LowPointMap, const boost::bgl_named_params<P, T, R>&, boost::param_not_found) [with Graph = R_adjacency_list<boost::undirectedS, double>; ComponentMap = boost::dummy_property_map; OutputIterator = std::back_insert_iterator<std::vector<long unsigned int> >; VertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>; DiscoverTimeMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; LowPointMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; P = int; T = boost::buffer_param_t; R = boost::no_property]’
250 | return biconnected_components_impl(g, comp, out, index_map, dtm,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
251 | lowpt,
| ~~~~~~
252 | make_iterator_property_map(pred.begin(), index_map, vert),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
253 | choose_param(get_param(params, graph_visitor),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
254 | make_dfs_visitor(null_visitor())));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/biconnected_components.hpp:295:60: required from ‘static std::pair<long unsigned int, OutputIterator> boost::detail::bicomp_dispatch2<boost::param_not_found>::apply(const Graph&, ComponentMap, OutputIterator, VertexIndexMap, DiscoverTimeMap, const boost::bgl_named_params<P, T, R>&, boost::param_not_found) [with Graph = R_adjacency_list<boost::undirectedS, double>; ComponentMap = boost::dummy_property_map; OutputIterator = std::back_insert_iterator<std::vector<long unsigned int> >; VertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>; DiscoverTimeMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; P = int; T = boost::buffer_param_t; R = boost::no_property]’
295 | return bicomp_dispatch3< dispatch_type >::apply(g, comp, out,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
296 | index_map, dtm,
| ~~~~~~~~~~~~~~~
297 | make_iterator_property_map(lowpt.begin(), index_map, vst),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
298 | params, get_param(params, vertex_predecessor));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/biconnected_components.hpp:336:60: required from ‘static std::pair<long unsigned int, OutputIterator> boost::detail::bicomp_dispatch1<boost::param_not_found>::apply(const Graph&, ComponentMap, OutputIterator, VertexIndexMap, const boost::bgl_named_params<P, T, R>&, boost::param_not_found) [with Graph = R_adjacency_list<boost::undirectedS, double>; ComponentMap = boost::dummy_property_map; OutputIterator = std::back_insert_iterator<std::vector<long unsigned int> >; VertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>; P = int; T = boost::buffer_param_t; R = boost::no_property]’
336 | return bicomp_dispatch2< dispatch_type >::apply(g, comp, out,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
337 | index_map,
| ~~~~~~~~~~
338 | make_iterator_property_map(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~
339 | discover_time.begin(), index_map, vst),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
340 | params, get_param(params, vertex_lowpoint));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/biconnected_components.hpp:368:60: required from ‘std::pair<long unsigned int, OutputIterator> boost::biconnected_components(const Graph&, ComponentMap, OutputIterator, const bgl_named_params<P, T, R>&) [with Graph = R_adjacency_list<undirectedS, double>; ComponentMap = dummy_property_map; OutputIterator = std::back_insert_iterator<std::vector<long unsigned int> >; P = int; T = buffer_param_t; R = no_property]’
368 | return detail::bicomp_dispatch1< dispatch_type >::apply(g, comp, out,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
369 | choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
370 | params, get_param(params, vertex_discover_time));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/biconnected_components.hpp:433:34: required from ‘OutputIterator boost::articulation_points(const Graph&, OutputIterator) [with Graph = R_adjacency_list<undirectedS, double>; OutputIterator = std::back_insert_iterator<std::vector<long unsigned int> >]’
433 | return biconnected_components(g, dummy_property_map(), out,
| ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
434 | bgl_named_params< int, buffer_param_t >(0))
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
interfaces.cpp:300:28: required from here
300 | articulation_points(g, std::back_inserter(art_points));
| ~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:65:52: warning: ‘this’ pointer is null [-Wnonnull]
65 | static void failed() { ((Model*)0)->constraints(); }
| ~~~~~~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/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::dummy_property_map; Key = boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>]’
179 | void constraints() {
| ^~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::constraint<Model>::failed() [with Model = boost::ReadWritePropertyMapConcept<boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>, long unsigned int>]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/biconnected_components.hpp:192:9: required from ‘std::pair<long unsigned int, OutputIterator> boost::detail::biconnected_components_impl(const Graph&, ComponentMap, OutputIterator, VertexIndexMap, DiscoverTimeMap, LowPointMap, PredecessorMap, DFSVisitor) [with Graph = R_adjacency_list<boost::undirectedS, double>; ComponentMap = boost::dummy_property_map; OutputIterator = std::back_insert_iterator<std::vector<long unsigned int> >; VertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>; DiscoverTimeMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; LowPointMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; PredecessorMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; DFSVisitor = boost::dfs_visitor<>]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/biconnected_components.hpp:250:47: required from ‘static std::pair<long unsigned int, OutputIterator> boost::detail::bicomp_dispatch3<boost::param_not_found>::apply(const Graph&, ComponentMap, OutputIterator, VertexIndexMap, DiscoverTimeMap, LowPointMap, const boost::bgl_named_params<P, T, R>&, boost::param_not_found) [with Graph = R_adjacency_list<boost::undirectedS, double>; ComponentMap = boost::dummy_property_map; OutputIterator = std::back_insert_iterator<std::vector<long unsigned int> >; VertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>; DiscoverTimeMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; LowPointMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; P = int; T = boost::buffer_param_t; R = boost::no_property]’
250 | return biconnected_components_impl(g, comp, out, index_map, dtm,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
251 | lowpt,
| ~~~~~~
252 | make_iterator_property_map(pred.begin(), index_map, vert),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
253 | choose_param(get_param(params, graph_visitor),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
254 | make_dfs_visitor(null_visitor())));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/biconnected_components.hpp:295:60: required from ‘static std::pair<long unsigned int, OutputIterator> boost::detail::bicomp_dispatch2<boost::param_not_found>::apply(const Graph&, ComponentMap, OutputIterator, VertexIndexMap, DiscoverTimeMap, const boost::bgl_named_params<P, T, R>&, boost::param_not_found) [with Graph = R_adjacency_list<boost::undirectedS, double>; ComponentMap = boost::dummy_property_map; OutputIterator = std::back_insert_iterator<std::vector<long unsigned int> >; VertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>; DiscoverTimeMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; P = int; T = boost::buffer_param_t; R = boost::no_property]’
295 | return bicomp_dispatch3< dispatch_type >::apply(g, comp, out,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
296 | index_map, dtm,
| ~~~~~~~~~~~~~~~
297 | make_iterator_property_map(lowpt.begin(), index_map, vst),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
298 | params, get_param(params, vertex_predecessor));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/biconnected_components.hpp:336:60: required from ‘static std::pair<long unsigned int, OutputIterator> boost::detail::bicomp_dispatch1<boost::param_not_found>::apply(const Graph&, ComponentMap, OutputIterator, VertexIndexMap, const boost::bgl_named_params<P, T, R>&, boost::param_not_found) [with Graph = R_adjacency_list<boost::undirectedS, double>; ComponentMap = boost::dummy_property_map; OutputIterator = std::back_insert_iterator<std::vector<long unsigned int> >; VertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>; P = int; T = boost::buffer_param_t; R = boost::no_property]’
336 | return bicomp_dispatch2< dispatch_type >::apply(g, comp, out,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
337 | index_map,
| ~~~~~~~~~~
338 | make_iterator_property_map(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~
339 | discover_time.begin(), index_map, vst),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
340 | params, get_param(params, vertex_lowpoint));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/biconnected_components.hpp:368:60: required from ‘std::pair<long unsigned int, OutputIterator> boost::biconnected_components(const Graph&, ComponentMap, OutputIterator, const bgl_named_params<P, T, R>&) [with Graph = R_adjacency_list<undirectedS, double>; ComponentMap = dummy_property_map; OutputIterator = std::back_insert_iterator<std::vector<long unsigned int> >; P = int; T = buffer_param_t; R = no_property]’
368 | return detail::bicomp_dispatch1< dispatch_type >::apply(g, comp, out,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
369 | choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
370 | params, get_param(params, vertex_discover_time));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/biconnected_components.hpp:433:34: required from ‘OutputIterator boost::articulation_points(const Graph&, OutputIterator) [with Graph = R_adjacency_list<undirectedS, double>; OutputIterator = std::back_insert_iterator<std::vector<long unsigned int> >]’
433 | return biconnected_components(g, dummy_property_map(), out,
| ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
434 | bgl_named_params< int, buffer_param_t >(0))
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
interfaces.cpp:300:28: required from here
300 | articulation_points(g, std::back_inserter(art_points));
| ~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:65:52: warning: ‘this’ pointer is null [-Wnonnull]
65 | static void failed() { ((Model*)0)->constraints(); }
| ~~~~~~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:205:10: note: in a call to non-static member function ‘void boost::ReadWritePropertyMapConcept<PMap, Key>::constraints() [with PMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; Key = long unsigned int]’
205 | void constraints() {
| ^~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::concepts::Graph<boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::no_property, boost::listS>, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long unsigned int, long unsigned int&, long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::concepts::Graph<boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::no_property, boost::listS>, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long unsigned int, long unsigned int&, long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all> > >]’
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:66:5: required from ‘struct boost::concepts::Graph<boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::no_property, boost::listS>, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long unsigned int, long unsigned int&, long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:75:1: required from ‘struct boost::concepts::IncidenceGraph<boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::no_property, boost::listS>, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long unsigned int, long unsigned int&, long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >’
75 | BOOST_concept(IncidenceGraph, (G)) : Graph< G >
| ^~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:75:1: required from ‘struct boost::concepts::IncidenceGraphConcept<boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::no_property, boost::listS>, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long unsigned int, long unsigned int&, long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >’
75 | BOOST_concept(IncidenceGraph, (G)) : Graph< G >
| ^~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::concepts::IncidenceGraphConcept<boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::no_property, boost::listS>, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long unsigned int, long unsigned int&, long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >]’
32 | inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
| ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:129:9: required from ‘void boost::breadth_first_visit(const IncidenceGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with IncidenceGraph = filtered_graph<adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, no_property, listS>, is_residual_edge<adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_residual_capacity_t> >, keep_all>; Buffer = queue<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > >; BFSVisitor = bfs_visitor<edge_predecessor_recorder<detail::edge_desc_impl<directed_tag, long unsigned int>*, on_tree_edge> >; ColorMap = default_color_type*; SourceIterator = long unsigned int*]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:136:24: required from ‘void boost::breadth_first_search(const VertexListGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph<adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, no_property, listS>, is_residual_edge<adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_residual_capacity_t> >, keep_all>; SourceIterator = long unsigned int*; Buffer = queue<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > >; BFSVisitor = bfs_visitor<edge_predecessor_recorder<detail::edge_desc_impl<directed_tag, long unsigned int>*, on_tree_edge> >; ColorMap = default_color_type*]’
136 | breadth_first_visit(g, sources_begin, sources_end, Q, vis, color);
| ~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:147:25: required from ‘void boost::breadth_first_search(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph<adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, no_property, listS>, is_residual_edge<adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_residual_capacity_t> >, keep_all>; Buffer = queue<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > >; BFSVisitor = bfs_visitor<edge_predecessor_recorder<detail::edge_desc_impl<directed_tag, long unsigned int>*, on_tree_edge> >; ColorMap = default_color_type*; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
147 | breadth_first_search(g, sources, sources + 1, Q, vis, color);
| ~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/edmonds_karp_max_flow.hpp:101:29: required from ‘typename boost::property_traits<IndexMap>::value_type boost::edmonds_karp_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, ColorMap, PredEdgeMap) [with Graph = adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, no_property, listS>; CapacityEdgeMap = adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map<directed_tag, detail::edge_desc_impl<directed_tag, long unsigned int>, detail::edge_desc_impl<directed_tag, long unsigned int>&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_reverse_t>; ColorMap = default_color_type*; PredEdgeMap = detail::edge_desc_impl<directed_tag, long unsigned int>*; typename property_traits<IndexMap>::value_type = long unsigned int; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
101 | breadth_first_search(detail::residual_graph(g, res), src, Q,
| ~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
102 | make_bfs_visitor(record_edge_predecessors(pred, on_tree_edge())),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
103 | color);
| ~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/edge_connectivity.hpp:146:42: required from ‘typename boost::graph_traits<G>::degree_size_type boost::edge_connectivity(VertexListGraph&, OutputIterator) [with VertexListGraph = R_adjacency_list<undirectedS, double>; OutputIterator = std::back_insert_iterator<std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int> > >; typename graph_traits<G>::degree_size_type = long unsigned int]’
146 | alpha_S_k = edmonds_karp_max_flow(
| ~~~~~~~~~~~~~~~~~~~~~^
147 | flow_g, p, k, cap, res_cap, rev_edge, &color[0], &pred[0]);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
interfaces.cpp:326:34: required from here
326 | dst c = edge_connectivity( g, std::back_inserter(disconnecting_set) );
| ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
20 | ~usage_requirements() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::concepts::Graph<G>::~Graph() [with G = boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::no_property, boost::listS>, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long unsigned int, long unsigned int&, long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all>]’
37 | ~model()
| ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:66:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
66 | BOOST_CONCEPT_USAGE(Graph)
| ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::concepts::IncidenceGraph<boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::no_property, boost::listS>, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long unsigned int, long unsigned int&, long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::concepts::IncidenceGraph<boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::no_property, boost::listS>, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long unsigned int, long unsigned int&, long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all> > >]’
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:87:5: required from ‘struct boost::concepts::IncidenceGraph<boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::no_property, boost::listS>, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long unsigned int, long unsigned int&, long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:75:1: required from ‘struct boost::concepts::IncidenceGraphConcept<boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::no_property, boost::listS>, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long unsigned int, long unsigned int&, long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >’
75 | BOOST_concept(IncidenceGraph, (G)) : Graph< G >
| ^~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::concepts::IncidenceGraphConcept<boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::no_property, boost::listS>, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long unsigned int, long unsigned int&, long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >]’
32 | inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
| ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied<boost::concepts::IncidenceGraphConcept<boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::no_property, boost::listS>, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long unsigned int, long unsigned int&, long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all> > >::value’
44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:129:9: required from ‘void boost::breadth_first_visit(const IncidenceGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with IncidenceGraph = filtered_graph<adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, no_property, listS>, is_residual_edge<adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_residual_capacity_t> >, keep_all>; Buffer = queue<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > >; BFSVisitor = bfs_visitor<edge_predecessor_recorder<detail::edge_desc_impl<directed_tag, long unsigned int>*, on_tree_edge> >; ColorMap = default_color_type*; SourceIterator = long unsigned int*]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:136:24: required from ‘void boost::breadth_first_search(const VertexListGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph<adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, no_property, listS>, is_residual_edge<adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_residual_capacity_t> >, keep_all>; SourceIterator = long unsigned int*; Buffer = queue<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > >; BFSVisitor = bfs_visitor<edge_predecessor_recorder<detail::edge_desc_impl<directed_tag, long unsigned int>*, on_tree_edge> >; ColorMap = default_color_type*]’
136 | breadth_first_visit(g, sources_begin, sources_end, Q, vis, color);
| ~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:147:25: required from ‘void boost::breadth_first_search(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph<adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, no_property, listS>, is_residual_edge<adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_residual_capacity_t> >, keep_all>; Buffer = queue<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > >; BFSVisitor = bfs_visitor<edge_predecessor_recorder<detail::edge_desc_impl<directed_tag, long unsigned int>*, on_tree_edge> >; ColorMap = default_color_type*; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
147 | breadth_first_search(g, sources, sources + 1, Q, vis, color);
| ~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/edmonds_karp_max_flow.hpp:101:29: required from ‘typename boost::property_traits<IndexMap>::value_type boost::edmonds_karp_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, ColorMap, PredEdgeMap) [with Graph = adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, no_property, listS>; CapacityEdgeMap = adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map<directed_tag, detail::edge_desc_impl<directed_tag, long unsigned int>, detail::edge_desc_impl<directed_tag, long unsigned int>&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_reverse_t>; ColorMap = default_color_type*; PredEdgeMap = detail::edge_desc_impl<directed_tag, long unsigned int>*; typename property_traits<IndexMap>::value_type = long unsigned int; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
101 | breadth_first_search(detail::residual_graph(g, res), src, Q,
| ~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
102 | make_bfs_visitor(record_edge_predecessors(pred, on_tree_edge())),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
103 | color);
| ~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/edge_connectivity.hpp:146:42: required from ‘typename boost::graph_traits<G>::degree_size_type boost::edge_connectivity(VertexListGraph&, OutputIterator) [with VertexListGraph = R_adjacency_list<undirectedS, double>; OutputIterator = std::back_insert_iterator<std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int> > >; typename graph_traits<G>::degree_size_type = long unsigned int]’
146 | alpha_S_k = edmonds_karp_max_flow(
| ~~~~~~~~~~~~~~~~~~~~~^
147 | flow_g, p, k, cap, res_cap, rev_edge, &color[0], &pred[0]);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
interfaces.cpp:326:34: required from here
326 | dst c = edge_connectivity( g, std::back_inserter(disconnecting_set) );
| ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
20 | ~usage_requirements() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::concepts::IncidenceGraph<G>::~IncidenceGraph() [with G = boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::no_property, boost::listS>, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long unsigned int, long unsigned int&, long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all>]’
37 | ~model()
| ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:87:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
87 | BOOST_CONCEPT_USAGE(IncidenceGraph)
| ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/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::bfs_visitor<boost::edge_predecessor_recorder<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>*, boost::on_tree_edge> > > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:167:5: required from ‘struct boost::CopyConstructible<boost::bfs_visitor<boost::edge_predecessor_recorder<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>*, boost::on_tree_edge> > >’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:165:3: required from ‘struct boost::CopyConstructibleConcept<boost::bfs_visitor<boost::edge_predecessor_recorder<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>*, boost::on_tree_edge> > >’
165 | BOOST_concept(CopyConstructible,(TT))
| ^~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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::bfs_visitor<boost::edge_predecessor_recorder<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>*, boost::on_tree_edge> > >]’
32 | inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
| ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied<boost::CopyConstructibleConcept<boost::bfs_visitor<boost::edge_predecessor_recorder<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>*, boost::on_tree_edge> > > >::value’
44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied<boost::CopyConstructibleConcept<boost::bfs_visitor<boost::edge_predecessor_recorder<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>*, boost::on_tree_edge> > > >’
45 | typedef boost::integral_constant<bool, value> type;
| ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 6 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:65:5: required from ‘void boost::breadth_first_visit(const IncidenceGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with IncidenceGraph = filtered_graph<adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, no_property, listS>, is_residual_edge<adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_residual_capacity_t> >, keep_all>; Buffer = queue<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > >; BFSVisitor = bfs_visitor<edge_predecessor_recorder<detail::edge_desc_impl<directed_tag, long unsigned int>*, on_tree_edge> >; ColorMap = default_color_type*; SourceIterator = long unsigned int*]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:136:24: required from ‘void boost::breadth_first_search(const VertexListGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph<adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, no_property, listS>, is_residual_edge<adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_residual_capacity_t> >, keep_all>; SourceIterator = long unsigned int*; Buffer = queue<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > >; BFSVisitor = bfs_visitor<edge_predecessor_recorder<detail::edge_desc_impl<directed_tag, long unsigned int>*, on_tree_edge> >; ColorMap = default_color_type*]’
136 | breadth_first_visit(g, sources_begin, sources_end, Q, vis, color);
| ~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:147:25: required from ‘void boost::breadth_first_search(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph<adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, no_property, listS>, is_residual_edge<adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_residual_capacity_t> >, keep_all>; Buffer = queue<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > >; BFSVisitor = bfs_visitor<edge_predecessor_recorder<detail::edge_desc_impl<directed_tag, long unsigned int>*, on_tree_edge> >; ColorMap = default_color_type*; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
147 | breadth_first_search(g, sources, sources + 1, Q, vis, color);
| ~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/edmonds_karp_max_flow.hpp:101:29: required from ‘typename boost::property_traits<IndexMap>::value_type boost::edmonds_karp_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, ColorMap, PredEdgeMap) [with Graph = adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, no_property, listS>; CapacityEdgeMap = adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map<directed_tag, detail::edge_desc_impl<directed_tag, long unsigned int>, detail::edge_desc_impl<directed_tag, long unsigned int>&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_reverse_t>; ColorMap = default_color_type*; PredEdgeMap = detail::edge_desc_impl<directed_tag, long unsigned int>*; typename property_traits<IndexMap>::value_type = long unsigned int; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
101 | breadth_first_search(detail::residual_graph(g, res), src, Q,
| ~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
102 | make_bfs_visitor(record_edge_predecessors(pred, on_tree_edge())),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
103 | color);
| ~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/edge_connectivity.hpp:146:42: required from ‘typename boost::graph_traits<G>::degree_size_type boost::edge_connectivity(VertexListGraph&, OutputIterator) [with VertexListGraph = R_adjacency_list<undirectedS, double>; OutputIterator = std::back_insert_iterator<std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int> > >; typename graph_traits<G>::degree_size_type = long unsigned int]’
146 | alpha_S_k = edmonds_karp_max_flow(
| ~~~~~~~~~~~~~~~~~~~~~^
147 | flow_g, p, k, cap, res_cap, rev_edge, &color[0], &pred[0]);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
interfaces.cpp:326:34: required from here
326 | dst c = edge_connectivity( g, std::back_inserter(disconnecting_set) );
| ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/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::bfs_visitor<boost::edge_predecessor_recorder<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>*, boost::on_tree_edge> > >]’
20 | ~usage_requirements() { ((Model*)0)->~Model(); }
| ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/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::bfs_visitor<boost::edge_predecessor_recorder<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>*, boost::on_tree_edge> > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:41:9: required from ‘void boost::BFSVisitorConcept<Visitor, Graph>::constraints() [with Visitor = boost::bfs_visitor<boost::edge_predecessor_recorder<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>*, boost::on_tree_edge> >; Graph = boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::no_property, boost::listS>, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long unsigned int, long unsigned int&, long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all>]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::BFSVisitorConcept<boost::bfs_visitor<boost::edge_predecessor_recorder<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>*, boost::on_tree_edge> >, boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::no_property, boost::listS>, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long unsigned int, long unsigned int&, long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >]’
32 | inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
| ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied<boost::BFSVisitorConcept<boost::bfs_visitor<boost::edge_predecessor_recorder<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>*, boost::on_tree_edge> >, boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::no_property, boost::listS>, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long unsigned int, long unsigned int&, long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all> > >::value’
44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied<boost::BFSVisitorConcept<boost::bfs_visitor<boost::edge_predecessor_recorder<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>*, boost::on_tree_edge> >, boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::no_property, boost::listS>, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long unsigned int, long unsigned int&, long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all> > >’
45 | typedef boost::integral_constant<bool, value> type;
| ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_<void (*)(boost::BFSVisitorConcept<boost::bfs_visitor<boost::edge_predecessor_recorder<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>*, boost::on_tree_edge> >, boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::no_property, boost::listS>, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long unsigned int, long unsigned int&, long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >)>’
72 | struct requirement_<void(*)(Model)>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:65:5: required from ‘void boost::breadth_first_visit(const IncidenceGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with IncidenceGraph = filtered_graph<adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, no_property, listS>, is_residual_edge<adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_residual_capacity_t> >, keep_all>; Buffer = queue<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > >; BFSVisitor = bfs_visitor<edge_predecessor_recorder<detail::edge_desc_impl<directed_tag, long unsigned int>*, on_tree_edge> >; ColorMap = default_color_type*; SourceIterator = long unsigned int*]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:136:24: required from ‘void boost::breadth_first_search(const VertexListGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph<adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, no_property, listS>, is_residual_edge<adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_residual_capacity_t> >, keep_all>; SourceIterator = long unsigned int*; Buffer = queue<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > >; BFSVisitor = bfs_visitor<edge_predecessor_recorder<detail::edge_desc_impl<directed_tag, long unsigned int>*, on_tree_edge> >; ColorMap = default_color_type*]’
136 | breadth_first_visit(g, sources_begin, sources_end, Q, vis, color);
| ~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:147:25: required from ‘void boost::breadth_first_search(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph<adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, no_property, listS>, is_residual_edge<adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_residual_capacity_t> >, keep_all>; Buffer = queue<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > >; BFSVisitor = bfs_visitor<edge_predecessor_recorder<detail::edge_desc_impl<directed_tag, long unsigned int>*, on_tree_edge> >; ColorMap = default_color_type*; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
147 | breadth_first_search(g, sources, sources + 1, Q, vis, color);
| ~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/edmonds_karp_max_flow.hpp:101:29: required from ‘typename boost::property_traits<IndexMap>::value_type boost::edmonds_karp_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, ColorMap, PredEdgeMap) [with Graph = adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, no_property, listS>; CapacityEdgeMap = adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map<directed_tag, detail::edge_desc_impl<directed_tag, long unsigned int>, detail::edge_desc_impl<directed_tag, long unsigned int>&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_reverse_t>; ColorMap = default_color_type*; PredEdgeMap = detail::edge_desc_impl<directed_tag, long unsigned int>*; typename property_traits<IndexMap>::value_type = long unsigned int; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
101 | breadth_first_search(detail::residual_graph(g, res), src, Q,
| ~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
102 | make_bfs_visitor(record_edge_predecessors(pred, on_tree_edge())),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
103 | color);
| ~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/edge_connectivity.hpp:146:42: required from ‘typename boost::graph_traits<G>::degree_size_type boost::edge_connectivity(VertexListGraph&, OutputIterator) [with VertexListGraph = R_adjacency_list<undirectedS, double>; OutputIterator = std::back_insert_iterator<std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int> > >; typename graph_traits<G>::degree_size_type = long unsigned int]’
146 | alpha_S_k = edmonds_karp_max_flow(
| ~~~~~~~~~~~~~~~~~~~~~^
147 | flow_g, p, k, cap, res_cap, rev_edge, &color[0], &pred[0]);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
interfaces.cpp:326:34: required from here
326 | dst c = edge_connectivity( g, std::back_inserter(disconnecting_set) );
| ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:165:17: note: in a call to non-static member function ‘boost::CopyConstructibleConcept<boost::bfs_visitor<boost::edge_predecessor_recorder<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>*, boost::on_tree_edge> > >::~CopyConstructibleConcept()’
165 | BOOST_concept(CopyConstructible,(TT))
| ^~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/preprocessor/cat.hpp:29:34: note: in definition of macro ‘BOOST_PP_CAT_I’
29 | # define BOOST_PP_CAT_I(a, b) a ## b
| ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/concept_def.hpp:23:12: note: in expansion of macro ‘BOOST_PP_CAT’
23 | struct BOOST_PP_CAT(name,Concept) \
| ^~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:165:3: note: in expansion of macro ‘BOOST_concept’
165 | BOOST_concept(CopyConstructible,(TT))
| ^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::constraint<Model>::failed() [with Model = boost::ReadablePropertyMapConcept<boost::default_color_type*, long unsigned int>]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:206:7: required from ‘void boost::ReadWritePropertyMapConcept<PMap, Key>::constraints() [with PMap = boost::default_color_type*; Key = long unsigned int]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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::default_color_type*, long unsigned int>]’
32 | inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
| ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied<boost::ReadWritePropertyMapConcept<boost::default_color_type*, long unsigned int> >::value’
44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied<boost::ReadWritePropertyMapConcept<boost::default_color_type*, long unsigned int> >’
45 | typedef boost::integral_constant<bool, value> type;
| ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_<void (*)(boost::ReadWritePropertyMapConcept<boost::default_color_type*, long unsigned int>)>’
72 | struct requirement_<void(*)(Model)>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:66:5: required from ‘void boost::breadth_first_visit(const IncidenceGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with IncidenceGraph = filtered_graph<adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, no_property, listS>, is_residual_edge<adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_residual_capacity_t> >, keep_all>; Buffer = queue<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > >; BFSVisitor = bfs_visitor<edge_predecessor_recorder<detail::edge_desc_impl<directed_tag, long unsigned int>*, on_tree_edge> >; ColorMap = default_color_type*; SourceIterator = long unsigned int*]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:136:24: required from ‘void boost::breadth_first_search(const VertexListGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph<adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, no_property, listS>, is_residual_edge<adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_residual_capacity_t> >, keep_all>; SourceIterator = long unsigned int*; Buffer = queue<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > >; BFSVisitor = bfs_visitor<edge_predecessor_recorder<detail::edge_desc_impl<directed_tag, long unsigned int>*, on_tree_edge> >; ColorMap = default_color_type*]’
136 | breadth_first_visit(g, sources_begin, sources_end, Q, vis, color);
| ~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:147:25: required from ‘void boost::breadth_first_search(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph<adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, no_property, listS>, is_residual_edge<adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_residual_capacity_t> >, keep_all>; Buffer = queue<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > >; BFSVisitor = bfs_visitor<edge_predecessor_recorder<detail::edge_desc_impl<directed_tag, long unsigned int>*, on_tree_edge> >; ColorMap = default_color_type*; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
147 | breadth_first_search(g, sources, sources + 1, Q, vis, color);
| ~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/edmonds_karp_max_flow.hpp:101:29: required from ‘typename boost::property_traits<IndexMap>::value_type boost::edmonds_karp_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, ColorMap, PredEdgeMap) [with Graph = adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, no_property, listS>; CapacityEdgeMap = adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map<directed_tag, detail::edge_desc_impl<directed_tag, long unsigned int>, detail::edge_desc_impl<directed_tag, long unsigned int>&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_reverse_t>; ColorMap = default_color_type*; PredEdgeMap = detail::edge_desc_impl<directed_tag, long unsigned int>*; typename property_traits<IndexMap>::value_type = long unsigned int; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
101 | breadth_first_search(detail::residual_graph(g, res), src, Q,
| ~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
102 | make_bfs_visitor(record_edge_predecessors(pred, on_tree_edge())),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
103 | color);
| ~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/edge_connectivity.hpp:146:42: required from ‘typename boost::graph_traits<G>::degree_size_type boost::edge_connectivity(VertexListGraph&, OutputIterator) [with VertexListGraph = R_adjacency_list<undirectedS, double>; OutputIterator = std::back_insert_iterator<std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int> > >; typename graph_traits<G>::degree_size_type = long unsigned int]’
146 | alpha_S_k = edmonds_karp_max_flow(
| ~~~~~~~~~~~~~~~~~~~~~^
147 | flow_g, p, k, cap, res_cap, rev_edge, &color[0], &pred[0]);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
interfaces.cpp:326:34: required from here
326 | dst c = edge_connectivity( g, std::back_inserter(disconnecting_set) );
| ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:65:52: warning: ‘this’ pointer is null [-Wnonnull]
65 | static void failed() { ((Model*)0)->constraints(); }
| ~~~~~~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/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::default_color_type*; Key = long unsigned int]’
147 | void constraints() {
| ^~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::constraint<Model>::failed() [with Model = boost::WritablePropertyMapConcept<boost::default_color_type*, long unsigned int>]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:207:7: required from ‘void boost::ReadWritePropertyMapConcept<PMap, Key>::constraints() [with PMap = boost::default_color_type*; Key = long unsigned int]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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::default_color_type*, long unsigned int>]’
32 | inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
| ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied<boost::ReadWritePropertyMapConcept<boost::default_color_type*, long unsigned int> >::value’
44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied<boost::ReadWritePropertyMapConcept<boost::default_color_type*, long unsigned int> >’
45 | typedef boost::integral_constant<bool, value> type;
| ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_<void (*)(boost::ReadWritePropertyMapConcept<boost::default_color_type*, long unsigned int>)>’
72 | struct requirement_<void(*)(Model)>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:66:5: required from ‘void boost::breadth_first_visit(const IncidenceGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with IncidenceGraph = filtered_graph<adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, no_property, listS>, is_residual_edge<adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_residual_capacity_t> >, keep_all>; Buffer = queue<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > >; BFSVisitor = bfs_visitor<edge_predecessor_recorder<detail::edge_desc_impl<directed_tag, long unsigned int>*, on_tree_edge> >; ColorMap = default_color_type*; SourceIterator = long unsigned int*]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:136:24: required from ‘void boost::breadth_first_search(const VertexListGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph<adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, no_property, listS>, is_residual_edge<adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_residual_capacity_t> >, keep_all>; SourceIterator = long unsigned int*; Buffer = queue<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > >; BFSVisitor = bfs_visitor<edge_predecessor_recorder<detail::edge_desc_impl<directed_tag, long unsigned int>*, on_tree_edge> >; ColorMap = default_color_type*]’
136 | breadth_first_visit(g, sources_begin, sources_end, Q, vis, color);
| ~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:147:25: required from ‘void boost::breadth_first_search(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph<adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, no_property, listS>, is_residual_edge<adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_residual_capacity_t> >, keep_all>; Buffer = queue<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > >; BFSVisitor = bfs_visitor<edge_predecessor_recorder<detail::edge_desc_impl<directed_tag, long unsigned int>*, on_tree_edge> >; ColorMap = default_color_type*; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
147 | breadth_first_search(g, sources, sources + 1, Q, vis, color);
| ~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/edmonds_karp_max_flow.hpp:101:29: required from ‘typename boost::property_traits<IndexMap>::value_type boost::edmonds_karp_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, ColorMap, PredEdgeMap) [with Graph = adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, no_property, listS>; CapacityEdgeMap = adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map<directed_tag, detail::edge_desc_impl<directed_tag, long unsigned int>, detail::edge_desc_impl<directed_tag, long unsigned int>&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_reverse_t>; ColorMap = default_color_type*; PredEdgeMap = detail::edge_desc_impl<directed_tag, long unsigned int>*; typename property_traits<IndexMap>::value_type = long unsigned int; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
101 | breadth_first_search(detail::residual_graph(g, res), src, Q,
| ~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
102 | make_bfs_visitor(record_edge_predecessors(pred, on_tree_edge())),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
103 | color);
| ~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/edge_connectivity.hpp:146:42: required from ‘typename boost::graph_traits<G>::degree_size_type boost::edge_connectivity(VertexListGraph&, OutputIterator) [with VertexListGraph = R_adjacency_list<undirectedS, double>; OutputIterator = std::back_insert_iterator<std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int> > >; typename graph_traits<G>::degree_size_type = long unsigned int]’
146 | alpha_S_k = edmonds_karp_max_flow(
| ~~~~~~~~~~~~~~~~~~~~~^
147 | flow_g, p, k, cap, res_cap, rev_edge, &color[0], &pred[0]);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
interfaces.cpp:326:34: required from here
326 | dst c = edge_connectivity( g, std::back_inserter(disconnecting_set) );
| ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:65:52: warning: ‘this’ pointer is null [-Wnonnull]
65 | static void failed() { ((Model*)0)->constraints(); }
| ~~~~~~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/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::default_color_type*; Key = long unsigned int]’
179 | void constraints() {
| ^~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Convertible<std::random_access_iterator_tag, std::input_iterator_tag>]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/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(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/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> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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);
| ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/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) );
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/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;
| ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 10 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied<boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > > >::value’
44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied<boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > > >’
45 | typedef boost::integral_constant<bool, value> type;
| ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_<void (*)(boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > >)>’
72 | struct requirement_<void(*)(Model)>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map<RAIter, ID, Value, Value&> boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >; Value = long unsigned int; ID = typed_identity_property_map<long unsigned int>]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/sequential_vertex_coloring.hpp:120:35: required from ‘typename boost::property_traits<IndexMap>::value_type boost::sequential_vertex_coloring(const VertexListGraph&, ColorMap) [with VertexListGraph = R_adjacency_list<undirectedS, double>; ColorMap = iterator_property_map<long unsigned int*, vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int> >; typename property_traits<IndexMap>::value_type = long unsigned int]’
120 | make_iterator_property_map(order.begin(), identity_property_map(),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
121 | graph_traits< VertexListGraph >::null_vertex()),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
interfaces.cpp:370:56: required from here
370 | Vertex_Size_Type n = sequential_vertex_coloring( g, color );
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
20 | ~usage_requirements() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible<X, Y>::~Convertible() [with X = std::random_access_iterator_tag; Y = std::input_iterator_tag]’
37 | ~model()
| ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
208 | BOOST_CONCEPT_USAGE(Convertible) {
| ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Convertible<std::random_access_iterator_tag, std::forward_iterator_tag>]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/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(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/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> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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);
| ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/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) );
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/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;
| ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 9 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied<boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > > >::value’
44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied<boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > > >’
45 | typedef boost::integral_constant<bool, value> type;
| ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_<void (*)(boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > >)>’
72 | struct requirement_<void(*)(Model)>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map<RAIter, ID, Value, Value&> boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >; Value = long unsigned int; ID = typed_identity_property_map<long unsigned int>]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/sequential_vertex_coloring.hpp:120:35: required from ‘typename boost::property_traits<IndexMap>::value_type boost::sequential_vertex_coloring(const VertexListGraph&, ColorMap) [with VertexListGraph = R_adjacency_list<undirectedS, double>; ColorMap = iterator_property_map<long unsigned int*, vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int> >; typename property_traits<IndexMap>::value_type = long unsigned int]’
120 | make_iterator_property_map(order.begin(), identity_property_map(),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
121 | graph_traits< VertexListGraph >::null_vertex()),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
interfaces.cpp:370:56: required from here
370 | Vertex_Size_Type n = sequential_vertex_coloring( g, color );
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
20 | ~usage_requirements() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible<X, Y>::~Convertible() [with X = std::random_access_iterator_tag; Y = std::forward_iterator_tag]’
37 | ~model()
| ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
208 | BOOST_CONCEPT_USAGE(Convertible) {
| ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Convertible<std::random_access_iterator_tag, std::bidirectional_iterator_tag>]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/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(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/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> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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);
| ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/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) );
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/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;
| ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 8 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied<boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > > >::value’
44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied<boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > > >’
45 | typedef boost::integral_constant<bool, value> type;
| ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_<void (*)(boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > >)>’
72 | struct requirement_<void(*)(Model)>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map<RAIter, ID, Value, Value&> boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >; Value = long unsigned int; ID = typed_identity_property_map<long unsigned int>]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/sequential_vertex_coloring.hpp:120:35: required from ‘typename boost::property_traits<IndexMap>::value_type boost::sequential_vertex_coloring(const VertexListGraph&, ColorMap) [with VertexListGraph = R_adjacency_list<undirectedS, double>; ColorMap = iterator_property_map<long unsigned int*, vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int> >; typename property_traits<IndexMap>::value_type = long unsigned int]’
120 | make_iterator_property_map(order.begin(), identity_property_map(),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
121 | graph_traits< VertexListGraph >::null_vertex()),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
interfaces.cpp:370:56: required from here
370 | Vertex_Size_Type n = sequential_vertex_coloring( g, color );
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
20 | ~usage_requirements() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible<X, Y>::~Convertible() [with X = std::random_access_iterator_tag; Y = std::bidirectional_iterator_tag]’
37 | ~model()
| ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
208 | BOOST_CONCEPT_USAGE(Convertible) {
| ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::CopyConstructible<boost::topo_sort_visitor<std::front_insert_iterator<std::__cxx11::list<long unsigned int> > > > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:167:5: required from ‘struct boost::CopyConstructible<boost::topo_sort_visitor<std::front_insert_iterator<std::__cxx11::list<long unsigned int> > > >’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:165:3: required from ‘struct boost::CopyConstructibleConcept<boost::topo_sort_visitor<std::front_insert_iterator<std::__cxx11::list<long unsigned int> > > >’
165 | BOOST_concept(CopyConstructible,(TT))
| ^~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::CopyConstructibleConcept<boost::topo_sort_visitor<std::front_insert_iterator<std::__cxx11::list<long unsigned int> > > >]’
32 | inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
| ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied<boost::CopyConstructibleConcept<boost::topo_sort_visitor<std::front_insert_iterator<std::__cxx11::list<long unsigned int> > > > >::value’
44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied<boost::CopyConstructibleConcept<boost::topo_sort_visitor<std::front_insert_iterator<std::__cxx11::list<long unsigned int> > > > >’
45 | typedef boost::integral_constant<bool, value> type;
| ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 7 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:397:42: required from ‘void boost::graph::detail::depth_first_search_impl<Graph>::operator()(const Graph&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<boost::graph::keywords::tag::visitor, const boost::topo_sort_visitor<std::front_insert_iterator<std::__cxx11::list<long unsigned int> > > >, boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<boost::graph::keywords::tag::buffer, const int>, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >, std::integral_constant<bool, true> >; Graph = R_adjacency_list<boost::directedS, double>]’
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)]);
| ~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/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 = R_adjacency_list<boost::directedS, double>; ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<keywords::tag::visitor, const boost::topo_sort_visitor<std::front_insert_iterator<std::__cxx11::list<long unsigned int> > > >, boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<keywords::tag::buffer, const int>, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >, std::integral_constant<bool, true> >; typename boost::result_of<detail::depth_first_search_impl<Param0>(Param0, const ArgPack&)>::type = void]’
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); \
| ~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/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 = R_adjacency_list<directedS, double>; P = topo_sort_visitor<std::front_insert_iterator<std::__cxx11::list<long unsigned int> > >; T = graph_visitor_t; R = bgl_named_params<int, buffer_param_t>; typename result_of<graph::detail::depth_first_search_impl<Param0>(Param0, const typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<T, Tag, Base> >::type&)>::type = void; typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<T, Tag, Base> >::type = parameter::aux::arg_list<parameter::aux::tagged_argument<graph::keywords::tag::visitor, const topo_sort_visitor<std::front_insert_iterator<std::__cxx11::list<long unsigned int> > > >, parameter::aux::arg_list<parameter::aux::tagged_argument<graph::keywords::tag::buffer, const int>, parameter::aux::empty_arg_list, std::integral_constant<bool, true> >, std::integral_constant<bool, true> >]’
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); \
| ~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/topological_sort.hpp:69:23: required from ‘void boost::topological_sort(VertexListGraph&, OutputIterator, const bgl_named_params<P, T, R>&) [with VertexListGraph = R_adjacency_list<directedS, double>; OutputIterator = std::front_insert_iterator<std::__cxx11::list<long unsigned int> >; P = int; T = buffer_param_t; R = no_property]’
69 | depth_first_search(g, params.visitor(TopoVisitor(result)));
| ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/topological_sort.hpp:75:21: required from ‘void boost::topological_sort(VertexListGraph&, OutputIterator) [with VertexListGraph = R_adjacency_list<directedS, double>; OutputIterator = std::front_insert_iterator<std::__cxx11::list<long unsigned int> >]’
75 | topological_sort(
| ~~~~~~~~~~~~~~~~^
76 | g, result, bgl_named_params< int, buffer_param_t >(0)); // bogus
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
interfaces.cpp:71:29: required from here
71 | topological_sort(g, std::front_inserter(tsord));
| ~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::CopyConstructible<boost::topo_sort_visitor<std::front_insert_iterator<std::__cxx11::list<long unsigned int> > > >]’
20 | ~usage_requirements() { ((Model*)0)->~Model(); }
| ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::CopyConstructibleConcept<boost::topo_sort_visitor<std::front_insert_iterator<std::__cxx11::list<long unsigned int> > > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:41:9: required from ‘void boost::DFSVisitorConcept<Visitor, Graph>::constraints() [with Visitor = boost::topo_sort_visitor<std::front_insert_iterator<std::__cxx11::list<long unsigned int> > >; Graph = R_adjacency_list<boost::directedS, double>]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::DFSVisitorConcept<boost::topo_sort_visitor<std::front_insert_iterator<std::__cxx11::list<long unsigned int> > >, R_adjacency_list<boost::directedS, double> >]’
32 | inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
| ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied<boost::DFSVisitorConcept<boost::topo_sort_visitor<std::front_insert_iterator<std::__cxx11::list<long unsigned int> > >, R_adjacency_list<boost::directedS, double> > >::value’
44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied<boost::DFSVisitorConcept<boost::topo_sort_visitor<std::front_insert_iterator<std::__cxx11::list<long unsigned int> > >, R_adjacency_list<boost::directedS, double> > >’
45 | typedef boost::integral_constant<bool, value> type;
| ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:397:42: required from ‘void boost::graph::detail::depth_first_search_impl<Graph>::operator()(const Graph&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<boost::graph::keywords::tag::visitor, const boost::topo_sort_visitor<std::front_insert_iterator<std::__cxx11::list<long unsigned int> > > >, boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<boost::graph::keywords::tag::buffer, const int>, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >, std::integral_constant<bool, true> >; Graph = R_adjacency_list<boost::directedS, double>]’
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)]);
| ~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/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 = R_adjacency_list<boost::directedS, double>; ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<keywords::tag::visitor, const boost::topo_sort_visitor<std::front_insert_iterator<std::__cxx11::list<long unsigned int> > > >, boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<keywords::tag::buffer, const int>, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >, std::integral_constant<bool, true> >; typename boost::result_of<detail::depth_first_search_impl<Param0>(Param0, const ArgPack&)>::type = void]’
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); \
| ~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/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 = R_adjacency_list<directedS, double>; P = topo_sort_visitor<std::front_insert_iterator<std::__cxx11::list<long unsigned int> > >; T = graph_visitor_t; R = bgl_named_params<int, buffer_param_t>; typename result_of<graph::detail::depth_first_search_impl<Param0>(Param0, const typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<T, Tag, Base> >::type&)>::type = void; typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<T, Tag, Base> >::type = parameter::aux::arg_list<parameter::aux::tagged_argument<graph::keywords::tag::visitor, const topo_sort_visitor<std::front_insert_iterator<std::__cxx11::list<long unsigned int> > > >, parameter::aux::arg_list<parameter::aux::tagged_argument<graph::keywords::tag::buffer, const int>, parameter::aux::empty_arg_list, std::integral_constant<bool, true> >, std::integral_constant<bool, true> >]’
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); \
| ~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/topological_sort.hpp:69:23: required from ‘void boost::topological_sort(VertexListGraph&, OutputIterator, const bgl_named_params<P, T, R>&) [with VertexListGraph = R_adjacency_list<directedS, double>; OutputIterator = std::front_insert_iterator<std::__cxx11::list<long unsigned int> >; P = int; T = buffer_param_t; R = no_property]’
69 | depth_first_search(g, params.visitor(TopoVisitor(result)));
| ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/topological_sort.hpp:75:21: required from ‘void boost::topological_sort(VertexListGraph&, OutputIterator) [with VertexListGraph = R_adjacency_list<directedS, double>; OutputIterator = std::front_insert_iterator<std::__cxx11::list<long unsigned int> >]’
75 | topological_sort(
| ~~~~~~~~~~~~~~~~^
76 | g, result, bgl_named_params< int, buffer_param_t >(0)); // bogus
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
interfaces.cpp:71:29: required from here
71 | topological_sort(g, std::front_inserter(tsord));
| ~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:165:17: note: in a call to non-static member function ‘boost::CopyConstructibleConcept<boost::topo_sort_visitor<std::front_insert_iterator<std::__cxx11::list<long unsigned int> > > >::~CopyConstructibleConcept()’
165 | BOOST_concept(CopyConstructible,(TT))
| ^~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/preprocessor/cat.hpp:29:34: note: in definition of macro ‘BOOST_PP_CAT_I’
29 | # define BOOST_PP_CAT_I(a, b) a ## b
| ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/concept_def.hpp:23:12: note: in expansion of macro ‘BOOST_PP_CAT’
23 | struct BOOST_PP_CAT(name,Concept) \
| ^~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:165:3: note: in expansion of macro ‘BOOST_concept’
165 | BOOST_concept(CopyConstructible,(TT))
| ^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/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<bfs_time_visitor<long unsigned int*> > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:167:5: required from ‘struct boost::CopyConstructible<bfs_time_visitor<long unsigned int*> >’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:165:3: required from ‘struct boost::CopyConstructibleConcept<bfs_time_visitor<long unsigned int*> >’
165 | BOOST_concept(CopyConstructible,(TT))
| ^~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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<bfs_time_visitor<long unsigned int*> >]’
32 | inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
| ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied<boost::CopyConstructibleConcept<bfs_time_visitor<long unsigned int*> > >::value’
44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied<boost::CopyConstructibleConcept<bfs_time_visitor<long unsigned int*> > >’
45 | typedef boost::integral_constant<bool, value> type;
| ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 7 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:136:24: required from ‘void boost::breadth_first_search(const VertexListGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = R_adjacency_list<directedS, double>; SourceIterator = long unsigned int*; Buffer = queue<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > >; BFSVisitor = bfs_time_visitor<long unsigned int*>; ColorMap = two_bit_color_map<vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int> >]’
136 | breadth_first_visit(g, sources_begin, sources_end, Q, vis, color);
| ~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:147:25: required from ‘void boost::breadth_first_search(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = R_adjacency_list<directedS, double>; Buffer = queue<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > >; BFSVisitor = bfs_time_visitor<long unsigned int*>; ColorMap = two_bit_color_map<vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int> >; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
147 | breadth_first_search(g, sources, sources + 1, Q, vis, color);
| ~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:262:29: required from ‘void boost::detail::bfs_helper(VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, ColorMap, BFSVisitor, const boost::bgl_named_params<P, T, R>&, mpl_::false_) [with VertexListGraph = R_adjacency_list<boost::directedS, double>; ColorMap = boost::two_bit_color_map<boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int> >; BFSVisitor = bfs_time_visitor<long unsigned int*>; P = bfs_time_visitor<long unsigned int*>; T = boost::graph_visitor_t; R = boost::no_property; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int; mpl_::false_ = mpl_::bool_<false>]’
262 | breadth_first_search(g, s,
| ~~~~~~~~~~~~~~~~~~~~^~~~~~
263 | choose_param(get_param(params, buffer_param_t()), boost::ref(Q))
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
264 | .get(),
| ~~~~~~~
265 | vis, color);
| ~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:309:23: required from ‘static void boost::detail::bfs_dispatch<boost::param_not_found>::apply(VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, const boost::bgl_named_params<T, Tag, Base>&, boost::param_not_found) [with VertexListGraph = R_adjacency_list<boost::directedS, double>; P = bfs_time_visitor<long unsigned int*>; T = boost::graph_visitor_t; R = boost::no_property; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’
309 | bfs_helper(g, s,
| ~~~~~~~~~~^~~~~~
310 | make_two_bit_color_map(num_vertices(g),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
311 | choose_const_pmap(
| ~~~~~~~~~~~~~~~~~~
312 | get_param(params, vertex_index), g, vertex_index)),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
313 | choose_param(get_param(params, graph_visitor),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
314 | make_bfs_visitor(null_vis)),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~
315 | params,
| ~~~~~~~
316 | boost::mpl::bool_<
| ~~~~~~~~~~~~~~~~~~
317 | boost::is_base_and_derived< distributed_graph_tag,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
318 | typename graph_traits<
| ~~~~~~~~~~~~~~~~~~~~~~
319 | VertexListGraph >::traversal_category >::value >());
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:339:37: required from ‘void boost::breadth_first_search(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with VertexListGraph = R_adjacency_list<directedS, double>; P = bfs_time_visitor<long unsigned int*>; T = graph_visitor_t; R = no_property; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
339 | detail::bfs_dispatch< C >::apply(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
340 | ng, s, params, get_param(params, vertex_color));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
interfaces.cpp:113:29: required from here
113 | breadth_first_search(g, vertex((int)INTEGER(init_ind)[0], g), visitor(vis));
| ~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/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<bfs_time_visitor<long unsigned int*> >]’
20 | ~usage_requirements() { ((Model*)0)->~Model(); }
| ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::CopyConstructibleConcept<bfs_time_visitor<long unsigned int*> >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:41:9: required from ‘void boost::BFSVisitorConcept<Visitor, Graph>::constraints() [with Visitor = bfs_time_visitor<long unsigned int*>; Graph = R_adjacency_list<boost::directedS, double>]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::BFSVisitorConcept<bfs_time_visitor<long unsigned int*>, R_adjacency_list<boost::directedS, double> >]’
32 | inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
| ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied<boost::BFSVisitorConcept<bfs_time_visitor<long unsigned int*>, R_adjacency_list<boost::directedS, double> > >::value’
44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied<boost::BFSVisitorConcept<bfs_time_visitor<long unsigned int*>, R_adjacency_list<boost::directedS, double> > >’
45 | typedef boost::integral_constant<bool, value> type;
| ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:136:24: required from ‘void boost::breadth_first_search(const VertexListGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = R_adjacency_list<directedS, double>; SourceIterator = long unsigned int*; Buffer = queue<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > >; BFSVisitor = bfs_time_visitor<long unsigned int*>; ColorMap = two_bit_color_map<vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int> >]’
136 | breadth_first_visit(g, sources_begin, sources_end, Q, vis, color);
| ~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:147:25: required from ‘void boost::breadth_first_search(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = R_adjacency_list<directedS, double>; Buffer = queue<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > >; BFSVisitor = bfs_time_visitor<long unsigned int*>; ColorMap = two_bit_color_map<vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int> >; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
147 | breadth_first_search(g, sources, sources + 1, Q, vis, color);
| ~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:262:29: required from ‘void boost::detail::bfs_helper(VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, ColorMap, BFSVisitor, const boost::bgl_named_params<P, T, R>&, mpl_::false_) [with VertexListGraph = R_adjacency_list<boost::directedS, double>; ColorMap = boost::two_bit_color_map<boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int> >; BFSVisitor = bfs_time_visitor<long unsigned int*>; P = bfs_time_visitor<long unsigned int*>; T = boost::graph_visitor_t; R = boost::no_property; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int; mpl_::false_ = mpl_::bool_<false>]’
262 | breadth_first_search(g, s,
| ~~~~~~~~~~~~~~~~~~~~^~~~~~
263 | choose_param(get_param(params, buffer_param_t()), boost::ref(Q))
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
264 | .get(),
| ~~~~~~~
265 | vis, color);
| ~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:309:23: required from ‘static void boost::detail::bfs_dispatch<boost::param_not_found>::apply(VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, const boost::bgl_named_params<T, Tag, Base>&, boost::param_not_found) [with VertexListGraph = R_adjacency_list<boost::directedS, double>; P = bfs_time_visitor<long unsigned int*>; T = boost::graph_visitor_t; R = boost::no_property; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’
309 | bfs_helper(g, s,
| ~~~~~~~~~~^~~~~~
310 | make_two_bit_color_map(num_vertices(g),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
311 | choose_const_pmap(
| ~~~~~~~~~~~~~~~~~~
312 | get_param(params, vertex_index), g, vertex_index)),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
313 | choose_param(get_param(params, graph_visitor),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
314 | make_bfs_visitor(null_vis)),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~
315 | params,
| ~~~~~~~
316 | boost::mpl::bool_<
| ~~~~~~~~~~~~~~~~~~
317 | boost::is_base_and_derived< distributed_graph_tag,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
318 | typename graph_traits<
| ~~~~~~~~~~~~~~~~~~~~~~
319 | VertexListGraph >::traversal_category >::value >());
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:339:37: required from ‘void boost::breadth_first_search(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with VertexListGraph = R_adjacency_list<directedS, double>; P = bfs_time_visitor<long unsigned int*>; T = graph_visitor_t; R = no_property; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
339 | detail::bfs_dispatch< C >::apply(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
340 | ng, s, params, get_param(params, vertex_color));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
interfaces.cpp:113:29: required from here
113 | breadth_first_search(g, vertex((int)INTEGER(init_ind)[0], g), visitor(vis));
| ~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:165:17: note: in a call to non-static member function ‘boost::CopyConstructibleConcept<bfs_time_visitor<long unsigned int*> >::~CopyConstructibleConcept()’
165 | BOOST_concept(CopyConstructible,(TT))
| ^~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/preprocessor/cat.hpp:29:34: note: in definition of macro ‘BOOST_PP_CAT_I’
29 | # define BOOST_PP_CAT_I(a, b) a ## b
| ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/concept_def.hpp:23:12: note: in expansion of macro ‘BOOST_PP_CAT’
23 | struct BOOST_PP_CAT(name,Concept) \
| ^~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:165:3: note: in expansion of macro ‘BOOST_concept’
165 | BOOST_concept(CopyConstructible,(TT))
| ^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::constraint<Model>::failed() [with Model = boost::ReadablePropertyMapConcept<boost::two_bit_color_map<boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int> >, long unsigned int>]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:206:7: required from ‘void boost::ReadWritePropertyMapConcept<PMap, Key>::constraints() [with PMap = boost::two_bit_color_map<boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int> >; Key = long unsigned int]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::ReadWritePropertyMapConcept<boost::two_bit_color_map<boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int> >, long unsigned int>]’
32 | inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
| ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied<boost::ReadWritePropertyMapConcept<boost::two_bit_color_map<boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int> >, long unsigned int> >::value’
44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied<boost::ReadWritePropertyMapConcept<boost::two_bit_color_map<boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int> >, long unsigned int> >’
45 | typedef boost::integral_constant<bool, value> type;
| ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:136:24: required from ‘void boost::breadth_first_search(const VertexListGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = R_adjacency_list<directedS, double>; SourceIterator = long unsigned int*; Buffer = queue<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > >; BFSVisitor = bfs_time_visitor<long unsigned int*>; ColorMap = two_bit_color_map<vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int> >]’
136 | breadth_first_visit(g, sources_begin, sources_end, Q, vis, color);
| ~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:147:25: required from ‘void boost::breadth_first_search(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = R_adjacency_list<directedS, double>; Buffer = queue<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > >; BFSVisitor = bfs_time_visitor<long unsigned int*>; ColorMap = two_bit_color_map<vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int> >; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
147 | breadth_first_search(g, sources, sources + 1, Q, vis, color);
| ~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:262:29: required from ‘void boost::detail::bfs_helper(VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, ColorMap, BFSVisitor, const boost::bgl_named_params<P, T, R>&, mpl_::false_) [with VertexListGraph = R_adjacency_list<boost::directedS, double>; ColorMap = boost::two_bit_color_map<boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int> >; BFSVisitor = bfs_time_visitor<long unsigned int*>; P = bfs_time_visitor<long unsigned int*>; T = boost::graph_visitor_t; R = boost::no_property; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int; mpl_::false_ = mpl_::bool_<false>]’
262 | breadth_first_search(g, s,
| ~~~~~~~~~~~~~~~~~~~~^~~~~~
263 | choose_param(get_param(params, buffer_param_t()), boost::ref(Q))
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
264 | .get(),
| ~~~~~~~
265 | vis, color);
| ~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:309:23: required from ‘static void boost::detail::bfs_dispatch<boost::param_not_found>::apply(VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, const boost::bgl_named_params<T, Tag, Base>&, boost::param_not_found) [with VertexListGraph = R_adjacency_list<boost::directedS, double>; P = bfs_time_visitor<long unsigned int*>; T = boost::graph_visitor_t; R = boost::no_property; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’
309 | bfs_helper(g, s,
| ~~~~~~~~~~^~~~~~
310 | make_two_bit_color_map(num_vertices(g),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
311 | choose_const_pmap(
| ~~~~~~~~~~~~~~~~~~
312 | get_param(params, vertex_index), g, vertex_index)),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
313 | choose_param(get_param(params, graph_visitor),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
314 | make_bfs_visitor(null_vis)),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~
315 | params,
| ~~~~~~~
316 | boost::mpl::bool_<
| ~~~~~~~~~~~~~~~~~~
317 | boost::is_base_and_derived< distributed_graph_tag,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
318 | typename graph_traits<
| ~~~~~~~~~~~~~~~~~~~~~~
319 | VertexListGraph >::traversal_category >::value >());
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:339:37: required from ‘void boost::breadth_first_search(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with VertexListGraph = R_adjacency_list<directedS, double>; P = bfs_time_visitor<long unsigned int*>; T = graph_visitor_t; R = no_property; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
339 | detail::bfs_dispatch< C >::apply(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
340 | ng, s, params, get_param(params, vertex_color));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
interfaces.cpp:113:29: required from here
113 | breadth_first_search(g, vertex((int)INTEGER(init_ind)[0], g), visitor(vis));
| ~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:65:52: warning: ‘this’ pointer is null [-Wnonnull]
65 | static void failed() { ((Model*)0)->constraints(); }
| ~~~~~~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:147:10: note: in a call to non-static member function ‘void boost::ReadablePropertyMapConcept<PMap, Key>::constraints() [with PMap = boost::two_bit_color_map<boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int> >; Key = long unsigned int]’
147 | void constraints() {
| ^~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::constraint<Model>::failed() [with Model = boost::WritablePropertyMapConcept<boost::two_bit_color_map<boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int> >, long unsigned int>]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:207:7: required from ‘void boost::ReadWritePropertyMapConcept<PMap, Key>::constraints() [with PMap = boost::two_bit_color_map<boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int> >; Key = long unsigned int]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::ReadWritePropertyMapConcept<boost::two_bit_color_map<boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int> >, long unsigned int>]’
32 | inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
| ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied<boost::ReadWritePropertyMapConcept<boost::two_bit_color_map<boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int> >, long unsigned int> >::value’
44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied<boost::ReadWritePropertyMapConcept<boost::two_bit_color_map<boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int> >, long unsigned int> >’
45 | typedef boost::integral_constant<bool, value> type;
| ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:136:24: required from ‘void boost::breadth_first_search(const VertexListGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = R_adjacency_list<directedS, double>; SourceIterator = long unsigned int*; Buffer = queue<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > >; BFSVisitor = bfs_time_visitor<long unsigned int*>; ColorMap = two_bit_color_map<vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int> >]’
136 | breadth_first_visit(g, sources_begin, sources_end, Q, vis, color);
| ~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:147:25: required from ‘void boost::breadth_first_search(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = R_adjacency_list<directedS, double>; Buffer = queue<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > >; BFSVisitor = bfs_time_visitor<long unsigned int*>; ColorMap = two_bit_color_map<vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int> >; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
147 | breadth_first_search(g, sources, sources + 1, Q, vis, color);
| ~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:262:29: required from ‘void boost::detail::bfs_helper(VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, ColorMap, BFSVisitor, const boost::bgl_named_params<P, T, R>&, mpl_::false_) [with VertexListGraph = R_adjacency_list<boost::directedS, double>; ColorMap = boost::two_bit_color_map<boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int> >; BFSVisitor = bfs_time_visitor<long unsigned int*>; P = bfs_time_visitor<long unsigned int*>; T = boost::graph_visitor_t; R = boost::no_property; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int; mpl_::false_ = mpl_::bool_<false>]’
262 | breadth_first_search(g, s,
| ~~~~~~~~~~~~~~~~~~~~^~~~~~
263 | choose_param(get_param(params, buffer_param_t()), boost::ref(Q))
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
264 | .get(),
| ~~~~~~~
265 | vis, color);
| ~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:309:23: required from ‘static void boost::detail::bfs_dispatch<boost::param_not_found>::apply(VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, const boost::bgl_named_params<T, Tag, Base>&, boost::param_not_found) [with VertexListGraph = R_adjacency_list<boost::directedS, double>; P = bfs_time_visitor<long unsigned int*>; T = boost::graph_visitor_t; R = boost::no_property; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’
309 | bfs_helper(g, s,
| ~~~~~~~~~~^~~~~~
310 | make_two_bit_color_map(num_vertices(g),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
311 | choose_const_pmap(
| ~~~~~~~~~~~~~~~~~~
312 | get_param(params, vertex_index), g, vertex_index)),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
313 | choose_param(get_param(params, graph_visitor),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
314 | make_bfs_visitor(null_vis)),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~
315 | params,
| ~~~~~~~
316 | boost::mpl::bool_<
| ~~~~~~~~~~~~~~~~~~
317 | boost::is_base_and_derived< distributed_graph_tag,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
318 | typename graph_traits<
| ~~~~~~~~~~~~~~~~~~~~~~
319 | VertexListGraph >::traversal_category >::value >());
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:339:37: required from ‘void boost::breadth_first_search(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with VertexListGraph = R_adjacency_list<directedS, double>; P = bfs_time_visitor<long unsigned int*>; T = graph_visitor_t; R = no_property; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
339 | detail::bfs_dispatch< C >::apply(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
340 | ng, s, params, get_param(params, vertex_color));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
interfaces.cpp:113:29: required from here
113 | breadth_first_search(g, vertex((int)INTEGER(init_ind)[0], g), visitor(vis));
| ~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:65:52: warning: ‘this’ pointer is null [-Wnonnull]
65 | static void failed() { ((Model*)0)->constraints(); }
| ~~~~~~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:179:10: note: in a call to non-static member function ‘void boost::WritablePropertyMapConcept<PMap, Key>::constraints() [with PMap = boost::two_bit_color_map<boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int> >; Key = long unsigned int]’
179 | void constraints() {
| ^~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Convertible<boost::read_write_property_map_tag, boost::read_write_property_map_tag> >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible<boost::read_write_property_map_tag, boost::read_write_property_map_tag>’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:206:3: required from ‘struct boost::ConvertibleConcept<boost::read_write_property_map_tag, boost::read_write_property_map_tag>’
206 | BOOST_concept(Convertible,(X)(Y))
| ^~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::ConvertibleConcept<boost::read_write_property_map_tag, boost::read_write_property_map_tag>]’
32 | inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
| ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied<boost::ConvertibleConcept<boost::read_write_property_map_tag, boost::read_write_property_map_tag> >::value’
44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied<boost::ConvertibleConcept<boost::read_write_property_map_tag, boost::read_write_property_map_tag> >’
45 | typedef boost::integral_constant<bool, value> type;
| ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 7 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:136:24: required from ‘void boost::breadth_first_search(const VertexListGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = R_adjacency_list<directedS, double>; SourceIterator = long unsigned int*; Buffer = queue<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > >; BFSVisitor = bfs_time_visitor<long unsigned int*>; ColorMap = two_bit_color_map<vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int> >]’
136 | breadth_first_visit(g, sources_begin, sources_end, Q, vis, color);
| ~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:147:25: required from ‘void boost::breadth_first_search(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = R_adjacency_list<directedS, double>; Buffer = queue<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > >; BFSVisitor = bfs_time_visitor<long unsigned int*>; ColorMap = two_bit_color_map<vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int> >; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
147 | breadth_first_search(g, sources, sources + 1, Q, vis, color);
| ~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:262:29: required from ‘void boost::detail::bfs_helper(VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, ColorMap, BFSVisitor, const boost::bgl_named_params<P, T, R>&, mpl_::false_) [with VertexListGraph = R_adjacency_list<boost::directedS, double>; ColorMap = boost::two_bit_color_map<boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int> >; BFSVisitor = bfs_time_visitor<long unsigned int*>; P = bfs_time_visitor<long unsigned int*>; T = boost::graph_visitor_t; R = boost::no_property; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int; mpl_::false_ = mpl_::bool_<false>]’
262 | breadth_first_search(g, s,
| ~~~~~~~~~~~~~~~~~~~~^~~~~~
263 | choose_param(get_param(params, buffer_param_t()), boost::ref(Q))
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
264 | .get(),
| ~~~~~~~
265 | vis, color);
| ~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:309:23: required from ‘static void boost::detail::bfs_dispatch<boost::param_not_found>::apply(VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, const boost::bgl_named_params<T, Tag, Base>&, boost::param_not_found) [with VertexListGraph = R_adjacency_list<boost::directedS, double>; P = bfs_time_visitor<long unsigned int*>; T = boost::graph_visitor_t; R = boost::no_property; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’
309 | bfs_helper(g, s,
| ~~~~~~~~~~^~~~~~
310 | make_two_bit_color_map(num_vertices(g),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
311 | choose_const_pmap(
| ~~~~~~~~~~~~~~~~~~
312 | get_param(params, vertex_index), g, vertex_index)),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
313 | choose_param(get_param(params, graph_visitor),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
314 | make_bfs_visitor(null_vis)),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~
315 | params,
| ~~~~~~~
316 | boost::mpl::bool_<
| ~~~~~~~~~~~~~~~~~~
317 | boost::is_base_and_derived< distributed_graph_tag,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
318 | typename graph_traits<
| ~~~~~~~~~~~~~~~~~~~~~~
319 | VertexListGraph >::traversal_category >::value >());
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:339:37: required from ‘void boost::breadth_first_search(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with VertexListGraph = R_adjacency_list<directedS, double>; P = bfs_time_visitor<long unsigned int*>; T = graph_visitor_t; R = no_property; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
339 | detail::bfs_dispatch< C >::apply(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
340 | ng, s, params, get_param(params, vertex_color));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
interfaces.cpp:113:29: required from here
113 | breadth_first_search(g, vertex((int)INTEGER(init_ind)[0], g), visitor(vis));
| ~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Convertible<boost::read_write_property_map_tag, boost::read_write_property_map_tag>]’
20 | ~usage_requirements() { ((Model*)0)->~Model(); }
| ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::ConvertibleConcept<boost::read_write_property_map_tag, boost::read_write_property_map_tag>]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:208:7: required from ‘void boost::ReadWritePropertyMapConcept<PMap, Key>::constraints() [with PMap = boost::two_bit_color_map<boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int> >; Key = long unsigned int]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::ReadWritePropertyMapConcept<boost::two_bit_color_map<boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int> >, long unsigned int>]’
32 | inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
| ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied<boost::ReadWritePropertyMapConcept<boost::two_bit_color_map<boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int> >, long unsigned int> >::value’
44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied<boost::ReadWritePropertyMapConcept<boost::two_bit_color_map<boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int> >, long unsigned int> >’
45 | typedef boost::integral_constant<bool, value> type;
| ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:136:24: required from ‘void boost::breadth_first_search(const VertexListGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = R_adjacency_list<directedS, double>; SourceIterator = long unsigned int*; Buffer = queue<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > >; BFSVisitor = bfs_time_visitor<long unsigned int*>; ColorMap = two_bit_color_map<vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int> >]’
136 | breadth_first_visit(g, sources_begin, sources_end, Q, vis, color);
| ~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:147:25: required from ‘void boost::breadth_first_search(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = R_adjacency_list<directedS, double>; Buffer = queue<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > >; BFSVisitor = bfs_time_visitor<long unsigned int*>; ColorMap = two_bit_color_map<vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int> >; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
147 | breadth_first_search(g, sources, sources + 1, Q, vis, color);
| ~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:262:29: required from ‘void boost::detail::bfs_helper(VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, ColorMap, BFSVisitor, const boost::bgl_named_params<P, T, R>&, mpl_::false_) [with VertexListGraph = R_adjacency_list<boost::directedS, double>; ColorMap = boost::two_bit_color_map<boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int> >; BFSVisitor = bfs_time_visitor<long unsigned int*>; P = bfs_time_visitor<long unsigned int*>; T = boost::graph_visitor_t; R = boost::no_property; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int; mpl_::false_ = mpl_::bool_<false>]’
262 | breadth_first_search(g, s,
| ~~~~~~~~~~~~~~~~~~~~^~~~~~
263 | choose_param(get_param(params, buffer_param_t()), boost::ref(Q))
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
264 | .get(),
| ~~~~~~~
265 | vis, color);
| ~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:309:23: required from ‘static void boost::detail::bfs_dispatch<boost::param_not_found>::apply(VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, const boost::bgl_named_params<T, Tag, Base>&, boost::param_not_found) [with VertexListGraph = R_adjacency_list<boost::directedS, double>; P = bfs_time_visitor<long unsigned int*>; T = boost::graph_visitor_t; R = boost::no_property; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’
309 | bfs_helper(g, s,
| ~~~~~~~~~~^~~~~~
310 | make_two_bit_color_map(num_vertices(g),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
311 | choose_const_pmap(
| ~~~~~~~~~~~~~~~~~~
312 | get_param(params, vertex_index), g, vertex_index)),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
313 | choose_param(get_param(params, graph_visitor),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
314 | make_bfs_visitor(null_vis)),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~
315 | params,
| ~~~~~~~
316 | boost::mpl::bool_<
| ~~~~~~~~~~~~~~~~~~
317 | boost::is_base_and_derived< distributed_graph_tag,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
318 | typename graph_traits<
| ~~~~~~~~~~~~~~~~~~~~~~
319 | VertexListGraph >::traversal_category >::value >());
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:339:37: required from ‘void boost::breadth_first_search(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with VertexListGraph = R_adjacency_list<directedS, double>; P = bfs_time_visitor<long unsigned int*>; T = graph_visitor_t; R = no_property; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
339 | detail::bfs_dispatch< C >::apply(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
340 | ng, s, params, get_param(params, vertex_color));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
interfaces.cpp:113:29: required from here
113 | breadth_first_search(g, vertex((int)INTEGER(init_ind)[0], g), visitor(vis));
| ~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:206:17: note: in a call to non-static member function ‘boost::ConvertibleConcept<boost::read_write_property_map_tag, boost::read_write_property_map_tag>::~ConvertibleConcept()’
206 | BOOST_concept(Convertible,(X)(Y))
| ^~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/preprocessor/cat.hpp:29:34: note: in definition of macro ‘BOOST_PP_CAT_I’
29 | # define BOOST_PP_CAT_I(a, b) a ## b
| ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/concept_def.hpp:23:12: note: in expansion of macro ‘BOOST_PP_CAT’
23 | struct BOOST_PP_CAT(name,Concept) \
| ^~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:206:3: note: in expansion of macro ‘BOOST_concept’
206 | BOOST_concept(Convertible,(X)(Y))
| ^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::concepts::MultiPassInputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int> > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:52:50: required from ‘struct boost::concepts::MultiPassInputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int> >’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::concepts::MultiPassInputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int> >]’
32 | inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
| ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied<boost::concepts::MultiPassInputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int> > >::value’
44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied<boost::concepts::MultiPassInputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int> > >’
45 | typedef boost::integral_constant<bool, value> type;
| ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_<void (*)(boost::concepts::MultiPassInputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int> >)>’
72 | struct requirement_<void(*)(Model)>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:89:9: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:129:9: required from ‘void boost::detail::depth_first_visit_impl(const IncidenceGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, DFSVisitor&, ColorMap, TerminatorFunc) [with IncidenceGraph = R_adjacency_list<boost::directedS, double>; DFSVisitor = dfs_time_visitor<long unsigned int*>; ColorMap = boost::shared_array_property_map<boost::default_color_type, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int> >; TerminatorFunc = nontruth2; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:286:39: required from ‘void boost::depth_first_search(const VertexListGraph&, DFSVisitor, ColorMap, typename graph_traits<Graph>::vertex_descriptor) [with VertexListGraph = R_adjacency_list<directedS, double>; DFSVisitor = dfs_time_visitor<long unsigned int*>; ColorMap = shared_array_property_map<default_color_type, vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int> >; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
286 | detail::depth_first_visit_impl(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
287 | g, start_vertex, vis, color, detail::nontruth2());
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/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 dfs_time_visitor<long unsigned int*> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; Graph = R_adjacency_list<boost::directedS, double>]’
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)]);
| ~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/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 = R_adjacency_list<boost::directedS, double>; ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<keywords::tag::visitor, const dfs_time_visitor<long unsigned 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); \
| ~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/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 = R_adjacency_list<directedS, double>; P = dfs_time_visitor<long unsigned 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 dfs_time_visitor<long unsigned 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); \
| ~~~~~~~~~
interfaces.cpp:158:27: required from here
158 | depth_first_search(g, visitor(vis));
| ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::concepts::MultiPassInputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int> >]’
20 | ~usage_requirements() { ((Model*)0)->~Model(); }
| ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::MultiPassInputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int> >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:89:9: required from ‘boost::concepts::IncidenceGraph<G>::~IncidenceGraph() [with G = R_adjacency_list<boost::directedS, double>]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/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<R_adjacency_list<boost::directedS, double> >]’
75 | BOOST_concept(IncidenceGraph, (G)) : Graph< G >
| ^~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:129:9: required from ‘void boost::detail::depth_first_visit_impl(const IncidenceGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, DFSVisitor&, ColorMap, TerminatorFunc) [with IncidenceGraph = R_adjacency_list<boost::directedS, double>; DFSVisitor = dfs_time_visitor<long unsigned int*>; ColorMap = boost::shared_array_property_map<boost::default_color_type, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int> >; TerminatorFunc = nontruth2; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:286:39: required from ‘void boost::depth_first_search(const VertexListGraph&, DFSVisitor, ColorMap, typename graph_traits<Graph>::vertex_descriptor) [with VertexListGraph = R_adjacency_list<directedS, double>; DFSVisitor = dfs_time_visitor<long unsigned int*>; ColorMap = shared_array_property_map<default_color_type, vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int> >; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
286 | detail::depth_first_visit_impl(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
287 | g, start_vertex, vis, color, detail::nontruth2());
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/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 dfs_time_visitor<long unsigned int*> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; Graph = R_adjacency_list<boost::directedS, double>]’
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)]);
| ~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/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 = R_adjacency_list<boost::directedS, double>; ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<keywords::tag::visitor, const dfs_time_visitor<long unsigned 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); \
| ~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/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 = R_adjacency_list<directedS, double>; P = dfs_time_visitor<long unsigned 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 dfs_time_visitor<long unsigned 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); \
| ~~~~~~~~~
interfaces.cpp:158:27: required from here
158 | depth_first_search(g, visitor(vis));
| ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::concepts::MultiPassInputIterator<T>::~MultiPassInputIterator() [with T = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int>]’
37 | ~model()
| ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:52:50: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
52 | BOOST_concept(MultiPassInputIterator, (T)) { BOOST_CONCEPT_USAGE(
| ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::DefaultConstructible<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:137:5: required from ‘struct boost::DefaultConstructible<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> >’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::DefaultConstructible<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> >]’
32 | inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
| ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied<boost::DefaultConstructible<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > >::value’
44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied<boost::DefaultConstructible<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > >’
45 | typedef boost::integral_constant<bool, value> type;
| ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_<void (*)(boost::DefaultConstructible<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> >)>’
72 | struct requirement_<void(*)(Model)>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:90:9: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:129:9: required from ‘void boost::detail::depth_first_visit_impl(const IncidenceGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, DFSVisitor&, ColorMap, TerminatorFunc) [with IncidenceGraph = R_adjacency_list<boost::directedS, double>; DFSVisitor = dfs_time_visitor<long unsigned int*>; ColorMap = boost::shared_array_property_map<boost::default_color_type, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int> >; TerminatorFunc = nontruth2; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:286:39: required from ‘void boost::depth_first_search(const VertexListGraph&, DFSVisitor, ColorMap, typename graph_traits<Graph>::vertex_descriptor) [with VertexListGraph = R_adjacency_list<directedS, double>; DFSVisitor = dfs_time_visitor<long unsigned int*>; ColorMap = shared_array_property_map<default_color_type, vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int> >; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
286 | detail::depth_first_visit_impl(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
287 | g, start_vertex, vis, color, detail::nontruth2());
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/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 dfs_time_visitor<long unsigned int*> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; Graph = R_adjacency_list<boost::directedS, double>]’
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)]);
| ~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/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 = R_adjacency_list<boost::directedS, double>; ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<keywords::tag::visitor, const dfs_time_visitor<long unsigned 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); \
| ~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/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 = R_adjacency_list<directedS, double>; P = dfs_time_visitor<long unsigned 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 dfs_time_visitor<long unsigned 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); \
| ~~~~~~~~~
interfaces.cpp:158:27: required from here
158 | depth_first_search(g, visitor(vis));
| ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::DefaultConstructible<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> >]’
20 | ~usage_requirements() { ((Model*)0)->~Model(); }
| ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::DefaultConstructible<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:90:9: required from ‘boost::concepts::IncidenceGraph<G>::~IncidenceGraph() [with G = R_adjacency_list<boost::directedS, double>]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/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<R_adjacency_list<boost::directedS, double> >]’
75 | BOOST_concept(IncidenceGraph, (G)) : Graph< G >
| ^~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:129:9: required from ‘void boost::detail::depth_first_visit_impl(const IncidenceGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, DFSVisitor&, ColorMap, TerminatorFunc) [with IncidenceGraph = R_adjacency_list<boost::directedS, double>; DFSVisitor = dfs_time_visitor<long unsigned int*>; ColorMap = boost::shared_array_property_map<boost::default_color_type, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int> >; TerminatorFunc = nontruth2; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:286:39: required from ‘void boost::depth_first_search(const VertexListGraph&, DFSVisitor, ColorMap, typename graph_traits<Graph>::vertex_descriptor) [with VertexListGraph = R_adjacency_list<directedS, double>; DFSVisitor = dfs_time_visitor<long unsigned int*>; ColorMap = shared_array_property_map<default_color_type, vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int> >; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
286 | detail::depth_first_visit_impl(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
287 | g, start_vertex, vis, color, detail::nontruth2());
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/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 dfs_time_visitor<long unsigned int*> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; Graph = R_adjacency_list<boost::directedS, double>]’
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)]);
| ~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/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 = R_adjacency_list<boost::directedS, double>; ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<keywords::tag::visitor, const dfs_time_visitor<long unsigned 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); \
| ~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/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 = R_adjacency_list<directedS, double>; P = dfs_time_visitor<long unsigned 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 dfs_time_visitor<long unsigned 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); \
| ~~~~~~~~~
interfaces.cpp:158:27: required from here
158 | depth_first_search(g, visitor(vis));
| ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::DefaultConstructible<TT>::~DefaultConstructible() [with TT = boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>]’
37 | ~model()
| ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:137:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
137 | BOOST_CONCEPT_USAGE(DefaultConstructible) {
| ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::EqualityComparable<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> >’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::EqualityComparable<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> >]’
32 | inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
| ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied<boost::EqualityComparable<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > >::value’
44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied<boost::EqualityComparable<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > >’
45 | typedef boost::integral_constant<bool, value> type;
| ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_<void (*)(boost::EqualityComparable<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> >)>’
72 | struct requirement_<void(*)(Model)>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:91:9: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:129:9: required from ‘void boost::detail::depth_first_visit_impl(const IncidenceGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, DFSVisitor&, ColorMap, TerminatorFunc) [with IncidenceGraph = R_adjacency_list<boost::directedS, double>; DFSVisitor = dfs_time_visitor<long unsigned int*>; ColorMap = boost::shared_array_property_map<boost::default_color_type, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int> >; TerminatorFunc = nontruth2; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:286:39: required from ‘void boost::depth_first_search(const VertexListGraph&, DFSVisitor, ColorMap, typename graph_traits<Graph>::vertex_descriptor) [with VertexListGraph = R_adjacency_list<directedS, double>; DFSVisitor = dfs_time_visitor<long unsigned int*>; ColorMap = shared_array_property_map<default_color_type, vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int> >; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
286 | detail::depth_first_visit_impl(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
287 | g, start_vertex, vis, color, detail::nontruth2());
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/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 dfs_time_visitor<long unsigned int*> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; Graph = R_adjacency_list<boost::directedS, double>]’
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)]);
| ~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/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 = R_adjacency_list<boost::directedS, double>; ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<keywords::tag::visitor, const dfs_time_visitor<long unsigned 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); \
| ~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/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 = R_adjacency_list<directedS, double>; P = dfs_time_visitor<long unsigned 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 dfs_time_visitor<long unsigned 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); \
| ~~~~~~~~~
interfaces.cpp:158:27: required from here
158 | depth_first_search(g, visitor(vis));
| ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::EqualityComparable<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> >]’
20 | ~usage_requirements() { ((Model*)0)->~Model(); }
| ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::EqualityComparable<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:91:9: required from ‘boost::concepts::IncidenceGraph<G>::~IncidenceGraph() [with G = R_adjacency_list<boost::directedS, double>]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/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<R_adjacency_list<boost::directedS, double> >]’
75 | BOOST_concept(IncidenceGraph, (G)) : Graph< G >
| ^~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:129:9: required from ‘void boost::detail::depth_first_visit_impl(const IncidenceGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, DFSVisitor&, ColorMap, TerminatorFunc) [with IncidenceGraph = R_adjacency_list<boost::directedS, double>; DFSVisitor = dfs_time_visitor<long unsigned int*>; ColorMap = boost::shared_array_property_map<boost::default_color_type, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int> >; TerminatorFunc = nontruth2; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:286:39: required from ‘void boost::depth_first_search(const VertexListGraph&, DFSVisitor, ColorMap, typename graph_traits<Graph>::vertex_descriptor) [with VertexListGraph = R_adjacency_list<directedS, double>; DFSVisitor = dfs_time_visitor<long unsigned int*>; ColorMap = shared_array_property_map<default_color_type, vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int> >; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
286 | detail::depth_first_visit_impl(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
287 | g, start_vertex, vis, color, detail::nontruth2());
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/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 dfs_time_visitor<long unsigned int*> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; Graph = R_adjacency_list<boost::directedS, double>]’
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)]);
| ~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/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 = R_adjacency_list<boost::directedS, double>; ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<keywords::tag::visitor, const dfs_time_visitor<long unsigned 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); \
| ~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/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 = R_adjacency_list<directedS, double>; P = dfs_time_visitor<long unsigned 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 dfs_time_visitor<long unsigned 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); \
| ~~~~~~~~~
interfaces.cpp:158:27: required from here
158 | depth_first_search(g, visitor(vis));
| ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::EqualityComparable<TT>::~EqualityComparable() [with TT = boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>]’
37 | ~model()
| ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:233:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
233 | BOOST_CONCEPT_USAGE(EqualityComparable) {
| ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Assignable<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:145:5: required from ‘struct boost::Assignable<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> >’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::Assignable<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> >]’
32 | inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
| ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied<boost::Assignable<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > >::value’
44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied<boost::Assignable<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > >’
45 | typedef boost::integral_constant<bool, value> type;
| ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_<void (*)(boost::Assignable<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> >)>’
72 | struct requirement_<void(*)(Model)>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:92:9: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:129:9: required from ‘void boost::detail::depth_first_visit_impl(const IncidenceGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, DFSVisitor&, ColorMap, TerminatorFunc) [with IncidenceGraph = R_adjacency_list<boost::directedS, double>; DFSVisitor = dfs_time_visitor<long unsigned int*>; ColorMap = boost::shared_array_property_map<boost::default_color_type, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int> >; TerminatorFunc = nontruth2; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:286:39: required from ‘void boost::depth_first_search(const VertexListGraph&, DFSVisitor, ColorMap, typename graph_traits<Graph>::vertex_descriptor) [with VertexListGraph = R_adjacency_list<directedS, double>; DFSVisitor = dfs_time_visitor<long unsigned int*>; ColorMap = shared_array_property_map<default_color_type, vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int> >; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
286 | detail::depth_first_visit_impl(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
287 | g, start_vertex, vis, color, detail::nontruth2());
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/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 dfs_time_visitor<long unsigned int*> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; Graph = R_adjacency_list<boost::directedS, double>]’
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)]);
| ~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/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 = R_adjacency_list<boost::directedS, double>; ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<keywords::tag::visitor, const dfs_time_visitor<long unsigned 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); \
| ~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/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 = R_adjacency_list<directedS, double>; P = dfs_time_visitor<long unsigned 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 dfs_time_visitor<long unsigned 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); \
| ~~~~~~~~~
interfaces.cpp:158:27: required from here
158 | depth_first_search(g, visitor(vis));
| ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Assignable<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> >]’
20 | ~usage_requirements() { ((Model*)0)->~Model(); }
| ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::Assignable<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:92:9: required from ‘boost::concepts::IncidenceGraph<G>::~IncidenceGraph() [with G = R_adjacency_list<boost::directedS, double>]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/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<R_adjacency_list<boost::directedS, double> >]’
75 | BOOST_concept(IncidenceGraph, (G)) : Graph< G >
| ^~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:129:9: required from ‘void boost::detail::depth_first_visit_impl(const IncidenceGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, DFSVisitor&, ColorMap, TerminatorFunc) [with IncidenceGraph = R_adjacency_list<boost::directedS, double>; DFSVisitor = dfs_time_visitor<long unsigned int*>; ColorMap = boost::shared_array_property_map<boost::default_color_type, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int> >; TerminatorFunc = nontruth2; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:286:39: required from ‘void boost::depth_first_search(const VertexListGraph&, DFSVisitor, ColorMap, typename graph_traits<Graph>::vertex_descriptor) [with VertexListGraph = R_adjacency_list<directedS, double>; DFSVisitor = dfs_time_visitor<long unsigned int*>; ColorMap = shared_array_property_map<default_color_type, vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int> >; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
286 | detail::depth_first_visit_impl(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
287 | g, start_vertex, vis, color, detail::nontruth2());
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/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 dfs_time_visitor<long unsigned int*> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; Graph = R_adjacency_list<boost::directedS, double>]’
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)]);
| ~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/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 = R_adjacency_list<boost::directedS, double>; ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<keywords::tag::visitor, const dfs_time_visitor<long unsigned 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); \
| ~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/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 = R_adjacency_list<directedS, double>; P = dfs_time_visitor<long unsigned 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 dfs_time_visitor<long unsigned 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); \
| ~~~~~~~~~
interfaces.cpp:158:27: required from here
158 | depth_first_search(g, visitor(vis));
| ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Assignable<TT>::~Assignable() [with TT = boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>]’
37 | ~model()
| ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:145:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
145 | BOOST_CONCEPT_USAGE(Assignable) {
| ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Convertible<boost::adj_list_dir_traversal_tag, boost::incidence_graph_tag> >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/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> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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);
| ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/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) );
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/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;
| ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/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)>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:93:9: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:129:9: required from ‘void boost::detail::depth_first_visit_impl(const IncidenceGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, DFSVisitor&, ColorMap, TerminatorFunc) [with IncidenceGraph = R_adjacency_list<boost::directedS, double>; DFSVisitor = dfs_time_visitor<long unsigned int*>; ColorMap = boost::shared_array_property_map<boost::default_color_type, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int> >; TerminatorFunc = nontruth2; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:286:39: required from ‘void boost::depth_first_search(const VertexListGraph&, DFSVisitor, ColorMap, typename graph_traits<Graph>::vertex_descriptor) [with VertexListGraph = R_adjacency_list<directedS, double>; DFSVisitor = dfs_time_visitor<long unsigned int*>; ColorMap = shared_array_property_map<default_color_type, vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int> >; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
286 | detail::depth_first_visit_impl(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
287 | g, start_vertex, vis, color, detail::nontruth2());
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/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 dfs_time_visitor<long unsigned int*> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; Graph = R_adjacency_list<boost::directedS, double>]’
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)]);
| ~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/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 = R_adjacency_list<boost::directedS, double>; ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<keywords::tag::visitor, const dfs_time_visitor<long unsigned 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); \
| ~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/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 = R_adjacency_list<directedS, double>; P = dfs_time_visitor<long unsigned 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 dfs_time_visitor<long unsigned 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); \
| ~~~~~~~~~
interfaces.cpp:158:27: required from here
158 | depth_first_search(g, visitor(vis));
| ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Convertible<boost::adj_list_dir_traversal_tag, boost::incidence_graph_tag>]’
20 | ~usage_requirements() { ((Model*)0)->~Model(); }
| ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::Convertible<boost::adj_list_dir_traversal_tag, boost::incidence_graph_tag>]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:93:9: required from ‘boost::concepts::IncidenceGraph<G>::~IncidenceGraph() [with G = R_adjacency_list<boost::directedS, double>]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/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<R_adjacency_list<boost::directedS, double> >]’
75 | BOOST_concept(IncidenceGraph, (G)) : Graph< G >
| ^~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:129:9: required from ‘void boost::detail::depth_first_visit_impl(const IncidenceGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, DFSVisitor&, ColorMap, TerminatorFunc) [with IncidenceGraph = R_adjacency_list<boost::directedS, double>; DFSVisitor = dfs_time_visitor<long unsigned int*>; ColorMap = boost::shared_array_property_map<boost::default_color_type, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int> >; TerminatorFunc = nontruth2; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:286:39: required from ‘void boost::depth_first_search(const VertexListGraph&, DFSVisitor, ColorMap, typename graph_traits<Graph>::vertex_descriptor) [with VertexListGraph = R_adjacency_list<directedS, double>; DFSVisitor = dfs_time_visitor<long unsigned int*>; ColorMap = shared_array_property_map<default_color_type, vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int> >; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
286 | detail::depth_first_visit_impl(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
287 | g, start_vertex, vis, color, detail::nontruth2());
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/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 dfs_time_visitor<long unsigned int*> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; Graph = R_adjacency_list<boost::directedS, double>]’
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)]);
| ~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/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 = R_adjacency_list<boost::directedS, double>; ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<keywords::tag::visitor, const dfs_time_visitor<long unsigned 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); \
| ~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/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 = R_adjacency_list<directedS, double>; P = dfs_time_visitor<long unsigned 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 dfs_time_visitor<long unsigned 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); \
| ~~~~~~~~~
interfaces.cpp:158:27: required from here
158 | depth_first_search(g, visitor(vis));
| ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible<X, Y>::~Convertible() [with X = boost::adj_list_dir_traversal_tag; Y = boost::incidence_graph_tag]’
37 | ~model()
| ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
208 | BOOST_CONCEPT_USAGE(Convertible) {
| ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Convertible<boost::lvalue_property_map_tag, boost::readable_property_map_tag> >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/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> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/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))
| ^~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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);
| ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/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) );
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/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;
| ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 11 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:134:9: required from ‘void boost::detail::depth_first_visit_impl(const IncidenceGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, DFSVisitor&, ColorMap, TerminatorFunc) [with IncidenceGraph = R_adjacency_list<boost::directedS, double>; DFSVisitor = dfs_time_visitor<long unsigned int*>; ColorMap = boost::shared_array_property_map<boost::default_color_type, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int> >; TerminatorFunc = nontruth2; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:286:39: required from ‘void boost::depth_first_search(const VertexListGraph&, DFSVisitor, ColorMap, typename graph_traits<Graph>::vertex_descriptor) [with VertexListGraph = R_adjacency_list<directedS, double>; DFSVisitor = dfs_time_visitor<long unsigned int*>; ColorMap = shared_array_property_map<default_color_type, vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int> >; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
286 | detail::depth_first_visit_impl(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
287 | g, start_vertex, vis, color, detail::nontruth2());
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/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 dfs_time_visitor<long unsigned int*> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; Graph = R_adjacency_list<boost::directedS, double>]’
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)]);
| ~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/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 = R_adjacency_list<boost::directedS, double>; ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<keywords::tag::visitor, const dfs_time_visitor<long unsigned 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); \
| ~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/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 = R_adjacency_list<directedS, double>; P = dfs_time_visitor<long unsigned 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 dfs_time_visitor<long unsigned 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); \
| ~~~~~~~~~
interfaces.cpp:158:27: required from here
158 | depth_first_search(g, visitor(vis));
| ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Convertible<boost::lvalue_property_map_tag, boost::readable_property_map_tag>]’
20 | ~usage_requirements() { ((Model*)0)->~Model(); }
| ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::ConvertibleConcept<boost::lvalue_property_map_tag, boost::readable_property_map_tag>]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/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::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int> >; Key = long unsigned int]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int> >, long unsigned int>]’
32 | inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
| ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/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::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int> >, long unsigned int> >::value’
44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/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::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int> >, long unsigned int> >’
45 | typedef boost::integral_constant<bool, value> type;
| ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/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::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int> >, long unsigned int>)>’
72 | struct requirement_<void(*)(Model)>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:206:7: [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:134:9: required from ‘void boost::detail::depth_first_visit_impl(const IncidenceGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, DFSVisitor&, ColorMap, TerminatorFunc) [with IncidenceGraph = R_adjacency_list<boost::directedS, double>; DFSVisitor = dfs_time_visitor<long unsigned int*>; ColorMap = boost::shared_array_property_map<boost::default_color_type, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int> >; TerminatorFunc = nontruth2; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:286:39: required from ‘void boost::depth_first_search(const VertexListGraph&, DFSVisitor, ColorMap, typename graph_traits<Graph>::vertex_descriptor) [with VertexListGraph = R_adjacency_list<directedS, double>; DFSVisitor = dfs_time_visitor<long unsigned int*>; ColorMap = shared_array_property_map<default_color_type, vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int> >; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
286 | detail::depth_first_visit_impl(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
287 | g, start_vertex, vis, color, detail::nontruth2());
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/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 dfs_time_visitor<long unsigned int*> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; Graph = R_adjacency_list<boost::directedS, double>]’
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)]);
| ~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/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 = R_adjacency_list<boost::directedS, double>; ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<keywords::tag::visitor, const dfs_time_visitor<long unsigned 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); \
| ~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/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 = R_adjacency_list<directedS, double>; P = dfs_time_visitor<long unsigned 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 dfs_time_visitor<long unsigned 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); \
| ~~~~~~~~~
interfaces.cpp:158:27: required from here
158 | depth_first_search(g, visitor(vis));
| ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:206:17: note: in a call to non-static member function ‘boost::ConvertibleConcept<boost::lvalue_property_map_tag, boost::readable_property_map_tag>::~ConvertibleConcept()’
206 | BOOST_concept(Convertible,(X)(Y))
| ^~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/preprocessor/cat.hpp:29:34: note: in definition of macro ‘BOOST_PP_CAT_I’
29 | # define BOOST_PP_CAT_I(a, b) a ## b
| ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/concept_def.hpp:23:12: note: in expansion of macro ‘BOOST_PP_CAT’
23 | struct BOOST_PP_CAT(name,Concept) \
| ^~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:206:3: note: in expansion of macro ‘BOOST_concept’
206 | BOOST_concept(Convertible,(X)(Y))
| ^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Convertible<boost::lvalue_property_map_tag, boost::read_write_property_map_tag>]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/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(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/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> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/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))
| ^~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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);
| ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/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) );
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 7 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:134:9: required from ‘void boost::detail::depth_first_visit_impl(const IncidenceGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, DFSVisitor&, ColorMap, TerminatorFunc) [with IncidenceGraph = R_adjacency_list<boost::directedS, double>; DFSVisitor = dfs_time_visitor<long unsigned int*>; ColorMap = boost::shared_array_property_map<boost::default_color_type, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int> >; TerminatorFunc = nontruth2; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:286:39: required from ‘void boost::depth_first_search(const VertexListGraph&, DFSVisitor, ColorMap, typename graph_traits<Graph>::vertex_descriptor) [with VertexListGraph = R_adjacency_list<directedS, double>; DFSVisitor = dfs_time_visitor<long unsigned int*>; ColorMap = shared_array_property_map<default_color_type, vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int> >; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
286 | detail::depth_first_visit_impl(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
287 | g, start_vertex, vis, color, detail::nontruth2());
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/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 dfs_time_visitor<long unsigned int*> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; Graph = R_adjacency_list<boost::directedS, double>]’
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)]);
| ~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/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 = R_adjacency_list<boost::directedS, double>; ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<keywords::tag::visitor, const dfs_time_visitor<long unsigned 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); \
| ~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/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 = R_adjacency_list<directedS, double>; P = dfs_time_visitor<long unsigned 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 dfs_time_visitor<long unsigned 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); \
| ~~~~~~~~~
interfaces.cpp:158:27: required from here
158 | depth_first_search(g, visitor(vis));
| ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
20 | ~usage_requirements() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible<X, Y>::~Convertible() [with X = boost::lvalue_property_map_tag; Y = boost::read_write_property_map_tag]’
37 | ~model()
| ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
208 | BOOST_CONCEPT_USAGE(Convertible) {
| ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::CopyConstructible<boost::detail::components_recorder<int*> >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::CopyConstructible<boost::detail::components_recorder<int*> > >]’
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:167:5: required from ‘struct boost::CopyConstructible<boost::detail::components_recorder<int*> >’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:165:3: required from ‘struct boost::CopyConstructibleConcept<boost::detail::components_recorder<int*> >’
165 | BOOST_concept(CopyConstructible,(TT))
| ^~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::CopyConstructibleConcept<boost::detail::components_recorder<int*> >]’
32 | inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
| ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied<boost::CopyConstructibleConcept<boost::detail::components_recorder<int*> > >::value’
44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 7 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:130:9: required from ‘void boost::depth_first_search(const VertexListGraph&, DFSVisitor, ColorMap, typename graph_traits<Graph>::vertex_descriptor) [with VertexListGraph = R_adjacency_list<undirectedS, double>; DFSVisitor = detail::components_recorder<int*>; ColorMap = shared_array_property_map<default_color_type, vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int> >; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:397:42: required from ‘void boost::graph::detail::depth_first_search_impl<Graph>::operator()(const Graph&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<boost::graph::keywords::tag::visitor, const boost::detail::components_recorder<int*> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; Graph = R_adjacency_list<boost::undirectedS, double>]’
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)]);
| ~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/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 = R_adjacency_list<boost::undirectedS, double>; ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<keywords::tag::visitor, const boost::detail::components_recorder<int*> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; typename boost::result_of<detail::depth_first_search_impl<Param0>(Param0, const ArgPack&)>::type = void]’
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); \
| ~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/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 = R_adjacency_list<undirectedS, double>; P = detail::components_recorder<int*>; T = graph_visitor_t; R = no_property; typename result_of<graph::detail::depth_first_search_impl<Param0>(Param0, const typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<T, Tag, Base> >::type&)>::type = void; typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<T, Tag, Base> >::type = parameter::aux::arg_list<parameter::aux::tagged_argument<graph::keywords::tag::visitor, const detail::components_recorder<int*> >, parameter::aux::empty_arg_list, std::integral_constant<bool, true> >]’
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); \
| ~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/connected_components.hpp:106:23: required from ‘typename boost::property_traits<IndexMap>::value_type boost::connected_components(const Graph&, ComponentMap, typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = R_adjacency_list<undirectedS, double>; ComponentMap = int*; typename property_traits<IndexMap>::value_type = int; typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits<Graph>::traversal_category = undir_adj_list_traversal_tag]’
106 | depth_first_search(g, visitor(vis));
| ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~
interfaces.cpp:205:29: required from here
205 | connected_components(g, &component[0]);
| ~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
20 | ~usage_requirements() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::CopyConstructible<TT>::~CopyConstructible() [with TT = boost::detail::components_recorder<int*>]’
37 | ~model()
| ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:167:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
167 | BOOST_CONCEPT_USAGE(CopyConstructible) {
| ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::concepts::Graph<R_adjacency_list<boost::undirectedS, double> >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/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<R_adjacency_list<boost::undirectedS, double> > >]’
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:66:5: required from ‘struct boost::concepts::Graph<R_adjacency_list<boost::undirectedS, double> >’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:75:1: required from ‘struct boost::concepts::IncidenceGraph<R_adjacency_list<boost::undirectedS, double> >’
75 | BOOST_concept(IncidenceGraph, (G)) : Graph< G >
| ^~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:75:1: required from ‘struct boost::concepts::IncidenceGraphConcept<R_adjacency_list<boost::undirectedS, double> >’
75 | BOOST_concept(IncidenceGraph, (G)) : Graph< G >
| ^~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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<R_adjacency_list<boost::undirectedS, double> >]’
32 | inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
| ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5: [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:286:39: required from ‘void boost::depth_first_search(const VertexListGraph&, DFSVisitor, ColorMap, typename graph_traits<Graph>::vertex_descriptor) [with VertexListGraph = R_adjacency_list<undirectedS, double>; DFSVisitor = detail::components_recorder<int*>; ColorMap = shared_array_property_map<default_color_type, vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int> >; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
286 | detail::depth_first_visit_impl(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
287 | g, start_vertex, vis, color, detail::nontruth2());
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:397:42: required from ‘void boost::graph::detail::depth_first_search_impl<Graph>::operator()(const Graph&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<boost::graph::keywords::tag::visitor, const boost::detail::components_recorder<int*> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; Graph = R_adjacency_list<boost::undirectedS, double>]’
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)]);
| ~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/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 = R_adjacency_list<boost::undirectedS, double>; ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<keywords::tag::visitor, const boost::detail::components_recorder<int*> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; typename boost::result_of<detail::depth_first_search_impl<Param0>(Param0, const ArgPack&)>::type = void]’
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); \
| ~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/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 = R_adjacency_list<undirectedS, double>; P = detail::components_recorder<int*>; T = graph_visitor_t; R = no_property; typename result_of<graph::detail::depth_first_search_impl<Param0>(Param0, const typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<T, Tag, Base> >::type&)>::type = void; typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<T, Tag, Base> >::type = parameter::aux::arg_list<parameter::aux::tagged_argument<graph::keywords::tag::visitor, const detail::components_recorder<int*> >, parameter::aux::empty_arg_list, std::integral_constant<bool, true> >]’
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); \
| ~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/connected_components.hpp:106:23: required from ‘typename boost::property_traits<IndexMap>::value_type boost::connected_components(const Graph&, ComponentMap, typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = R_adjacency_list<undirectedS, double>; ComponentMap = int*; typename property_traits<IndexMap>::value_type = int; typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits<Graph>::traversal_category = undir_adj_list_traversal_tag]’
106 | depth_first_search(g, visitor(vis));
| ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~
interfaces.cpp:205:29: required from here
205 | connected_components(g, &component[0]);
| ~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
20 | ~usage_requirements() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::concepts::Graph<G>::~Graph() [with G = R_adjacency_list<boost::undirectedS, double>]’
37 | ~model()
| ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:66:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
66 | BOOST_CONCEPT_USAGE(Graph)
| ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::concepts::IncidenceGraph<R_adjacency_list<boost::undirectedS, double> >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/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<R_adjacency_list<boost::undirectedS, double> > >]’
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:87:5: required from ‘struct boost::concepts::IncidenceGraph<R_adjacency_list<boost::undirectedS, double> >’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:75:1: required from ‘struct boost::concepts::IncidenceGraphConcept<R_adjacency_list<boost::undirectedS, double> >’
75 | BOOST_concept(IncidenceGraph, (G)) : Graph< G >
| ^~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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<R_adjacency_list<boost::undirectedS, double> >]’
32 | inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
| ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied<boost::concepts::IncidenceGraphConcept<R_adjacency_list<boost::undirectedS, double> > >::value’
44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:286:39: required from ‘void boost::depth_first_search(const VertexListGraph&, DFSVisitor, ColorMap, typename graph_traits<Graph>::vertex_descriptor) [with VertexListGraph = R_adjacency_list<undirectedS, double>; DFSVisitor = detail::components_recorder<int*>; ColorMap = shared_array_property_map<default_color_type, vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int> >; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
286 | detail::depth_first_visit_impl(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
287 | g, start_vertex, vis, color, detail::nontruth2());
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:397:42: required from ‘void boost::graph::detail::depth_first_search_impl<Graph>::operator()(const Graph&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<boost::graph::keywords::tag::visitor, const boost::detail::components_recorder<int*> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; Graph = R_adjacency_list<boost::undirectedS, double>]’
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)]);
| ~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/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 = R_adjacency_list<boost::undirectedS, double>; ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<keywords::tag::visitor, const boost::detail::components_recorder<int*> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; typename boost::result_of<detail::depth_first_search_impl<Param0>(Param0, const ArgPack&)>::type = void]’
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); \
| ~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/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 = R_adjacency_list<undirectedS, double>; P = detail::components_recorder<int*>; T = graph_visitor_t; R = no_property; typename result_of<graph::detail::depth_first_search_impl<Param0>(Param0, const typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<T, Tag, Base> >::type&)>::type = void; typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<T, Tag, Base> >::type = parameter::aux::arg_list<parameter::aux::tagged_argument<graph::keywords::tag::visitor, const detail::components_recorder<int*> >, parameter::aux::empty_arg_list, std::integral_constant<bool, true> >]’
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); \
| ~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/connected_components.hpp:106:23: required from ‘typename boost::property_traits<IndexMap>::value_type boost::connected_components(const Graph&, ComponentMap, typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = R_adjacency_list<undirectedS, double>; ComponentMap = int*; typename property_traits<IndexMap>::value_type = int; typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits<Graph>::traversal_category = undir_adj_list_traversal_tag]’
106 | depth_first_search(g, visitor(vis));
| ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~
interfaces.cpp:205:29: required from here
205 | connected_components(g, &component[0]);
| ~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
20 | ~usage_requirements() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::concepts::IncidenceGraph<G>::~IncidenceGraph() [with G = R_adjacency_list<boost::undirectedS, double>]’
37 | ~model()
| ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:87:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
87 | BOOST_CONCEPT_USAGE(IncidenceGraph)
| ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::constraint<Model>::failed() [with Model = boost::ReadWritePropertyMapConcept<int*, long unsigned int>]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/strong_components.hpp:115:9: required from ‘typename boost::property_traits<IndexMap>::value_type boost::detail::strong_components_impl(const Graph&, ComponentMap, RootMap, DiscoverTime, const boost::bgl_named_params<P, T, R>&) [with Graph = R_adjacency_list<boost::directedS, double>; ComponentMap = int*; RootMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; DiscoverTime = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; P = int; T = int; R = boost::no_property; typename boost::property_traits<IndexMap>::value_type = int]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/strong_components.hpp:162:42: required from ‘static typename boost::property_traits<IndexMap>::value_type boost::detail::strong_comp_dispatch2<boost::param_not_found>::apply(const Graph&, ComponentMap, RootMap, const boost::bgl_named_params<P, T, R>&, boost::param_not_found) [with Graph = R_adjacency_list<boost::directedS, double>; ComponentMap = int*; RootMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; P = int; T = int; R = boost::no_property; typename boost::property_traits<IndexMap>::value_type = int]’
162 | return strong_components_impl(g, comp, r_map,
| ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~
163 | make_iterator_property_map(time_vec.begin(),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
164 | choose_const_pmap(
| ~~~~~~~~~~~~~~~~~~
165 | get_param(params, vertex_index), g, vertex_index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
166 | time_vec[0]),
| ~~~~~~~~~~~~~
167 | params);
| ~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/strong_components.hpp:177:63: required from ‘typename boost::property_traits<IndexMap>::value_type boost::detail::scc_helper2(const Graph&, ComponentMap, RootMap, const boost::bgl_named_params<P, T, R>&, DiscoverTimeMap) [with Graph = R_adjacency_list<boost::directedS, double>; ComponentMap = int*; RootMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; P = int; T = int; R = boost::no_property; DiscoverTimeMap = boost::param_not_found; typename boost::property_traits<IndexMap>::value_type = int]’
177 | return strong_comp_dispatch2< DiscoverTimeMap >::apply(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
178 | g, comp, r_map, params, time_map);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/strong_components.hpp:205:31: required from ‘static typename boost::property_traits<IndexMap>::value_type boost::detail::strong_comp_dispatch1<boost::param_not_found>::apply(const Graph&, ComponentMap, const boost::bgl_named_params<P, T, R>&, boost::param_not_found) [with Graph = R_adjacency_list<boost::directedS, double>; ComponentMap = int*; P = int; T = int; R = boost::no_property; typename boost::property_traits<IndexMap>::value_type = int]’
205 | return scc_helper2(g, comp,
| ~~~~~~~~~~~^~~~~~~~~
206 | make_iterator_property_map(root_vec.begin(),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
207 | choose_const_pmap(
| ~~~~~~~~~~~~~~~~~~
208 | get_param(params, vertex_index), g, vertex_index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
209 | root_vec[0]),
| ~~~~~~~~~~~~~
210 | params, get_param(params, vertex_discover_time));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/strong_components.hpp:220:63: required from ‘typename boost::property_traits<IndexMap>::value_type boost::detail::scc_helper1(const Graph&, ComponentMap, const boost::bgl_named_params<P, T, R>&, RootMap) [with Graph = R_adjacency_list<boost::directedS, double>; ComponentMap = int*; RootMap = boost::param_not_found; P = int; T = int; R = boost::no_property; typename boost::property_traits<IndexMap>::value_type = int]’
220 | return detail::strong_comp_dispatch1< RootMap >::apply(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
221 | g, comp, params, r_map);
| ~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/strong_components.hpp:235:31: required from ‘typename boost::property_traits<IndexMap>::value_type boost::strong_components(const Graph&, ComponentMap, const bgl_named_params<P, T, R>&, typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = R_adjacency_list<directedS, double>; ComponentMap = int*; P = int; T = int; R = no_property; typename property_traits<IndexMap>::value_type = int; typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits<Graph>::traversal_category = adj_list_dir_traversal_tag]’
235 | return detail::scc_helper1(
| ~~~~~~~~~~~~~~~~~~~^
236 | g, comp, params, get_param(params, vertex_root_t()));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/strong_components.hpp:249:29: required from ‘typename boost::property_traits<IndexMap>::value_type boost::strong_components(const Graph&, ComponentMap, typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = R_adjacency_list<directedS, double>; ComponentMap = int*; typename property_traits<IndexMap>::value_type = int; typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits<Graph>::traversal_category = adj_list_dir_traversal_tag]’
249 | return strong_components(g, comp, params);
| ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~
interfaces.cpp:232:26: required from here
232 | strong_components(g, &component[0]);
| ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:65:52: warning: ‘this’ pointer is null [-Wnonnull]
65 | static void failed() { ((Model*)0)->constraints(); }
| ~~~~~~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/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 = int*; Key = long unsigned int]’
205 | void constraints() {
| ^~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Convertible<long unsigned int, long unsigned int> >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible<long unsigned int, long unsigned int>’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:206:3: required from ‘struct boost::ConvertibleConcept<long unsigned int, long unsigned int>’
206 | BOOST_concept(Convertible,(X)(Y))
| ^~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::ConvertibleConcept<long unsigned int, long unsigned int>]’
32 | inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
| ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied<boost::ConvertibleConcept<long unsigned int, long unsigned int> >::value’
44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied<boost::ConvertibleConcept<long unsigned int, long unsigned int> >’
45 | typedef boost::integral_constant<bool, value> type;
| ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/strong_components.hpp:177:63: required from ‘typename boost::property_traits<IndexMap>::value_type boost::detail::scc_helper2(const Graph&, ComponentMap, RootMap, const boost::bgl_named_params<P, T, R>&, DiscoverTimeMap) [with Graph = R_adjacency_list<boost::directedS, double>; ComponentMap = int*; RootMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; P = int; T = int; R = boost::no_property; DiscoverTimeMap = boost::param_not_found; typename boost::property_traits<IndexMap>::value_type = int]’
177 | return strong_comp_dispatch2< DiscoverTimeMap >::apply(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
178 | g, comp, r_map, params, time_map);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/strong_components.hpp:205:31: required from ‘static typename boost::property_traits<IndexMap>::value_type boost::detail::strong_comp_dispatch1<boost::param_not_found>::apply(const Graph&, ComponentMap, const boost::bgl_named_params<P, T, R>&, boost::param_not_found) [with Graph = R_adjacency_list<boost::directedS, double>; ComponentMap = int*; P = int; T = int; R = boost::no_property; typename boost::property_traits<IndexMap>::value_type = int]’
205 | return scc_helper2(g, comp,
| ~~~~~~~~~~~^~~~~~~~~
206 | make_iterator_property_map(root_vec.begin(),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
207 | choose_const_pmap(
| ~~~~~~~~~~~~~~~~~~
208 | get_param(params, vertex_index), g, vertex_index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
209 | root_vec[0]),
| ~~~~~~~~~~~~~
210 | params, get_param(params, vertex_discover_time));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/strong_components.hpp:220:63: required from ‘typename boost::property_traits<IndexMap>::value_type boost::detail::scc_helper1(const Graph&, ComponentMap, const boost::bgl_named_params<P, T, R>&, RootMap) [with Graph = R_adjacency_list<boost::directedS, double>; ComponentMap = int*; RootMap = boost::param_not_found; P = int; T = int; R = boost::no_property; typename boost::property_traits<IndexMap>::value_type = int]’
220 | return detail::strong_comp_dispatch1< RootMap >::apply(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
221 | g, comp, params, r_map);
| ~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/strong_components.hpp:235:31: required from ‘typename boost::property_traits<IndexMap>::value_type boost::strong_components(const Graph&, ComponentMap, const bgl_named_params<P, T, R>&, typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = R_adjacency_list<directedS, double>; ComponentMap = int*; P = int; T = int; R = no_property; typename property_traits<IndexMap>::value_type = int; typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits<Graph>::traversal_category = adj_list_dir_traversal_tag]’
235 | return detail::scc_helper1(
| ~~~~~~~~~~~~~~~~~~~^
236 | g, comp, params, get_param(params, vertex_root_t()));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/strong_components.hpp:249:29: required from ‘typename boost::property_traits<IndexMap>::value_type boost::strong_components(const Graph&, ComponentMap, typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = R_adjacency_list<directedS, double>; ComponentMap = int*; typename property_traits<IndexMap>::value_type = int; typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits<Graph>::traversal_category = adj_list_dir_traversal_tag]’
249 | return strong_components(g, comp, params);
| ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~
interfaces.cpp:232:26: required from here
232 | strong_components(g, &component[0]);
| ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Convertible<long unsigned int, long unsigned int>]’
20 | ~usage_requirements() { ((Model*)0)->~Model(); }
| ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::ConvertibleConcept<long unsigned int, long unsigned int>]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/strong_components.hpp:119:9: required from ‘typename boost::property_traits<IndexMap>::value_type boost::detail::strong_components_impl(const Graph&, ComponentMap, RootMap, DiscoverTime, const boost::bgl_named_params<P, T, R>&) [with Graph = R_adjacency_list<boost::directedS, double>; ComponentMap = int*; RootMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; DiscoverTime = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; P = int; T = int; R = boost::no_property; typename boost::property_traits<IndexMap>::value_type = int]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/strong_components.hpp:162:42: required from ‘static typename boost::property_traits<IndexMap>::value_type boost::detail::strong_comp_dispatch2<boost::param_not_found>::apply(const Graph&, ComponentMap, RootMap, const boost::bgl_named_params<P, T, R>&, boost::param_not_found) [with Graph = R_adjacency_list<boost::directedS, double>; ComponentMap = int*; RootMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; P = int; T = int; R = boost::no_property; typename boost::property_traits<IndexMap>::value_type = int]’
162 | return strong_components_impl(g, comp, r_map,
| ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~
163 | make_iterator_property_map(time_vec.begin(),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
164 | choose_const_pmap(
| ~~~~~~~~~~~~~~~~~~
165 | get_param(params, vertex_index), g, vertex_index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
166 | time_vec[0]),
| ~~~~~~~~~~~~~
167 | params);
| ~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/strong_components.hpp:177:63: required from ‘typename boost::property_traits<IndexMap>::value_type boost::detail::scc_helper2(const Graph&, ComponentMap, RootMap, const boost::bgl_named_params<P, T, R>&, DiscoverTimeMap) [with Graph = R_adjacency_list<boost::directedS, double>; ComponentMap = int*; RootMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; P = int; T = int; R = boost::no_property; DiscoverTimeMap = boost::param_not_found; typename boost::property_traits<IndexMap>::value_type = int]’
177 | return strong_comp_dispatch2< DiscoverTimeMap >::apply(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
178 | g, comp, r_map, params, time_map);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/strong_components.hpp:205:31: required from ‘static typename boost::property_traits<IndexMap>::value_type boost::detail::strong_comp_dispatch1<boost::param_not_found>::apply(const Graph&, ComponentMap, const boost::bgl_named_params<P, T, R>&, boost::param_not_found) [with Graph = R_adjacency_list<boost::directedS, double>; ComponentMap = int*; P = int; T = int; R = boost::no_property; typename boost::property_traits<IndexMap>::value_type = int]’
205 | return scc_helper2(g, comp,
| ~~~~~~~~~~~^~~~~~~~~
206 | make_iterator_property_map(root_vec.begin(),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
207 | choose_const_pmap(
| ~~~~~~~~~~~~~~~~~~
208 | get_param(params, vertex_index), g, vertex_index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
209 | root_vec[0]),
| ~~~~~~~~~~~~~
210 | params, get_param(params, vertex_discover_time));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/strong_components.hpp:220:63: required from ‘typename boost::property_traits<IndexMap>::value_type boost::detail::scc_helper1(const Graph&, ComponentMap, const boost::bgl_named_params<P, T, R>&, RootMap) [with Graph = R_adjacency_list<boost::directedS, double>; ComponentMap = int*; RootMap = boost::param_not_found; P = int; T = int; R = boost::no_property; typename boost::property_traits<IndexMap>::value_type = int]’
220 | return detail::strong_comp_dispatch1< RootMap >::apply(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
221 | g, comp, params, r_map);
| ~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/strong_components.hpp:235:31: required from ‘typename boost::property_traits<IndexMap>::value_type boost::strong_components(const Graph&, ComponentMap, const bgl_named_params<P, T, R>&, typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = R_adjacency_list<directedS, double>; ComponentMap = int*; P = int; T = int; R = no_property; typename property_traits<IndexMap>::value_type = int; typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits<Graph>::traversal_category = adj_list_dir_traversal_tag]’
235 | return detail::scc_helper1(
| ~~~~~~~~~~~~~~~~~~~^
236 | g, comp, params, get_param(params, vertex_root_t()));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/strong_components.hpp:249:29: required from ‘typename boost::property_traits<IndexMap>::value_type boost::strong_components(const Graph&, ComponentMap, typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = R_adjacency_list<directedS, double>; ComponentMap = int*; typename property_traits<IndexMap>::value_type = int; typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits<Graph>::traversal_category = adj_list_dir_traversal_tag]’
249 | return strong_components(g, comp, params);
| ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~
interfaces.cpp:232:26: required from here
232 | strong_components(g, &component[0]);
| ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:206:17: note: in a call to non-static member function ‘boost::ConvertibleConcept<long unsigned int, long unsigned int>::~ConvertibleConcept()’
206 | BOOST_concept(Convertible,(X)(Y))
| ^~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/preprocessor/cat.hpp:29:34: note: in definition of macro ‘BOOST_PP_CAT_I’
29 | # define BOOST_PP_CAT_I(a, b) a ## b
| ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/concept_def.hpp:23:12: note: in expansion of macro ‘BOOST_PP_CAT’
23 | struct BOOST_PP_CAT(name,Concept) \
| ^~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:206:3: note: in expansion of macro ‘BOOST_concept’
206 | BOOST_concept(Convertible,(X)(Y))
| ^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/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::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/biconnected_components.hpp:190:9: required from ‘std::pair<long unsigned int, OutputIterator> boost::detail::biconnected_components_impl(const Graph&, ComponentMap, OutputIterator, VertexIndexMap, DiscoverTimeMap, LowPointMap, PredecessorMap, DFSVisitor) [with Graph = R_adjacency_list<boost::undirectedS, double>; ComponentMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>; OutputIterator = boost::graph_detail::dummy_output_iterator; VertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>; DiscoverTimeMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; LowPointMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; PredecessorMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; DFSVisitor = boost::dfs_visitor<>]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/biconnected_components.hpp:250:47: required from ‘static std::pair<long unsigned int, OutputIterator> boost::detail::bicomp_dispatch3<boost::param_not_found>::apply(const Graph&, ComponentMap, OutputIterator, VertexIndexMap, DiscoverTimeMap, LowPointMap, const boost::bgl_named_params<P, T, R>&, boost::param_not_found) [with Graph = R_adjacency_list<boost::undirectedS, double>; ComponentMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>; OutputIterator = boost::graph_detail::dummy_output_iterator; VertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>; DiscoverTimeMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; LowPointMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; P = int; T = boost::buffer_param_t; R = boost::no_property]’
250 | return biconnected_components_impl(g, comp, out, index_map, dtm,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
251 | lowpt,
| ~~~~~~
252 | make_iterator_property_map(pred.begin(), index_map, vert),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
253 | choose_param(get_param(params, graph_visitor),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
254 | make_dfs_visitor(null_visitor())));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/biconnected_components.hpp:295:60: required from ‘static std::pair<long unsigned int, OutputIterator> boost::detail::bicomp_dispatch2<boost::param_not_found>::apply(const Graph&, ComponentMap, OutputIterator, VertexIndexMap, DiscoverTimeMap, const boost::bgl_named_params<P, T, R>&, boost::param_not_found) [with Graph = R_adjacency_list<boost::undirectedS, double>; ComponentMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>; OutputIterator = boost::graph_detail::dummy_output_iterator; VertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>; DiscoverTimeMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; P = int; T = boost::buffer_param_t; R = boost::no_property]’
295 | return bicomp_dispatch3< dispatch_type >::apply(g, comp, out,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
296 | index_map, dtm,
| ~~~~~~~~~~~~~~~
297 | make_iterator_property_map(lowpt.begin(), index_map, vst),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
298 | params, get_param(params, vertex_predecessor));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/biconnected_components.hpp:336:60: required from ‘static std::pair<long unsigned int, OutputIterator> boost::detail::bicomp_dispatch1<boost::param_not_found>::apply(const Graph&, ComponentMap, OutputIterator, VertexIndexMap, const boost::bgl_named_params<P, T, R>&, boost::param_not_found) [with Graph = R_adjacency_list<boost::undirectedS, double>; ComponentMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>; OutputIterator = boost::graph_detail::dummy_output_iterator; VertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>; P = int; T = boost::buffer_param_t; R = boost::no_property]’
336 | return bicomp_dispatch2< dispatch_type >::apply(g, comp, out,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
337 | index_map,
| ~~~~~~~~~~
338 | make_iterator_property_map(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~
339 | discover_time.begin(), index_map, vst),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
340 | params, get_param(params, vertex_lowpoint));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/biconnected_components.hpp:368:60: required from ‘std::pair<long unsigned int, OutputIterator> boost::biconnected_components(const Graph&, ComponentMap, OutputIterator, const bgl_named_params<P, T, R>&) [with Graph = R_adjacency_list<undirectedS, double>; ComponentMap = adj_list_edge_property_map<undirected_tag, double, double&, long unsigned int, property<edge_weight_t, double, no_property>, edge_weight_t>; OutputIterator = graph_detail::dummy_output_iterator; P = int; T = buffer_param_t; R = no_property]’
368 | return detail::bicomp_dispatch1< dispatch_type >::apply(g, comp, out,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
369 | choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
370 | params, get_param(params, vertex_discover_time));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/biconnected_components.hpp:377:34: required from ‘std::pair<long unsigned int, OutputIterator> boost::biconnected_components(const Graph&, ComponentMap, OutputIterator) [with Graph = R_adjacency_list<undirectedS, double>; ComponentMap = adj_list_edge_property_map<undirected_tag, double, double&, long unsigned int, property<edge_weight_t, double, no_property>, edge_weight_t>; OutputIterator = graph_detail::dummy_output_iterator]’
377 | return biconnected_components(
| ~~~~~~~~~~~~~~~~~~~~~~^
378 | g, comp, out, bgl_named_params< int, buffer_param_t >(0));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/biconnected_components.hpp:417:34: required from ‘std::size_t boost::biconnected_components(const Graph&, ComponentMap) [with Graph = R_adjacency_list<undirectedS, double>; ComponentMap = adj_list_edge_property_map<undirected_tag, double, double&, long unsigned int, property<edge_weight_t, double, no_property>, edge_weight_t>; std::size_t = long unsigned int]’
417 | return biconnected_components(
| ~~~~~~~~~~~~~~~~~~~~~~^
418 | g, comp, graph_detail::dummy_output_iterator())
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
interfaces.cpp:264:47: required from here
264 | int num_comps = biconnected_components(g, component);
| ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:65:52: warning: ‘this’ pointer is null [-Wnonnull]
65 | static void failed() { ((Model*)0)->constraints(); }
| ~~~~~~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/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::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>; Key = boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>]’
179 | void constraints() {
| ^~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::concepts::VertexListGraph<R_adjacency_list<boost::undirectedS, double> >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/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<R_adjacency_list<boost::undirectedS, double> > >]’
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:182:5: required from ‘struct boost::concepts::VertexListGraph<R_adjacency_list<boost::undirectedS, double> >’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:176:1: required from ‘struct boost::concepts::VertexListGraphConcept<R_adjacency_list<boost::undirectedS, double> >’
176 | BOOST_concept(VertexListGraph, (G)) : Graph< G >
| ^~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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<R_adjacency_list<boost::undirectedS, double> >]’
32 | inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
| ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied<boost::concepts::VertexListGraphConcept<R_adjacency_list<boost::undirectedS, double> > >::value’
44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/biconnected_components.hpp:250:47: required from ‘static std::pair<long unsigned int, OutputIterator> boost::detail::bicomp_dispatch3<boost::param_not_found>::apply(const Graph&, ComponentMap, OutputIterator, VertexIndexMap, DiscoverTimeMap, LowPointMap, const boost::bgl_named_params<P, T, R>&, boost::param_not_found) [with Graph = R_adjacency_list<boost::undirectedS, double>; ComponentMap = boost::dummy_property_map; OutputIterator = std::back_insert_iterator<std::vector<long unsigned int> >; VertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>; DiscoverTimeMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; LowPointMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; P = int; T = boost::buffer_param_t; R = boost::no_property]’
250 | return biconnected_components_impl(g, comp, out, index_map, dtm,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
251 | lowpt,
| ~~~~~~
252 | make_iterator_property_map(pred.begin(), index_map, vert),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
253 | choose_param(get_param(params, graph_visitor),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
254 | make_dfs_visitor(null_visitor())));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/biconnected_components.hpp:295:60: required from ‘static std::pair<long unsigned int, OutputIterator> boost::detail::bicomp_dispatch2<boost::param_not_found>::apply(const Graph&, ComponentMap, OutputIterator, VertexIndexMap, DiscoverTimeMap, const boost::bgl_named_params<P, T, R>&, boost::param_not_found) [with Graph = R_adjacency_list<boost::undirectedS, double>; ComponentMap = boost::dummy_property_map; OutputIterator = std::back_insert_iterator<std::vector<long unsigned int> >; VertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>; DiscoverTimeMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; P = int; T = boost::buffer_param_t; R = boost::no_property]’
295 | return bicomp_dispatch3< dispatch_type >::apply(g, comp, out,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
296 | index_map, dtm,
| ~~~~~~~~~~~~~~~
297 | make_iterator_property_map(lowpt.begin(), index_map, vst),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
298 | params, get_param(params, vertex_predecessor));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/biconnected_components.hpp:336:60: required from ‘static std::pair<long unsigned int, OutputIterator> boost::detail::bicomp_dispatch1<boost::param_not_found>::apply(const Graph&, ComponentMap, OutputIterator, VertexIndexMap, const boost::bgl_named_params<P, T, R>&, boost::param_not_found) [with Graph = R_adjacency_list<boost::undirectedS, double>; ComponentMap = boost::dummy_property_map; OutputIterator = std::back_insert_iterator<std::vector<long unsigned int> >; VertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>; P = int; T = boost::buffer_param_t; R = boost::no_property]’
336 | return bicomp_dispatch2< dispatch_type >::apply(g, comp, out,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
337 | index_map,
| ~~~~~~~~~~
338 | make_iterator_property_map(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~
339 | discover_time.begin(), index_map, vst),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
340 | params, get_param(params, vertex_lowpoint));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/biconnected_components.hpp:368:60: required from ‘std::pair<long unsigned int, OutputIterator> boost::biconnected_components(const Graph&, ComponentMap, OutputIterator, const bgl_named_params<P, T, R>&) [with Graph = R_adjacency_list<undirectedS, double>; ComponentMap = dummy_property_map; OutputIterator = std::back_insert_iterator<std::vector<long unsigned int> >; P = int; T = buffer_param_t; R = no_property]’
368 | return detail::bicomp_dispatch1< dispatch_type >::apply(g, comp, out,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
369 | choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
370 | params, get_param(params, vertex_discover_time));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/biconnected_components.hpp:433:34: required from ‘OutputIterator boost::articulation_points(const Graph&, OutputIterator) [with Graph = R_adjacency_list<undirectedS, double>; OutputIterator = std::back_insert_iterator<std::vector<long unsigned int> >]’
433 | return biconnected_components(g, dummy_property_map(), out,
| ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
434 | bgl_named_params< int, buffer_param_t >(0))
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
interfaces.cpp:300:28: required from here
300 | articulation_points(g, std::back_inserter(art_points));
| ~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
20 | ~usage_requirements() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::concepts::VertexListGraph<G>::~VertexListGraph() [with G = R_adjacency_list<boost::undirectedS, double>]’
37 | ~model()
| ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:182:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
182 | BOOST_CONCEPT_USAGE(VertexListGraph)
| ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Convertible<boost::read_write_property_map_tag, boost::writable_property_map_tag> >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible<boost::read_write_property_map_tag, boost::writable_property_map_tag>’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:206:3: required from ‘struct boost::ConvertibleConcept<boost::read_write_property_map_tag, boost::writable_property_map_tag>’
206 | BOOST_concept(Convertible,(X)(Y))
| ^~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::ConvertibleConcept<boost::read_write_property_map_tag, boost::writable_property_map_tag>]’
32 | inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
| ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied<boost::ConvertibleConcept<boost::read_write_property_map_tag, boost::writable_property_map_tag> >::value’
44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied<boost::ConvertibleConcept<boost::read_write_property_map_tag, boost::writable_property_map_tag> >’
45 | typedef boost::integral_constant<bool, value> type;
| ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 7 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/biconnected_components.hpp:250:47: required from ‘static std::pair<long unsigned int, OutputIterator> boost::detail::bicomp_dispatch3<boost::param_not_found>::apply(const Graph&, ComponentMap, OutputIterator, VertexIndexMap, DiscoverTimeMap, LowPointMap, const boost::bgl_named_params<P, T, R>&, boost::param_not_found) [with Graph = R_adjacency_list<boost::undirectedS, double>; ComponentMap = boost::dummy_property_map; OutputIterator = std::back_insert_iterator<std::vector<long unsigned int> >; VertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>; DiscoverTimeMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; LowPointMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; P = int; T = boost::buffer_param_t; R = boost::no_property]’
250 | return biconnected_components_impl(g, comp, out, index_map, dtm,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
251 | lowpt,
| ~~~~~~
252 | make_iterator_property_map(pred.begin(), index_map, vert),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
253 | choose_param(get_param(params, graph_visitor),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
254 | make_dfs_visitor(null_visitor())));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/biconnected_components.hpp:295:60: required from ‘static std::pair<long unsigned int, OutputIterator> boost::detail::bicomp_dispatch2<boost::param_not_found>::apply(const Graph&, ComponentMap, OutputIterator, VertexIndexMap, DiscoverTimeMap, const boost::bgl_named_params<P, T, R>&, boost::param_not_found) [with Graph = R_adjacency_list<boost::undirectedS, double>; ComponentMap = boost::dummy_property_map; OutputIterator = std::back_insert_iterator<std::vector<long unsigned int> >; VertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>; DiscoverTimeMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; P = int; T = boost::buffer_param_t; R = boost::no_property]’
295 | return bicomp_dispatch3< dispatch_type >::apply(g, comp, out,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
296 | index_map, dtm,
| ~~~~~~~~~~~~~~~
297 | make_iterator_property_map(lowpt.begin(), index_map, vst),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
298 | params, get_param(params, vertex_predecessor));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/biconnected_components.hpp:336:60: required from ‘static std::pair<long unsigned int, OutputIterator> boost::detail::bicomp_dispatch1<boost::param_not_found>::apply(const Graph&, ComponentMap, OutputIterator, VertexIndexMap, const boost::bgl_named_params<P, T, R>&, boost::param_not_found) [with Graph = R_adjacency_list<boost::undirectedS, double>; ComponentMap = boost::dummy_property_map; OutputIterator = std::back_insert_iterator<std::vector<long unsigned int> >; VertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>; P = int; T = boost::buffer_param_t; R = boost::no_property]’
336 | return bicomp_dispatch2< dispatch_type >::apply(g, comp, out,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
337 | index_map,
| ~~~~~~~~~~
338 | make_iterator_property_map(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~
339 | discover_time.begin(), index_map, vst),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
340 | params, get_param(params, vertex_lowpoint));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/biconnected_components.hpp:368:60: required from ‘std::pair<long unsigned int, OutputIterator> boost::biconnected_components(const Graph&, ComponentMap, OutputIterator, const bgl_named_params<P, T, R>&) [with Graph = R_adjacency_list<undirectedS, double>; ComponentMap = dummy_property_map; OutputIterator = std::back_insert_iterator<std::vector<long unsigned int> >; P = int; T = buffer_param_t; R = no_property]’
368 | return detail::bicomp_dispatch1< dispatch_type >::apply(g, comp, out,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
369 | choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
370 | params, get_param(params, vertex_discover_time));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/biconnected_components.hpp:433:34: required from ‘OutputIterator boost::articulation_points(const Graph&, OutputIterator) [with Graph = R_adjacency_list<undirectedS, double>; OutputIterator = std::back_insert_iterator<std::vector<long unsigned int> >]’
433 | return biconnected_components(g, dummy_property_map(), out,
| ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
434 | bgl_named_params< int, buffer_param_t >(0))
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
interfaces.cpp:300:28: required from here
300 | articulation_points(g, std::back_inserter(art_points));
| ~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Convertible<boost::read_write_property_map_tag, boost::writable_property_map_tag>]’
20 | ~usage_requirements() { ((Model*)0)->~Model(); }
| ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::ConvertibleConcept<boost::read_write_property_map_tag, boost::writable_property_map_tag>]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:180:7: required from ‘void boost::WritablePropertyMapConcept<PMap, Key>::constraints() [with PMap = boost::dummy_property_map; Key = boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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::dummy_property_map, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> >]’
32 | inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
| ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied<boost::WritablePropertyMapConcept<boost::dummy_property_map, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >::value’
44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied<boost::WritablePropertyMapConcept<boost::dummy_property_map, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >’
45 | typedef boost::integral_constant<bool, value> type;
| ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/biconnected_components.hpp:250:47: required from ‘static std::pair<long unsigned int, OutputIterator> boost::detail::bicomp_dispatch3<boost::param_not_found>::apply(const Graph&, ComponentMap, OutputIterator, VertexIndexMap, DiscoverTimeMap, LowPointMap, const boost::bgl_named_params<P, T, R>&, boost::param_not_found) [with Graph = R_adjacency_list<boost::undirectedS, double>; ComponentMap = boost::dummy_property_map; OutputIterator = std::back_insert_iterator<std::vector<long unsigned int> >; VertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>; DiscoverTimeMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; LowPointMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; P = int; T = boost::buffer_param_t; R = boost::no_property]’
250 | return biconnected_components_impl(g, comp, out, index_map, dtm,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
251 | lowpt,
| ~~~~~~
252 | make_iterator_property_map(pred.begin(), index_map, vert),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
253 | choose_param(get_param(params, graph_visitor),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
254 | make_dfs_visitor(null_visitor())));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/biconnected_components.hpp:295:60: required from ‘static std::pair<long unsigned int, OutputIterator> boost::detail::bicomp_dispatch2<boost::param_not_found>::apply(const Graph&, ComponentMap, OutputIterator, VertexIndexMap, DiscoverTimeMap, const boost::bgl_named_params<P, T, R>&, boost::param_not_found) [with Graph = R_adjacency_list<boost::undirectedS, double>; ComponentMap = boost::dummy_property_map; OutputIterator = std::back_insert_iterator<std::vector<long unsigned int> >; VertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>; DiscoverTimeMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; P = int; T = boost::buffer_param_t; R = boost::no_property]’
295 | return bicomp_dispatch3< dispatch_type >::apply(g, comp, out,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
296 | index_map, dtm,
| ~~~~~~~~~~~~~~~
297 | make_iterator_property_map(lowpt.begin(), index_map, vst),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
298 | params, get_param(params, vertex_predecessor));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/biconnected_components.hpp:336:60: required from ‘static std::pair<long unsigned int, OutputIterator> boost::detail::bicomp_dispatch1<boost::param_not_found>::apply(const Graph&, ComponentMap, OutputIterator, VertexIndexMap, const boost::bgl_named_params<P, T, R>&, boost::param_not_found) [with Graph = R_adjacency_list<boost::undirectedS, double>; ComponentMap = boost::dummy_property_map; OutputIterator = std::back_insert_iterator<std::vector<long unsigned int> >; VertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>; P = int; T = boost::buffer_param_t; R = boost::no_property]’
336 | return bicomp_dispatch2< dispatch_type >::apply(g, comp, out,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
337 | index_map,
| ~~~~~~~~~~
338 | make_iterator_property_map(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~
339 | discover_time.begin(), index_map, vst),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
340 | params, get_param(params, vertex_lowpoint));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/biconnected_components.hpp:368:60: required from ‘std::pair<long unsigned int, OutputIterator> boost::biconnected_components(const Graph&, ComponentMap, OutputIterator, const bgl_named_params<P, T, R>&) [with Graph = R_adjacency_list<undirectedS, double>; ComponentMap = dummy_property_map; OutputIterator = std::back_insert_iterator<std::vector<long unsigned int> >; P = int; T = buffer_param_t; R = no_property]’
368 | return detail::bicomp_dispatch1< dispatch_type >::apply(g, comp, out,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
369 | choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
370 | params, get_param(params, vertex_discover_time));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/biconnected_components.hpp:433:34: required from ‘OutputIterator boost::articulation_points(const Graph&, OutputIterator) [with Graph = R_adjacency_list<undirectedS, double>; OutputIterator = std::back_insert_iterator<std::vector<long unsigned int> >]’
433 | return biconnected_components(g, dummy_property_map(), out,
| ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
434 | bgl_named_params< int, buffer_param_t >(0))
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
interfaces.cpp:300:28: required from here
300 | articulation_points(g, std::back_inserter(art_points));
| ~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:206:17: note: in a call to non-static member function ‘boost::ConvertibleConcept<boost::read_write_property_map_tag, boost::writable_property_map_tag>::~ConvertibleConcept()’
206 | BOOST_concept(Convertible,(X)(Y))
| ^~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/preprocessor/cat.hpp:29:34: note: in definition of macro ‘BOOST_PP_CAT_I’
29 | # define BOOST_PP_CAT_I(a, b) a ## b
| ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/concept_def.hpp:23:12: note: in expansion of macro ‘BOOST_PP_CAT’
23 | struct BOOST_PP_CAT(name,Concept) \
| ^~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:206:3: note: in expansion of macro ‘BOOST_concept’
206 | BOOST_concept(Convertible,(X)(Y))
| ^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::constraint<Model>::failed() [with Model = boost::ReadablePropertyMapConcept<boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>, long unsigned int>]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:206:7: required from ‘void boost::ReadWritePropertyMapConcept<PMap, Key>::constraints() [with PMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; Key = long unsigned int]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::ReadWritePropertyMapConcept<boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>, long unsigned int>]’
32 | inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
| ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied<boost::ReadWritePropertyMapConcept<boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>, long unsigned int> >::value’
44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied<boost::ReadWritePropertyMapConcept<boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>, long unsigned int> >’
45 | typedef boost::integral_constant<bool, value> type;
| ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/biconnected_components.hpp:250:47: required from ‘static std::pair<long unsigned int, OutputIterator> boost::detail::bicomp_dispatch3<boost::param_not_found>::apply(const Graph&, ComponentMap, OutputIterator, VertexIndexMap, DiscoverTimeMap, LowPointMap, const boost::bgl_named_params<P, T, R>&, boost::param_not_found) [with Graph = R_adjacency_list<boost::undirectedS, double>; ComponentMap = boost::dummy_property_map; OutputIterator = std::back_insert_iterator<std::vector<long unsigned int> >; VertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>; DiscoverTimeMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; LowPointMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; P = int; T = boost::buffer_param_t; R = boost::no_property]’
250 | return biconnected_components_impl(g, comp, out, index_map, dtm,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
251 | lowpt,
| ~~~~~~
252 | make_iterator_property_map(pred.begin(), index_map, vert),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
253 | choose_param(get_param(params, graph_visitor),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
254 | make_dfs_visitor(null_visitor())));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/biconnected_components.hpp:295:60: required from ‘static std::pair<long unsigned int, OutputIterator> boost::detail::bicomp_dispatch2<boost::param_not_found>::apply(const Graph&, ComponentMap, OutputIterator, VertexIndexMap, DiscoverTimeMap, const boost::bgl_named_params<P, T, R>&, boost::param_not_found) [with Graph = R_adjacency_list<boost::undirectedS, double>; ComponentMap = boost::dummy_property_map; OutputIterator = std::back_insert_iterator<std::vector<long unsigned int> >; VertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>; DiscoverTimeMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; P = int; T = boost::buffer_param_t; R = boost::no_property]’
295 | return bicomp_dispatch3< dispatch_type >::apply(g, comp, out,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
296 | index_map, dtm,
| ~~~~~~~~~~~~~~~
297 | make_iterator_property_map(lowpt.begin(), index_map, vst),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
298 | params, get_param(params, vertex_predecessor));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/biconnected_components.hpp:336:60: required from ‘static std::pair<long unsigned int, OutputIterator> boost::detail::bicomp_dispatch1<boost::param_not_found>::apply(const Graph&, ComponentMap, OutputIterator, VertexIndexMap, const boost::bgl_named_params<P, T, R>&, boost::param_not_found) [with Graph = R_adjacency_list<boost::undirectedS, double>; ComponentMap = boost::dummy_property_map; OutputIterator = std::back_insert_iterator<std::vector<long unsigned int> >; VertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>; P = int; T = boost::buffer_param_t; R = boost::no_property]’
336 | return bicomp_dispatch2< dispatch_type >::apply(g, comp, out,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
337 | index_map,
| ~~~~~~~~~~
338 | make_iterator_property_map(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~
339 | discover_time.begin(), index_map, vst),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
340 | params, get_param(params, vertex_lowpoint));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/biconnected_components.hpp:368:60: required from ‘std::pair<long unsigned int, OutputIterator> boost::biconnected_components(const Graph&, ComponentMap, OutputIterator, const bgl_named_params<P, T, R>&) [with Graph = R_adjacency_list<undirectedS, double>; ComponentMap = dummy_property_map; OutputIterator = std::back_insert_iterator<std::vector<long unsigned int> >; P = int; T = buffer_param_t; R = no_property]’
368 | return detail::bicomp_dispatch1< dispatch_type >::apply(g, comp, out,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
369 | choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
370 | params, get_param(params, vertex_discover_time));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/biconnected_components.hpp:433:34: required from ‘OutputIterator boost::articulation_points(const Graph&, OutputIterator) [with Graph = R_adjacency_list<undirectedS, double>; OutputIterator = std::back_insert_iterator<std::vector<long unsigned int> >]’
433 | return biconnected_components(g, dummy_property_map(), out,
| ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
434 | bgl_named_params< int, buffer_param_t >(0))
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
interfaces.cpp:300:28: required from here
300 | articulation_points(g, std::back_inserter(art_points));
| ~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:65:52: warning: ‘this’ pointer is null [-Wnonnull]
65 | static void failed() { ((Model*)0)->constraints(); }
| ~~~~~~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:147:10: note: in a call to non-static member function ‘void boost::ReadablePropertyMapConcept<PMap, Key>::constraints() [with PMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; Key = long unsigned int]’
147 | void constraints() {
| ^~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::constraint<Model>::failed() [with Model = boost::WritablePropertyMapConcept<boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>, long unsigned int>]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:207:7: required from ‘void boost::ReadWritePropertyMapConcept<PMap, Key>::constraints() [with PMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; Key = long unsigned int]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::ReadWritePropertyMapConcept<boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>, long unsigned int>]’
32 | inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
| ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied<boost::ReadWritePropertyMapConcept<boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>, long unsigned int> >::value’
44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied<boost::ReadWritePropertyMapConcept<boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>, long unsigned int> >’
45 | typedef boost::integral_constant<bool, value> type;
| ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/biconnected_components.hpp:250:47: required from ‘static std::pair<long unsigned int, OutputIterator> boost::detail::bicomp_dispatch3<boost::param_not_found>::apply(const Graph&, ComponentMap, OutputIterator, VertexIndexMap, DiscoverTimeMap, LowPointMap, const boost::bgl_named_params<P, T, R>&, boost::param_not_found) [with Graph = R_adjacency_list<boost::undirectedS, double>; ComponentMap = boost::dummy_property_map; OutputIterator = std::back_insert_iterator<std::vector<long unsigned int> >; VertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>; DiscoverTimeMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; LowPointMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; P = int; T = boost::buffer_param_t; R = boost::no_property]’
250 | return biconnected_components_impl(g, comp, out, index_map, dtm,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
251 | lowpt,
| ~~~~~~
252 | make_iterator_property_map(pred.begin(), index_map, vert),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
253 | choose_param(get_param(params, graph_visitor),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
254 | make_dfs_visitor(null_visitor())));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/biconnected_components.hpp:295:60: required from ‘static std::pair<long unsigned int, OutputIterator> boost::detail::bicomp_dispatch2<boost::param_not_found>::apply(const Graph&, ComponentMap, OutputIterator, VertexIndexMap, DiscoverTimeMap, const boost::bgl_named_params<P, T, R>&, boost::param_not_found) [with Graph = R_adjacency_list<boost::undirectedS, double>; ComponentMap = boost::dummy_property_map; OutputIterator = std::back_insert_iterator<std::vector<long unsigned int> >; VertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>; DiscoverTimeMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; P = int; T = boost::buffer_param_t; R = boost::no_property]’
295 | return bicomp_dispatch3< dispatch_type >::apply(g, comp, out,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
296 | index_map, dtm,
| ~~~~~~~~~~~~~~~
297 | make_iterator_property_map(lowpt.begin(), index_map, vst),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
298 | params, get_param(params, vertex_predecessor));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/biconnected_components.hpp:336:60: required from ‘static std::pair<long unsigned int, OutputIterator> boost::detail::bicomp_dispatch1<boost::param_not_found>::apply(const Graph&, ComponentMap, OutputIterator, VertexIndexMap, const boost::bgl_named_params<P, T, R>&, boost::param_not_found) [with Graph = R_adjacency_list<boost::undirectedS, double>; ComponentMap = boost::dummy_property_map; OutputIterator = std::back_insert_iterator<std::vector<long unsigned int> >; VertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>; P = int; T = boost::buffer_param_t; R = boost::no_property]’
336 | return bicomp_dispatch2< dispatch_type >::apply(g, comp, out,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
337 | index_map,
| ~~~~~~~~~~
338 | make_iterator_property_map(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~
339 | discover_time.begin(), index_map, vst),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
340 | params, get_param(params, vertex_lowpoint));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/biconnected_components.hpp:368:60: required from ‘std::pair<long unsigned int, OutputIterator> boost::biconnected_components(const Graph&, ComponentMap, OutputIterator, const bgl_named_params<P, T, R>&) [with Graph = R_adjacency_list<undirectedS, double>; ComponentMap = dummy_property_map; OutputIterator = std::back_insert_iterator<std::vector<long unsigned int> >; P = int; T = buffer_param_t; R = no_property]’
368 | return detail::bicomp_dispatch1< dispatch_type >::apply(g, comp, out,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
369 | choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
370 | params, get_param(params, vertex_discover_time));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/biconnected_components.hpp:433:34: required from ‘OutputIterator boost::articulation_points(const Graph&, OutputIterator) [with Graph = R_adjacency_list<undirectedS, double>; OutputIterator = std::back_insert_iterator<std::vector<long unsigned int> >]’
433 | return biconnected_components(g, dummy_property_map(), out,
| ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
434 | bgl_named_params< int, buffer_param_t >(0))
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
interfaces.cpp:300:28: required from here
300 | articulation_points(g, std::back_inserter(art_points));
| ~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:65:52: warning: ‘this’ pointer is null [-Wnonnull]
65 | static void failed() { ((Model*)0)->constraints(); }
| ~~~~~~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:179:10: note: in a call to non-static member function ‘void boost::WritablePropertyMapConcept<PMap, Key>::constraints() [with PMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; Key = long unsigned int]’
179 | void constraints() {
| ^~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::concepts::MultiPassInputIterator<boost::iterators::filter_iterator<boost::detail::out_edge_predicate<boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long unsigned int, long unsigned int&, long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::no_property, boost::listS>, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long unsigned int, long unsigned int&, long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int> > > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:52:50: required from ‘struct boost::concepts::MultiPassInputIterator<boost::iterators::filter_iterator<boost::detail::out_edge_predicate<boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long unsigned int, long unsigned int&, long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::no_property, boost::listS>, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long unsigned int, long unsigned int&, long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int> > >’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::concepts::MultiPassInputIterator<boost::iterators::filter_iterator<boost::detail::out_edge_predicate<boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long unsigned int, long unsigned int&, long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::no_property, boost::listS>, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long unsigned int, long unsigned int&, long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int> > >]’
32 | inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
| ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied<boost::concepts::MultiPassInputIterator<boost::iterators::filter_iterator<boost::detail::out_edge_predicate<boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long unsigned int, long unsigned int&, long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::no_property, boost::listS>, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long unsigned int, long unsigned int&, long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int> > > >::value’
44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied<boost::concepts::MultiPassInputIterator<boost::iterators::filter_iterator<boost::detail::out_edge_predicate<boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long unsigned int, long unsigned int&, long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::no_property, boost::listS>, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long unsigned int, long unsigned int&, long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int> > > >’
45 | typedef boost::integral_constant<bool, value> type;
| ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_<void (*)(boost::concepts::MultiPassInputIterator<boost::iterators::filter_iterator<boost::detail::out_edge_predicate<boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long unsigned int, long unsigned int&, long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::no_property, boost::listS>, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long unsigned int, long unsigned int&, long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int> > >)>’
72 | struct requirement_<void(*)(Model)>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:89:9: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:129:9: required from ‘void boost::breadth_first_visit(const IncidenceGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with IncidenceGraph = filtered_graph<adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, no_property, listS>, is_residual_edge<adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_residual_capacity_t> >, keep_all>; Buffer = queue<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > >; BFSVisitor = bfs_visitor<edge_predecessor_recorder<detail::edge_desc_impl<directed_tag, long unsigned int>*, on_tree_edge> >; ColorMap = default_color_type*; SourceIterator = long unsigned int*]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:136:24: required from ‘void boost::breadth_first_search(const VertexListGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph<adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, no_property, listS>, is_residual_edge<adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_residual_capacity_t> >, keep_all>; SourceIterator = long unsigned int*; Buffer = queue<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > >; BFSVisitor = bfs_visitor<edge_predecessor_recorder<detail::edge_desc_impl<directed_tag, long unsigned int>*, on_tree_edge> >; ColorMap = default_color_type*]’
136 | breadth_first_visit(g, sources_begin, sources_end, Q, vis, color);
| ~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:147:25: required from ‘void boost::breadth_first_search(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph<adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, no_property, listS>, is_residual_edge<adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_residual_capacity_t> >, keep_all>; Buffer = queue<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > >; BFSVisitor = bfs_visitor<edge_predecessor_recorder<detail::edge_desc_impl<directed_tag, long unsigned int>*, on_tree_edge> >; ColorMap = default_color_type*; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
147 | breadth_first_search(g, sources, sources + 1, Q, vis, color);
| ~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/edmonds_karp_max_flow.hpp:101:29: required from ‘typename boost::property_traits<IndexMap>::value_type boost::edmonds_karp_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, ColorMap, PredEdgeMap) [with Graph = adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, no_property, listS>; CapacityEdgeMap = adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map<directed_tag, detail::edge_desc_impl<directed_tag, long unsigned int>, detail::edge_desc_impl<directed_tag, long unsigned int>&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_reverse_t>; ColorMap = default_color_type*; PredEdgeMap = detail::edge_desc_impl<directed_tag, long unsigned int>*; typename property_traits<IndexMap>::value_type = long unsigned int; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
101 | breadth_first_search(detail::residual_graph(g, res), src, Q,
| ~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
102 | make_bfs_visitor(record_edge_predecessors(pred, on_tree_edge())),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
103 | color);
| ~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/edge_connectivity.hpp:146:42: required from ‘typename boost::graph_traits<G>::degree_size_type boost::edge_connectivity(VertexListGraph&, OutputIterator) [with VertexListGraph = R_adjacency_list<undirectedS, double>; OutputIterator = std::back_insert_iterator<std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int> > >; typename graph_traits<G>::degree_size_type = long unsigned int]’
146 | alpha_S_k = edmonds_karp_max_flow(
| ~~~~~~~~~~~~~~~~~~~~~^
147 | flow_g, p, k, cap, res_cap, rev_edge, &color[0], &pred[0]);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
interfaces.cpp:326:34: required from here
326 | dst c = edge_connectivity( g, std::back_inserter(disconnecting_set) );
| ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::concepts::MultiPassInputIterator<boost::iterators::filter_iterator<boost::detail::out_edge_predicate<boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long unsigned int, long unsigned int&, long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::no_property, boost::listS>, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long unsigned int, long unsigned int&, long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int> > >]’
20 | ~usage_requirements() { ((Model*)0)->~Model(); }
| ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::MultiPassInputIterator<boost::iterators::filter_iterator<boost::detail::out_edge_predicate<boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long unsigned int, long unsigned int&, long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::no_property, boost::listS>, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long unsigned int, long unsigned int&, long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int> > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:89:9: required from ‘boost::concepts::IncidenceGraph<G>::~IncidenceGraph() [with G = boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::no_property, boost::listS>, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long unsigned int, long unsigned int&, long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all>]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:75:1: required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::IncidenceGraphConcept<boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::no_property, boost::listS>, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long unsigned int, long unsigned int&, long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >]’
75 | BOOST_concept(IncidenceGraph, (G)) : Graph< G >
| ^~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:129:9: required from ‘void boost::breadth_first_visit(const IncidenceGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with IncidenceGraph = filtered_graph<adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, no_property, listS>, is_residual_edge<adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_residual_capacity_t> >, keep_all>; Buffer = queue<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > >; BFSVisitor = bfs_visitor<edge_predecessor_recorder<detail::edge_desc_impl<directed_tag, long unsigned int>*, on_tree_edge> >; ColorMap = default_color_type*; SourceIterator = long unsigned int*]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:136:24: required from ‘void boost::breadth_first_search(const VertexListGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph<adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, no_property, listS>, is_residual_edge<adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_residual_capacity_t> >, keep_all>; SourceIterator = long unsigned int*; Buffer = queue<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > >; BFSVisitor = bfs_visitor<edge_predecessor_recorder<detail::edge_desc_impl<directed_tag, long unsigned int>*, on_tree_edge> >; ColorMap = default_color_type*]’
136 | breadth_first_visit(g, sources_begin, sources_end, Q, vis, color);
| ~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:147:25: required from ‘void boost::breadth_first_search(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph<adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, no_property, listS>, is_residual_edge<adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_residual_capacity_t> >, keep_all>; Buffer = queue<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > >; BFSVisitor = bfs_visitor<edge_predecessor_recorder<detail::edge_desc_impl<directed_tag, long unsigned int>*, on_tree_edge> >; ColorMap = default_color_type*; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
147 | breadth_first_search(g, sources, sources + 1, Q, vis, color);
| ~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/edmonds_karp_max_flow.hpp:101:29: required from ‘typename boost::property_traits<IndexMap>::value_type boost::edmonds_karp_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, ColorMap, PredEdgeMap) [with Graph = adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, no_property, listS>; CapacityEdgeMap = adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map<directed_tag, detail::edge_desc_impl<directed_tag, long unsigned int>, detail::edge_desc_impl<directed_tag, long unsigned int>&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_reverse_t>; ColorMap = default_color_type*; PredEdgeMap = detail::edge_desc_impl<directed_tag, long unsigned int>*; typename property_traits<IndexMap>::value_type = long unsigned int; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
101 | breadth_first_search(detail::residual_graph(g, res), src, Q,
| ~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
102 | make_bfs_visitor(record_edge_predecessors(pred, on_tree_edge())),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
103 | color);
| ~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/edge_connectivity.hpp:146:42: required from ‘typename boost::graph_traits<G>::degree_size_type boost::edge_connectivity(VertexListGraph&, OutputIterator) [with VertexListGraph = R_adjacency_list<undirectedS, double>; OutputIterator = std::back_insert_iterator<std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int> > >; typename graph_traits<G>::degree_size_type = long unsigned int]’
146 | alpha_S_k = edmonds_karp_max_flow(
| ~~~~~~~~~~~~~~~~~~~~~^
147 | flow_g, p, k, cap, res_cap, rev_edge, &color[0], &pred[0]);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
interfaces.cpp:326:34: required from here
326 | dst c = edge_connectivity( g, std::back_inserter(disconnecting_set) );
| ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::concepts::MultiPassInputIterator<T>::~MultiPassInputIterator() [with T = boost::iterators::filter_iterator<boost::detail::out_edge_predicate<boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long unsigned int, long unsigned int&, long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::no_property, boost::listS>, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long unsigned int, long unsigned int&, long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int> >]’
37 | ~model()
| ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:52:50: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
52 | BOOST_concept(MultiPassInputIterator, (T)) { BOOST_CONCEPT_USAGE(
| ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::CopyConstructible<boost::bfs_visitor<boost::edge_predecessor_recorder<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>*, boost::on_tree_edge> > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/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::bfs_visitor<boost::edge_predecessor_recorder<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>*, boost::on_tree_edge> > > >]’
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:167:5: required from ‘struct boost::CopyConstructible<boost::bfs_visitor<boost::edge_predecessor_recorder<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>*, boost::on_tree_edge> > >’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:165:3: required from ‘struct boost::CopyConstructibleConcept<boost::bfs_visitor<boost::edge_predecessor_recorder<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>*, boost::on_tree_edge> > >’
165 | BOOST_concept(CopyConstructible,(TT))
| ^~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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::bfs_visitor<boost::edge_predecessor_recorder<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>*, boost::on_tree_edge> > >]’
32 | inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
| ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied<boost::CopyConstructibleConcept<boost::bfs_visitor<boost::edge_predecessor_recorder<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>*, boost::on_tree_edge> > > >::value’
44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 7 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:65:5: required from ‘void boost::breadth_first_visit(const IncidenceGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with IncidenceGraph = filtered_graph<adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, no_property, listS>, is_residual_edge<adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_residual_capacity_t> >, keep_all>; Buffer = queue<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > >; BFSVisitor = bfs_visitor<edge_predecessor_recorder<detail::edge_desc_impl<directed_tag, long unsigned int>*, on_tree_edge> >; ColorMap = default_color_type*; SourceIterator = long unsigned int*]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:136:24: required from ‘void boost::breadth_first_search(const VertexListGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph<adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, no_property, listS>, is_residual_edge<adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_residual_capacity_t> >, keep_all>; SourceIterator = long unsigned int*; Buffer = queue<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > >; BFSVisitor = bfs_visitor<edge_predecessor_recorder<detail::edge_desc_impl<directed_tag, long unsigned int>*, on_tree_edge> >; ColorMap = default_color_type*]’
136 | breadth_first_visit(g, sources_begin, sources_end, Q, vis, color);
| ~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:147:25: required from ‘void boost::breadth_first_search(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph<adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, no_property, listS>, is_residual_edge<adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_residual_capacity_t> >, keep_all>; Buffer = queue<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > >; BFSVisitor = bfs_visitor<edge_predecessor_recorder<detail::edge_desc_impl<directed_tag, long unsigned int>*, on_tree_edge> >; ColorMap = default_color_type*; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
147 | breadth_first_search(g, sources, sources + 1, Q, vis, color);
| ~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/edmonds_karp_max_flow.hpp:101:29: required from ‘typename boost::property_traits<IndexMap>::value_type boost::edmonds_karp_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, ColorMap, PredEdgeMap) [with Graph = adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, no_property, listS>; CapacityEdgeMap = adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map<directed_tag, detail::edge_desc_impl<directed_tag, long unsigned int>, detail::edge_desc_impl<directed_tag, long unsigned int>&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_reverse_t>; ColorMap = default_color_type*; PredEdgeMap = detail::edge_desc_impl<directed_tag, long unsigned int>*; typename property_traits<IndexMap>::value_type = long unsigned int; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
101 | breadth_first_search(detail::residual_graph(g, res), src, Q,
| ~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
102 | make_bfs_visitor(record_edge_predecessors(pred, on_tree_edge())),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
103 | color);
| ~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/edge_connectivity.hpp:146:42: required from ‘typename boost::graph_traits<G>::degree_size_type boost::edge_connectivity(VertexListGraph&, OutputIterator) [with VertexListGraph = R_adjacency_list<undirectedS, double>; OutputIterator = std::back_insert_iterator<std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int> > >; typename graph_traits<G>::degree_size_type = long unsigned int]’
146 | alpha_S_k = edmonds_karp_max_flow(
| ~~~~~~~~~~~~~~~~~~~~~^
147 | flow_g, p, k, cap, res_cap, rev_edge, &color[0], &pred[0]);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
interfaces.cpp:326:34: required from here
326 | dst c = edge_connectivity( g, std::back_inserter(disconnecting_set) );
| ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
20 | ~usage_requirements() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::CopyConstructible<TT>::~CopyConstructible() [with TT = boost::bfs_visitor<boost::edge_predecessor_recorder<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>*, boost::on_tree_edge> >]’
37 | ~model()
| ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:167:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
167 | BOOST_CONCEPT_USAGE(CopyConstructible) {
| ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::CopyConstructible<boost::topo_sort_visitor<std::front_insert_iterator<std::__cxx11::list<long unsigned int> > > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::CopyConstructible<boost::topo_sort_visitor<std::front_insert_iterator<std::__cxx11::list<long unsigned int> > > > >]’
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:167:5: required from ‘struct boost::CopyConstructible<boost::topo_sort_visitor<std::front_insert_iterator<std::__cxx11::list<long unsigned int> > > >’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:165:3: required from ‘struct boost::CopyConstructibleConcept<boost::topo_sort_visitor<std::front_insert_iterator<std::__cxx11::list<long unsigned int> > > >’
165 | BOOST_concept(CopyConstructible,(TT))
| ^~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::CopyConstructibleConcept<boost::topo_sort_visitor<std::front_insert_iterator<std::__cxx11::list<long unsigned int> > > >]’
32 | inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
| ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied<boost::CopyConstructibleConcept<boost::topo_sort_visitor<std::front_insert_iterator<std::__cxx11::list<long unsigned int> > > > >::value’
44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 8 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:397:42: required from ‘void boost::graph::detail::depth_first_search_impl<Graph>::operator()(const Graph&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<boost::graph::keywords::tag::visitor, const boost::topo_sort_visitor<std::front_insert_iterator<std::__cxx11::list<long unsigned int> > > >, boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<boost::graph::keywords::tag::buffer, const int>, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >, std::integral_constant<bool, true> >; Graph = R_adjacency_list<boost::directedS, double>]’
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)]);
| ~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/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 = R_adjacency_list<boost::directedS, double>; ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<keywords::tag::visitor, const boost::topo_sort_visitor<std::front_insert_iterator<std::__cxx11::list<long unsigned int> > > >, boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<keywords::tag::buffer, const int>, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >, std::integral_constant<bool, true> >; typename boost::result_of<detail::depth_first_search_impl<Param0>(Param0, const ArgPack&)>::type = void]’
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); \
| ~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/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 = R_adjacency_list<directedS, double>; P = topo_sort_visitor<std::front_insert_iterator<std::__cxx11::list<long unsigned int> > >; T = graph_visitor_t; R = bgl_named_params<int, buffer_param_t>; typename result_of<graph::detail::depth_first_search_impl<Param0>(Param0, const typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<T, Tag, Base> >::type&)>::type = void; typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<T, Tag, Base> >::type = parameter::aux::arg_list<parameter::aux::tagged_argument<graph::keywords::tag::visitor, const topo_sort_visitor<std::front_insert_iterator<std::__cxx11::list<long unsigned int> > > >, parameter::aux::arg_list<parameter::aux::tagged_argument<graph::keywords::tag::buffer, const int>, parameter::aux::empty_arg_list, std::integral_constant<bool, true> >, std::integral_constant<bool, true> >]’
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); \
| ~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/topological_sort.hpp:69:23: required from ‘void boost::topological_sort(VertexListGraph&, OutputIterator, const bgl_named_params<P, T, R>&) [with VertexListGraph = R_adjacency_list<directedS, double>; OutputIterator = std::front_insert_iterator<std::__cxx11::list<long unsigned int> >; P = int; T = buffer_param_t; R = no_property]’
69 | depth_first_search(g, params.visitor(TopoVisitor(result)));
| ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/topological_sort.hpp:75:21: required from ‘void boost::topological_sort(VertexListGraph&, OutputIterator) [with VertexListGraph = R_adjacency_list<directedS, double>; OutputIterator = std::front_insert_iterator<std::__cxx11::list<long unsigned int> >]’
75 | topological_sort(
| ~~~~~~~~~~~~~~~~^
76 | g, result, bgl_named_params< int, buffer_param_t >(0)); // bogus
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
interfaces.cpp:71:29: required from here
71 | topological_sort(g, std::front_inserter(tsord));
| ~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
20 | ~usage_requirements() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::CopyConstructible<TT>::~CopyConstructible() [with TT = boost::topo_sort_visitor<std::front_insert_iterator<std::__cxx11::list<long unsigned int> > >]’
37 | ~model()
| ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:167:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
167 | BOOST_CONCEPT_USAGE(CopyConstructible) {
| ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::CopyConstructible<bfs_time_visitor<long unsigned int*> >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/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<bfs_time_visitor<long unsigned int*> > >]’
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:167:5: required from ‘struct boost::CopyConstructible<bfs_time_visitor<long unsigned int*> >’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:165:3: required from ‘struct boost::CopyConstructibleConcept<bfs_time_visitor<long unsigned int*> >’
165 | BOOST_concept(CopyConstructible,(TT))
| ^~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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<bfs_time_visitor<long unsigned int*> >]’
32 | inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
| ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied<boost::CopyConstructibleConcept<bfs_time_visitor<long unsigned int*> > >::value’
44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 8 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:136:24: required from ‘void boost::breadth_first_search(const VertexListGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = R_adjacency_list<directedS, double>; SourceIterator = long unsigned int*; Buffer = queue<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > >; BFSVisitor = bfs_time_visitor<long unsigned int*>; ColorMap = two_bit_color_map<vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int> >]’
136 | breadth_first_visit(g, sources_begin, sources_end, Q, vis, color);
| ~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:147:25: required from ‘void boost::breadth_first_search(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = R_adjacency_list<directedS, double>; Buffer = queue<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > >; BFSVisitor = bfs_time_visitor<long unsigned int*>; ColorMap = two_bit_color_map<vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int> >; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
147 | breadth_first_search(g, sources, sources + 1, Q, vis, color);
| ~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:262:29: required from ‘void boost::detail::bfs_helper(VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, ColorMap, BFSVisitor, const boost::bgl_named_params<P, T, R>&, mpl_::false_) [with VertexListGraph = R_adjacency_list<boost::directedS, double>; ColorMap = boost::two_bit_color_map<boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int> >; BFSVisitor = bfs_time_visitor<long unsigned int*>; P = bfs_time_visitor<long unsigned int*>; T = boost::graph_visitor_t; R = boost::no_property; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int; mpl_::false_ = mpl_::bool_<false>]’
262 | breadth_first_search(g, s,
| ~~~~~~~~~~~~~~~~~~~~^~~~~~
263 | choose_param(get_param(params, buffer_param_t()), boost::ref(Q))
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
264 | .get(),
| ~~~~~~~
265 | vis, color);
| ~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:309:23: required from ‘static void boost::detail::bfs_dispatch<boost::param_not_found>::apply(VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, const boost::bgl_named_params<T, Tag, Base>&, boost::param_not_found) [with VertexListGraph = R_adjacency_list<boost::directedS, double>; P = bfs_time_visitor<long unsigned int*>; T = boost::graph_visitor_t; R = boost::no_property; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’
309 | bfs_helper(g, s,
| ~~~~~~~~~~^~~~~~
310 | make_two_bit_color_map(num_vertices(g),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
311 | choose_const_pmap(
| ~~~~~~~~~~~~~~~~~~
312 | get_param(params, vertex_index), g, vertex_index)),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
313 | choose_param(get_param(params, graph_visitor),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
314 | make_bfs_visitor(null_vis)),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~
315 | params,
| ~~~~~~~
316 | boost::mpl::bool_<
| ~~~~~~~~~~~~~~~~~~
317 | boost::is_base_and_derived< distributed_graph_tag,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
318 | typename graph_traits<
| ~~~~~~~~~~~~~~~~~~~~~~
319 | VertexListGraph >::traversal_category >::value >());
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:339:37: required from ‘void boost::breadth_first_search(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with VertexListGraph = R_adjacency_list<directedS, double>; P = bfs_time_visitor<long unsigned int*>; T = graph_visitor_t; R = no_property; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
339 | detail::bfs_dispatch< C >::apply(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
340 | ng, s, params, get_param(params, vertex_color));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
interfaces.cpp:113:29: required from here
113 | breadth_first_search(g, vertex((int)INTEGER(init_ind)[0], g), visitor(vis));
| ~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
20 | ~usage_requirements() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::CopyConstructible<TT>::~CopyConstructible() [with TT = bfs_time_visitor<long unsigned int*>]’
37 | ~model()
| ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:167:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
167 | BOOST_CONCEPT_USAGE(CopyConstructible) {
| ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Convertible<boost::read_write_property_map_tag, boost::readable_property_map_tag> >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible<boost::read_write_property_map_tag, boost::readable_property_map_tag>’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:206:3: required from ‘struct boost::ConvertibleConcept<boost::read_write_property_map_tag, boost::readable_property_map_tag>’
206 | BOOST_concept(Convertible,(X)(Y))
| ^~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::ConvertibleConcept<boost::read_write_property_map_tag, boost::readable_property_map_tag>]’
32 | inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
| ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied<boost::ConvertibleConcept<boost::read_write_property_map_tag, boost::readable_property_map_tag> >::value’
44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied<boost::ConvertibleConcept<boost::read_write_property_map_tag, boost::readable_property_map_tag> >’
45 | typedef boost::integral_constant<bool, value> type;
| ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 12 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:136:24: required from ‘void boost::breadth_first_search(const VertexListGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = R_adjacency_list<directedS, double>; SourceIterator = long unsigned int*; Buffer = queue<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > >; BFSVisitor = bfs_time_visitor<long unsigned int*>; ColorMap = two_bit_color_map<vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int> >]’
136 | breadth_first_visit(g, sources_begin, sources_end, Q, vis, color);
| ~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:147:25: required from ‘void boost::breadth_first_search(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = R_adjacency_list<directedS, double>; Buffer = queue<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > >; BFSVisitor = bfs_time_visitor<long unsigned int*>; ColorMap = two_bit_color_map<vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int> >; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
147 | breadth_first_search(g, sources, sources + 1, Q, vis, color);
| ~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:262:29: required from ‘void boost::detail::bfs_helper(VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, ColorMap, BFSVisitor, const boost::bgl_named_params<P, T, R>&, mpl_::false_) [with VertexListGraph = R_adjacency_list<boost::directedS, double>; ColorMap = boost::two_bit_color_map<boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int> >; BFSVisitor = bfs_time_visitor<long unsigned int*>; P = bfs_time_visitor<long unsigned int*>; T = boost::graph_visitor_t; R = boost::no_property; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int; mpl_::false_ = mpl_::bool_<false>]’
262 | breadth_first_search(g, s,
| ~~~~~~~~~~~~~~~~~~~~^~~~~~
263 | choose_param(get_param(params, buffer_param_t()), boost::ref(Q))
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
264 | .get(),
| ~~~~~~~
265 | vis, color);
| ~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:309:23: required from ‘static void boost::detail::bfs_dispatch<boost::param_not_found>::apply(VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, const boost::bgl_named_params<T, Tag, Base>&, boost::param_not_found) [with VertexListGraph = R_adjacency_list<boost::directedS, double>; P = bfs_time_visitor<long unsigned int*>; T = boost::graph_visitor_t; R = boost::no_property; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’
309 | bfs_helper(g, s,
| ~~~~~~~~~~^~~~~~
310 | make_two_bit_color_map(num_vertices(g),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
311 | choose_const_pmap(
| ~~~~~~~~~~~~~~~~~~
312 | get_param(params, vertex_index), g, vertex_index)),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
313 | choose_param(get_param(params, graph_visitor),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
314 | make_bfs_visitor(null_vis)),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~
315 | params,
| ~~~~~~~
316 | boost::mpl::bool_<
| ~~~~~~~~~~~~~~~~~~
317 | boost::is_base_and_derived< distributed_graph_tag,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
318 | typename graph_traits<
| ~~~~~~~~~~~~~~~~~~~~~~
319 | VertexListGraph >::traversal_category >::value >());
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:339:37: required from ‘void boost::breadth_first_search(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with VertexListGraph = R_adjacency_list<directedS, double>; P = bfs_time_visitor<long unsigned int*>; T = graph_visitor_t; R = no_property; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
339 | detail::bfs_dispatch< C >::apply(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
340 | ng, s, params, get_param(params, vertex_color));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
interfaces.cpp:113:29: required from here
113 | breadth_first_search(g, vertex((int)INTEGER(init_ind)[0], g), visitor(vis));
| ~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Convertible<boost::read_write_property_map_tag, boost::readable_property_map_tag>]’
20 | ~usage_requirements() { ((Model*)0)->~Model(); }
| ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::ConvertibleConcept<boost::read_write_property_map_tag, boost::readable_property_map_tag>]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:148:7: required from ‘void boost::ReadablePropertyMapConcept<PMap, Key>::constraints() [with PMap = boost::two_bit_color_map<boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int> >; Key = long unsigned int]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::ReadablePropertyMapConcept<boost::two_bit_color_map<boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int> >, long unsigned int>]’
32 | inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
| ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied<boost::ReadablePropertyMapConcept<boost::two_bit_color_map<boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int> >, long unsigned int> >::value’
44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied<boost::ReadablePropertyMapConcept<boost::two_bit_color_map<boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int> >, long unsigned int> >’
45 | typedef boost::integral_constant<bool, value> type;
| ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_<void (*)(boost::ReadablePropertyMapConcept<boost::two_bit_color_map<boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int> >, long unsigned int>)>’
72 | struct requirement_<void(*)(Model)>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:206:7: [ skipping 6 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:136:24: required from ‘void boost::breadth_first_search(const VertexListGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = R_adjacency_list<directedS, double>; SourceIterator = long unsigned int*; Buffer = queue<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > >; BFSVisitor = bfs_time_visitor<long unsigned int*>; ColorMap = two_bit_color_map<vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int> >]’
136 | breadth_first_visit(g, sources_begin, sources_end, Q, vis, color);
| ~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:147:25: required from ‘void boost::breadth_first_search(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = R_adjacency_list<directedS, double>; Buffer = queue<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > >; BFSVisitor = bfs_time_visitor<long unsigned int*>; ColorMap = two_bit_color_map<vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int> >; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
147 | breadth_first_search(g, sources, sources + 1, Q, vis, color);
| ~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:262:29: required from ‘void boost::detail::bfs_helper(VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, ColorMap, BFSVisitor, const boost::bgl_named_params<P, T, R>&, mpl_::false_) [with VertexListGraph = R_adjacency_list<boost::directedS, double>; ColorMap = boost::two_bit_color_map<boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int> >; BFSVisitor = bfs_time_visitor<long unsigned int*>; P = bfs_time_visitor<long unsigned int*>; T = boost::graph_visitor_t; R = boost::no_property; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int; mpl_::false_ = mpl_::bool_<false>]’
262 | breadth_first_search(g, s,
| ~~~~~~~~~~~~~~~~~~~~^~~~~~
263 | choose_param(get_param(params, buffer_param_t()), boost::ref(Q))
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
264 | .get(),
| ~~~~~~~
265 | vis, color);
| ~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:309:23: required from ‘static void boost::detail::bfs_dispatch<boost::param_not_found>::apply(VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, const boost::bgl_named_params<T, Tag, Base>&, boost::param_not_found) [with VertexListGraph = R_adjacency_list<boost::directedS, double>; P = bfs_time_visitor<long unsigned int*>; T = boost::graph_visitor_t; R = boost::no_property; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’
309 | bfs_helper(g, s,
| ~~~~~~~~~~^~~~~~
310 | make_two_bit_color_map(num_vertices(g),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
311 | choose_const_pmap(
| ~~~~~~~~~~~~~~~~~~
312 | get_param(params, vertex_index), g, vertex_index)),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
313 | choose_param(get_param(params, graph_visitor),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
314 | make_bfs_visitor(null_vis)),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~
315 | params,
| ~~~~~~~
316 | boost::mpl::bool_<
| ~~~~~~~~~~~~~~~~~~
317 | boost::is_base_and_derived< distributed_graph_tag,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
318 | typename graph_traits<
| ~~~~~~~~~~~~~~~~~~~~~~
319 | VertexListGraph >::traversal_category >::value >());
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:339:37: required from ‘void boost::breadth_first_search(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with VertexListGraph = R_adjacency_list<directedS, double>; P = bfs_time_visitor<long unsigned int*>; T = graph_visitor_t; R = no_property; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
339 | detail::bfs_dispatch< C >::apply(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
340 | ng, s, params, get_param(params, vertex_color));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
interfaces.cpp:113:29: required from here
113 | breadth_first_search(g, vertex((int)INTEGER(init_ind)[0], g), visitor(vis));
| ~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:206:17: note: in a call to non-static member function ‘boost::ConvertibleConcept<boost::read_write_property_map_tag, boost::readable_property_map_tag>::~ConvertibleConcept()’
206 | BOOST_concept(Convertible,(X)(Y))
| ^~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/preprocessor/cat.hpp:29:34: note: in definition of macro ‘BOOST_PP_CAT_I’
29 | # define BOOST_PP_CAT_I(a, b) a ## b
| ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/concept_def.hpp:23:12: note: in expansion of macro ‘BOOST_PP_CAT’
23 | struct BOOST_PP_CAT(name,Concept) \
| ^~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:206:3: note: in expansion of macro ‘BOOST_concept’
206 | BOOST_concept(Convertible,(X)(Y))
| ^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Convertible<boost::read_write_property_map_tag, boost::read_write_property_map_tag>]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Convertible<boost::read_write_property_map_tag, boost::read_write_property_map_tag> >]’
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible<boost::read_write_property_map_tag, boost::read_write_property_map_tag>’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:206:3: required from ‘struct boost::ConvertibleConcept<boost::read_write_property_map_tag, boost::read_write_property_map_tag>’
206 | BOOST_concept(Convertible,(X)(Y))
| ^~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::ConvertibleConcept<boost::read_write_property_map_tag, boost::read_write_property_map_tag>]’
32 | inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
| ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied<boost::ConvertibleConcept<boost::read_write_property_map_tag, boost::read_write_property_map_tag> >::value’
44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 8 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:136:24: required from ‘void boost::breadth_first_search(const VertexListGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = R_adjacency_list<directedS, double>; SourceIterator = long unsigned int*; Buffer = queue<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > >; BFSVisitor = bfs_time_visitor<long unsigned int*>; ColorMap = two_bit_color_map<vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int> >]’
136 | breadth_first_visit(g, sources_begin, sources_end, Q, vis, color);
| ~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:147:25: required from ‘void boost::breadth_first_search(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = R_adjacency_list<directedS, double>; Buffer = queue<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > >; BFSVisitor = bfs_time_visitor<long unsigned int*>; ColorMap = two_bit_color_map<vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int> >; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
147 | breadth_first_search(g, sources, sources + 1, Q, vis, color);
| ~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:262:29: required from ‘void boost::detail::bfs_helper(VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, ColorMap, BFSVisitor, const boost::bgl_named_params<P, T, R>&, mpl_::false_) [with VertexListGraph = R_adjacency_list<boost::directedS, double>; ColorMap = boost::two_bit_color_map<boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int> >; BFSVisitor = bfs_time_visitor<long unsigned int*>; P = bfs_time_visitor<long unsigned int*>; T = boost::graph_visitor_t; R = boost::no_property; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int; mpl_::false_ = mpl_::bool_<false>]’
262 | breadth_first_search(g, s,
| ~~~~~~~~~~~~~~~~~~~~^~~~~~
263 | choose_param(get_param(params, buffer_param_t()), boost::ref(Q))
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
264 | .get(),
| ~~~~~~~
265 | vis, color);
| ~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:309:23: required from ‘static void boost::detail::bfs_dispatch<boost::param_not_found>::apply(VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, const boost::bgl_named_params<T, Tag, Base>&, boost::param_not_found) [with VertexListGraph = R_adjacency_list<boost::directedS, double>; P = bfs_time_visitor<long unsigned int*>; T = boost::graph_visitor_t; R = boost::no_property; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’
309 | bfs_helper(g, s,
| ~~~~~~~~~~^~~~~~
310 | make_two_bit_color_map(num_vertices(g),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
311 | choose_const_pmap(
| ~~~~~~~~~~~~~~~~~~
312 | get_param(params, vertex_index), g, vertex_index)),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
313 | choose_param(get_param(params, graph_visitor),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
314 | make_bfs_visitor(null_vis)),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~
315 | params,
| ~~~~~~~
316 | boost::mpl::bool_<
| ~~~~~~~~~~~~~~~~~~
317 | boost::is_base_and_derived< distributed_graph_tag,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
318 | typename graph_traits<
| ~~~~~~~~~~~~~~~~~~~~~~
319 | VertexListGraph >::traversal_category >::value >());
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:339:37: required from ‘void boost::breadth_first_search(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with VertexListGraph = R_adjacency_list<directedS, double>; P = bfs_time_visitor<long unsigned int*>; T = graph_visitor_t; R = no_property; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
339 | detail::bfs_dispatch< C >::apply(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
340 | ng, s, params, get_param(params, vertex_color));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
interfaces.cpp:113:29: required from here
113 | breadth_first_search(g, vertex((int)INTEGER(init_ind)[0], g), visitor(vis));
| ~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
20 | ~usage_requirements() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible<X, Y>::~Convertible() [with X = boost::read_write_property_map_tag; Y = boost::read_write_property_map_tag]’
37 | ~model()
| ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
208 | BOOST_CONCEPT_USAGE(Convertible) {
| ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::DefaultConstructible<long unsigned int> >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:137:5: required from ‘struct boost::DefaultConstructible<long unsigned int>’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::DefaultConstructible<long unsigned int>]’
32 | inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
| ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied<boost::DefaultConstructible<long unsigned int> >::value’
44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied<boost::DefaultConstructible<long unsigned int> >’
45 | typedef boost::integral_constant<bool, value> type;
| ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_<void (*)(boost::DefaultConstructible<long unsigned int>)>’
72 | struct requirement_<void(*)(Model)>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:68:9: [ skipping 10 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:129:9: required from ‘void boost::detail::depth_first_visit_impl(const IncidenceGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, DFSVisitor&, ColorMap, TerminatorFunc) [with IncidenceGraph = R_adjacency_list<boost::directedS, double>; DFSVisitor = dfs_time_visitor<long unsigned int*>; ColorMap = boost::shared_array_property_map<boost::default_color_type, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int> >; TerminatorFunc = nontruth2; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:286:39: required from ‘void boost::depth_first_search(const VertexListGraph&, DFSVisitor, ColorMap, typename graph_traits<Graph>::vertex_descriptor) [with VertexListGraph = R_adjacency_list<directedS, double>; DFSVisitor = dfs_time_visitor<long unsigned int*>; ColorMap = shared_array_property_map<default_color_type, vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int> >; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
286 | detail::depth_first_visit_impl(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
287 | g, start_vertex, vis, color, detail::nontruth2());
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/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 dfs_time_visitor<long unsigned int*> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; Graph = R_adjacency_list<boost::directedS, double>]’
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)]);
| ~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/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 = R_adjacency_list<boost::directedS, double>; ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<keywords::tag::visitor, const dfs_time_visitor<long unsigned 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); \
| ~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/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 = R_adjacency_list<directedS, double>; P = dfs_time_visitor<long unsigned 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 dfs_time_visitor<long unsigned 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); \
| ~~~~~~~~~
interfaces.cpp:158:27: required from here
158 | depth_first_search(g, visitor(vis));
| ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::DefaultConstructible<long unsigned int>]’
20 | ~usage_requirements() { ((Model*)0)->~Model(); }
| ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::DefaultConstructible<long unsigned int>]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:68:9: required from ‘boost::concepts::Graph<G>::~Graph() [with G = R_adjacency_list<boost::directedS, double>]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: required from ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::concepts::Graph<R_adjacency_list<boost::directedS, double> >]’
20 | ~usage_requirements() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/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<R_adjacency_list<boost::directedS, double> > >]’
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:66:5: required from ‘struct boost::concepts::Graph<R_adjacency_list<boost::directedS, double> >’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:75:1: required from ‘struct boost::concepts::IncidenceGraph<R_adjacency_list<boost::directedS, double> >’
75 | BOOST_concept(IncidenceGraph, (G)) : Graph< G >
| ^~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:75:1: [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:129:9: required from ‘void boost::detail::depth_first_visit_impl(const IncidenceGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, DFSVisitor&, ColorMap, TerminatorFunc) [with IncidenceGraph = R_adjacency_list<boost::directedS, double>; DFSVisitor = dfs_time_visitor<long unsigned int*>; ColorMap = boost::shared_array_property_map<boost::default_color_type, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int> >; TerminatorFunc = nontruth2; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:286:39: required from ‘void boost::depth_first_search(const VertexListGraph&, DFSVisitor, ColorMap, typename graph_traits<Graph>::vertex_descriptor) [with VertexListGraph = R_adjacency_list<directedS, double>; DFSVisitor = dfs_time_visitor<long unsigned int*>; ColorMap = shared_array_property_map<default_color_type, vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int> >; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
286 | detail::depth_first_visit_impl(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
287 | g, start_vertex, vis, color, detail::nontruth2());
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/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 dfs_time_visitor<long unsigned int*> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; Graph = R_adjacency_list<boost::directedS, double>]’
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)]);
| ~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/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 = R_adjacency_list<boost::directedS, double>; ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<keywords::tag::visitor, const dfs_time_visitor<long unsigned 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); \
| ~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/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 = R_adjacency_list<directedS, double>; P = dfs_time_visitor<long unsigned 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 dfs_time_visitor<long unsigned 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); \
| ~~~~~~~~~
interfaces.cpp:158:27: required from here
158 | depth_first_search(g, visitor(vis));
| ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::DefaultConstructible<TT>::~DefaultConstructible() [with TT = long unsigned int]’
37 | ~model()
| ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:137:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
137 | BOOST_CONCEPT_USAGE(DefaultConstructible) {
| ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::EqualityComparable<long unsigned int> >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable<long unsigned int>’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::EqualityComparable<long unsigned int>]’
32 | inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
| ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied<boost::EqualityComparable<long unsigned int> >::value’
44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied<boost::EqualityComparable<long unsigned int> >’
45 | typedef boost::integral_constant<bool, value> type;
| ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_<void (*)(boost::EqualityComparable<long unsigned int>)>’
72 | struct requirement_<void(*)(Model)>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:69:9: [ skipping 10 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:129:9: required from ‘void boost::detail::depth_first_visit_impl(const IncidenceGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, DFSVisitor&, ColorMap, TerminatorFunc) [with IncidenceGraph = R_adjacency_list<boost::directedS, double>; DFSVisitor = dfs_time_visitor<long unsigned int*>; ColorMap = boost::shared_array_property_map<boost::default_color_type, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int> >; TerminatorFunc = nontruth2; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:286:39: required from ‘void boost::depth_first_search(const VertexListGraph&, DFSVisitor, ColorMap, typename graph_traits<Graph>::vertex_descriptor) [with VertexListGraph = R_adjacency_list<directedS, double>; DFSVisitor = dfs_time_visitor<long unsigned int*>; ColorMap = shared_array_property_map<default_color_type, vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int> >; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
286 | detail::depth_first_visit_impl(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
287 | g, start_vertex, vis, color, detail::nontruth2());
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/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 dfs_time_visitor<long unsigned int*> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; Graph = R_adjacency_list<boost::directedS, double>]’
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)]);
| ~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/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 = R_adjacency_list<boost::directedS, double>; ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<keywords::tag::visitor, const dfs_time_visitor<long unsigned 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); \
| ~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/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 = R_adjacency_list<directedS, double>; P = dfs_time_visitor<long unsigned 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 dfs_time_visitor<long unsigned 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); \
| ~~~~~~~~~
interfaces.cpp:158:27: required from here
158 | depth_first_search(g, visitor(vis));
| ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::EqualityComparable<long unsigned int>]’
20 | ~usage_requirements() { ((Model*)0)->~Model(); }
| ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::EqualityComparable<long unsigned int>]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:69:9: required from ‘boost::concepts::Graph<G>::~Graph() [with G = R_adjacency_list<boost::directedS, double>]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: required from ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::concepts::Graph<R_adjacency_list<boost::directedS, double> >]’
20 | ~usage_requirements() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/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<R_adjacency_list<boost::directedS, double> > >]’
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:66:5: required from ‘struct boost::concepts::Graph<R_adjacency_list<boost::directedS, double> >’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:75:1: required from ‘struct boost::concepts::IncidenceGraph<R_adjacency_list<boost::directedS, double> >’
75 | BOOST_concept(IncidenceGraph, (G)) : Graph< G >
| ^~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:75:1: [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:129:9: required from ‘void boost::detail::depth_first_visit_impl(const IncidenceGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, DFSVisitor&, ColorMap, TerminatorFunc) [with IncidenceGraph = R_adjacency_list<boost::directedS, double>; DFSVisitor = dfs_time_visitor<long unsigned int*>; ColorMap = boost::shared_array_property_map<boost::default_color_type, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int> >; TerminatorFunc = nontruth2; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:286:39: required from ‘void boost::depth_first_search(const VertexListGraph&, DFSVisitor, ColorMap, typename graph_traits<Graph>::vertex_descriptor) [with VertexListGraph = R_adjacency_list<directedS, double>; DFSVisitor = dfs_time_visitor<long unsigned int*>; ColorMap = shared_array_property_map<default_color_type, vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int> >; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
286 | detail::depth_first_visit_impl(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
287 | g, start_vertex, vis, color, detail::nontruth2());
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/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 dfs_time_visitor<long unsigned int*> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; Graph = R_adjacency_list<boost::directedS, double>]’
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)]);
| ~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/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 = R_adjacency_list<boost::directedS, double>; ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<keywords::tag::visitor, const dfs_time_visitor<long unsigned 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); \
| ~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/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 = R_adjacency_list<directedS, double>; P = dfs_time_visitor<long unsigned 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 dfs_time_visitor<long unsigned 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); \
| ~~~~~~~~~
interfaces.cpp:158:27: required from here
158 | depth_first_search(g, visitor(vis));
| ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::EqualityComparable<TT>::~EqualityComparable() [with TT = long unsigned int]’
37 | ~model()
| ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:233:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
233 | BOOST_CONCEPT_USAGE(EqualityComparable) {
| ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Assignable<long unsigned int> >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:145:5: required from ‘struct boost::Assignable<long unsigned int>’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::Assignable<long unsigned int>]’
32 | inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
| ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied<boost::Assignable<long unsigned int> >::value’
44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied<boost::Assignable<long unsigned int> >’
45 | typedef boost::integral_constant<bool, value> type;
| ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_<void (*)(boost::Assignable<long unsigned int>)>’
72 | struct requirement_<void(*)(Model)>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:70:9: [ skipping 10 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:129:9: required from ‘void boost::detail::depth_first_visit_impl(const IncidenceGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, DFSVisitor&, ColorMap, TerminatorFunc) [with IncidenceGraph = R_adjacency_list<boost::directedS, double>; DFSVisitor = dfs_time_visitor<long unsigned int*>; ColorMap = boost::shared_array_property_map<boost::default_color_type, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int> >; TerminatorFunc = nontruth2; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:286:39: required from ‘void boost::depth_first_search(const VertexListGraph&, DFSVisitor, ColorMap, typename graph_traits<Graph>::vertex_descriptor) [with VertexListGraph = R_adjacency_list<directedS, double>; DFSVisitor = dfs_time_visitor<long unsigned int*>; ColorMap = shared_array_property_map<default_color_type, vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int> >; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
286 | detail::depth_first_visit_impl(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
287 | g, start_vertex, vis, color, detail::nontruth2());
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/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 dfs_time_visitor<long unsigned int*> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; Graph = R_adjacency_list<boost::directedS, double>]’
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)]);
| ~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/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 = R_adjacency_list<boost::directedS, double>; ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<keywords::tag::visitor, const dfs_time_visitor<long unsigned 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); \
| ~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/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 = R_adjacency_list<directedS, double>; P = dfs_time_visitor<long unsigned 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 dfs_time_visitor<long unsigned 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); \
| ~~~~~~~~~
interfaces.cpp:158:27: required from here
158 | depth_first_search(g, visitor(vis));
| ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Assignable<long unsigned int>]’
20 | ~usage_requirements() { ((Model*)0)->~Model(); }
| ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::Assignable<long unsigned int>]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:70:9: required from ‘boost::concepts::Graph<G>::~Graph() [with G = R_adjacency_list<boost::directedS, double>]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: required from ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::concepts::Graph<R_adjacency_list<boost::directedS, double> >]’
20 | ~usage_requirements() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/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<R_adjacency_list<boost::directedS, double> > >]’
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:66:5: required from ‘struct boost::concepts::Graph<R_adjacency_list<boost::directedS, double> >’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:75:1: required from ‘struct boost::concepts::IncidenceGraph<R_adjacency_list<boost::directedS, double> >’
75 | BOOST_concept(IncidenceGraph, (G)) : Graph< G >
| ^~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:75:1: [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:129:9: required from ‘void boost::detail::depth_first_visit_impl(const IncidenceGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, DFSVisitor&, ColorMap, TerminatorFunc) [with IncidenceGraph = R_adjacency_list<boost::directedS, double>; DFSVisitor = dfs_time_visitor<long unsigned int*>; ColorMap = boost::shared_array_property_map<boost::default_color_type, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int> >; TerminatorFunc = nontruth2; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:286:39: required from ‘void boost::depth_first_search(const VertexListGraph&, DFSVisitor, ColorMap, typename graph_traits<Graph>::vertex_descriptor) [with VertexListGraph = R_adjacency_list<directedS, double>; DFSVisitor = dfs_time_visitor<long unsigned int*>; ColorMap = shared_array_property_map<default_color_type, vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int> >; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
286 | detail::depth_first_visit_impl(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
287 | g, start_vertex, vis, color, detail::nontruth2());
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/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 dfs_time_visitor<long unsigned int*> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; Graph = R_adjacency_list<boost::directedS, double>]’
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)]);
| ~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/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 = R_adjacency_list<boost::directedS, double>; ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<keywords::tag::visitor, const dfs_time_visitor<long unsigned 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); \
| ~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/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 = R_adjacency_list<directedS, double>; P = dfs_time_visitor<long unsigned 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 dfs_time_visitor<long unsigned 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); \
| ~~~~~~~~~
interfaces.cpp:158:27: required from here
158 | depth_first_search(g, visitor(vis));
| ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Assignable<TT>::~Assignable() [with TT = long unsigned int]’
37 | ~model()
| ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:145:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
145 | BOOST_CONCEPT_USAGE(Assignable) {
| ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::concepts::MultiPassInputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int> >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::concepts::MultiPassInputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int> > >]’
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:52:50: required from ‘struct boost::concepts::MultiPassInputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int> >’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::concepts::MultiPassInputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int> >]’
32 | inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
| ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied<boost::concepts::MultiPassInputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int> > >::value’
44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied<boost::concepts::MultiPassInputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int> > >’
45 | typedef boost::integral_constant<bool, value> type;
| ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:129:9: required from ‘void boost::detail::depth_first_visit_impl(const IncidenceGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, DFSVisitor&, ColorMap, TerminatorFunc) [with IncidenceGraph = R_adjacency_list<boost::directedS, double>; DFSVisitor = dfs_time_visitor<long unsigned int*>; ColorMap = boost::shared_array_property_map<boost::default_color_type, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int> >; TerminatorFunc = nontruth2; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:286:39: required from ‘void boost::depth_first_search(const VertexListGraph&, DFSVisitor, ColorMap, typename graph_traits<Graph>::vertex_descriptor) [with VertexListGraph = R_adjacency_list<directedS, double>; DFSVisitor = dfs_time_visitor<long unsigned int*>; ColorMap = shared_array_property_map<default_color_type, vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int> >; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
286 | detail::depth_first_visit_impl(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
287 | g, start_vertex, vis, color, detail::nontruth2());
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/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 dfs_time_visitor<long unsigned int*> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; Graph = R_adjacency_list<boost::directedS, double>]’
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)]);
| ~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/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 = R_adjacency_list<boost::directedS, double>; ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<keywords::tag::visitor, const dfs_time_visitor<long unsigned 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); \
| ~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/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 = R_adjacency_list<directedS, double>; P = dfs_time_visitor<long unsigned 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 dfs_time_visitor<long unsigned 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); \
| ~~~~~~~~~
interfaces.cpp:158:27: required from here
158 | depth_first_search(g, visitor(vis));
| ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
20 | ~usage_requirements() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::concepts::MultiPassInputIterator<T>::~MultiPassInputIterator() [with T = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int>]’
37 | ~model()
| ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:52:50: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
52 | BOOST_concept(MultiPassInputIterator, (T)) { BOOST_CONCEPT_USAGE(
| ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::DefaultConstructible<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::DefaultConstructible<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > >]’
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:137:5: required from ‘struct boost::DefaultConstructible<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> >’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::DefaultConstructible<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> >]’
32 | inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
| ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied<boost::DefaultConstructible<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > >::value’
44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied<boost::DefaultConstructible<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > >’
45 | typedef boost::integral_constant<bool, value> type;
| ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:129:9: required from ‘void boost::detail::depth_first_visit_impl(const IncidenceGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, DFSVisitor&, ColorMap, TerminatorFunc) [with IncidenceGraph = R_adjacency_list<boost::directedS, double>; DFSVisitor = dfs_time_visitor<long unsigned int*>; ColorMap = boost::shared_array_property_map<boost::default_color_type, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int> >; TerminatorFunc = nontruth2; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:286:39: required from ‘void boost::depth_first_search(const VertexListGraph&, DFSVisitor, ColorMap, typename graph_traits<Graph>::vertex_descriptor) [with VertexListGraph = R_adjacency_list<directedS, double>; DFSVisitor = dfs_time_visitor<long unsigned int*>; ColorMap = shared_array_property_map<default_color_type, vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int> >; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
286 | detail::depth_first_visit_impl(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
287 | g, start_vertex, vis, color, detail::nontruth2());
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/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 dfs_time_visitor<long unsigned int*> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; Graph = R_adjacency_list<boost::directedS, double>]’
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)]);
| ~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/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 = R_adjacency_list<boost::directedS, double>; ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<keywords::tag::visitor, const dfs_time_visitor<long unsigned 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); \
| ~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/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 = R_adjacency_list<directedS, double>; P = dfs_time_visitor<long unsigned 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 dfs_time_visitor<long unsigned 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); \
| ~~~~~~~~~
interfaces.cpp:158:27: required from here
158 | depth_first_search(g, visitor(vis));
| ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
20 | ~usage_requirements() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::DefaultConstructible<TT>::~DefaultConstructible() [with TT = boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>]’
37 | ~model()
| ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:137:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
137 | BOOST_CONCEPT_USAGE(DefaultConstructible) {
| ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::EqualityComparable<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::EqualityComparable<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > >]’
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> >’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::EqualityComparable<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> >]’
32 | inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
| ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied<boost::EqualityComparable<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > >::value’
44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied<boost::EqualityComparable<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > >’
45 | typedef boost::integral_constant<bool, value> type;
| ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:129:9: required from ‘void boost::detail::depth_first_visit_impl(const IncidenceGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, DFSVisitor&, ColorMap, TerminatorFunc) [with IncidenceGraph = R_adjacency_list<boost::directedS, double>; DFSVisitor = dfs_time_visitor<long unsigned int*>; ColorMap = boost::shared_array_property_map<boost::default_color_type, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int> >; TerminatorFunc = nontruth2; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:286:39: required from ‘void boost::depth_first_search(const VertexListGraph&, DFSVisitor, ColorMap, typename graph_traits<Graph>::vertex_descriptor) [with VertexListGraph = R_adjacency_list<directedS, double>; DFSVisitor = dfs_time_visitor<long unsigned int*>; ColorMap = shared_array_property_map<default_color_type, vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int> >; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
286 | detail::depth_first_visit_impl(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
287 | g, start_vertex, vis, color, detail::nontruth2());
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/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 dfs_time_visitor<long unsigned int*> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; Graph = R_adjacency_list<boost::directedS, double>]’
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)]);
| ~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/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 = R_adjacency_list<boost::directedS, double>; ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<keywords::tag::visitor, const dfs_time_visitor<long unsigned 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); \
| ~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/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 = R_adjacency_list<directedS, double>; P = dfs_time_visitor<long unsigned 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 dfs_time_visitor<long unsigned 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); \
| ~~~~~~~~~
interfaces.cpp:158:27: required from here
158 | depth_first_search(g, visitor(vis));
| ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
20 | ~usage_requirements() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::EqualityComparable<TT>::~EqualityComparable() [with TT = boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>]’
37 | ~model()
| ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:233:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
233 | BOOST_CONCEPT_USAGE(EqualityComparable) {
| ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Assignable<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Assignable<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > >]’
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:145:5: required from ‘struct boost::Assignable<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> >’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::Assignable<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> >]’
32 | inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
| ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied<boost::Assignable<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > >::value’
44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied<boost::Assignable<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > >’
45 | typedef boost::integral_constant<bool, value> type;
| ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:129:9: required from ‘void boost::detail::depth_first_visit_impl(const IncidenceGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, DFSVisitor&, ColorMap, TerminatorFunc) [with IncidenceGraph = R_adjacency_list<boost::directedS, double>; DFSVisitor = dfs_time_visitor<long unsigned int*>; ColorMap = boost::shared_array_property_map<boost::default_color_type, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int> >; TerminatorFunc = nontruth2; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:286:39: required from ‘void boost::depth_first_search(const VertexListGraph&, DFSVisitor, ColorMap, typename graph_traits<Graph>::vertex_descriptor) [with VertexListGraph = R_adjacency_list<directedS, double>; DFSVisitor = dfs_time_visitor<long unsigned int*>; ColorMap = shared_array_property_map<default_color_type, vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int> >; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
286 | detail::depth_first_visit_impl(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
287 | g, start_vertex, vis, color, detail::nontruth2());
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/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 dfs_time_visitor<long unsigned int*> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; Graph = R_adjacency_list<boost::directedS, double>]’
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)]);
| ~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/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 = R_adjacency_list<boost::directedS, double>; ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<keywords::tag::visitor, const dfs_time_visitor<long unsigned 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); \
| ~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/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 = R_adjacency_list<directedS, double>; P = dfs_time_visitor<long unsigned 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 dfs_time_visitor<long unsigned 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); \
| ~~~~~~~~~
interfaces.cpp:158:27: required from here
158 | depth_first_search(g, visitor(vis));
| ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
20 | ~usage_requirements() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Assignable<TT>::~Assignable() [with TT = boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>]’
37 | ~model()
| ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:145:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
145 | BOOST_CONCEPT_USAGE(Assignable) {
| ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Convertible<boost::adj_list_dir_traversal_tag, boost::incidence_graph_tag>]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/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(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/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> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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);
| ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/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) );
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/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;
| ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:129:9: required from ‘void boost::detail::depth_first_visit_impl(const IncidenceGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, DFSVisitor&, ColorMap, TerminatorFunc) [with IncidenceGraph = R_adjacency_list<boost::directedS, double>; DFSVisitor = dfs_time_visitor<long unsigned int*>; ColorMap = boost::shared_array_property_map<boost::default_color_type, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int> >; TerminatorFunc = nontruth2; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:286:39: required from ‘void boost::depth_first_search(const VertexListGraph&, DFSVisitor, ColorMap, typename graph_traits<Graph>::vertex_descriptor) [with VertexListGraph = R_adjacency_list<directedS, double>; DFSVisitor = dfs_time_visitor<long unsigned int*>; ColorMap = shared_array_property_map<default_color_type, vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int> >; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
286 | detail::depth_first_visit_impl(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
287 | g, start_vertex, vis, color, detail::nontruth2());
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/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 dfs_time_visitor<long unsigned int*> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; Graph = R_adjacency_list<boost::directedS, double>]’
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)]);
| ~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/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 = R_adjacency_list<boost::directedS, double>; ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<keywords::tag::visitor, const dfs_time_visitor<long unsigned 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); \
| ~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/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 = R_adjacency_list<directedS, double>; P = dfs_time_visitor<long unsigned 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 dfs_time_visitor<long unsigned 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); \
| ~~~~~~~~~
interfaces.cpp:158:27: required from here
158 | depth_first_search(g, visitor(vis));
| ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
20 | ~usage_requirements() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible<X, Y>::~Convertible() [with X = boost::adj_list_dir_traversal_tag; Y = boost::incidence_graph_tag]’
37 | ~model()
| ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
208 | BOOST_CONCEPT_USAGE(Convertible) {
| ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Convertible<boost::lvalue_property_map_tag, boost::readable_property_map_tag>]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/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(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/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> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/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))
| ^~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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);
| ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/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) );
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 12 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:134:9: required from ‘void boost::detail::depth_first_visit_impl(const IncidenceGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, DFSVisitor&, ColorMap, TerminatorFunc) [with IncidenceGraph = R_adjacency_list<boost::directedS, double>; DFSVisitor = dfs_time_visitor<long unsigned int*>; ColorMap = boost::shared_array_property_map<boost::default_color_type, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int> >; TerminatorFunc = nontruth2; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:286:39: required from ‘void boost::depth_first_search(const VertexListGraph&, DFSVisitor, ColorMap, typename graph_traits<Graph>::vertex_descriptor) [with VertexListGraph = R_adjacency_list<directedS, double>; DFSVisitor = dfs_time_visitor<long unsigned int*>; ColorMap = shared_array_property_map<default_color_type, vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int> >; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
286 | detail::depth_first_visit_impl(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
287 | g, start_vertex, vis, color, detail::nontruth2());
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/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 dfs_time_visitor<long unsigned int*> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; Graph = R_adjacency_list<boost::directedS, double>]’
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)]);
| ~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/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 = R_adjacency_list<boost::directedS, double>; ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<keywords::tag::visitor, const dfs_time_visitor<long unsigned 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); \
| ~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/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 = R_adjacency_list<directedS, double>; P = dfs_time_visitor<long unsigned 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 dfs_time_visitor<long unsigned 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); \
| ~~~~~~~~~
interfaces.cpp:158:27: required from here
158 | depth_first_search(g, visitor(vis));
| ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
20 | ~usage_requirements() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible<X, Y>::~Convertible() [with X = boost::lvalue_property_map_tag; Y = boost::readable_property_map_tag]’
37 | ~model()
| ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
208 | BOOST_CONCEPT_USAGE(Convertible) {
| ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::concepts::MultiPassInputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > >, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > >, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > >, boost::property<boost::edge_weight_t, double, boost::no_property> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:52:50: required from ‘struct boost::concepts::MultiPassInputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > >, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > >, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > >, boost::property<boost::edge_weight_t, double, 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> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::concepts::MultiPassInputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > >, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > >, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > >, boost::property<boost::edge_weight_t, double, 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);
| ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied<boost::concepts::MultiPassInputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > >, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > >, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > >, boost::property<boost::edge_weight_t, double, 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) );
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied<boost::concepts::MultiPassInputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > >, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > >, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > >, boost::property<boost::edge_weight_t, double, 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;
| ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_<void (*)(boost::concepts::MultiPassInputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > >, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > >, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > >, boost::property<boost::edge_weight_t, double, boost::no_property> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> >)>’
72 | struct requirement_<void(*)(Model)>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:89:9: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:286:39: required from ‘void boost::depth_first_search(const VertexListGraph&, DFSVisitor, ColorMap, typename graph_traits<Graph>::vertex_descriptor) [with VertexListGraph = R_adjacency_list<undirectedS, double>; DFSVisitor = detail::components_recorder<int*>; ColorMap = shared_array_property_map<default_color_type, vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int> >; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
286 | detail::depth_first_visit_impl(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
287 | g, start_vertex, vis, color, detail::nontruth2());
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:397:42: required from ‘void boost::graph::detail::depth_first_search_impl<Graph>::operator()(const Graph&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<boost::graph::keywords::tag::visitor, const boost::detail::components_recorder<int*> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; Graph = R_adjacency_list<boost::undirectedS, double>]’
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)]);
| ~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/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 = R_adjacency_list<boost::undirectedS, double>; ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<keywords::tag::visitor, const boost::detail::components_recorder<int*> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; typename boost::result_of<detail::depth_first_search_impl<Param0>(Param0, const ArgPack&)>::type = void]’
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); \
| ~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/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 = R_adjacency_list<undirectedS, double>; P = detail::components_recorder<int*>; T = graph_visitor_t; R = no_property; typename result_of<graph::detail::depth_first_search_impl<Param0>(Param0, const typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<T, Tag, Base> >::type&)>::type = void; typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<T, Tag, Base> >::type = parameter::aux::arg_list<parameter::aux::tagged_argument<graph::keywords::tag::visitor, const detail::components_recorder<int*> >, parameter::aux::empty_arg_list, std::integral_constant<bool, true> >]’
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); \
| ~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/connected_components.hpp:106:23: required from ‘typename boost::property_traits<IndexMap>::value_type boost::connected_components(const Graph&, ComponentMap, typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = R_adjacency_list<undirectedS, double>; ComponentMap = int*; typename property_traits<IndexMap>::value_type = int; typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits<Graph>::traversal_category = undir_adj_list_traversal_tag]’
106 | depth_first_search(g, visitor(vis));
| ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~
interfaces.cpp:205:29: required from here
205 | connected_components(g, &component[0]);
| ~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::concepts::MultiPassInputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > >, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > >, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > >, boost::property<boost::edge_weight_t, double, 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(); }
| ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::MultiPassInputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > >, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > >, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > >, boost::property<boost::edge_weight_t, double, boost::no_property> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:89:9: required from ‘boost::concepts::IncidenceGraph<G>::~IncidenceGraph() [with G = R_adjacency_list<boost::undirectedS, double>]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/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<R_adjacency_list<boost::undirectedS, double> >]’
75 | BOOST_concept(IncidenceGraph, (G)) : Graph< G >
| ^~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:129:9: required from ‘void boost::detail::depth_first_visit_impl(const IncidenceGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, DFSVisitor&, ColorMap, TerminatorFunc) [with IncidenceGraph = R_adjacency_list<boost::undirectedS, double>; DFSVisitor = components_recorder<int*>; ColorMap = boost::shared_array_property_map<boost::default_color_type, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int> >; TerminatorFunc = nontruth2; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:286:39: required from ‘void boost::depth_first_search(const VertexListGraph&, DFSVisitor, ColorMap, typename graph_traits<Graph>::vertex_descriptor) [with VertexListGraph = R_adjacency_list<undirectedS, double>; DFSVisitor = detail::components_recorder<int*>; ColorMap = shared_array_property_map<default_color_type, vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int> >; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
286 | detail::depth_first_visit_impl(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
287 | g, start_vertex, vis, color, detail::nontruth2());
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:397:42: required from ‘void boost::graph::detail::depth_first_search_impl<Graph>::operator()(const Graph&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<boost::graph::keywords::tag::visitor, const boost::detail::components_recorder<int*> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; Graph = R_adjacency_list<boost::undirectedS, double>]’
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)]);
| ~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/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 = R_adjacency_list<boost::undirectedS, double>; ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<keywords::tag::visitor, const boost::detail::components_recorder<int*> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; typename boost::result_of<detail::depth_first_search_impl<Param0>(Param0, const ArgPack&)>::type = void]’
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); \
| ~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/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 = R_adjacency_list<undirectedS, double>; P = detail::components_recorder<int*>; T = graph_visitor_t; R = no_property; typename result_of<graph::detail::depth_first_search_impl<Param0>(Param0, const typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<T, Tag, Base> >::type&)>::type = void; typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<T, Tag, Base> >::type = parameter::aux::arg_list<parameter::aux::tagged_argument<graph::keywords::tag::visitor, const detail::components_recorder<int*> >, parameter::aux::empty_arg_list, std::integral_constant<bool, true> >]’
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); \
| ~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/connected_components.hpp:106:23: required from ‘typename boost::property_traits<IndexMap>::value_type boost::connected_components(const Graph&, ComponentMap, typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = R_adjacency_list<undirectedS, double>; ComponentMap = int*; typename property_traits<IndexMap>::value_type = int; typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits<Graph>::traversal_category = undir_adj_list_traversal_tag]’
106 | depth_first_search(g, visitor(vis));
| ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~
interfaces.cpp:205:29: required from here
205 | connected_components(g, &component[0]);
| ~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::concepts::MultiPassInputIterator<T>::~MultiPassInputIterator() [with T = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > >, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > >, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > >, boost::property<boost::edge_weight_t, double, boost::no_property> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int>]’
37 | ~model()
| ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:52:50: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
52 | BOOST_concept(MultiPassInputIterator, (T)) { BOOST_CONCEPT_USAGE(
| ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::DefaultConstructible<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:137:5: required from ‘struct boost::DefaultConstructible<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> >’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::DefaultConstructible<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> >]’
32 | inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
| ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied<boost::DefaultConstructible<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >::value’
44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied<boost::DefaultConstructible<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >’
45 | typedef boost::integral_constant<bool, value> type;
| ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_<void (*)(boost::DefaultConstructible<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> >)>’
72 | struct requirement_<void(*)(Model)>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:90:9: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:286:39: required from ‘void boost::depth_first_search(const VertexListGraph&, DFSVisitor, ColorMap, typename graph_traits<Graph>::vertex_descriptor) [with VertexListGraph = R_adjacency_list<undirectedS, double>; DFSVisitor = detail::components_recorder<int*>; ColorMap = shared_array_property_map<default_color_type, vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int> >; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
286 | detail::depth_first_visit_impl(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
287 | g, start_vertex, vis, color, detail::nontruth2());
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:397:42: required from ‘void boost::graph::detail::depth_first_search_impl<Graph>::operator()(const Graph&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<boost::graph::keywords::tag::visitor, const boost::detail::components_recorder<int*> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; Graph = R_adjacency_list<boost::undirectedS, double>]’
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)]);
| ~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/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 = R_adjacency_list<boost::undirectedS, double>; ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<keywords::tag::visitor, const boost::detail::components_recorder<int*> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; typename boost::result_of<detail::depth_first_search_impl<Param0>(Param0, const ArgPack&)>::type = void]’
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); \
| ~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/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 = R_adjacency_list<undirectedS, double>; P = detail::components_recorder<int*>; T = graph_visitor_t; R = no_property; typename result_of<graph::detail::depth_first_search_impl<Param0>(Param0, const typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<T, Tag, Base> >::type&)>::type = void; typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<T, Tag, Base> >::type = parameter::aux::arg_list<parameter::aux::tagged_argument<graph::keywords::tag::visitor, const detail::components_recorder<int*> >, parameter::aux::empty_arg_list, std::integral_constant<bool, true> >]’
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); \
| ~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/connected_components.hpp:106:23: required from ‘typename boost::property_traits<IndexMap>::value_type boost::connected_components(const Graph&, ComponentMap, typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = R_adjacency_list<undirectedS, double>; ComponentMap = int*; typename property_traits<IndexMap>::value_type = int; typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits<Graph>::traversal_category = undir_adj_list_traversal_tag]’
106 | depth_first_search(g, visitor(vis));
| ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~
interfaces.cpp:205:29: required from here
205 | connected_components(g, &component[0]);
| ~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::DefaultConstructible<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> >]’
20 | ~usage_requirements() { ((Model*)0)->~Model(); }
| ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::DefaultConstructible<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:90:9: required from ‘boost::concepts::IncidenceGraph<G>::~IncidenceGraph() [with G = R_adjacency_list<boost::undirectedS, double>]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/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<R_adjacency_list<boost::undirectedS, double> >]’
75 | BOOST_concept(IncidenceGraph, (G)) : Graph< G >
| ^~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:129:9: required from ‘void boost::detail::depth_first_visit_impl(const IncidenceGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, DFSVisitor&, ColorMap, TerminatorFunc) [with IncidenceGraph = R_adjacency_list<boost::undirectedS, double>; DFSVisitor = components_recorder<int*>; ColorMap = boost::shared_array_property_map<boost::default_color_type, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int> >; TerminatorFunc = nontruth2; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:286:39: required from ‘void boost::depth_first_search(const VertexListGraph&, DFSVisitor, ColorMap, typename graph_traits<Graph>::vertex_descriptor) [with VertexListGraph = R_adjacency_list<undirectedS, double>; DFSVisitor = detail::components_recorder<int*>; ColorMap = shared_array_property_map<default_color_type, vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int> >; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
286 | detail::depth_first_visit_impl(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
287 | g, start_vertex, vis, color, detail::nontruth2());
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:397:42: required from ‘void boost::graph::detail::depth_first_search_impl<Graph>::operator()(const Graph&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<boost::graph::keywords::tag::visitor, const boost::detail::components_recorder<int*> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; Graph = R_adjacency_list<boost::undirectedS, double>]’
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)]);
| ~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/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 = R_adjacency_list<boost::undirectedS, double>; ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<keywords::tag::visitor, const boost::detail::components_recorder<int*> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; typename boost::result_of<detail::depth_first_search_impl<Param0>(Param0, const ArgPack&)>::type = void]’
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); \
| ~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/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 = R_adjacency_list<undirectedS, double>; P = detail::components_recorder<int*>; T = graph_visitor_t; R = no_property; typename result_of<graph::detail::depth_first_search_impl<Param0>(Param0, const typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<T, Tag, Base> >::type&)>::type = void; typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<T, Tag, Base> >::type = parameter::aux::arg_list<parameter::aux::tagged_argument<graph::keywords::tag::visitor, const detail::components_recorder<int*> >, parameter::aux::empty_arg_list, std::integral_constant<bool, true> >]’
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); \
| ~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/connected_components.hpp:106:23: required from ‘typename boost::property_traits<IndexMap>::value_type boost::connected_components(const Graph&, ComponentMap, typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = R_adjacency_list<undirectedS, double>; ComponentMap = int*; typename property_traits<IndexMap>::value_type = int; typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits<Graph>::traversal_category = undir_adj_list_traversal_tag]’
106 | depth_first_search(g, visitor(vis));
| ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~
interfaces.cpp:205:29: required from here
205 | connected_components(g, &component[0]);
| ~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::DefaultConstructible<TT>::~DefaultConstructible() [with TT = boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>]’
37 | ~model()
| ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:137:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
137 | BOOST_CONCEPT_USAGE(DefaultConstructible) {
| ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::EqualityComparable<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> >’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::EqualityComparable<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> >]’
32 | inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
| ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied<boost::EqualityComparable<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >::value’
44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied<boost::EqualityComparable<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >’
45 | typedef boost::integral_constant<bool, value> type;
| ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_<void (*)(boost::EqualityComparable<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> >)>’
72 | struct requirement_<void(*)(Model)>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:91:9: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:286:39: required from ‘void boost::depth_first_search(const VertexListGraph&, DFSVisitor, ColorMap, typename graph_traits<Graph>::vertex_descriptor) [with VertexListGraph = R_adjacency_list<undirectedS, double>; DFSVisitor = detail::components_recorder<int*>; ColorMap = shared_array_property_map<default_color_type, vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int> >; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
286 | detail::depth_first_visit_impl(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
287 | g, start_vertex, vis, color, detail::nontruth2());
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:397:42: required from ‘void boost::graph::detail::depth_first_search_impl<Graph>::operator()(const Graph&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<boost::graph::keywords::tag::visitor, const boost::detail::components_recorder<int*> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; Graph = R_adjacency_list<boost::undirectedS, double>]’
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)]);
| ~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/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 = R_adjacency_list<boost::undirectedS, double>; ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<keywords::tag::visitor, const boost::detail::components_recorder<int*> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; typename boost::result_of<detail::depth_first_search_impl<Param0>(Param0, const ArgPack&)>::type = void]’
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); \
| ~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/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 = R_adjacency_list<undirectedS, double>; P = detail::components_recorder<int*>; T = graph_visitor_t; R = no_property; typename result_of<graph::detail::depth_first_search_impl<Param0>(Param0, const typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<T, Tag, Base> >::type&)>::type = void; typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<T, Tag, Base> >::type = parameter::aux::arg_list<parameter::aux::tagged_argument<graph::keywords::tag::visitor, const detail::components_recorder<int*> >, parameter::aux::empty_arg_list, std::integral_constant<bool, true> >]’
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); \
| ~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/connected_components.hpp:106:23: required from ‘typename boost::property_traits<IndexMap>::value_type boost::connected_components(const Graph&, ComponentMap, typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = R_adjacency_list<undirectedS, double>; ComponentMap = int*; typename property_traits<IndexMap>::value_type = int; typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits<Graph>::traversal_category = undir_adj_list_traversal_tag]’
106 | depth_first_search(g, visitor(vis));
| ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~
interfaces.cpp:205:29: required from here
205 | connected_components(g, &component[0]);
| ~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::EqualityComparable<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> >]’
20 | ~usage_requirements() { ((Model*)0)->~Model(); }
| ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::EqualityComparable<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:91:9: required from ‘boost::concepts::IncidenceGraph<G>::~IncidenceGraph() [with G = R_adjacency_list<boost::undirectedS, double>]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/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<R_adjacency_list<boost::undirectedS, double> >]’
75 | BOOST_concept(IncidenceGraph, (G)) : Graph< G >
| ^~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:129:9: required from ‘void boost::detail::depth_first_visit_impl(const IncidenceGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, DFSVisitor&, ColorMap, TerminatorFunc) [with IncidenceGraph = R_adjacency_list<boost::undirectedS, double>; DFSVisitor = components_recorder<int*>; ColorMap = boost::shared_array_property_map<boost::default_color_type, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int> >; TerminatorFunc = nontruth2; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:286:39: required from ‘void boost::depth_first_search(const VertexListGraph&, DFSVisitor, ColorMap, typename graph_traits<Graph>::vertex_descriptor) [with VertexListGraph = R_adjacency_list<undirectedS, double>; DFSVisitor = detail::components_recorder<int*>; ColorMap = shared_array_property_map<default_color_type, vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int> >; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
286 | detail::depth_first_visit_impl(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
287 | g, start_vertex, vis, color, detail::nontruth2());
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:397:42: required from ‘void boost::graph::detail::depth_first_search_impl<Graph>::operator()(const Graph&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<boost::graph::keywords::tag::visitor, const boost::detail::components_recorder<int*> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; Graph = R_adjacency_list<boost::undirectedS, double>]’
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)]);
| ~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/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 = R_adjacency_list<boost::undirectedS, double>; ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<keywords::tag::visitor, const boost::detail::components_recorder<int*> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; typename boost::result_of<detail::depth_first_search_impl<Param0>(Param0, const ArgPack&)>::type = void]’
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); \
| ~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/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 = R_adjacency_list<undirectedS, double>; P = detail::components_recorder<int*>; T = graph_visitor_t; R = no_property; typename result_of<graph::detail::depth_first_search_impl<Param0>(Param0, const typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<T, Tag, Base> >::type&)>::type = void; typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<T, Tag, Base> >::type = parameter::aux::arg_list<parameter::aux::tagged_argument<graph::keywords::tag::visitor, const detail::components_recorder<int*> >, parameter::aux::empty_arg_list, std::integral_constant<bool, true> >]’
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); \
| ~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/connected_components.hpp:106:23: required from ‘typename boost::property_traits<IndexMap>::value_type boost::connected_components(const Graph&, ComponentMap, typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = R_adjacency_list<undirectedS, double>; ComponentMap = int*; typename property_traits<IndexMap>::value_type = int; typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits<Graph>::traversal_category = undir_adj_list_traversal_tag]’
106 | depth_first_search(g, visitor(vis));
| ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~
interfaces.cpp:205:29: required from here
205 | connected_components(g, &component[0]);
| ~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::EqualityComparable<TT>::~EqualityComparable() [with TT = boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>]’
37 | ~model()
| ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:233:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
233 | BOOST_CONCEPT_USAGE(EqualityComparable) {
| ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Assignable<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:145:5: required from ‘struct boost::Assignable<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> >’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::Assignable<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> >]’
32 | inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
| ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied<boost::Assignable<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >::value’
44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied<boost::Assignable<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >’
45 | typedef boost::integral_constant<bool, value> type;
| ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_<void (*)(boost::Assignable<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> >)>’
72 | struct requirement_<void(*)(Model)>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:92:9: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:286:39: required from ‘void boost::depth_first_search(const VertexListGraph&, DFSVisitor, ColorMap, typename graph_traits<Graph>::vertex_descriptor) [with VertexListGraph = R_adjacency_list<undirectedS, double>; DFSVisitor = detail::components_recorder<int*>; ColorMap = shared_array_property_map<default_color_type, vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int> >; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
286 | detail::depth_first_visit_impl(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
287 | g, start_vertex, vis, color, detail::nontruth2());
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:397:42: required from ‘void boost::graph::detail::depth_first_search_impl<Graph>::operator()(const Graph&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<boost::graph::keywords::tag::visitor, const boost::detail::components_recorder<int*> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; Graph = R_adjacency_list<boost::undirectedS, double>]’
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)]);
| ~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/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 = R_adjacency_list<boost::undirectedS, double>; ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<keywords::tag::visitor, const boost::detail::components_recorder<int*> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; typename boost::result_of<detail::depth_first_search_impl<Param0>(Param0, const ArgPack&)>::type = void]’
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); \
| ~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/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 = R_adjacency_list<undirectedS, double>; P = detail::components_recorder<int*>; T = graph_visitor_t; R = no_property; typename result_of<graph::detail::depth_first_search_impl<Param0>(Param0, const typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<T, Tag, Base> >::type&)>::type = void; typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<T, Tag, Base> >::type = parameter::aux::arg_list<parameter::aux::tagged_argument<graph::keywords::tag::visitor, const detail::components_recorder<int*> >, parameter::aux::empty_arg_list, std::integral_constant<bool, true> >]’
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); \
| ~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/connected_components.hpp:106:23: required from ‘typename boost::property_traits<IndexMap>::value_type boost::connected_components(const Graph&, ComponentMap, typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = R_adjacency_list<undirectedS, double>; ComponentMap = int*; typename property_traits<IndexMap>::value_type = int; typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits<Graph>::traversal_category = undir_adj_list_traversal_tag]’
106 | depth_first_search(g, visitor(vis));
| ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~
interfaces.cpp:205:29: required from here
205 | connected_components(g, &component[0]);
| ~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Assignable<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> >]’
20 | ~usage_requirements() { ((Model*)0)->~Model(); }
| ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::Assignable<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:92:9: required from ‘boost::concepts::IncidenceGraph<G>::~IncidenceGraph() [with G = R_adjacency_list<boost::undirectedS, double>]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/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<R_adjacency_list<boost::undirectedS, double> >]’
75 | BOOST_concept(IncidenceGraph, (G)) : Graph< G >
| ^~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:129:9: required from ‘void boost::detail::depth_first_visit_impl(const IncidenceGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, DFSVisitor&, ColorMap, TerminatorFunc) [with IncidenceGraph = R_adjacency_list<boost::undirectedS, double>; DFSVisitor = components_recorder<int*>; ColorMap = boost::shared_array_property_map<boost::default_color_type, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int> >; TerminatorFunc = nontruth2; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:286:39: required from ‘void boost::depth_first_search(const VertexListGraph&, DFSVisitor, ColorMap, typename graph_traits<Graph>::vertex_descriptor) [with VertexListGraph = R_adjacency_list<undirectedS, double>; DFSVisitor = detail::components_recorder<int*>; ColorMap = shared_array_property_map<default_color_type, vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int> >; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
286 | detail::depth_first_visit_impl(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
287 | g, start_vertex, vis, color, detail::nontruth2());
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:397:42: required from ‘void boost::graph::detail::depth_first_search_impl<Graph>::operator()(const Graph&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<boost::graph::keywords::tag::visitor, const boost::detail::components_recorder<int*> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; Graph = R_adjacency_list<boost::undirectedS, double>]’
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)]);
| ~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/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 = R_adjacency_list<boost::undirectedS, double>; ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<keywords::tag::visitor, const boost::detail::components_recorder<int*> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; typename boost::result_of<detail::depth_first_search_impl<Param0>(Param0, const ArgPack&)>::type = void]’
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); \
| ~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/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 = R_adjacency_list<undirectedS, double>; P = detail::components_recorder<int*>; T = graph_visitor_t; R = no_property; typename result_of<graph::detail::depth_first_search_impl<Param0>(Param0, const typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<T, Tag, Base> >::type&)>::type = void; typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<T, Tag, Base> >::type = parameter::aux::arg_list<parameter::aux::tagged_argument<graph::keywords::tag::visitor, const detail::components_recorder<int*> >, parameter::aux::empty_arg_list, std::integral_constant<bool, true> >]’
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); \
| ~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/connected_components.hpp:106:23: required from ‘typename boost::property_traits<IndexMap>::value_type boost::connected_components(const Graph&, ComponentMap, typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = R_adjacency_list<undirectedS, double>; ComponentMap = int*; typename property_traits<IndexMap>::value_type = int; typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits<Graph>::traversal_category = undir_adj_list_traversal_tag]’
106 | depth_first_search(g, visitor(vis));
| ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~
interfaces.cpp:205:29: required from here
205 | connected_components(g, &component[0]);
| ~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Assignable<TT>::~Assignable() [with TT = boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>]’
37 | ~model()
| ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:145:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
145 | BOOST_CONCEPT_USAGE(Assignable) {
| ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Convertible<boost::undir_adj_list_traversal_tag, boost::incidence_graph_tag> >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible<boost::undir_adj_list_traversal_tag, boost::incidence_graph_tag>’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::Convertible<boost::undir_adj_list_traversal_tag, boost::incidence_graph_tag>]’
32 | inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
| ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied<boost::Convertible<boost::undir_adj_list_traversal_tag, boost::incidence_graph_tag> >::value’
44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied<boost::Convertible<boost::undir_adj_list_traversal_tag, boost::incidence_graph_tag> >’
45 | typedef boost::integral_constant<bool, value> type;
| ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_<void (*)(boost::Convertible<boost::undir_adj_list_traversal_tag, boost::incidence_graph_tag>)>’
72 | struct requirement_<void(*)(Model)>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:93:9: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:286:39: required from ‘void boost::depth_first_search(const VertexListGraph&, DFSVisitor, ColorMap, typename graph_traits<Graph>::vertex_descriptor) [with VertexListGraph = R_adjacency_list<undirectedS, double>; DFSVisitor = detail::components_recorder<int*>; ColorMap = shared_array_property_map<default_color_type, vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int> >; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
286 | detail::depth_first_visit_impl(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
287 | g, start_vertex, vis, color, detail::nontruth2());
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:397:42: required from ‘void boost::graph::detail::depth_first_search_impl<Graph>::operator()(const Graph&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<boost::graph::keywords::tag::visitor, const boost::detail::components_recorder<int*> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; Graph = R_adjacency_list<boost::undirectedS, double>]’
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)]);
| ~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/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 = R_adjacency_list<boost::undirectedS, double>; ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<keywords::tag::visitor, const boost::detail::components_recorder<int*> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; typename boost::result_of<detail::depth_first_search_impl<Param0>(Param0, const ArgPack&)>::type = void]’
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); \
| ~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/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 = R_adjacency_list<undirectedS, double>; P = detail::components_recorder<int*>; T = graph_visitor_t; R = no_property; typename result_of<graph::detail::depth_first_search_impl<Param0>(Param0, const typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<T, Tag, Base> >::type&)>::type = void; typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<T, Tag, Base> >::type = parameter::aux::arg_list<parameter::aux::tagged_argument<graph::keywords::tag::visitor, const detail::components_recorder<int*> >, parameter::aux::empty_arg_list, std::integral_constant<bool, true> >]’
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); \
| ~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/connected_components.hpp:106:23: required from ‘typename boost::property_traits<IndexMap>::value_type boost::connected_components(const Graph&, ComponentMap, typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = R_adjacency_list<undirectedS, double>; ComponentMap = int*; typename property_traits<IndexMap>::value_type = int; typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits<Graph>::traversal_category = undir_adj_list_traversal_tag]’
106 | depth_first_search(g, visitor(vis));
| ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~
interfaces.cpp:205:29: required from here
205 | connected_components(g, &component[0]);
| ~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Convertible<boost::undir_adj_list_traversal_tag, boost::incidence_graph_tag>]’
20 | ~usage_requirements() { ((Model*)0)->~Model(); }
| ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::Convertible<boost::undir_adj_list_traversal_tag, boost::incidence_graph_tag>]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:93:9: required from ‘boost::concepts::IncidenceGraph<G>::~IncidenceGraph() [with G = R_adjacency_list<boost::undirectedS, double>]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/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<R_adjacency_list<boost::undirectedS, double> >]’
75 | BOOST_concept(IncidenceGraph, (G)) : Graph< G >
| ^~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:129:9: required from ‘void boost::detail::depth_first_visit_impl(const IncidenceGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, DFSVisitor&, ColorMap, TerminatorFunc) [with IncidenceGraph = R_adjacency_list<boost::undirectedS, double>; DFSVisitor = components_recorder<int*>; ColorMap = boost::shared_array_property_map<boost::default_color_type, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int> >; TerminatorFunc = nontruth2; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:286:39: required from ‘void boost::depth_first_search(const VertexListGraph&, DFSVisitor, ColorMap, typename graph_traits<Graph>::vertex_descriptor) [with VertexListGraph = R_adjacency_list<undirectedS, double>; DFSVisitor = detail::components_recorder<int*>; ColorMap = shared_array_property_map<default_color_type, vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int> >; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
286 | detail::depth_first_visit_impl(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
287 | g, start_vertex, vis, color, detail::nontruth2());
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:397:42: required from ‘void boost::graph::detail::depth_first_search_impl<Graph>::operator()(const Graph&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<boost::graph::keywords::tag::visitor, const boost::detail::components_recorder<int*> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; Graph = R_adjacency_list<boost::undirectedS, double>]’
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)]);
| ~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/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 = R_adjacency_list<boost::undirectedS, double>; ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<keywords::tag::visitor, const boost::detail::components_recorder<int*> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; typename boost::result_of<detail::depth_first_search_impl<Param0>(Param0, const ArgPack&)>::type = void]’
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); \
| ~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/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 = R_adjacency_list<undirectedS, double>; P = detail::components_recorder<int*>; T = graph_visitor_t; R = no_property; typename result_of<graph::detail::depth_first_search_impl<Param0>(Param0, const typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<T, Tag, Base> >::type&)>::type = void; typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<T, Tag, Base> >::type = parameter::aux::arg_list<parameter::aux::tagged_argument<graph::keywords::tag::visitor, const detail::components_recorder<int*> >, parameter::aux::empty_arg_list, std::integral_constant<bool, true> >]’
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); \
| ~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/connected_components.hpp:106:23: required from ‘typename boost::property_traits<IndexMap>::value_type boost::connected_components(const Graph&, ComponentMap, typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = R_adjacency_list<undirectedS, double>; ComponentMap = int*; typename property_traits<IndexMap>::value_type = int; typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits<Graph>::traversal_category = undir_adj_list_traversal_tag]’
106 | depth_first_search(g, visitor(vis));
| ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~
interfaces.cpp:205:29: required from here
205 | connected_components(g, &component[0]);
| ~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible<X, Y>::~Convertible() [with X = boost::undir_adj_list_traversal_tag; Y = boost::incidence_graph_tag]’
37 | ~model()
| ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
208 | BOOST_CONCEPT_USAGE(Convertible) {
| ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::constraint<Model>::failed() [with Model = boost::ReadablePropertyMapConcept<int*, long unsigned int>]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:206:7: required from ‘void boost::ReadWritePropertyMapConcept<PMap, Key>::constraints() [with PMap = int*; Key = long unsigned int]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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<int*, long unsigned int>]’
32 | inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
| ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied<boost::ReadWritePropertyMapConcept<int*, long unsigned int> >::value’
44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied<boost::ReadWritePropertyMapConcept<int*, long unsigned int> >’
45 | typedef boost::integral_constant<bool, value> type;
| ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_<void (*)(boost::ReadWritePropertyMapConcept<int*, long unsigned int>)>’
72 | struct requirement_<void(*)(Model)>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/strong_components.hpp:115:9: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/strong_components.hpp:177:63: required from ‘typename boost::property_traits<IndexMap>::value_type boost::detail::scc_helper2(const Graph&, ComponentMap, RootMap, const boost::bgl_named_params<P, T, R>&, DiscoverTimeMap) [with Graph = R_adjacency_list<boost::directedS, double>; ComponentMap = int*; RootMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; P = int; T = int; R = boost::no_property; DiscoverTimeMap = boost::param_not_found; typename boost::property_traits<IndexMap>::value_type = int]’
177 | return strong_comp_dispatch2< DiscoverTimeMap >::apply(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
178 | g, comp, r_map, params, time_map);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/strong_components.hpp:205:31: required from ‘static typename boost::property_traits<IndexMap>::value_type boost::detail::strong_comp_dispatch1<boost::param_not_found>::apply(const Graph&, ComponentMap, const boost::bgl_named_params<P, T, R>&, boost::param_not_found) [with Graph = R_adjacency_list<boost::directedS, double>; ComponentMap = int*; P = int; T = int; R = boost::no_property; typename boost::property_traits<IndexMap>::value_type = int]’
205 | return scc_helper2(g, comp,
| ~~~~~~~~~~~^~~~~~~~~
206 | make_iterator_property_map(root_vec.begin(),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
207 | choose_const_pmap(
| ~~~~~~~~~~~~~~~~~~
208 | get_param(params, vertex_index), g, vertex_index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
209 | root_vec[0]),
| ~~~~~~~~~~~~~
210 | params, get_param(params, vertex_discover_time));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/strong_components.hpp:220:63: required from ‘typename boost::property_traits<IndexMap>::value_type boost::detail::scc_helper1(const Graph&, ComponentMap, const boost::bgl_named_params<P, T, R>&, RootMap) [with Graph = R_adjacency_list<boost::directedS, double>; ComponentMap = int*; RootMap = boost::param_not_found; P = int; T = int; R = boost::no_property; typename boost::property_traits<IndexMap>::value_type = int]’
220 | return detail::strong_comp_dispatch1< RootMap >::apply(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
221 | g, comp, params, r_map);
| ~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/strong_components.hpp:235:31: required from ‘typename boost::property_traits<IndexMap>::value_type boost::strong_components(const Graph&, ComponentMap, const bgl_named_params<P, T, R>&, typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = R_adjacency_list<directedS, double>; ComponentMap = int*; P = int; T = int; R = no_property; typename property_traits<IndexMap>::value_type = int; typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits<Graph>::traversal_category = adj_list_dir_traversal_tag]’
235 | return detail::scc_helper1(
| ~~~~~~~~~~~~~~~~~~~^
236 | g, comp, params, get_param(params, vertex_root_t()));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/strong_components.hpp:249:29: required from ‘typename boost::property_traits<IndexMap>::value_type boost::strong_components(const Graph&, ComponentMap, typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = R_adjacency_list<directedS, double>; ComponentMap = int*; typename property_traits<IndexMap>::value_type = int; typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits<Graph>::traversal_category = adj_list_dir_traversal_tag]’
249 | return strong_components(g, comp, params);
| ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~
interfaces.cpp:232:26: required from here
232 | strong_components(g, &component[0]);
| ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:65:52: warning: ‘this’ pointer is null [-Wnonnull]
65 | static void failed() { ((Model*)0)->constraints(); }
| ~~~~~~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/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 = int*; Key = long unsigned int]’
147 | void constraints() {
| ^~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Convertible<long unsigned int, long unsigned int>]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Convertible<long unsigned int, long unsigned int> >]’
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible<long unsigned int, long unsigned int>’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:206:3: required from ‘struct boost::ConvertibleConcept<long unsigned int, long unsigned int>’
206 | BOOST_concept(Convertible,(X)(Y))
| ^~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::ConvertibleConcept<long unsigned int, long unsigned int>]’
32 | inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
| ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied<boost::ConvertibleConcept<long unsigned int, long unsigned int> >::value’
44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/strong_components.hpp:177:63: required from ‘typename boost::property_traits<IndexMap>::value_type boost::detail::scc_helper2(const Graph&, ComponentMap, RootMap, const boost::bgl_named_params<P, T, R>&, DiscoverTimeMap) [with Graph = R_adjacency_list<boost::directedS, double>; ComponentMap = int*; RootMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; P = int; T = int; R = boost::no_property; DiscoverTimeMap = boost::param_not_found; typename boost::property_traits<IndexMap>::value_type = int]’
177 | return strong_comp_dispatch2< DiscoverTimeMap >::apply(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
178 | g, comp, r_map, params, time_map);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/strong_components.hpp:205:31: required from ‘static typename boost::property_traits<IndexMap>::value_type boost::detail::strong_comp_dispatch1<boost::param_not_found>::apply(const Graph&, ComponentMap, const boost::bgl_named_params<P, T, R>&, boost::param_not_found) [with Graph = R_adjacency_list<boost::directedS, double>; ComponentMap = int*; P = int; T = int; R = boost::no_property; typename boost::property_traits<IndexMap>::value_type = int]’
205 | return scc_helper2(g, comp,
| ~~~~~~~~~~~^~~~~~~~~
206 | make_iterator_property_map(root_vec.begin(),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
207 | choose_const_pmap(
| ~~~~~~~~~~~~~~~~~~
208 | get_param(params, vertex_index), g, vertex_index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
209 | root_vec[0]),
| ~~~~~~~~~~~~~
210 | params, get_param(params, vertex_discover_time));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/strong_components.hpp:220:63: required from ‘typename boost::property_traits<IndexMap>::value_type boost::detail::scc_helper1(const Graph&, ComponentMap, const boost::bgl_named_params<P, T, R>&, RootMap) [with Graph = R_adjacency_list<boost::directedS, double>; ComponentMap = int*; RootMap = boost::param_not_found; P = int; T = int; R = boost::no_property; typename boost::property_traits<IndexMap>::value_type = int]’
220 | return detail::strong_comp_dispatch1< RootMap >::apply(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
221 | g, comp, params, r_map);
| ~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/strong_components.hpp:235:31: required from ‘typename boost::property_traits<IndexMap>::value_type boost::strong_components(const Graph&, ComponentMap, const bgl_named_params<P, T, R>&, typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = R_adjacency_list<directedS, double>; ComponentMap = int*; P = int; T = int; R = no_property; typename property_traits<IndexMap>::value_type = int; typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits<Graph>::traversal_category = adj_list_dir_traversal_tag]’
235 | return detail::scc_helper1(
| ~~~~~~~~~~~~~~~~~~~^
236 | g, comp, params, get_param(params, vertex_root_t()));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/strong_components.hpp:249:29: required from ‘typename boost::property_traits<IndexMap>::value_type boost::strong_components(const Graph&, ComponentMap, typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = R_adjacency_list<directedS, double>; ComponentMap = int*; typename property_traits<IndexMap>::value_type = int; typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits<Graph>::traversal_category = adj_list_dir_traversal_tag]’
249 | return strong_components(g, comp, params);
| ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~
interfaces.cpp:232:26: required from here
232 | strong_components(g, &component[0]);
| ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
20 | ~usage_requirements() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible<X, Y>::~Convertible() [with X = long unsigned int; Y = long unsigned int]’
37 | ~model()
| ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
208 | BOOST_CONCEPT_USAGE(Convertible) {
| ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::concepts::MultiPassInputIterator<boost::range_detail::integer_iterator<long unsigned int> > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:52:50: required from ‘struct boost::concepts::MultiPassInputIterator<boost::range_detail::integer_iterator<long unsigned int> >’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::concepts::MultiPassInputIterator<boost::range_detail::integer_iterator<long unsigned int> >]’
32 | inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
| ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied<boost::concepts::MultiPassInputIterator<boost::range_detail::integer_iterator<long unsigned int> > >::value’
44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied<boost::concepts::MultiPassInputIterator<boost::range_detail::integer_iterator<long unsigned int> > >’
45 | typedef boost::integral_constant<bool, value> type;
| ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_<void (*)(boost::concepts::MultiPassInputIterator<boost::range_detail::integer_iterator<long unsigned int> >)>’
72 | struct requirement_<void(*)(Model)>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:184:9: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/biconnected_components.hpp:250:47: required from ‘static std::pair<long unsigned int, OutputIterator> boost::detail::bicomp_dispatch3<boost::param_not_found>::apply(const Graph&, ComponentMap, OutputIterator, VertexIndexMap, DiscoverTimeMap, LowPointMap, const boost::bgl_named_params<P, T, R>&, boost::param_not_found) [with Graph = R_adjacency_list<boost::undirectedS, double>; ComponentMap = boost::dummy_property_map; OutputIterator = std::back_insert_iterator<std::vector<long unsigned int> >; VertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>; DiscoverTimeMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; LowPointMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; P = int; T = boost::buffer_param_t; R = boost::no_property]’
250 | return biconnected_components_impl(g, comp, out, index_map, dtm,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
251 | lowpt,
| ~~~~~~
252 | make_iterator_property_map(pred.begin(), index_map, vert),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
253 | choose_param(get_param(params, graph_visitor),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
254 | make_dfs_visitor(null_visitor())));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/biconnected_components.hpp:295:60: required from ‘static std::pair<long unsigned int, OutputIterator> boost::detail::bicomp_dispatch2<boost::param_not_found>::apply(const Graph&, ComponentMap, OutputIterator, VertexIndexMap, DiscoverTimeMap, const boost::bgl_named_params<P, T, R>&, boost::param_not_found) [with Graph = R_adjacency_list<boost::undirectedS, double>; ComponentMap = boost::dummy_property_map; OutputIterator = std::back_insert_iterator<std::vector<long unsigned int> >; VertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>; DiscoverTimeMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; P = int; T = boost::buffer_param_t; R = boost::no_property]’
295 | return bicomp_dispatch3< dispatch_type >::apply(g, comp, out,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
296 | index_map, dtm,
| ~~~~~~~~~~~~~~~
297 | make_iterator_property_map(lowpt.begin(), index_map, vst),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
298 | params, get_param(params, vertex_predecessor));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/biconnected_components.hpp:336:60: required from ‘static std::pair<long unsigned int, OutputIterator> boost::detail::bicomp_dispatch1<boost::param_not_found>::apply(const Graph&, ComponentMap, OutputIterator, VertexIndexMap, const boost::bgl_named_params<P, T, R>&, boost::param_not_found) [with Graph = R_adjacency_list<boost::undirectedS, double>; ComponentMap = boost::dummy_property_map; OutputIterator = std::back_insert_iterator<std::vector<long unsigned int> >; VertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>; P = int; T = boost::buffer_param_t; R = boost::no_property]’
336 | return bicomp_dispatch2< dispatch_type >::apply(g, comp, out,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
337 | index_map,
| ~~~~~~~~~~
338 | make_iterator_property_map(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~
339 | discover_time.begin(), index_map, vst),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
340 | params, get_param(params, vertex_lowpoint));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/biconnected_components.hpp:368:60: required from ‘std::pair<long unsigned int, OutputIterator> boost::biconnected_components(const Graph&, ComponentMap, OutputIterator, const bgl_named_params<P, T, R>&) [with Graph = R_adjacency_list<undirectedS, double>; ComponentMap = dummy_property_map; OutputIterator = std::back_insert_iterator<std::vector<long unsigned int> >; P = int; T = buffer_param_t; R = no_property]’
368 | return detail::bicomp_dispatch1< dispatch_type >::apply(g, comp, out,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
369 | choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
370 | params, get_param(params, vertex_discover_time));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/biconnected_components.hpp:433:34: required from ‘OutputIterator boost::articulation_points(const Graph&, OutputIterator) [with Graph = R_adjacency_list<undirectedS, double>; OutputIterator = std::back_insert_iterator<std::vector<long unsigned int> >]’
433 | return biconnected_components(g, dummy_property_map(), out,
| ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
434 | bgl_named_params< int, buffer_param_t >(0))
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
interfaces.cpp:300:28: required from here
300 | articulation_points(g, std::back_inserter(art_points));
| ~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::concepts::MultiPassInputIterator<boost::range_detail::integer_iterator<long unsigned int> >]’
20 | ~usage_requirements() { ((Model*)0)->~Model(); }
| ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::MultiPassInputIterator<boost::range_detail::integer_iterator<long unsigned int> >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:184:9: required from ‘boost::concepts::VertexListGraph<G>::~VertexListGraph() [with G = R_adjacency_list<boost::undirectedS, double>]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/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<R_adjacency_list<boost::undirectedS, double> >]’
176 | BOOST_concept(VertexListGraph, (G)) : Graph< G >
| ^~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/biconnected_components.hpp:188:9: required from ‘std::pair<long unsigned int, OutputIterator> boost::detail::biconnected_components_impl(const Graph&, ComponentMap, OutputIterator, VertexIndexMap, DiscoverTimeMap, LowPointMap, PredecessorMap, DFSVisitor) [with Graph = R_adjacency_list<boost::undirectedS, double>; ComponentMap = boost::dummy_property_map; OutputIterator = std::back_insert_iterator<std::vector<long unsigned int> >; VertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>; DiscoverTimeMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; LowPointMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; PredecessorMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; DFSVisitor = boost::dfs_visitor<>]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/biconnected_components.hpp:250:47: required from ‘static std::pair<long unsigned int, OutputIterator> boost::detail::bicomp_dispatch3<boost::param_not_found>::apply(const Graph&, ComponentMap, OutputIterator, VertexIndexMap, DiscoverTimeMap, LowPointMap, const boost::bgl_named_params<P, T, R>&, boost::param_not_found) [with Graph = R_adjacency_list<boost::undirectedS, double>; ComponentMap = boost::dummy_property_map; OutputIterator = std::back_insert_iterator<std::vector<long unsigned int> >; VertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>; DiscoverTimeMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; LowPointMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; P = int; T = boost::buffer_param_t; R = boost::no_property]’
250 | return biconnected_components_impl(g, comp, out, index_map, dtm,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
251 | lowpt,
| ~~~~~~
252 | make_iterator_property_map(pred.begin(), index_map, vert),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
253 | choose_param(get_param(params, graph_visitor),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
254 | make_dfs_visitor(null_visitor())));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/biconnected_components.hpp:295:60: required from ‘static std::pair<long unsigned int, OutputIterator> boost::detail::bicomp_dispatch2<boost::param_not_found>::apply(const Graph&, ComponentMap, OutputIterator, VertexIndexMap, DiscoverTimeMap, const boost::bgl_named_params<P, T, R>&, boost::param_not_found) [with Graph = R_adjacency_list<boost::undirectedS, double>; ComponentMap = boost::dummy_property_map; OutputIterator = std::back_insert_iterator<std::vector<long unsigned int> >; VertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>; DiscoverTimeMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; P = int; T = boost::buffer_param_t; R = boost::no_property]’
295 | return bicomp_dispatch3< dispatch_type >::apply(g, comp, out,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
296 | index_map, dtm,
| ~~~~~~~~~~~~~~~
297 | make_iterator_property_map(lowpt.begin(), index_map, vst),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
298 | params, get_param(params, vertex_predecessor));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/biconnected_components.hpp:336:60: required from ‘static std::pair<long unsigned int, OutputIterator> boost::detail::bicomp_dispatch1<boost::param_not_found>::apply(const Graph&, ComponentMap, OutputIterator, VertexIndexMap, const boost::bgl_named_params<P, T, R>&, boost::param_not_found) [with Graph = R_adjacency_list<boost::undirectedS, double>; ComponentMap = boost::dummy_property_map; OutputIterator = std::back_insert_iterator<std::vector<long unsigned int> >; VertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>; P = int; T = boost::buffer_param_t; R = boost::no_property]’
336 | return bicomp_dispatch2< dispatch_type >::apply(g, comp, out,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
337 | index_map,
| ~~~~~~~~~~
338 | make_iterator_property_map(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~
339 | discover_time.begin(), index_map, vst),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
340 | params, get_param(params, vertex_lowpoint));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/biconnected_components.hpp:368:60: required from ‘std::pair<long unsigned int, OutputIterator> boost::biconnected_components(const Graph&, ComponentMap, OutputIterator, const bgl_named_params<P, T, R>&) [with Graph = R_adjacency_list<undirectedS, double>; ComponentMap = dummy_property_map; OutputIterator = std::back_insert_iterator<std::vector<long unsigned int> >; P = int; T = buffer_param_t; R = no_property]’
368 | return detail::bicomp_dispatch1< dispatch_type >::apply(g, comp, out,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
369 | choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
370 | params, get_param(params, vertex_discover_time));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/biconnected_components.hpp:433:34: required from ‘OutputIterator boost::articulation_points(const Graph&, OutputIterator) [with Graph = R_adjacency_list<undirectedS, double>; OutputIterator = std::back_insert_iterator<std::vector<long unsigned int> >]’
433 | return biconnected_components(g, dummy_property_map(), out,
| ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
434 | bgl_named_params< int, buffer_param_t >(0))
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
interfaces.cpp:300:28: required from here
300 | articulation_points(g, std::back_inserter(art_points));
| ~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::concepts::MultiPassInputIterator<T>::~MultiPassInputIterator() [with T = boost::range_detail::integer_iterator<long unsigned int>]’
37 | ~model()
| ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:52:50: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
52 | BOOST_concept(MultiPassInputIterator, (T)) { BOOST_CONCEPT_USAGE(
| ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Convertible<boost::undir_adj_list_traversal_tag, boost::vertex_list_graph_tag> >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible<boost::undir_adj_list_traversal_tag, boost::vertex_list_graph_tag>’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::Convertible<boost::undir_adj_list_traversal_tag, boost::vertex_list_graph_tag>]’
32 | inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
| ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied<boost::Convertible<boost::undir_adj_list_traversal_tag, boost::vertex_list_graph_tag> >::value’
44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied<boost::Convertible<boost::undir_adj_list_traversal_tag, boost::vertex_list_graph_tag> >’
45 | typedef boost::integral_constant<bool, value> type;
| ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_<void (*)(boost::Convertible<boost::undir_adj_list_traversal_tag, boost::vertex_list_graph_tag>)>’
72 | struct requirement_<void(*)(Model)>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:185:9: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/biconnected_components.hpp:250:47: required from ‘static std::pair<long unsigned int, OutputIterator> boost::detail::bicomp_dispatch3<boost::param_not_found>::apply(const Graph&, ComponentMap, OutputIterator, VertexIndexMap, DiscoverTimeMap, LowPointMap, const boost::bgl_named_params<P, T, R>&, boost::param_not_found) [with Graph = R_adjacency_list<boost::undirectedS, double>; ComponentMap = boost::dummy_property_map; OutputIterator = std::back_insert_iterator<std::vector<long unsigned int> >; VertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>; DiscoverTimeMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; LowPointMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; P = int; T = boost::buffer_param_t; R = boost::no_property]’
250 | return biconnected_components_impl(g, comp, out, index_map, dtm,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
251 | lowpt,
| ~~~~~~
252 | make_iterator_property_map(pred.begin(), index_map, vert),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
253 | choose_param(get_param(params, graph_visitor),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
254 | make_dfs_visitor(null_visitor())));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/biconnected_components.hpp:295:60: required from ‘static std::pair<long unsigned int, OutputIterator> boost::detail::bicomp_dispatch2<boost::param_not_found>::apply(const Graph&, ComponentMap, OutputIterator, VertexIndexMap, DiscoverTimeMap, const boost::bgl_named_params<P, T, R>&, boost::param_not_found) [with Graph = R_adjacency_list<boost::undirectedS, double>; ComponentMap = boost::dummy_property_map; OutputIterator = std::back_insert_iterator<std::vector<long unsigned int> >; VertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>; DiscoverTimeMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; P = int; T = boost::buffer_param_t; R = boost::no_property]’
295 | return bicomp_dispatch3< dispatch_type >::apply(g, comp, out,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
296 | index_map, dtm,
| ~~~~~~~~~~~~~~~
297 | make_iterator_property_map(lowpt.begin(), index_map, vst),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
298 | params, get_param(params, vertex_predecessor));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/biconnected_components.hpp:336:60: required from ‘static std::pair<long unsigned int, OutputIterator> boost::detail::bicomp_dispatch1<boost::param_not_found>::apply(const Graph&, ComponentMap, OutputIterator, VertexIndexMap, const boost::bgl_named_params<P, T, R>&, boost::param_not_found) [with Graph = R_adjacency_list<boost::undirectedS, double>; ComponentMap = boost::dummy_property_map; OutputIterator = std::back_insert_iterator<std::vector<long unsigned int> >; VertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>; P = int; T = boost::buffer_param_t; R = boost::no_property]’
336 | return bicomp_dispatch2< dispatch_type >::apply(g, comp, out,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
337 | index_map,
| ~~~~~~~~~~
338 | make_iterator_property_map(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~
339 | discover_time.begin(), index_map, vst),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
340 | params, get_param(params, vertex_lowpoint));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/biconnected_components.hpp:368:60: required from ‘std::pair<long unsigned int, OutputIterator> boost::biconnected_components(const Graph&, ComponentMap, OutputIterator, const bgl_named_params<P, T, R>&) [with Graph = R_adjacency_list<undirectedS, double>; ComponentMap = dummy_property_map; OutputIterator = std::back_insert_iterator<std::vector<long unsigned int> >; P = int; T = buffer_param_t; R = no_property]’
368 | return detail::bicomp_dispatch1< dispatch_type >::apply(g, comp, out,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
369 | choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
370 | params, get_param(params, vertex_discover_time));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/biconnected_components.hpp:433:34: required from ‘OutputIterator boost::articulation_points(const Graph&, OutputIterator) [with Graph = R_adjacency_list<undirectedS, double>; OutputIterator = std::back_insert_iterator<std::vector<long unsigned int> >]’
433 | return biconnected_components(g, dummy_property_map(), out,
| ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
434 | bgl_named_params< int, buffer_param_t >(0))
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
interfaces.cpp:300:28: required from here
300 | articulation_points(g, std::back_inserter(art_points));
| ~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Convertible<boost::undir_adj_list_traversal_tag, boost::vertex_list_graph_tag>]’
20 | ~usage_requirements() { ((Model*)0)->~Model(); }
| ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::Convertible<boost::undir_adj_list_traversal_tag, boost::vertex_list_graph_tag>]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:185:9: required from ‘boost::concepts::VertexListGraph<G>::~VertexListGraph() [with G = R_adjacency_list<boost::undirectedS, double>]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/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<R_adjacency_list<boost::undirectedS, double> >]’
176 | BOOST_concept(VertexListGraph, (G)) : Graph< G >
| ^~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/biconnected_components.hpp:188:9: required from ‘std::pair<long unsigned int, OutputIterator> boost::detail::biconnected_components_impl(const Graph&, ComponentMap, OutputIterator, VertexIndexMap, DiscoverTimeMap, LowPointMap, PredecessorMap, DFSVisitor) [with Graph = R_adjacency_list<boost::undirectedS, double>; ComponentMap = boost::dummy_property_map; OutputIterator = std::back_insert_iterator<std::vector<long unsigned int> >; VertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>; DiscoverTimeMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; LowPointMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; PredecessorMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; DFSVisitor = boost::dfs_visitor<>]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/biconnected_components.hpp:250:47: required from ‘static std::pair<long unsigned int, OutputIterator> boost::detail::bicomp_dispatch3<boost::param_not_found>::apply(const Graph&, ComponentMap, OutputIterator, VertexIndexMap, DiscoverTimeMap, LowPointMap, const boost::bgl_named_params<P, T, R>&, boost::param_not_found) [with Graph = R_adjacency_list<boost::undirectedS, double>; ComponentMap = boost::dummy_property_map; OutputIterator = std::back_insert_iterator<std::vector<long unsigned int> >; VertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>; DiscoverTimeMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; LowPointMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; P = int; T = boost::buffer_param_t; R = boost::no_property]’
250 | return biconnected_components_impl(g, comp, out, index_map, dtm,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
251 | lowpt,
| ~~~~~~
252 | make_iterator_property_map(pred.begin(), index_map, vert),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
253 | choose_param(get_param(params, graph_visitor),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
254 | make_dfs_visitor(null_visitor())));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/biconnected_components.hpp:295:60: required from ‘static std::pair<long unsigned int, OutputIterator> boost::detail::bicomp_dispatch2<boost::param_not_found>::apply(const Graph&, ComponentMap, OutputIterator, VertexIndexMap, DiscoverTimeMap, const boost::bgl_named_params<P, T, R>&, boost::param_not_found) [with Graph = R_adjacency_list<boost::undirectedS, double>; ComponentMap = boost::dummy_property_map; OutputIterator = std::back_insert_iterator<std::vector<long unsigned int> >; VertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>; DiscoverTimeMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; P = int; T = boost::buffer_param_t; R = boost::no_property]’
295 | return bicomp_dispatch3< dispatch_type >::apply(g, comp, out,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
296 | index_map, dtm,
| ~~~~~~~~~~~~~~~
297 | make_iterator_property_map(lowpt.begin(), index_map, vst),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
298 | params, get_param(params, vertex_predecessor));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/biconnected_components.hpp:336:60: required from ‘static std::pair<long unsigned int, OutputIterator> boost::detail::bicomp_dispatch1<boost::param_not_found>::apply(const Graph&, ComponentMap, OutputIterator, VertexIndexMap, const boost::bgl_named_params<P, T, R>&, boost::param_not_found) [with Graph = R_adjacency_list<boost::undirectedS, double>; ComponentMap = boost::dummy_property_map; OutputIterator = std::back_insert_iterator<std::vector<long unsigned int> >; VertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>; P = int; T = boost::buffer_param_t; R = boost::no_property]’
336 | return bicomp_dispatch2< dispatch_type >::apply(g, comp, out,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
337 | index_map,
| ~~~~~~~~~~
338 | make_iterator_property_map(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~
339 | discover_time.begin(), index_map, vst),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
340 | params, get_param(params, vertex_lowpoint));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/biconnected_components.hpp:368:60: required from ‘std::pair<long unsigned int, OutputIterator> boost::biconnected_components(const Graph&, ComponentMap, OutputIterator, const bgl_named_params<P, T, R>&) [with Graph = R_adjacency_list<undirectedS, double>; ComponentMap = dummy_property_map; OutputIterator = std::back_insert_iterator<std::vector<long unsigned int> >; P = int; T = buffer_param_t; R = no_property]’
368 | return detail::bicomp_dispatch1< dispatch_type >::apply(g, comp, out,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
369 | choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
370 | params, get_param(params, vertex_discover_time));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/biconnected_components.hpp:433:34: required from ‘OutputIterator boost::articulation_points(const Graph&, OutputIterator) [with Graph = R_adjacency_list<undirectedS, double>; OutputIterator = std::back_insert_iterator<std::vector<long unsigned int> >]’
433 | return biconnected_components(g, dummy_property_map(), out,
| ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
434 | bgl_named_params< int, buffer_param_t >(0))
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
interfaces.cpp:300:28: required from here
300 | articulation_points(g, std::back_inserter(art_points));
| ~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible<X, Y>::~Convertible() [with X = boost::undir_adj_list_traversal_tag; Y = boost::vertex_list_graph_tag]’
37 | ~model()
| ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
208 | BOOST_CONCEPT_USAGE(Convertible) {
| ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Convertible<boost::read_write_property_map_tag, boost::writable_property_map_tag>]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Convertible<boost::read_write_property_map_tag, boost::writable_property_map_tag> >]’
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible<boost::read_write_property_map_tag, boost::writable_property_map_tag>’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:206:3: required from ‘struct boost::ConvertibleConcept<boost::read_write_property_map_tag, boost::writable_property_map_tag>’
206 | BOOST_concept(Convertible,(X)(Y))
| ^~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::ConvertibleConcept<boost::read_write_property_map_tag, boost::writable_property_map_tag>]’
32 | inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
| ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied<boost::ConvertibleConcept<boost::read_write_property_map_tag, boost::writable_property_map_tag> >::value’
44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 8 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/biconnected_components.hpp:250:47: required from ‘static std::pair<long unsigned int, OutputIterator> boost::detail::bicomp_dispatch3<boost::param_not_found>::apply(const Graph&, ComponentMap, OutputIterator, VertexIndexMap, DiscoverTimeMap, LowPointMap, const boost::bgl_named_params<P, T, R>&, boost::param_not_found) [with Graph = R_adjacency_list<boost::undirectedS, double>; ComponentMap = boost::dummy_property_map; OutputIterator = std::back_insert_iterator<std::vector<long unsigned int> >; VertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>; DiscoverTimeMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; LowPointMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; P = int; T = boost::buffer_param_t; R = boost::no_property]’
250 | return biconnected_components_impl(g, comp, out, index_map, dtm,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
251 | lowpt,
| ~~~~~~
252 | make_iterator_property_map(pred.begin(), index_map, vert),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
253 | choose_param(get_param(params, graph_visitor),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
254 | make_dfs_visitor(null_visitor())));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/biconnected_components.hpp:295:60: required from ‘static std::pair<long unsigned int, OutputIterator> boost::detail::bicomp_dispatch2<boost::param_not_found>::apply(const Graph&, ComponentMap, OutputIterator, VertexIndexMap, DiscoverTimeMap, const boost::bgl_named_params<P, T, R>&, boost::param_not_found) [with Graph = R_adjacency_list<boost::undirectedS, double>; ComponentMap = boost::dummy_property_map; OutputIterator = std::back_insert_iterator<std::vector<long unsigned int> >; VertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>; DiscoverTimeMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; P = int; T = boost::buffer_param_t; R = boost::no_property]’
295 | return bicomp_dispatch3< dispatch_type >::apply(g, comp, out,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
296 | index_map, dtm,
| ~~~~~~~~~~~~~~~
297 | make_iterator_property_map(lowpt.begin(), index_map, vst),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
298 | params, get_param(params, vertex_predecessor));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/biconnected_components.hpp:336:60: required from ‘static std::pair<long unsigned int, OutputIterator> boost::detail::bicomp_dispatch1<boost::param_not_found>::apply(const Graph&, ComponentMap, OutputIterator, VertexIndexMap, const boost::bgl_named_params<P, T, R>&, boost::param_not_found) [with Graph = R_adjacency_list<boost::undirectedS, double>; ComponentMap = boost::dummy_property_map; OutputIterator = std::back_insert_iterator<std::vector<long unsigned int> >; VertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>; P = int; T = boost::buffer_param_t; R = boost::no_property]’
336 | return bicomp_dispatch2< dispatch_type >::apply(g, comp, out,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
337 | index_map,
| ~~~~~~~~~~
338 | make_iterator_property_map(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~
339 | discover_time.begin(), index_map, vst),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
340 | params, get_param(params, vertex_lowpoint));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/biconnected_components.hpp:368:60: required from ‘std::pair<long unsigned int, OutputIterator> boost::biconnected_components(const Graph&, ComponentMap, OutputIterator, const bgl_named_params<P, T, R>&) [with Graph = R_adjacency_list<undirectedS, double>; ComponentMap = dummy_property_map; OutputIterator = std::back_insert_iterator<std::vector<long unsigned int> >; P = int; T = buffer_param_t; R = no_property]’
368 | return detail::bicomp_dispatch1< dispatch_type >::apply(g, comp, out,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
369 | choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
370 | params, get_param(params, vertex_discover_time));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/biconnected_components.hpp:433:34: required from ‘OutputIterator boost::articulation_points(const Graph&, OutputIterator) [with Graph = R_adjacency_list<undirectedS, double>; OutputIterator = std::back_insert_iterator<std::vector<long unsigned int> >]’
433 | return biconnected_components(g, dummy_property_map(), out,
| ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
434 | bgl_named_params< int, buffer_param_t >(0))
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
interfaces.cpp:300:28: required from here
300 | articulation_points(g, std::back_inserter(art_points));
| ~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
20 | ~usage_requirements() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible<X, Y>::~Convertible() [with X = boost::read_write_property_map_tag; Y = boost::writable_property_map_tag]’
37 | ~model()
| ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
208 | BOOST_CONCEPT_USAGE(Convertible) {
| ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::concepts::MultiPassInputIterator<boost::iterators::filter_iterator<boost::detail::out_edge_predicate<boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long unsigned int, long unsigned int&, long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::no_property, boost::listS>, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long unsigned int, long unsigned int&, long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int> > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::concepts::MultiPassInputIterator<boost::iterators::filter_iterator<boost::detail::out_edge_predicate<boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long unsigned int, long unsigned int&, long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::no_property, boost::listS>, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long unsigned int, long unsigned int&, long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int> > > >]’
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:52:50: required from ‘struct boost::concepts::MultiPassInputIterator<boost::iterators::filter_iterator<boost::detail::out_edge_predicate<boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long unsigned int, long unsigned int&, long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::no_property, boost::listS>, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long unsigned int, long unsigned int&, long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int> > >’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::concepts::MultiPassInputIterator<boost::iterators::filter_iterator<boost::detail::out_edge_predicate<boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long unsigned int, long unsigned int&, long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::no_property, boost::listS>, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long unsigned int, long unsigned int&, long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int> > >]’
32 | inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
| ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied<boost::concepts::MultiPassInputIterator<boost::iterators::filter_iterator<boost::detail::out_edge_predicate<boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long unsigned int, long unsigned int&, long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::no_property, boost::listS>, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long unsigned int, long unsigned int&, long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int> > > >::value’
44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied<boost::concepts::MultiPassInputIterator<boost::iterators::filter_iterator<boost::detail::out_edge_predicate<boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long unsigned int, long unsigned int&, long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::no_property, boost::listS>, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long unsigned int, long unsigned int&, long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int> > > >’
45 | typedef boost::integral_constant<bool, value> type;
| ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:129:9: required from ‘void boost::breadth_first_visit(const IncidenceGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with IncidenceGraph = filtered_graph<adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, no_property, listS>, is_residual_edge<adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_residual_capacity_t> >, keep_all>; Buffer = queue<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > >; BFSVisitor = bfs_visitor<edge_predecessor_recorder<detail::edge_desc_impl<directed_tag, long unsigned int>*, on_tree_edge> >; ColorMap = default_color_type*; SourceIterator = long unsigned int*]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:136:24: required from ‘void boost::breadth_first_search(const VertexListGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph<adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, no_property, listS>, is_residual_edge<adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_residual_capacity_t> >, keep_all>; SourceIterator = long unsigned int*; Buffer = queue<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > >; BFSVisitor = bfs_visitor<edge_predecessor_recorder<detail::edge_desc_impl<directed_tag, long unsigned int>*, on_tree_edge> >; ColorMap = default_color_type*]’
136 | breadth_first_visit(g, sources_begin, sources_end, Q, vis, color);
| ~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:147:25: required from ‘void boost::breadth_first_search(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph<adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, no_property, listS>, is_residual_edge<adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_residual_capacity_t> >, keep_all>; Buffer = queue<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > >; BFSVisitor = bfs_visitor<edge_predecessor_recorder<detail::edge_desc_impl<directed_tag, long unsigned int>*, on_tree_edge> >; ColorMap = default_color_type*; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
147 | breadth_first_search(g, sources, sources + 1, Q, vis, color);
| ~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/edmonds_karp_max_flow.hpp:101:29: required from ‘typename boost::property_traits<IndexMap>::value_type boost::edmonds_karp_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, ColorMap, PredEdgeMap) [with Graph = adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, no_property, listS>; CapacityEdgeMap = adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map<directed_tag, detail::edge_desc_impl<directed_tag, long unsigned int>, detail::edge_desc_impl<directed_tag, long unsigned int>&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_reverse_t>; ColorMap = default_color_type*; PredEdgeMap = detail::edge_desc_impl<directed_tag, long unsigned int>*; typename property_traits<IndexMap>::value_type = long unsigned int; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
101 | breadth_first_search(detail::residual_graph(g, res), src, Q,
| ~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
102 | make_bfs_visitor(record_edge_predecessors(pred, on_tree_edge())),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
103 | color);
| ~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/edge_connectivity.hpp:146:42: required from ‘typename boost::graph_traits<G>::degree_size_type boost::edge_connectivity(VertexListGraph&, OutputIterator) [with VertexListGraph = R_adjacency_list<undirectedS, double>; OutputIterator = std::back_insert_iterator<std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int> > >; typename graph_traits<G>::degree_size_type = long unsigned int]’
146 | alpha_S_k = edmonds_karp_max_flow(
| ~~~~~~~~~~~~~~~~~~~~~^
147 | flow_g, p, k, cap, res_cap, rev_edge, &color[0], &pred[0]);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
interfaces.cpp:326:34: required from here
326 | dst c = edge_connectivity( g, std::back_inserter(disconnecting_set) );
| ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
20 | ~usage_requirements() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::concepts::MultiPassInputIterator<T>::~MultiPassInputIterator() [with T = boost::iterators::filter_iterator<boost::detail::out_edge_predicate<boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long unsigned int, long unsigned int&, long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::no_property, boost::listS>, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long unsigned int, long unsigned int&, long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int> >]’
37 | ~model()
| ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:52:50: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
52 | BOOST_concept(MultiPassInputIterator, (T)) { BOOST_CONCEPT_USAGE(
| ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Convertible<boost::read_write_property_map_tag, boost::readable_property_map_tag>]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Convertible<boost::read_write_property_map_tag, boost::readable_property_map_tag> >]’
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible<boost::read_write_property_map_tag, boost::readable_property_map_tag>’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:206:3: required from ‘struct boost::ConvertibleConcept<boost::read_write_property_map_tag, boost::readable_property_map_tag>’
206 | BOOST_concept(Convertible,(X)(Y))
| ^~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::ConvertibleConcept<boost::read_write_property_map_tag, boost::readable_property_map_tag>]’
32 | inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
| ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied<boost::ConvertibleConcept<boost::read_write_property_map_tag, boost::readable_property_map_tag> >::value’
44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 13 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:136:24: required from ‘void boost::breadth_first_search(const VertexListGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = R_adjacency_list<directedS, double>; SourceIterator = long unsigned int*; Buffer = queue<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > >; BFSVisitor = bfs_time_visitor<long unsigned int*>; ColorMap = two_bit_color_map<vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int> >]’
136 | breadth_first_visit(g, sources_begin, sources_end, Q, vis, color);
| ~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:147:25: required from ‘void boost::breadth_first_search(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = R_adjacency_list<directedS, double>; Buffer = queue<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > >; BFSVisitor = bfs_time_visitor<long unsigned int*>; ColorMap = two_bit_color_map<vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int> >; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
147 | breadth_first_search(g, sources, sources + 1, Q, vis, color);
| ~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:262:29: required from ‘void boost::detail::bfs_helper(VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, ColorMap, BFSVisitor, const boost::bgl_named_params<P, T, R>&, mpl_::false_) [with VertexListGraph = R_adjacency_list<boost::directedS, double>; ColorMap = boost::two_bit_color_map<boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int> >; BFSVisitor = bfs_time_visitor<long unsigned int*>; P = bfs_time_visitor<long unsigned int*>; T = boost::graph_visitor_t; R = boost::no_property; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int; mpl_::false_ = mpl_::bool_<false>]’
262 | breadth_first_search(g, s,
| ~~~~~~~~~~~~~~~~~~~~^~~~~~
263 | choose_param(get_param(params, buffer_param_t()), boost::ref(Q))
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
264 | .get(),
| ~~~~~~~
265 | vis, color);
| ~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:309:23: required from ‘static void boost::detail::bfs_dispatch<boost::param_not_found>::apply(VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, const boost::bgl_named_params<T, Tag, Base>&, boost::param_not_found) [with VertexListGraph = R_adjacency_list<boost::directedS, double>; P = bfs_time_visitor<long unsigned int*>; T = boost::graph_visitor_t; R = boost::no_property; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’
309 | bfs_helper(g, s,
| ~~~~~~~~~~^~~~~~
310 | make_two_bit_color_map(num_vertices(g),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
311 | choose_const_pmap(
| ~~~~~~~~~~~~~~~~~~
312 | get_param(params, vertex_index), g, vertex_index)),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
313 | choose_param(get_param(params, graph_visitor),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
314 | make_bfs_visitor(null_vis)),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~
315 | params,
| ~~~~~~~
316 | boost::mpl::bool_<
| ~~~~~~~~~~~~~~~~~~
317 | boost::is_base_and_derived< distributed_graph_tag,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
318 | typename graph_traits<
| ~~~~~~~~~~~~~~~~~~~~~~
319 | VertexListGraph >::traversal_category >::value >());
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:339:37: required from ‘void boost::breadth_first_search(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with VertexListGraph = R_adjacency_list<directedS, double>; P = bfs_time_visitor<long unsigned int*>; T = graph_visitor_t; R = no_property; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
339 | detail::bfs_dispatch< C >::apply(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
340 | ng, s, params, get_param(params, vertex_color));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
interfaces.cpp:113:29: required from here
113 | breadth_first_search(g, vertex((int)INTEGER(init_ind)[0], g), visitor(vis));
| ~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
20 | ~usage_requirements() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible<X, Y>::~Convertible() [with X = boost::read_write_property_map_tag; Y = boost::readable_property_map_tag]’
37 | ~model()
| ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
208 | BOOST_CONCEPT_USAGE(Convertible) {
| ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::DefaultConstructible<long unsigned int>]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::DefaultConstructible<long unsigned int> >]’
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:137:5: required from ‘struct boost::DefaultConstructible<long unsigned int>’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::DefaultConstructible<long unsigned int>]’
32 | inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
| ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied<boost::DefaultConstructible<long unsigned int> >::value’
44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied<boost::DefaultConstructible<long unsigned int> >’
45 | typedef boost::integral_constant<bool, value> type;
| ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 11 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:129:9: required from ‘void boost::detail::depth_first_visit_impl(const IncidenceGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, DFSVisitor&, ColorMap, TerminatorFunc) [with IncidenceGraph = R_adjacency_list<boost::directedS, double>; DFSVisitor = dfs_time_visitor<long unsigned int*>; ColorMap = boost::shared_array_property_map<boost::default_color_type, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int> >; TerminatorFunc = nontruth2; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:286:39: required from ‘void boost::depth_first_search(const VertexListGraph&, DFSVisitor, ColorMap, typename graph_traits<Graph>::vertex_descriptor) [with VertexListGraph = R_adjacency_list<directedS, double>; DFSVisitor = dfs_time_visitor<long unsigned int*>; ColorMap = shared_array_property_map<default_color_type, vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int> >; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
286 | detail::depth_first_visit_impl(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
287 | g, start_vertex, vis, color, detail::nontruth2());
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/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 dfs_time_visitor<long unsigned int*> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; Graph = R_adjacency_list<boost::directedS, double>]’
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)]);
| ~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/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 = R_adjacency_list<boost::directedS, double>; ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<keywords::tag::visitor, const dfs_time_visitor<long unsigned 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); \
| ~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/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 = R_adjacency_list<directedS, double>; P = dfs_time_visitor<long unsigned 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 dfs_time_visitor<long unsigned 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); \
| ~~~~~~~~~
interfaces.cpp:158:27: required from here
158 | depth_first_search(g, visitor(vis));
| ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
20 | ~usage_requirements() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::DefaultConstructible<TT>::~DefaultConstructible() [with TT = long unsigned int]’
37 | ~model()
| ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:137:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
137 | BOOST_CONCEPT_USAGE(DefaultConstructible) {
| ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::EqualityComparable<long unsigned int>]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::EqualityComparable<long unsigned int> >]’
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable<long unsigned int>’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::EqualityComparable<long unsigned int>]’
32 | inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
| ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied<boost::EqualityComparable<long unsigned int> >::value’
44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied<boost::EqualityComparable<long unsigned int> >’
45 | typedef boost::integral_constant<bool, value> type;
| ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 11 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:129:9: required from ‘void boost::detail::depth_first_visit_impl(const IncidenceGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, DFSVisitor&, ColorMap, TerminatorFunc) [with IncidenceGraph = R_adjacency_list<boost::directedS, double>; DFSVisitor = dfs_time_visitor<long unsigned int*>; ColorMap = boost::shared_array_property_map<boost::default_color_type, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int> >; TerminatorFunc = nontruth2; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:286:39: required from ‘void boost::depth_first_search(const VertexListGraph&, DFSVisitor, ColorMap, typename graph_traits<Graph>::vertex_descriptor) [with VertexListGraph = R_adjacency_list<directedS, double>; DFSVisitor = dfs_time_visitor<long unsigned int*>; ColorMap = shared_array_property_map<default_color_type, vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int> >; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
286 | detail::depth_first_visit_impl(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
287 | g, start_vertex, vis, color, detail::nontruth2());
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/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 dfs_time_visitor<long unsigned int*> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; Graph = R_adjacency_list<boost::directedS, double>]’
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)]);
| ~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/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 = R_adjacency_list<boost::directedS, double>; ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<keywords::tag::visitor, const dfs_time_visitor<long unsigned 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); \
| ~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/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 = R_adjacency_list<directedS, double>; P = dfs_time_visitor<long unsigned 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 dfs_time_visitor<long unsigned 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); \
| ~~~~~~~~~
interfaces.cpp:158:27: required from here
158 | depth_first_search(g, visitor(vis));
| ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
20 | ~usage_requirements() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::EqualityComparable<TT>::~EqualityComparable() [with TT = long unsigned int]’
37 | ~model()
| ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:233:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
233 | BOOST_CONCEPT_USAGE(EqualityComparable) {
| ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Assignable<long unsigned int>]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Assignable<long unsigned int> >]’
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:145:5: required from ‘struct boost::Assignable<long unsigned int>’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::Assignable<long unsigned int>]’
32 | inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
| ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied<boost::Assignable<long unsigned int> >::value’
44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied<boost::Assignable<long unsigned int> >’
45 | typedef boost::integral_constant<bool, value> type;
| ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 11 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:129:9: required from ‘void boost::detail::depth_first_visit_impl(const IncidenceGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, DFSVisitor&, ColorMap, TerminatorFunc) [with IncidenceGraph = R_adjacency_list<boost::directedS, double>; DFSVisitor = dfs_time_visitor<long unsigned int*>; ColorMap = boost::shared_array_property_map<boost::default_color_type, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int> >; TerminatorFunc = nontruth2; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:286:39: required from ‘void boost::depth_first_search(const VertexListGraph&, DFSVisitor, ColorMap, typename graph_traits<Graph>::vertex_descriptor) [with VertexListGraph = R_adjacency_list<directedS, double>; DFSVisitor = dfs_time_visitor<long unsigned int*>; ColorMap = shared_array_property_map<default_color_type, vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int> >; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
286 | detail::depth_first_visit_impl(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
287 | g, start_vertex, vis, color, detail::nontruth2());
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/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 dfs_time_visitor<long unsigned int*> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; Graph = R_adjacency_list<boost::directedS, double>]’
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)]);
| ~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/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 = R_adjacency_list<boost::directedS, double>; ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<keywords::tag::visitor, const dfs_time_visitor<long unsigned 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); \
| ~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/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 = R_adjacency_list<directedS, double>; P = dfs_time_visitor<long unsigned 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 dfs_time_visitor<long unsigned 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); \
| ~~~~~~~~~
interfaces.cpp:158:27: required from here
158 | depth_first_search(g, visitor(vis));
| ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
20 | ~usage_requirements() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Assignable<TT>::~Assignable() [with TT = long unsigned int]’
37 | ~model()
| ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:145:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
145 | BOOST_CONCEPT_USAGE(Assignable) {
| ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Assignable<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int> > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:145:5: required from ‘struct boost::Assignable<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int> >’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int> >’
502 | BOOST_concept(InputIterator,(TT))
| ^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::InputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int> >]’
32 | inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
| ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied<boost::InputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int> > >::value’
44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied<boost::InputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int> > >’
45 | typedef boost::integral_constant<bool, value> type;
| ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:129:9: required from ‘void boost::detail::depth_first_visit_impl(const IncidenceGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, DFSVisitor&, ColorMap, TerminatorFunc) [with IncidenceGraph = R_adjacency_list<boost::directedS, double>; DFSVisitor = dfs_time_visitor<long unsigned int*>; ColorMap = boost::shared_array_property_map<boost::default_color_type, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int> >; TerminatorFunc = nontruth2; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:286:39: required from ‘void boost::depth_first_search(const VertexListGraph&, DFSVisitor, ColorMap, typename graph_traits<Graph>::vertex_descriptor) [with VertexListGraph = R_adjacency_list<directedS, double>; DFSVisitor = dfs_time_visitor<long unsigned int*>; ColorMap = shared_array_property_map<default_color_type, vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int> >; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
286 | detail::depth_first_visit_impl(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
287 | g, start_vertex, vis, color, detail::nontruth2());
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/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 dfs_time_visitor<long unsigned int*> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; Graph = R_adjacency_list<boost::directedS, double>]’
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)]);
| ~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/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 = R_adjacency_list<boost::directedS, double>; ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<keywords::tag::visitor, const dfs_time_visitor<long unsigned 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); \
| ~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/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 = R_adjacency_list<directedS, double>; P = dfs_time_visitor<long unsigned 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 dfs_time_visitor<long unsigned 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); \
| ~~~~~~~~~
interfaces.cpp:158:27: required from here
158 | depth_first_search(g, visitor(vis));
| ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Assignable<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int> >]’
20 | ~usage_requirements() { ((Model*)0)->~Model(); }
| ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::EqualityComparable<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int> > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int> >’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int> >’
502 | BOOST_concept(InputIterator,(TT))
| ^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::InputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int> >]’
32 | inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
| ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied<boost::InputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int> > >::value’
44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied<boost::InputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int> > >’
45 | typedef boost::integral_constant<bool, value> type;
| ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:129:9: required from ‘void boost::detail::depth_first_visit_impl(const IncidenceGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, DFSVisitor&, ColorMap, TerminatorFunc) [with IncidenceGraph = R_adjacency_list<boost::directedS, double>; DFSVisitor = dfs_time_visitor<long unsigned int*>; ColorMap = boost::shared_array_property_map<boost::default_color_type, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int> >; TerminatorFunc = nontruth2; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:286:39: required from ‘void boost::depth_first_search(const VertexListGraph&, DFSVisitor, ColorMap, typename graph_traits<Graph>::vertex_descriptor) [with VertexListGraph = R_adjacency_list<directedS, double>; DFSVisitor = dfs_time_visitor<long unsigned int*>; ColorMap = shared_array_property_map<default_color_type, vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int> >; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
286 | detail::depth_first_visit_impl(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
287 | g, start_vertex, vis, color, detail::nontruth2());
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/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 dfs_time_visitor<long unsigned int*> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; Graph = R_adjacency_list<boost::directedS, double>]’
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)]);
| ~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/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 = R_adjacency_list<boost::directedS, double>; ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<keywords::tag::visitor, const dfs_time_visitor<long unsigned 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); \
| ~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/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 = R_adjacency_list<directedS, double>; P = dfs_time_visitor<long unsigned 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 dfs_time_visitor<long unsigned 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); \
| ~~~~~~~~~
interfaces.cpp:158:27: required from here
158 | depth_first_search(g, visitor(vis));
| ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::EqualityComparable<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int> >]’
20 | ~usage_requirements() { ((Model*)0)->~Model(); }
| ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::InputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int> > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:512:7: required from ‘struct boost::InputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int> >’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::InputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int> >]’
32 | inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
| ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied<boost::InputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int> > >::value’
44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied<boost::InputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int> > >’
45 | typedef boost::integral_constant<bool, value> type;
| ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_<void (*)(boost::InputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int> >)>’
72 | struct requirement_<void(*)(Model)>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:53:35: [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:129:9: required from ‘void boost::detail::depth_first_visit_impl(const IncidenceGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, DFSVisitor&, ColorMap, TerminatorFunc) [with IncidenceGraph = R_adjacency_list<boost::directedS, double>; DFSVisitor = dfs_time_visitor<long unsigned int*>; ColorMap = boost::shared_array_property_map<boost::default_color_type, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int> >; TerminatorFunc = nontruth2; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:286:39: required from ‘void boost::depth_first_search(const VertexListGraph&, DFSVisitor, ColorMap, typename graph_traits<Graph>::vertex_descriptor) [with VertexListGraph = R_adjacency_list<directedS, double>; DFSVisitor = dfs_time_visitor<long unsigned int*>; ColorMap = shared_array_property_map<default_color_type, vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int> >; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
286 | detail::depth_first_visit_impl(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
287 | g, start_vertex, vis, color, detail::nontruth2());
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/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 dfs_time_visitor<long unsigned int*> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; Graph = R_adjacency_list<boost::directedS, double>]’
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)]);
| ~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/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 = R_adjacency_list<boost::directedS, double>; ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<keywords::tag::visitor, const dfs_time_visitor<long unsigned 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); \
| ~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/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 = R_adjacency_list<directedS, double>; P = dfs_time_visitor<long unsigned 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 dfs_time_visitor<long unsigned 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); \
| ~~~~~~~~~
interfaces.cpp:158:27: required from here
158 | depth_first_search(g, visitor(vis));
| ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::InputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int> >]’
20 | ~usage_requirements() { ((Model*)0)->~Model(); }
| ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::InputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int> >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:53:35: required from ‘boost::concepts::MultiPassInputIterator<T>::~MultiPassInputIterator() [with T = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int>]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::MultiPassInputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int> >]’
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:89:9: required from ‘boost::concepts::IncidenceGraph<G>::~IncidenceGraph() [with G = R_adjacency_list<boost::directedS, double>]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/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<R_adjacency_list<boost::directedS, double> >]’
75 | BOOST_concept(IncidenceGraph, (G)) : Graph< G >
| ^~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:129:9: required from ‘void boost::detail::depth_first_visit_impl(const IncidenceGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, DFSVisitor&, ColorMap, TerminatorFunc) [with IncidenceGraph = R_adjacency_list<boost::directedS, double>; DFSVisitor = dfs_time_visitor<long unsigned int*>; ColorMap = boost::shared_array_property_map<boost::default_color_type, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int> >; TerminatorFunc = nontruth2; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:286:39: required from ‘void boost::depth_first_search(const VertexListGraph&, DFSVisitor, ColorMap, typename graph_traits<Graph>::vertex_descriptor) [with VertexListGraph = R_adjacency_list<directedS, double>; DFSVisitor = dfs_time_visitor<long unsigned int*>; ColorMap = shared_array_property_map<default_color_type, vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int> >; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
286 | detail::depth_first_visit_impl(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
287 | g, start_vertex, vis, color, detail::nontruth2());
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/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 dfs_time_visitor<long unsigned int*> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; Graph = R_adjacency_list<boost::directedS, double>]’
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)]);
| ~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/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 = R_adjacency_list<boost::directedS, double>; ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<keywords::tag::visitor, const dfs_time_visitor<long unsigned 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); \
| ~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/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 = R_adjacency_list<directedS, double>; P = dfs_time_visitor<long unsigned 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 dfs_time_visitor<long unsigned 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); \
| ~~~~~~~~~
interfaces.cpp:158:27: required from here
158 | depth_first_search(g, visitor(vis));
| ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::InputIterator<TT>::~InputIterator() [with TT = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int>]’
37 | ~model()
| ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:512:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
512 | BOOST_CONCEPT_USAGE(InputIterator)
| ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::concepts::MultiPassInputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > >, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > >, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > >, boost::property<boost::edge_weight_t, double, boost::no_property> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::concepts::MultiPassInputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > >, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > >, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > >, boost::property<boost::edge_weight_t, double, 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(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:52:50: required from ‘struct boost::concepts::MultiPassInputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > >, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > >, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > >, boost::property<boost::edge_weight_t, double, 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> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::concepts::MultiPassInputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > >, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > >, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > >, boost::property<boost::edge_weight_t, double, 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);
| ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied<boost::concepts::MultiPassInputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > >, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > >, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > >, boost::property<boost::edge_weight_t, double, 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) );
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied<boost::concepts::MultiPassInputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > >, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > >, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > >, boost::property<boost::edge_weight_t, double, 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;
| ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:286:39: required from ‘void boost::depth_first_search(const VertexListGraph&, DFSVisitor, ColorMap, typename graph_traits<Graph>::vertex_descriptor) [with VertexListGraph = R_adjacency_list<undirectedS, double>; DFSVisitor = detail::components_recorder<int*>; ColorMap = shared_array_property_map<default_color_type, vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int> >; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
286 | detail::depth_first_visit_impl(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
287 | g, start_vertex, vis, color, detail::nontruth2());
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:397:42: required from ‘void boost::graph::detail::depth_first_search_impl<Graph>::operator()(const Graph&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<boost::graph::keywords::tag::visitor, const boost::detail::components_recorder<int*> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; Graph = R_adjacency_list<boost::undirectedS, double>]’
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)]);
| ~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/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 = R_adjacency_list<boost::undirectedS, double>; ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<keywords::tag::visitor, const boost::detail::components_recorder<int*> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; typename boost::result_of<detail::depth_first_search_impl<Param0>(Param0, const ArgPack&)>::type = void]’
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); \
| ~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/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 = R_adjacency_list<undirectedS, double>; P = detail::components_recorder<int*>; T = graph_visitor_t; R = no_property; typename result_of<graph::detail::depth_first_search_impl<Param0>(Param0, const typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<T, Tag, Base> >::type&)>::type = void; typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<T, Tag, Base> >::type = parameter::aux::arg_list<parameter::aux::tagged_argument<graph::keywords::tag::visitor, const detail::components_recorder<int*> >, parameter::aux::empty_arg_list, std::integral_constant<bool, true> >]’
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); \
| ~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/connected_components.hpp:106:23: required from ‘typename boost::property_traits<IndexMap>::value_type boost::connected_components(const Graph&, ComponentMap, typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = R_adjacency_list<undirectedS, double>; ComponentMap = int*; typename property_traits<IndexMap>::value_type = int; typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits<Graph>::traversal_category = undir_adj_list_traversal_tag]’
106 | depth_first_search(g, visitor(vis));
| ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~
interfaces.cpp:205:29: required from here
205 | connected_components(g, &component[0]);
| ~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
20 | ~usage_requirements() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::concepts::MultiPassInputIterator<T>::~MultiPassInputIterator() [with T = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > >, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > >, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > >, boost::property<boost::edge_weight_t, double, boost::no_property> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int>]’
37 | ~model()
| ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:52:50: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
52 | BOOST_concept(MultiPassInputIterator, (T)) { BOOST_CONCEPT_USAGE(
| ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::DefaultConstructible<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::DefaultConstructible<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >]’
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:137:5: required from ‘struct boost::DefaultConstructible<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> >’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::DefaultConstructible<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> >]’
32 | inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
| ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied<boost::DefaultConstructible<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >::value’
44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied<boost::DefaultConstructible<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >’
45 | typedef boost::integral_constant<bool, value> type;
| ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:286:39: required from ‘void boost::depth_first_search(const VertexListGraph&, DFSVisitor, ColorMap, typename graph_traits<Graph>::vertex_descriptor) [with VertexListGraph = R_adjacency_list<undirectedS, double>; DFSVisitor = detail::components_recorder<int*>; ColorMap = shared_array_property_map<default_color_type, vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int> >; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
286 | detail::depth_first_visit_impl(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
287 | g, start_vertex, vis, color, detail::nontruth2());
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:397:42: required from ‘void boost::graph::detail::depth_first_search_impl<Graph>::operator()(const Graph&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<boost::graph::keywords::tag::visitor, const boost::detail::components_recorder<int*> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; Graph = R_adjacency_list<boost::undirectedS, double>]’
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)]);
| ~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/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 = R_adjacency_list<boost::undirectedS, double>; ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<keywords::tag::visitor, const boost::detail::components_recorder<int*> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; typename boost::result_of<detail::depth_first_search_impl<Param0>(Param0, const ArgPack&)>::type = void]’
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); \
| ~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/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 = R_adjacency_list<undirectedS, double>; P = detail::components_recorder<int*>; T = graph_visitor_t; R = no_property; typename result_of<graph::detail::depth_first_search_impl<Param0>(Param0, const typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<T, Tag, Base> >::type&)>::type = void; typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<T, Tag, Base> >::type = parameter::aux::arg_list<parameter::aux::tagged_argument<graph::keywords::tag::visitor, const detail::components_recorder<int*> >, parameter::aux::empty_arg_list, std::integral_constant<bool, true> >]’
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); \
| ~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/connected_components.hpp:106:23: required from ‘typename boost::property_traits<IndexMap>::value_type boost::connected_components(const Graph&, ComponentMap, typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = R_adjacency_list<undirectedS, double>; ComponentMap = int*; typename property_traits<IndexMap>::value_type = int; typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits<Graph>::traversal_category = undir_adj_list_traversal_tag]’
106 | depth_first_search(g, visitor(vis));
| ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~
interfaces.cpp:205:29: required from here
205 | connected_components(g, &component[0]);
| ~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
20 | ~usage_requirements() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::DefaultConstructible<TT>::~DefaultConstructible() [with TT = boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>]’
37 | ~model()
| ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:137:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
137 | BOOST_CONCEPT_USAGE(DefaultConstructible) {
| ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::EqualityComparable<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::EqualityComparable<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >]’
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> >’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::EqualityComparable<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> >]’
32 | inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
| ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied<boost::EqualityComparable<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >::value’
44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied<boost::EqualityComparable<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >’
45 | typedef boost::integral_constant<bool, value> type;
| ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:286:39: required from ‘void boost::depth_first_search(const VertexListGraph&, DFSVisitor, ColorMap, typename graph_traits<Graph>::vertex_descriptor) [with VertexListGraph = R_adjacency_list<undirectedS, double>; DFSVisitor = detail::components_recorder<int*>; ColorMap = shared_array_property_map<default_color_type, vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int> >; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
286 | detail::depth_first_visit_impl(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
287 | g, start_vertex, vis, color, detail::nontruth2());
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:397:42: required from ‘void boost::graph::detail::depth_first_search_impl<Graph>::operator()(const Graph&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<boost::graph::keywords::tag::visitor, const boost::detail::components_recorder<int*> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; Graph = R_adjacency_list<boost::undirectedS, double>]’
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)]);
| ~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/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 = R_adjacency_list<boost::undirectedS, double>; ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<keywords::tag::visitor, const boost::detail::components_recorder<int*> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; typename boost::result_of<detail::depth_first_search_impl<Param0>(Param0, const ArgPack&)>::type = void]’
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); \
| ~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/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 = R_adjacency_list<undirectedS, double>; P = detail::components_recorder<int*>; T = graph_visitor_t; R = no_property; typename result_of<graph::detail::depth_first_search_impl<Param0>(Param0, const typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<T, Tag, Base> >::type&)>::type = void; typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<T, Tag, Base> >::type = parameter::aux::arg_list<parameter::aux::tagged_argument<graph::keywords::tag::visitor, const detail::components_recorder<int*> >, parameter::aux::empty_arg_list, std::integral_constant<bool, true> >]’
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); \
| ~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/connected_components.hpp:106:23: required from ‘typename boost::property_traits<IndexMap>::value_type boost::connected_components(const Graph&, ComponentMap, typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = R_adjacency_list<undirectedS, double>; ComponentMap = int*; typename property_traits<IndexMap>::value_type = int; typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits<Graph>::traversal_category = undir_adj_list_traversal_tag]’
106 | depth_first_search(g, visitor(vis));
| ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~
interfaces.cpp:205:29: required from here
205 | connected_components(g, &component[0]);
| ~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
20 | ~usage_requirements() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::EqualityComparable<TT>::~EqualityComparable() [with TT = boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>]’
37 | ~model()
| ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:233:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
233 | BOOST_CONCEPT_USAGE(EqualityComparable) {
| ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Assignable<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Assignable<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >]’
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:145:5: required from ‘struct boost::Assignable<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> >’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::Assignable<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> >]’
32 | inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
| ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied<boost::Assignable<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >::value’
44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied<boost::Assignable<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >’
45 | typedef boost::integral_constant<bool, value> type;
| ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:286:39: required from ‘void boost::depth_first_search(const VertexListGraph&, DFSVisitor, ColorMap, typename graph_traits<Graph>::vertex_descriptor) [with VertexListGraph = R_adjacency_list<undirectedS, double>; DFSVisitor = detail::components_recorder<int*>; ColorMap = shared_array_property_map<default_color_type, vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int> >; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
286 | detail::depth_first_visit_impl(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
287 | g, start_vertex, vis, color, detail::nontruth2());
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:397:42: required from ‘void boost::graph::detail::depth_first_search_impl<Graph>::operator()(const Graph&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<boost::graph::keywords::tag::visitor, const boost::detail::components_recorder<int*> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; Graph = R_adjacency_list<boost::undirectedS, double>]’
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)]);
| ~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/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 = R_adjacency_list<boost::undirectedS, double>; ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<keywords::tag::visitor, const boost::detail::components_recorder<int*> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; typename boost::result_of<detail::depth_first_search_impl<Param0>(Param0, const ArgPack&)>::type = void]’
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); \
| ~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/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 = R_adjacency_list<undirectedS, double>; P = detail::components_recorder<int*>; T = graph_visitor_t; R = no_property; typename result_of<graph::detail::depth_first_search_impl<Param0>(Param0, const typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<T, Tag, Base> >::type&)>::type = void; typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<T, Tag, Base> >::type = parameter::aux::arg_list<parameter::aux::tagged_argument<graph::keywords::tag::visitor, const detail::components_recorder<int*> >, parameter::aux::empty_arg_list, std::integral_constant<bool, true> >]’
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); \
| ~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/connected_components.hpp:106:23: required from ‘typename boost::property_traits<IndexMap>::value_type boost::connected_components(const Graph&, ComponentMap, typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = R_adjacency_list<undirectedS, double>; ComponentMap = int*; typename property_traits<IndexMap>::value_type = int; typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits<Graph>::traversal_category = undir_adj_list_traversal_tag]’
106 | depth_first_search(g, visitor(vis));
| ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~
interfaces.cpp:205:29: required from here
205 | connected_components(g, &component[0]);
| ~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
20 | ~usage_requirements() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Assignable<TT>::~Assignable() [with TT = boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>]’
37 | ~model()
| ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:145:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
145 | BOOST_CONCEPT_USAGE(Assignable) {
| ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Convertible<boost::undir_adj_list_traversal_tag, boost::incidence_graph_tag>]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Convertible<boost::undir_adj_list_traversal_tag, boost::incidence_graph_tag> >]’
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible<boost::undir_adj_list_traversal_tag, boost::incidence_graph_tag>’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::Convertible<boost::undir_adj_list_traversal_tag, boost::incidence_graph_tag>]’
32 | inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
| ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied<boost::Convertible<boost::undir_adj_list_traversal_tag, boost::incidence_graph_tag> >::value’
44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied<boost::Convertible<boost::undir_adj_list_traversal_tag, boost::incidence_graph_tag> >’
45 | typedef boost::integral_constant<bool, value> type;
| ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:286:39: required from ‘void boost::depth_first_search(const VertexListGraph&, DFSVisitor, ColorMap, typename graph_traits<Graph>::vertex_descriptor) [with VertexListGraph = R_adjacency_list<undirectedS, double>; DFSVisitor = detail::components_recorder<int*>; ColorMap = shared_array_property_map<default_color_type, vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int> >; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
286 | detail::depth_first_visit_impl(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
287 | g, start_vertex, vis, color, detail::nontruth2());
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:397:42: required from ‘void boost::graph::detail::depth_first_search_impl<Graph>::operator()(const Graph&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<boost::graph::keywords::tag::visitor, const boost::detail::components_recorder<int*> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; Graph = R_adjacency_list<boost::undirectedS, double>]’
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)]);
| ~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/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 = R_adjacency_list<boost::undirectedS, double>; ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<keywords::tag::visitor, const boost::detail::components_recorder<int*> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; typename boost::result_of<detail::depth_first_search_impl<Param0>(Param0, const ArgPack&)>::type = void]’
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); \
| ~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/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 = R_adjacency_list<undirectedS, double>; P = detail::components_recorder<int*>; T = graph_visitor_t; R = no_property; typename result_of<graph::detail::depth_first_search_impl<Param0>(Param0, const typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<T, Tag, Base> >::type&)>::type = void; typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<T, Tag, Base> >::type = parameter::aux::arg_list<parameter::aux::tagged_argument<graph::keywords::tag::visitor, const detail::components_recorder<int*> >, parameter::aux::empty_arg_list, std::integral_constant<bool, true> >]’
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); \
| ~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/connected_components.hpp:106:23: required from ‘typename boost::property_traits<IndexMap>::value_type boost::connected_components(const Graph&, ComponentMap, typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = R_adjacency_list<undirectedS, double>; ComponentMap = int*; typename property_traits<IndexMap>::value_type = int; typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits<Graph>::traversal_category = undir_adj_list_traversal_tag]’
106 | depth_first_search(g, visitor(vis));
| ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~
interfaces.cpp:205:29: required from here
205 | connected_components(g, &component[0]);
| ~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
20 | ~usage_requirements() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible<X, Y>::~Convertible() [with X = boost::undir_adj_list_traversal_tag; Y = boost::incidence_graph_tag]’
37 | ~model()
| ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
208 | BOOST_CONCEPT_USAGE(Convertible) {
| ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::concepts::MultiPassInputIterator<boost::range_detail::integer_iterator<long unsigned int> >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::concepts::MultiPassInputIterator<boost::range_detail::integer_iterator<long unsigned int> > >]’
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:52:50: required from ‘struct boost::concepts::MultiPassInputIterator<boost::range_detail::integer_iterator<long unsigned int> >’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::concepts::MultiPassInputIterator<boost::range_detail::integer_iterator<long unsigned int> >]’
32 | inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
| ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied<boost::concepts::MultiPassInputIterator<boost::range_detail::integer_iterator<long unsigned int> > >::value’
44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied<boost::concepts::MultiPassInputIterator<boost::range_detail::integer_iterator<long unsigned int> > >’
45 | typedef boost::integral_constant<bool, value> type;
| ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/biconnected_components.hpp:250:47: required from ‘static std::pair<long unsigned int, OutputIterator> boost::detail::bicomp_dispatch3<boost::param_not_found>::apply(const Graph&, ComponentMap, OutputIterator, VertexIndexMap, DiscoverTimeMap, LowPointMap, const boost::bgl_named_params<P, T, R>&, boost::param_not_found) [with Graph = R_adjacency_list<boost::undirectedS, double>; ComponentMap = boost::dummy_property_map; OutputIterator = std::back_insert_iterator<std::vector<long unsigned int> >; VertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>; DiscoverTimeMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; LowPointMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; P = int; T = boost::buffer_param_t; R = boost::no_property]’
250 | return biconnected_components_impl(g, comp, out, index_map, dtm,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
251 | lowpt,
| ~~~~~~
252 | make_iterator_property_map(pred.begin(), index_map, vert),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
253 | choose_param(get_param(params, graph_visitor),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
254 | make_dfs_visitor(null_visitor())));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/biconnected_components.hpp:295:60: required from ‘static std::pair<long unsigned int, OutputIterator> boost::detail::bicomp_dispatch2<boost::param_not_found>::apply(const Graph&, ComponentMap, OutputIterator, VertexIndexMap, DiscoverTimeMap, const boost::bgl_named_params<P, T, R>&, boost::param_not_found) [with Graph = R_adjacency_list<boost::undirectedS, double>; ComponentMap = boost::dummy_property_map; OutputIterator = std::back_insert_iterator<std::vector<long unsigned int> >; VertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>; DiscoverTimeMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; P = int; T = boost::buffer_param_t; R = boost::no_property]’
295 | return bicomp_dispatch3< dispatch_type >::apply(g, comp, out,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
296 | index_map, dtm,
| ~~~~~~~~~~~~~~~
297 | make_iterator_property_map(lowpt.begin(), index_map, vst),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
298 | params, get_param(params, vertex_predecessor));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/biconnected_components.hpp:336:60: required from ‘static std::pair<long unsigned int, OutputIterator> boost::detail::bicomp_dispatch1<boost::param_not_found>::apply(const Graph&, ComponentMap, OutputIterator, VertexIndexMap, const boost::bgl_named_params<P, T, R>&, boost::param_not_found) [with Graph = R_adjacency_list<boost::undirectedS, double>; ComponentMap = boost::dummy_property_map; OutputIterator = std::back_insert_iterator<std::vector<long unsigned int> >; VertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>; P = int; T = boost::buffer_param_t; R = boost::no_property]’
336 | return bicomp_dispatch2< dispatch_type >::apply(g, comp, out,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
337 | index_map,
| ~~~~~~~~~~
338 | make_iterator_property_map(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~
339 | discover_time.begin(), index_map, vst),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
340 | params, get_param(params, vertex_lowpoint));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/biconnected_components.hpp:368:60: required from ‘std::pair<long unsigned int, OutputIterator> boost::biconnected_components(const Graph&, ComponentMap, OutputIterator, const bgl_named_params<P, T, R>&) [with Graph = R_adjacency_list<undirectedS, double>; ComponentMap = dummy_property_map; OutputIterator = std::back_insert_iterator<std::vector<long unsigned int> >; P = int; T = buffer_param_t; R = no_property]’
368 | return detail::bicomp_dispatch1< dispatch_type >::apply(g, comp, out,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
369 | choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
370 | params, get_param(params, vertex_discover_time));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/biconnected_components.hpp:433:34: required from ‘OutputIterator boost::articulation_points(const Graph&, OutputIterator) [with Graph = R_adjacency_list<undirectedS, double>; OutputIterator = std::back_insert_iterator<std::vector<long unsigned int> >]’
433 | return biconnected_components(g, dummy_property_map(), out,
| ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
434 | bgl_named_params< int, buffer_param_t >(0))
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
interfaces.cpp:300:28: required from here
300 | articulation_points(g, std::back_inserter(art_points));
| ~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
20 | ~usage_requirements() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::concepts::MultiPassInputIterator<T>::~MultiPassInputIterator() [with T = boost::range_detail::integer_iterator<long unsigned int>]’
37 | ~model()
| ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:52:50: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
52 | BOOST_concept(MultiPassInputIterator, (T)) { BOOST_CONCEPT_USAGE(
| ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Convertible<boost::undir_adj_list_traversal_tag, boost::vertex_list_graph_tag>]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Convertible<boost::undir_adj_list_traversal_tag, boost::vertex_list_graph_tag> >]’
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible<boost::undir_adj_list_traversal_tag, boost::vertex_list_graph_tag>’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::Convertible<boost::undir_adj_list_traversal_tag, boost::vertex_list_graph_tag>]’
32 | inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
| ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied<boost::Convertible<boost::undir_adj_list_traversal_tag, boost::vertex_list_graph_tag> >::value’
44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied<boost::Convertible<boost::undir_adj_list_traversal_tag, boost::vertex_list_graph_tag> >’
45 | typedef boost::integral_constant<bool, value> type;
| ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/biconnected_components.hpp:250:47: required from ‘static std::pair<long unsigned int, OutputIterator> boost::detail::bicomp_dispatch3<boost::param_not_found>::apply(const Graph&, ComponentMap, OutputIterator, VertexIndexMap, DiscoverTimeMap, LowPointMap, const boost::bgl_named_params<P, T, R>&, boost::param_not_found) [with Graph = R_adjacency_list<boost::undirectedS, double>; ComponentMap = boost::dummy_property_map; OutputIterator = std::back_insert_iterator<std::vector<long unsigned int> >; VertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>; DiscoverTimeMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; LowPointMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; P = int; T = boost::buffer_param_t; R = boost::no_property]’
250 | return biconnected_components_impl(g, comp, out, index_map, dtm,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
251 | lowpt,
| ~~~~~~
252 | make_iterator_property_map(pred.begin(), index_map, vert),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
253 | choose_param(get_param(params, graph_visitor),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
254 | make_dfs_visitor(null_visitor())));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/biconnected_components.hpp:295:60: required from ‘static std::pair<long unsigned int, OutputIterator> boost::detail::bicomp_dispatch2<boost::param_not_found>::apply(const Graph&, ComponentMap, OutputIterator, VertexIndexMap, DiscoverTimeMap, const boost::bgl_named_params<P, T, R>&, boost::param_not_found) [with Graph = R_adjacency_list<boost::undirectedS, double>; ComponentMap = boost::dummy_property_map; OutputIterator = std::back_insert_iterator<std::vector<long unsigned int> >; VertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>; DiscoverTimeMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; P = int; T = boost::buffer_param_t; R = boost::no_property]’
295 | return bicomp_dispatch3< dispatch_type >::apply(g, comp, out,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
296 | index_map, dtm,
| ~~~~~~~~~~~~~~~
297 | make_iterator_property_map(lowpt.begin(), index_map, vst),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
298 | params, get_param(params, vertex_predecessor));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/biconnected_components.hpp:336:60: required from ‘static std::pair<long unsigned int, OutputIterator> boost::detail::bicomp_dispatch1<boost::param_not_found>::apply(const Graph&, ComponentMap, OutputIterator, VertexIndexMap, const boost::bgl_named_params<P, T, R>&, boost::param_not_found) [with Graph = R_adjacency_list<boost::undirectedS, double>; ComponentMap = boost::dummy_property_map; OutputIterator = std::back_insert_iterator<std::vector<long unsigned int> >; VertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>; P = int; T = boost::buffer_param_t; R = boost::no_property]’
336 | return bicomp_dispatch2< dispatch_type >::apply(g, comp, out,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
337 | index_map,
| ~~~~~~~~~~
338 | make_iterator_property_map(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~
339 | discover_time.begin(), index_map, vst),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
340 | params, get_param(params, vertex_lowpoint));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/biconnected_components.hpp:368:60: required from ‘std::pair<long unsigned int, OutputIterator> boost::biconnected_components(const Graph&, ComponentMap, OutputIterator, const bgl_named_params<P, T, R>&) [with Graph = R_adjacency_list<undirectedS, double>; ComponentMap = dummy_property_map; OutputIterator = std::back_insert_iterator<std::vector<long unsigned int> >; P = int; T = buffer_param_t; R = no_property]’
368 | return detail::bicomp_dispatch1< dispatch_type >::apply(g, comp, out,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
369 | choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
370 | params, get_param(params, vertex_discover_time));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/biconnected_components.hpp:433:34: required from ‘OutputIterator boost::articulation_points(const Graph&, OutputIterator) [with Graph = R_adjacency_list<undirectedS, double>; OutputIterator = std::back_insert_iterator<std::vector<long unsigned int> >]’
433 | return biconnected_components(g, dummy_property_map(), out,
| ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
434 | bgl_named_params< int, buffer_param_t >(0))
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
interfaces.cpp:300:28: required from here
300 | articulation_points(g, std::back_inserter(art_points));
| ~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
20 | ~usage_requirements() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible<X, Y>::~Convertible() [with X = boost::undir_adj_list_traversal_tag; Y = boost::vertex_list_graph_tag]’
37 | ~model()
| ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
208 | BOOST_CONCEPT_USAGE(Convertible) {
| ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Assignable<boost::iterators::filter_iterator<boost::detail::out_edge_predicate<boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long unsigned int, long unsigned int&, long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::no_property, boost::listS>, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long unsigned int, long unsigned int&, long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int> > > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:145:5: required from ‘struct boost::Assignable<boost::iterators::filter_iterator<boost::detail::out_edge_predicate<boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long unsigned int, long unsigned int&, long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::no_property, boost::listS>, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long unsigned int, long unsigned int&, long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int> > >’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator<boost::iterators::filter_iterator<boost::detail::out_edge_predicate<boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long unsigned int, long unsigned int&, long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::no_property, boost::listS>, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long unsigned int, long unsigned int&, long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int> > >’
502 | BOOST_concept(InputIterator,(TT))
| ^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::InputIterator<boost::iterators::filter_iterator<boost::detail::out_edge_predicate<boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long unsigned int, long unsigned int&, long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::no_property, boost::listS>, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long unsigned int, long unsigned int&, long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int> > >]’
32 | inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
| ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied<boost::InputIterator<boost::iterators::filter_iterator<boost::detail::out_edge_predicate<boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long unsigned int, long unsigned int&, long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::no_property, boost::listS>, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long unsigned int, long unsigned int&, long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int> > > >::value’
44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied<boost::InputIterator<boost::iterators::filter_iterator<boost::detail::out_edge_predicate<boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long unsigned int, long unsigned int&, long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::no_property, boost::listS>, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long unsigned int, long unsigned int&, long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int> > > >’
45 | typedef boost::integral_constant<bool, value> type;
| ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:129:9: required from ‘void boost::breadth_first_visit(const IncidenceGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with IncidenceGraph = filtered_graph<adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, no_property, listS>, is_residual_edge<adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_residual_capacity_t> >, keep_all>; Buffer = queue<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > >; BFSVisitor = bfs_visitor<edge_predecessor_recorder<detail::edge_desc_impl<directed_tag, long unsigned int>*, on_tree_edge> >; ColorMap = default_color_type*; SourceIterator = long unsigned int*]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:136:24: required from ‘void boost::breadth_first_search(const VertexListGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph<adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, no_property, listS>, is_residual_edge<adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_residual_capacity_t> >, keep_all>; SourceIterator = long unsigned int*; Buffer = queue<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > >; BFSVisitor = bfs_visitor<edge_predecessor_recorder<detail::edge_desc_impl<directed_tag, long unsigned int>*, on_tree_edge> >; ColorMap = default_color_type*]’
136 | breadth_first_visit(g, sources_begin, sources_end, Q, vis, color);
| ~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:147:25: required from ‘void boost::breadth_first_search(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph<adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, no_property, listS>, is_residual_edge<adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_residual_capacity_t> >, keep_all>; Buffer = queue<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > >; BFSVisitor = bfs_visitor<edge_predecessor_recorder<detail::edge_desc_impl<directed_tag, long unsigned int>*, on_tree_edge> >; ColorMap = default_color_type*; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
147 | breadth_first_search(g, sources, sources + 1, Q, vis, color);
| ~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/edmonds_karp_max_flow.hpp:101:29: required from ‘typename boost::property_traits<IndexMap>::value_type boost::edmonds_karp_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, ColorMap, PredEdgeMap) [with Graph = adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, no_property, listS>; CapacityEdgeMap = adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map<directed_tag, detail::edge_desc_impl<directed_tag, long unsigned int>, detail::edge_desc_impl<directed_tag, long unsigned int>&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_reverse_t>; ColorMap = default_color_type*; PredEdgeMap = detail::edge_desc_impl<directed_tag, long unsigned int>*; typename property_traits<IndexMap>::value_type = long unsigned int; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
101 | breadth_first_search(detail::residual_graph(g, res), src, Q,
| ~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
102 | make_bfs_visitor(record_edge_predecessors(pred, on_tree_edge())),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
103 | color);
| ~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/edge_connectivity.hpp:146:42: required from ‘typename boost::graph_traits<G>::degree_size_type boost::edge_connectivity(VertexListGraph&, OutputIterator) [with VertexListGraph = R_adjacency_list<undirectedS, double>; OutputIterator = std::back_insert_iterator<std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int> > >; typename graph_traits<G>::degree_size_type = long unsigned int]’
146 | alpha_S_k = edmonds_karp_max_flow(
| ~~~~~~~~~~~~~~~~~~~~~^
147 | flow_g, p, k, cap, res_cap, rev_edge, &color[0], &pred[0]);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
interfaces.cpp:326:34: required from here
326 | dst c = edge_connectivity( g, std::back_inserter(disconnecting_set) );
| ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Assignable<boost::iterators::filter_iterator<boost::detail::out_edge_predicate<boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long unsigned int, long unsigned int&, long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::no_property, boost::listS>, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long unsigned int, long unsigned int&, long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int> > >]’
20 | ~usage_requirements() { ((Model*)0)->~Model(); }
| ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::EqualityComparable<boost::iterators::filter_iterator<boost::detail::out_edge_predicate<boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long unsigned int, long unsigned int&, long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::no_property, boost::listS>, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long unsigned int, long unsigned int&, long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int> > > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable<boost::iterators::filter_iterator<boost::detail::out_edge_predicate<boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long unsigned int, long unsigned int&, long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::no_property, boost::listS>, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long unsigned int, long unsigned int&, long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int> > >’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator<boost::iterators::filter_iterator<boost::detail::out_edge_predicate<boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long unsigned int, long unsigned int&, long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::no_property, boost::listS>, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long unsigned int, long unsigned int&, long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int> > >’
502 | BOOST_concept(InputIterator,(TT))
| ^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::InputIterator<boost::iterators::filter_iterator<boost::detail::out_edge_predicate<boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long unsigned int, long unsigned int&, long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::no_property, boost::listS>, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long unsigned int, long unsigned int&, long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int> > >]’
32 | inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
| ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied<boost::InputIterator<boost::iterators::filter_iterator<boost::detail::out_edge_predicate<boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long unsigned int, long unsigned int&, long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::no_property, boost::listS>, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long unsigned int, long unsigned int&, long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int> > > >::value’
44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied<boost::InputIterator<boost::iterators::filter_iterator<boost::detail::out_edge_predicate<boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long unsigned int, long unsigned int&, long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::no_property, boost::listS>, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long unsigned int, long unsigned int&, long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int> > > >’
45 | typedef boost::integral_constant<bool, value> type;
| ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:129:9: required from ‘void boost::breadth_first_visit(const IncidenceGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with IncidenceGraph = filtered_graph<adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, no_property, listS>, is_residual_edge<adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_residual_capacity_t> >, keep_all>; Buffer = queue<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > >; BFSVisitor = bfs_visitor<edge_predecessor_recorder<detail::edge_desc_impl<directed_tag, long unsigned int>*, on_tree_edge> >; ColorMap = default_color_type*; SourceIterator = long unsigned int*]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:136:24: required from ‘void boost::breadth_first_search(const VertexListGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph<adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, no_property, listS>, is_residual_edge<adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_residual_capacity_t> >, keep_all>; SourceIterator = long unsigned int*; Buffer = queue<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > >; BFSVisitor = bfs_visitor<edge_predecessor_recorder<detail::edge_desc_impl<directed_tag, long unsigned int>*, on_tree_edge> >; ColorMap = default_color_type*]’
136 | breadth_first_visit(g, sources_begin, sources_end, Q, vis, color);
| ~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:147:25: required from ‘void boost::breadth_first_search(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph<adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, no_property, listS>, is_residual_edge<adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_residual_capacity_t> >, keep_all>; Buffer = queue<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > >; BFSVisitor = bfs_visitor<edge_predecessor_recorder<detail::edge_desc_impl<directed_tag, long unsigned int>*, on_tree_edge> >; ColorMap = default_color_type*; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
147 | breadth_first_search(g, sources, sources + 1, Q, vis, color);
| ~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/edmonds_karp_max_flow.hpp:101:29: required from ‘typename boost::property_traits<IndexMap>::value_type boost::edmonds_karp_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, ColorMap, PredEdgeMap) [with Graph = adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, no_property, listS>; CapacityEdgeMap = adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map<directed_tag, detail::edge_desc_impl<directed_tag, long unsigned int>, detail::edge_desc_impl<directed_tag, long unsigned int>&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_reverse_t>; ColorMap = default_color_type*; PredEdgeMap = detail::edge_desc_impl<directed_tag, long unsigned int>*; typename property_traits<IndexMap>::value_type = long unsigned int; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
101 | breadth_first_search(detail::residual_graph(g, res), src, Q,
| ~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
102 | make_bfs_visitor(record_edge_predecessors(pred, on_tree_edge())),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
103 | color);
| ~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/edge_connectivity.hpp:146:42: required from ‘typename boost::graph_traits<G>::degree_size_type boost::edge_connectivity(VertexListGraph&, OutputIterator) [with VertexListGraph = R_adjacency_list<undirectedS, double>; OutputIterator = std::back_insert_iterator<std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int> > >; typename graph_traits<G>::degree_size_type = long unsigned int]’
146 | alpha_S_k = edmonds_karp_max_flow(
| ~~~~~~~~~~~~~~~~~~~~~^
147 | flow_g, p, k, cap, res_cap, rev_edge, &color[0], &pred[0]);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
interfaces.cpp:326:34: required from here
326 | dst c = edge_connectivity( g, std::back_inserter(disconnecting_set) );
| ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::EqualityComparable<boost::iterators::filter_iterator<boost::detail::out_edge_predicate<boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long unsigned int, long unsigned int&, long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::no_property, boost::listS>, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long unsigned int, long unsigned int&, long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int> > >]’
20 | ~usage_requirements() { ((Model*)0)->~Model(); }
| ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::InputIterator<boost::iterators::filter_iterator<boost::detail::out_edge_predicate<boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long unsigned int, long unsigned int&, long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::no_property, boost::listS>, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long unsigned int, long unsigned int&, long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int> > > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:512:7: required from ‘struct boost::InputIterator<boost::iterators::filter_iterator<boost::detail::out_edge_predicate<boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long unsigned int, long unsigned int&, long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::no_property, boost::listS>, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long unsigned int, long unsigned int&, long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int> > >’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::InputIterator<boost::iterators::filter_iterator<boost::detail::out_edge_predicate<boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long unsigned int, long unsigned int&, long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::no_property, boost::listS>, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long unsigned int, long unsigned int&, long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int> > >]’
32 | inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
| ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied<boost::InputIterator<boost::iterators::filter_iterator<boost::detail::out_edge_predicate<boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long unsigned int, long unsigned int&, long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::no_property, boost::listS>, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long unsigned int, long unsigned int&, long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int> > > >::value’
44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied<boost::InputIterator<boost::iterators::filter_iterator<boost::detail::out_edge_predicate<boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long unsigned int, long unsigned int&, long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::no_property, boost::listS>, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long unsigned int, long unsigned int&, long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int> > > >’
45 | typedef boost::integral_constant<bool, value> type;
| ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_<void (*)(boost::InputIterator<boost::iterators::filter_iterator<boost::detail::out_edge_predicate<boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long unsigned int, long unsigned int&, long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::no_property, boost::listS>, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long unsigned int, long unsigned int&, long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int> > >)>’
72 | struct requirement_<void(*)(Model)>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:53:35: [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:129:9: required from ‘void boost::breadth_first_visit(const IncidenceGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with IncidenceGraph = filtered_graph<adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, no_property, listS>, is_residual_edge<adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_residual_capacity_t> >, keep_all>; Buffer = queue<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > >; BFSVisitor = bfs_visitor<edge_predecessor_recorder<detail::edge_desc_impl<directed_tag, long unsigned int>*, on_tree_edge> >; ColorMap = default_color_type*; SourceIterator = long unsigned int*]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:136:24: required from ‘void boost::breadth_first_search(const VertexListGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph<adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, no_property, listS>, is_residual_edge<adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_residual_capacity_t> >, keep_all>; SourceIterator = long unsigned int*; Buffer = queue<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > >; BFSVisitor = bfs_visitor<edge_predecessor_recorder<detail::edge_desc_impl<directed_tag, long unsigned int>*, on_tree_edge> >; ColorMap = default_color_type*]’
136 | breadth_first_visit(g, sources_begin, sources_end, Q, vis, color);
| ~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:147:25: required from ‘void boost::breadth_first_search(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph<adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, no_property, listS>, is_residual_edge<adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_residual_capacity_t> >, keep_all>; Buffer = queue<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > >; BFSVisitor = bfs_visitor<edge_predecessor_recorder<detail::edge_desc_impl<directed_tag, long unsigned int>*, on_tree_edge> >; ColorMap = default_color_type*; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
147 | breadth_first_search(g, sources, sources + 1, Q, vis, color);
| ~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/edmonds_karp_max_flow.hpp:101:29: required from ‘typename boost::property_traits<IndexMap>::value_type boost::edmonds_karp_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, ColorMap, PredEdgeMap) [with Graph = adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, no_property, listS>; CapacityEdgeMap = adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map<directed_tag, detail::edge_desc_impl<directed_tag, long unsigned int>, detail::edge_desc_impl<directed_tag, long unsigned int>&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_reverse_t>; ColorMap = default_color_type*; PredEdgeMap = detail::edge_desc_impl<directed_tag, long unsigned int>*; typename property_traits<IndexMap>::value_type = long unsigned int; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
101 | breadth_first_search(detail::residual_graph(g, res), src, Q,
| ~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
102 | make_bfs_visitor(record_edge_predecessors(pred, on_tree_edge())),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
103 | color);
| ~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/edge_connectivity.hpp:146:42: required from ‘typename boost::graph_traits<G>::degree_size_type boost::edge_connectivity(VertexListGraph&, OutputIterator) [with VertexListGraph = R_adjacency_list<undirectedS, double>; OutputIterator = std::back_insert_iterator<std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int> > >; typename graph_traits<G>::degree_size_type = long unsigned int]’
146 | alpha_S_k = edmonds_karp_max_flow(
| ~~~~~~~~~~~~~~~~~~~~~^
147 | flow_g, p, k, cap, res_cap, rev_edge, &color[0], &pred[0]);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
interfaces.cpp:326:34: required from here
326 | dst c = edge_connectivity( g, std::back_inserter(disconnecting_set) );
| ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::InputIterator<boost::iterators::filter_iterator<boost::detail::out_edge_predicate<boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long unsigned int, long unsigned int&, long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::no_property, boost::listS>, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long unsigned int, long unsigned int&, long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int> > >]’
20 | ~usage_requirements() { ((Model*)0)->~Model(); }
| ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::InputIterator<boost::iterators::filter_iterator<boost::detail::out_edge_predicate<boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long unsigned int, long unsigned int&, long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::no_property, boost::listS>, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long unsigned int, long unsigned int&, long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int> > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:53:35: required from ‘boost::concepts::MultiPassInputIterator<T>::~MultiPassInputIterator() [with T = boost::iterators::filter_iterator<boost::detail::out_edge_predicate<boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long unsigned int, long unsigned int&, long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::no_property, boost::listS>, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long unsigned int, long unsigned int&, long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int> >]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::MultiPassInputIterator<boost::iterators::filter_iterator<boost::detail::out_edge_predicate<boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long unsigned int, long unsigned int&, long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::no_property, boost::listS>, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long unsigned int, long unsigned int&, long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int> > >]’
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:89:9: required from ‘boost::concepts::IncidenceGraph<G>::~IncidenceGraph() [with G = boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::no_property, boost::listS>, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long unsigned int, long unsigned int&, long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all>]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:75:1: required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::IncidenceGraphConcept<boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::no_property, boost::listS>, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long unsigned int, long unsigned int&, long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >]’
75 | BOOST_concept(IncidenceGraph, (G)) : Graph< G >
| ^~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:129:9: required from ‘void boost::breadth_first_visit(const IncidenceGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with IncidenceGraph = filtered_graph<adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, no_property, listS>, is_residual_edge<adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_residual_capacity_t> >, keep_all>; Buffer = queue<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > >; BFSVisitor = bfs_visitor<edge_predecessor_recorder<detail::edge_desc_impl<directed_tag, long unsigned int>*, on_tree_edge> >; ColorMap = default_color_type*; SourceIterator = long unsigned int*]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:136:24: required from ‘void boost::breadth_first_search(const VertexListGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph<adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, no_property, listS>, is_residual_edge<adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_residual_capacity_t> >, keep_all>; SourceIterator = long unsigned int*; Buffer = queue<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > >; BFSVisitor = bfs_visitor<edge_predecessor_recorder<detail::edge_desc_impl<directed_tag, long unsigned int>*, on_tree_edge> >; ColorMap = default_color_type*]’
136 | breadth_first_visit(g, sources_begin, sources_end, Q, vis, color);
| ~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:147:25: required from ‘void boost::breadth_first_search(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph<adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, no_property, listS>, is_residual_edge<adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_residual_capacity_t> >, keep_all>; Buffer = queue<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > >; BFSVisitor = bfs_visitor<edge_predecessor_recorder<detail::edge_desc_impl<directed_tag, long unsigned int>*, on_tree_edge> >; ColorMap = default_color_type*; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
147 | breadth_first_search(g, sources, sources + 1, Q, vis, color);
| ~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/edmonds_karp_max_flow.hpp:101:29: required from ‘typename boost::property_traits<IndexMap>::value_type boost::edmonds_karp_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, ColorMap, PredEdgeMap) [with Graph = adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, no_property, listS>; CapacityEdgeMap = adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map<directed_tag, detail::edge_desc_impl<directed_tag, long unsigned int>, detail::edge_desc_impl<directed_tag, long unsigned int>&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_reverse_t>; ColorMap = default_color_type*; PredEdgeMap = detail::edge_desc_impl<directed_tag, long unsigned int>*; typename property_traits<IndexMap>::value_type = long unsigned int; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
101 | breadth_first_search(detail::residual_graph(g, res), src, Q,
| ~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
102 | make_bfs_visitor(record_edge_predecessors(pred, on_tree_edge())),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
103 | color);
| ~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/edge_connectivity.hpp:146:42: required from ‘typename boost::graph_traits<G>::degree_size_type boost::edge_connectivity(VertexListGraph&, OutputIterator) [with VertexListGraph = R_adjacency_list<undirectedS, double>; OutputIterator = std::back_insert_iterator<std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int> > >; typename graph_traits<G>::degree_size_type = long unsigned int]’
146 | alpha_S_k = edmonds_karp_max_flow(
| ~~~~~~~~~~~~~~~~~~~~~^
147 | flow_g, p, k, cap, res_cap, rev_edge, &color[0], &pred[0]);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
interfaces.cpp:326:34: required from here
326 | dst c = edge_connectivity( g, std::back_inserter(disconnecting_set) );
| ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::InputIterator<TT>::~InputIterator() [with TT = boost::iterators::filter_iterator<boost::detail::out_edge_predicate<boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long unsigned int, long unsigned int&, long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::no_property, boost::listS>, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long unsigned int, long unsigned int&, long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int> >]’
37 | ~model()
| ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:512:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
512 | BOOST_CONCEPT_USAGE(InputIterator)
| ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Assignable<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int> >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Assignable<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int> > >]’
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:145:5: required from ‘struct boost::Assignable<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int> >’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int> >’
502 | BOOST_concept(InputIterator,(TT))
| ^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::InputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int> >]’
32 | inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
| ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied<boost::InputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int> > >::value’
44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 6 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:129:9: required from ‘void boost::detail::depth_first_visit_impl(const IncidenceGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, DFSVisitor&, ColorMap, TerminatorFunc) [with IncidenceGraph = R_adjacency_list<boost::directedS, double>; DFSVisitor = dfs_time_visitor<long unsigned int*>; ColorMap = boost::shared_array_property_map<boost::default_color_type, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int> >; TerminatorFunc = nontruth2; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:286:39: required from ‘void boost::depth_first_search(const VertexListGraph&, DFSVisitor, ColorMap, typename graph_traits<Graph>::vertex_descriptor) [with VertexListGraph = R_adjacency_list<directedS, double>; DFSVisitor = dfs_time_visitor<long unsigned int*>; ColorMap = shared_array_property_map<default_color_type, vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int> >; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
286 | detail::depth_first_visit_impl(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
287 | g, start_vertex, vis, color, detail::nontruth2());
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/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 dfs_time_visitor<long unsigned int*> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; Graph = R_adjacency_list<boost::directedS, double>]’
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)]);
| ~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/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 = R_adjacency_list<boost::directedS, double>; ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<keywords::tag::visitor, const dfs_time_visitor<long unsigned 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); \
| ~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/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 = R_adjacency_list<directedS, double>; P = dfs_time_visitor<long unsigned 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 dfs_time_visitor<long unsigned 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); \
| ~~~~~~~~~
interfaces.cpp:158:27: required from here
158 | depth_first_search(g, visitor(vis));
| ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
20 | ~usage_requirements() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Assignable<TT>::~Assignable() [with TT = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int>]’
37 | ~model()
| ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:145:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
145 | BOOST_CONCEPT_USAGE(Assignable) {
| ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::EqualityComparable<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int> >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::EqualityComparable<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int> > >]’
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int> >’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int> >’
502 | BOOST_concept(InputIterator,(TT))
| ^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::InputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int> >]’
32 | inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
| ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied<boost::InputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int> > >::value’
44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 6 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:129:9: required from ‘void boost::detail::depth_first_visit_impl(const IncidenceGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, DFSVisitor&, ColorMap, TerminatorFunc) [with IncidenceGraph = R_adjacency_list<boost::directedS, double>; DFSVisitor = dfs_time_visitor<long unsigned int*>; ColorMap = boost::shared_array_property_map<boost::default_color_type, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int> >; TerminatorFunc = nontruth2; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:286:39: required from ‘void boost::depth_first_search(const VertexListGraph&, DFSVisitor, ColorMap, typename graph_traits<Graph>::vertex_descriptor) [with VertexListGraph = R_adjacency_list<directedS, double>; DFSVisitor = dfs_time_visitor<long unsigned int*>; ColorMap = shared_array_property_map<default_color_type, vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int> >; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
286 | detail::depth_first_visit_impl(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
287 | g, start_vertex, vis, color, detail::nontruth2());
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/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 dfs_time_visitor<long unsigned int*> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; Graph = R_adjacency_list<boost::directedS, double>]’
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)]);
| ~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/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 = R_adjacency_list<boost::directedS, double>; ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<keywords::tag::visitor, const dfs_time_visitor<long unsigned 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); \
| ~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/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 = R_adjacency_list<directedS, double>; P = dfs_time_visitor<long unsigned 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 dfs_time_visitor<long unsigned 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); \
| ~~~~~~~~~
interfaces.cpp:158:27: required from here
158 | depth_first_search(g, visitor(vis));
| ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
20 | ~usage_requirements() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::EqualityComparable<TT>::~EqualityComparable() [with TT = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int>]’
37 | ~model()
| ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:233:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
233 | BOOST_CONCEPT_USAGE(EqualityComparable) {
| ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::InputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int> >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::InputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int> > >]’
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:512:7: required from ‘struct boost::InputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int> >’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::InputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int> >]’
32 | inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
| ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied<boost::InputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int> > >::value’
44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied<boost::InputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int> > >’
45 | typedef boost::integral_constant<bool, value> type;
| ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:129:9: required from ‘void boost::detail::depth_first_visit_impl(const IncidenceGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, DFSVisitor&, ColorMap, TerminatorFunc) [with IncidenceGraph = R_adjacency_list<boost::directedS, double>; DFSVisitor = dfs_time_visitor<long unsigned int*>; ColorMap = boost::shared_array_property_map<boost::default_color_type, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int> >; TerminatorFunc = nontruth2; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:286:39: required from ‘void boost::depth_first_search(const VertexListGraph&, DFSVisitor, ColorMap, typename graph_traits<Graph>::vertex_descriptor) [with VertexListGraph = R_adjacency_list<directedS, double>; DFSVisitor = dfs_time_visitor<long unsigned int*>; ColorMap = shared_array_property_map<default_color_type, vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int> >; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
286 | detail::depth_first_visit_impl(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
287 | g, start_vertex, vis, color, detail::nontruth2());
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/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 dfs_time_visitor<long unsigned int*> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; Graph = R_adjacency_list<boost::directedS, double>]’
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)]);
| ~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/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 = R_adjacency_list<boost::directedS, double>; ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<keywords::tag::visitor, const dfs_time_visitor<long unsigned 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); \
| ~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/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 = R_adjacency_list<directedS, double>; P = dfs_time_visitor<long unsigned 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 dfs_time_visitor<long unsigned 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); \
| ~~~~~~~~~
interfaces.cpp:158:27: required from here
158 | depth_first_search(g, visitor(vis));
| ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
20 | ~usage_requirements() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::InputIterator<TT>::~InputIterator() [with TT = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int>]’
37 | ~model()
| ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:512:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
512 | BOOST_CONCEPT_USAGE(InputIterator)
| ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Assignable<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > >, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > >, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > >, boost::property<boost::edge_weight_t, double, boost::no_property> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:145:5: required from ‘struct boost::Assignable<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > >, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > >, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > >, boost::property<boost::edge_weight_t, double, 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> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > >, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > >, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > >, boost::property<boost::edge_weight_t, double, boost::no_property> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> >’
502 | BOOST_concept(InputIterator,(TT))
| ^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::InputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > >, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > >, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > >, boost::property<boost::edge_weight_t, double, 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);
| ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied<boost::InputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > >, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > >, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > >, boost::property<boost::edge_weight_t, double, 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) );
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied<boost::InputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > >, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > >, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > >, boost::property<boost::edge_weight_t, double, 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;
| ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 6 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:286:39: required from ‘void boost::depth_first_search(const VertexListGraph&, DFSVisitor, ColorMap, typename graph_traits<Graph>::vertex_descriptor) [with VertexListGraph = R_adjacency_list<undirectedS, double>; DFSVisitor = detail::components_recorder<int*>; ColorMap = shared_array_property_map<default_color_type, vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int> >; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
286 | detail::depth_first_visit_impl(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
287 | g, start_vertex, vis, color, detail::nontruth2());
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:397:42: required from ‘void boost::graph::detail::depth_first_search_impl<Graph>::operator()(const Graph&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<boost::graph::keywords::tag::visitor, const boost::detail::components_recorder<int*> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; Graph = R_adjacency_list<boost::undirectedS, double>]’
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)]);
| ~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/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 = R_adjacency_list<boost::undirectedS, double>; ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<keywords::tag::visitor, const boost::detail::components_recorder<int*> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; typename boost::result_of<detail::depth_first_search_impl<Param0>(Param0, const ArgPack&)>::type = void]’
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); \
| ~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/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 = R_adjacency_list<undirectedS, double>; P = detail::components_recorder<int*>; T = graph_visitor_t; R = no_property; typename result_of<graph::detail::depth_first_search_impl<Param0>(Param0, const typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<T, Tag, Base> >::type&)>::type = void; typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<T, Tag, Base> >::type = parameter::aux::arg_list<parameter::aux::tagged_argument<graph::keywords::tag::visitor, const detail::components_recorder<int*> >, parameter::aux::empty_arg_list, std::integral_constant<bool, true> >]’
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); \
| ~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/connected_components.hpp:106:23: required from ‘typename boost::property_traits<IndexMap>::value_type boost::connected_components(const Graph&, ComponentMap, typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = R_adjacency_list<undirectedS, double>; ComponentMap = int*; typename property_traits<IndexMap>::value_type = int; typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits<Graph>::traversal_category = undir_adj_list_traversal_tag]’
106 | depth_first_search(g, visitor(vis));
| ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~
interfaces.cpp:205:29: required from here
205 | connected_components(g, &component[0]);
| ~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Assignable<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > >, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > >, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > >, boost::property<boost::edge_weight_t, double, 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(); }
| ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::EqualityComparable<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > >, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > >, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > >, boost::property<boost::edge_weight_t, double, boost::no_property> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > >, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > >, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > >, boost::property<boost::edge_weight_t, double, 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> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > >, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > >, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > >, boost::property<boost::edge_weight_t, double, boost::no_property> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> >’
502 | BOOST_concept(InputIterator,(TT))
| ^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::InputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > >, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > >, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > >, boost::property<boost::edge_weight_t, double, 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);
| ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied<boost::InputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > >, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > >, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > >, boost::property<boost::edge_weight_t, double, 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) );
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied<boost::InputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > >, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > >, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > >, boost::property<boost::edge_weight_t, double, 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;
| ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 6 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:286:39: required from ‘void boost::depth_first_search(const VertexListGraph&, DFSVisitor, ColorMap, typename graph_traits<Graph>::vertex_descriptor) [with VertexListGraph = R_adjacency_list<undirectedS, double>; DFSVisitor = detail::components_recorder<int*>; ColorMap = shared_array_property_map<default_color_type, vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int> >; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
286 | detail::depth_first_visit_impl(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
287 | g, start_vertex, vis, color, detail::nontruth2());
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:397:42: required from ‘void boost::graph::detail::depth_first_search_impl<Graph>::operator()(const Graph&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<boost::graph::keywords::tag::visitor, const boost::detail::components_recorder<int*> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; Graph = R_adjacency_list<boost::undirectedS, double>]’
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)]);
| ~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/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 = R_adjacency_list<boost::undirectedS, double>; ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<keywords::tag::visitor, const boost::detail::components_recorder<int*> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; typename boost::result_of<detail::depth_first_search_impl<Param0>(Param0, const ArgPack&)>::type = void]’
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); \
| ~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/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 = R_adjacency_list<undirectedS, double>; P = detail::components_recorder<int*>; T = graph_visitor_t; R = no_property; typename result_of<graph::detail::depth_first_search_impl<Param0>(Param0, const typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<T, Tag, Base> >::type&)>::type = void; typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<T, Tag, Base> >::type = parameter::aux::arg_list<parameter::aux::tagged_argument<graph::keywords::tag::visitor, const detail::components_recorder<int*> >, parameter::aux::empty_arg_list, std::integral_constant<bool, true> >]’
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); \
| ~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/connected_components.hpp:106:23: required from ‘typename boost::property_traits<IndexMap>::value_type boost::connected_components(const Graph&, ComponentMap, typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = R_adjacency_list<undirectedS, double>; ComponentMap = int*; typename property_traits<IndexMap>::value_type = int; typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits<Graph>::traversal_category = undir_adj_list_traversal_tag]’
106 | depth_first_search(g, visitor(vis));
| ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~
interfaces.cpp:205:29: required from here
205 | connected_components(g, &component[0]);
| ~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::EqualityComparable<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > >, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > >, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > >, boost::property<boost::edge_weight_t, double, 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(); }
| ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::InputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > >, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > >, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > >, boost::property<boost::edge_weight_t, double, boost::no_property> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:512:7: required from ‘struct boost::InputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > >, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > >, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > >, boost::property<boost::edge_weight_t, double, 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> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::InputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > >, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > >, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > >, boost::property<boost::edge_weight_t, double, 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);
| ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied<boost::InputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > >, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > >, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > >, boost::property<boost::edge_weight_t, double, 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) );
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied<boost::InputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > >, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > >, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > >, boost::property<boost::edge_weight_t, double, 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;
| ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_<void (*)(boost::InputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > >, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > >, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > >, boost::property<boost::edge_weight_t, double, boost::no_property> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> >)>’
72 | struct requirement_<void(*)(Model)>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:53:35: [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:286:39: required from ‘void boost::depth_first_search(const VertexListGraph&, DFSVisitor, ColorMap, typename graph_traits<Graph>::vertex_descriptor) [with VertexListGraph = R_adjacency_list<undirectedS, double>; DFSVisitor = detail::components_recorder<int*>; ColorMap = shared_array_property_map<default_color_type, vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int> >; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
286 | detail::depth_first_visit_impl(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
287 | g, start_vertex, vis, color, detail::nontruth2());
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:397:42: required from ‘void boost::graph::detail::depth_first_search_impl<Graph>::operator()(const Graph&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<boost::graph::keywords::tag::visitor, const boost::detail::components_recorder<int*> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; Graph = R_adjacency_list<boost::undirectedS, double>]’
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)]);
| ~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/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 = R_adjacency_list<boost::undirectedS, double>; ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<keywords::tag::visitor, const boost::detail::components_recorder<int*> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; typename boost::result_of<detail::depth_first_search_impl<Param0>(Param0, const ArgPack&)>::type = void]’
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); \
| ~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/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 = R_adjacency_list<undirectedS, double>; P = detail::components_recorder<int*>; T = graph_visitor_t; R = no_property; typename result_of<graph::detail::depth_first_search_impl<Param0>(Param0, const typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<T, Tag, Base> >::type&)>::type = void; typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<T, Tag, Base> >::type = parameter::aux::arg_list<parameter::aux::tagged_argument<graph::keywords::tag::visitor, const detail::components_recorder<int*> >, parameter::aux::empty_arg_list, std::integral_constant<bool, true> >]’
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); \
| ~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/connected_components.hpp:106:23: required from ‘typename boost::property_traits<IndexMap>::value_type boost::connected_components(const Graph&, ComponentMap, typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = R_adjacency_list<undirectedS, double>; ComponentMap = int*; typename property_traits<IndexMap>::value_type = int; typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits<Graph>::traversal_category = undir_adj_list_traversal_tag]’
106 | depth_first_search(g, visitor(vis));
| ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~
interfaces.cpp:205:29: required from here
205 | connected_components(g, &component[0]);
| ~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::InputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > >, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > >, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > >, boost::property<boost::edge_weight_t, double, 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(); }
| ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::InputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > >, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > >, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > >, boost::property<boost::edge_weight_t, double, boost::no_property> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:53:35: required from ‘boost::concepts::MultiPassInputIterator<T>::~MultiPassInputIterator() [with T = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > >, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > >, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > >, boost::property<boost::edge_weight_t, double, 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> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::MultiPassInputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > >, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > >, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > >, boost::property<boost::edge_weight_t, double, 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(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:89:9: required from ‘boost::concepts::IncidenceGraph<G>::~IncidenceGraph() [with G = R_adjacency_list<boost::undirectedS, double>]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/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<R_adjacency_list<boost::undirectedS, double> >]’
75 | BOOST_concept(IncidenceGraph, (G)) : Graph< G >
| ^~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:129:9: required from ‘void boost::detail::depth_first_visit_impl(const IncidenceGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, DFSVisitor&, ColorMap, TerminatorFunc) [with IncidenceGraph = R_adjacency_list<boost::undirectedS, double>; DFSVisitor = components_recorder<int*>; ColorMap = boost::shared_array_property_map<boost::default_color_type, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int> >; TerminatorFunc = nontruth2; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:286:39: required from ‘void boost::depth_first_search(const VertexListGraph&, DFSVisitor, ColorMap, typename graph_traits<Graph>::vertex_descriptor) [with VertexListGraph = R_adjacency_list<undirectedS, double>; DFSVisitor = detail::components_recorder<int*>; ColorMap = shared_array_property_map<default_color_type, vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int> >; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
286 | detail::depth_first_visit_impl(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
287 | g, start_vertex, vis, color, detail::nontruth2());
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:397:42: required from ‘void boost::graph::detail::depth_first_search_impl<Graph>::operator()(const Graph&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<boost::graph::keywords::tag::visitor, const boost::detail::components_recorder<int*> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; Graph = R_adjacency_list<boost::undirectedS, double>]’
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)]);
| ~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/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 = R_adjacency_list<boost::undirectedS, double>; ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<keywords::tag::visitor, const boost::detail::components_recorder<int*> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; typename boost::result_of<detail::depth_first_search_impl<Param0>(Param0, const ArgPack&)>::type = void]’
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); \
| ~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/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 = R_adjacency_list<undirectedS, double>; P = detail::components_recorder<int*>; T = graph_visitor_t; R = no_property; typename result_of<graph::detail::depth_first_search_impl<Param0>(Param0, const typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<T, Tag, Base> >::type&)>::type = void; typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<T, Tag, Base> >::type = parameter::aux::arg_list<parameter::aux::tagged_argument<graph::keywords::tag::visitor, const detail::components_recorder<int*> >, parameter::aux::empty_arg_list, std::integral_constant<bool, true> >]’
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); \
| ~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/connected_components.hpp:106:23: required from ‘typename boost::property_traits<IndexMap>::value_type boost::connected_components(const Graph&, ComponentMap, typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = R_adjacency_list<undirectedS, double>; ComponentMap = int*; typename property_traits<IndexMap>::value_type = int; typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits<Graph>::traversal_category = undir_adj_list_traversal_tag]’
106 | depth_first_search(g, visitor(vis));
| ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~
interfaces.cpp:205:29: required from here
205 | connected_components(g, &component[0]);
| ~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::InputIterator<TT>::~InputIterator() [with TT = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > >, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > >, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > >, boost::property<boost::edge_weight_t, double, boost::no_property> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int>]’
37 | ~model()
| ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:512:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
512 | BOOST_CONCEPT_USAGE(InputIterator)
| ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Assignable<boost::range_detail::integer_iterator<long unsigned int> > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:145:5: required from ‘struct boost::Assignable<boost::range_detail::integer_iterator<long unsigned int> >’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator<boost::range_detail::integer_iterator<long unsigned int> >’
502 | BOOST_concept(InputIterator,(TT))
| ^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::InputIterator<boost::range_detail::integer_iterator<long unsigned int> >]’
32 | inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
| ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied<boost::InputIterator<boost::range_detail::integer_iterator<long unsigned int> > >::value’
44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied<boost::InputIterator<boost::range_detail::integer_iterator<long unsigned int> > >’
45 | typedef boost::integral_constant<bool, value> type;
| ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 6 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/biconnected_components.hpp:250:47: required from ‘static std::pair<long unsigned int, OutputIterator> boost::detail::bicomp_dispatch3<boost::param_not_found>::apply(const Graph&, ComponentMap, OutputIterator, VertexIndexMap, DiscoverTimeMap, LowPointMap, const boost::bgl_named_params<P, T, R>&, boost::param_not_found) [with Graph = R_adjacency_list<boost::undirectedS, double>; ComponentMap = boost::dummy_property_map; OutputIterator = std::back_insert_iterator<std::vector<long unsigned int> >; VertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>; DiscoverTimeMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; LowPointMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; P = int; T = boost::buffer_param_t; R = boost::no_property]’
250 | return biconnected_components_impl(g, comp, out, index_map, dtm,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
251 | lowpt,
| ~~~~~~
252 | make_iterator_property_map(pred.begin(), index_map, vert),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
253 | choose_param(get_param(params, graph_visitor),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
254 | make_dfs_visitor(null_visitor())));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/biconnected_components.hpp:295:60: required from ‘static std::pair<long unsigned int, OutputIterator> boost::detail::bicomp_dispatch2<boost::param_not_found>::apply(const Graph&, ComponentMap, OutputIterator, VertexIndexMap, DiscoverTimeMap, const boost::bgl_named_params<P, T, R>&, boost::param_not_found) [with Graph = R_adjacency_list<boost::undirectedS, double>; ComponentMap = boost::dummy_property_map; OutputIterator = std::back_insert_iterator<std::vector<long unsigned int> >; VertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>; DiscoverTimeMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; P = int; T = boost::buffer_param_t; R = boost::no_property]’
295 | return bicomp_dispatch3< dispatch_type >::apply(g, comp, out,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
296 | index_map, dtm,
| ~~~~~~~~~~~~~~~
297 | make_iterator_property_map(lowpt.begin(), index_map, vst),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
298 | params, get_param(params, vertex_predecessor));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/biconnected_components.hpp:336:60: required from ‘static std::pair<long unsigned int, OutputIterator> boost::detail::bicomp_dispatch1<boost::param_not_found>::apply(const Graph&, ComponentMap, OutputIterator, VertexIndexMap, const boost::bgl_named_params<P, T, R>&, boost::param_not_found) [with Graph = R_adjacency_list<boost::undirectedS, double>; ComponentMap = boost::dummy_property_map; OutputIterator = std::back_insert_iterator<std::vector<long unsigned int> >; VertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>; P = int; T = boost::buffer_param_t; R = boost::no_property]’
336 | return bicomp_dispatch2< dispatch_type >::apply(g, comp, out,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
337 | index_map,
| ~~~~~~~~~~
338 | make_iterator_property_map(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~
339 | discover_time.begin(), index_map, vst),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
340 | params, get_param(params, vertex_lowpoint));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/biconnected_components.hpp:368:60: required from ‘std::pair<long unsigned int, OutputIterator> boost::biconnected_components(const Graph&, ComponentMap, OutputIterator, const bgl_named_params<P, T, R>&) [with Graph = R_adjacency_list<undirectedS, double>; ComponentMap = dummy_property_map; OutputIterator = std::back_insert_iterator<std::vector<long unsigned int> >; P = int; T = buffer_param_t; R = no_property]’
368 | return detail::bicomp_dispatch1< dispatch_type >::apply(g, comp, out,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
369 | choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
370 | params, get_param(params, vertex_discover_time));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/biconnected_components.hpp:433:34: required from ‘OutputIterator boost::articulation_points(const Graph&, OutputIterator) [with Graph = R_adjacency_list<undirectedS, double>; OutputIterator = std::back_insert_iterator<std::vector<long unsigned int> >]’
433 | return biconnected_components(g, dummy_property_map(), out,
| ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
434 | bgl_named_params< int, buffer_param_t >(0))
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
interfaces.cpp:300:28: required from here
300 | articulation_points(g, std::back_inserter(art_points));
| ~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Assignable<boost::range_detail::integer_iterator<long unsigned int> >]’
20 | ~usage_requirements() { ((Model*)0)->~Model(); }
| ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::EqualityComparable<boost::range_detail::integer_iterator<long unsigned int> > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable<boost::range_detail::integer_iterator<long unsigned int> >’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator<boost::range_detail::integer_iterator<long unsigned int> >’
502 | BOOST_concept(InputIterator,(TT))
| ^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::InputIterator<boost::range_detail::integer_iterator<long unsigned int> >]’
32 | inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
| ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied<boost::InputIterator<boost::range_detail::integer_iterator<long unsigned int> > >::value’
44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied<boost::InputIterator<boost::range_detail::integer_iterator<long unsigned int> > >’
45 | typedef boost::integral_constant<bool, value> type;
| ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 6 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/biconnected_components.hpp:250:47: required from ‘static std::pair<long unsigned int, OutputIterator> boost::detail::bicomp_dispatch3<boost::param_not_found>::apply(const Graph&, ComponentMap, OutputIterator, VertexIndexMap, DiscoverTimeMap, LowPointMap, const boost::bgl_named_params<P, T, R>&, boost::param_not_found) [with Graph = R_adjacency_list<boost::undirectedS, double>; ComponentMap = boost::dummy_property_map; OutputIterator = std::back_insert_iterator<std::vector<long unsigned int> >; VertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>; DiscoverTimeMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; LowPointMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; P = int; T = boost::buffer_param_t; R = boost::no_property]’
250 | return biconnected_components_impl(g, comp, out, index_map, dtm,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
251 | lowpt,
| ~~~~~~
252 | make_iterator_property_map(pred.begin(), index_map, vert),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
253 | choose_param(get_param(params, graph_visitor),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
254 | make_dfs_visitor(null_visitor())));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/biconnected_components.hpp:295:60: required from ‘static std::pair<long unsigned int, OutputIterator> boost::detail::bicomp_dispatch2<boost::param_not_found>::apply(const Graph&, ComponentMap, OutputIterator, VertexIndexMap, DiscoverTimeMap, const boost::bgl_named_params<P, T, R>&, boost::param_not_found) [with Graph = R_adjacency_list<boost::undirectedS, double>; ComponentMap = boost::dummy_property_map; OutputIterator = std::back_insert_iterator<std::vector<long unsigned int> >; VertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>; DiscoverTimeMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; P = int; T = boost::buffer_param_t; R = boost::no_property]’
295 | return bicomp_dispatch3< dispatch_type >::apply(g, comp, out,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
296 | index_map, dtm,
| ~~~~~~~~~~~~~~~
297 | make_iterator_property_map(lowpt.begin(), index_map, vst),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
298 | params, get_param(params, vertex_predecessor));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/biconnected_components.hpp:336:60: required from ‘static std::pair<long unsigned int, OutputIterator> boost::detail::bicomp_dispatch1<boost::param_not_found>::apply(const Graph&, ComponentMap, OutputIterator, VertexIndexMap, const boost::bgl_named_params<P, T, R>&, boost::param_not_found) [with Graph = R_adjacency_list<boost::undirectedS, double>; ComponentMap = boost::dummy_property_map; OutputIterator = std::back_insert_iterator<std::vector<long unsigned int> >; VertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>; P = int; T = boost::buffer_param_t; R = boost::no_property]’
336 | return bicomp_dispatch2< dispatch_type >::apply(g, comp, out,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
337 | index_map,
| ~~~~~~~~~~
338 | make_iterator_property_map(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~
339 | discover_time.begin(), index_map, vst),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
340 | params, get_param(params, vertex_lowpoint));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/biconnected_components.hpp:368:60: required from ‘std::pair<long unsigned int, OutputIterator> boost::biconnected_components(const Graph&, ComponentMap, OutputIterator, const bgl_named_params<P, T, R>&) [with Graph = R_adjacency_list<undirectedS, double>; ComponentMap = dummy_property_map; OutputIterator = std::back_insert_iterator<std::vector<long unsigned int> >; P = int; T = buffer_param_t; R = no_property]’
368 | return detail::bicomp_dispatch1< dispatch_type >::apply(g, comp, out,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
369 | choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
370 | params, get_param(params, vertex_discover_time));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/biconnected_components.hpp:433:34: required from ‘OutputIterator boost::articulation_points(const Graph&, OutputIterator) [with Graph = R_adjacency_list<undirectedS, double>; OutputIterator = std::back_insert_iterator<std::vector<long unsigned int> >]’
433 | return biconnected_components(g, dummy_property_map(), out,
| ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
434 | bgl_named_params< int, buffer_param_t >(0))
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
interfaces.cpp:300:28: required from here
300 | articulation_points(g, std::back_inserter(art_points));
| ~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::EqualityComparable<boost::range_detail::integer_iterator<long unsigned int> >]’
20 | ~usage_requirements() { ((Model*)0)->~Model(); }
| ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::InputIterator<boost::range_detail::integer_iterator<long unsigned int> > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:512:7: required from ‘struct boost::InputIterator<boost::range_detail::integer_iterator<long unsigned int> >’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::InputIterator<boost::range_detail::integer_iterator<long unsigned int> >]’
32 | inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
| ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied<boost::InputIterator<boost::range_detail::integer_iterator<long unsigned int> > >::value’
44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied<boost::InputIterator<boost::range_detail::integer_iterator<long unsigned int> > >’
45 | typedef boost::integral_constant<bool, value> type;
| ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_<void (*)(boost::InputIterator<boost::range_detail::integer_iterator<long unsigned int> >)>’
72 | struct requirement_<void(*)(Model)>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:53:35: [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/biconnected_components.hpp:250:47: required from ‘static std::pair<long unsigned int, OutputIterator> boost::detail::bicomp_dispatch3<boost::param_not_found>::apply(const Graph&, ComponentMap, OutputIterator, VertexIndexMap, DiscoverTimeMap, LowPointMap, const boost::bgl_named_params<P, T, R>&, boost::param_not_found) [with Graph = R_adjacency_list<boost::undirectedS, double>; ComponentMap = boost::dummy_property_map; OutputIterator = std::back_insert_iterator<std::vector<long unsigned int> >; VertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>; DiscoverTimeMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; LowPointMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; P = int; T = boost::buffer_param_t; R = boost::no_property]’
250 | return biconnected_components_impl(g, comp, out, index_map, dtm,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
251 | lowpt,
| ~~~~~~
252 | make_iterator_property_map(pred.begin(), index_map, vert),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
253 | choose_param(get_param(params, graph_visitor),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
254 | make_dfs_visitor(null_visitor())));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/biconnected_components.hpp:295:60: required from ‘static std::pair<long unsigned int, OutputIterator> boost::detail::bicomp_dispatch2<boost::param_not_found>::apply(const Graph&, ComponentMap, OutputIterator, VertexIndexMap, DiscoverTimeMap, const boost::bgl_named_params<P, T, R>&, boost::param_not_found) [with Graph = R_adjacency_list<boost::undirectedS, double>; ComponentMap = boost::dummy_property_map; OutputIterator = std::back_insert_iterator<std::vector<long unsigned int> >; VertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>; DiscoverTimeMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; P = int; T = boost::buffer_param_t; R = boost::no_property]’
295 | return bicomp_dispatch3< dispatch_type >::apply(g, comp, out,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
296 | index_map, dtm,
| ~~~~~~~~~~~~~~~
297 | make_iterator_property_map(lowpt.begin(), index_map, vst),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
298 | params, get_param(params, vertex_predecessor));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/biconnected_components.hpp:336:60: required from ‘static std::pair<long unsigned int, OutputIterator> boost::detail::bicomp_dispatch1<boost::param_not_found>::apply(const Graph&, ComponentMap, OutputIterator, VertexIndexMap, const boost::bgl_named_params<P, T, R>&, boost::param_not_found) [with Graph = R_adjacency_list<boost::undirectedS, double>; ComponentMap = boost::dummy_property_map; OutputIterator = std::back_insert_iterator<std::vector<long unsigned int> >; VertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>; P = int; T = boost::buffer_param_t; R = boost::no_property]’
336 | return bicomp_dispatch2< dispatch_type >::apply(g, comp, out,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
337 | index_map,
| ~~~~~~~~~~
338 | make_iterator_property_map(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~
339 | discover_time.begin(), index_map, vst),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
340 | params, get_param(params, vertex_lowpoint));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/biconnected_components.hpp:368:60: required from ‘std::pair<long unsigned int, OutputIterator> boost::biconnected_components(const Graph&, ComponentMap, OutputIterator, const bgl_named_params<P, T, R>&) [with Graph = R_adjacency_list<undirectedS, double>; ComponentMap = dummy_property_map; OutputIterator = std::back_insert_iterator<std::vector<long unsigned int> >; P = int; T = buffer_param_t; R = no_property]’
368 | return detail::bicomp_dispatch1< dispatch_type >::apply(g, comp, out,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
369 | choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
370 | params, get_param(params, vertex_discover_time));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/biconnected_components.hpp:433:34: required from ‘OutputIterator boost::articulation_points(const Graph&, OutputIterator) [with Graph = R_adjacency_list<undirectedS, double>; OutputIterator = std::back_insert_iterator<std::vector<long unsigned int> >]’
433 | return biconnected_components(g, dummy_property_map(), out,
| ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
434 | bgl_named_params< int, buffer_param_t >(0))
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
interfaces.cpp:300:28: required from here
300 | articulation_points(g, std::back_inserter(art_points));
| ~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::InputIterator<boost::range_detail::integer_iterator<long unsigned int> >]’
20 | ~usage_requirements() { ((Model*)0)->~Model(); }
| ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::InputIterator<boost::range_detail::integer_iterator<long unsigned int> >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:53:35: required from ‘boost::concepts::MultiPassInputIterator<T>::~MultiPassInputIterator() [with T = boost::range_detail::integer_iterator<long unsigned int>]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::MultiPassInputIterator<boost::range_detail::integer_iterator<long unsigned int> >]’
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:184:9: required from ‘boost::concepts::VertexListGraph<G>::~VertexListGraph() [with G = R_adjacency_list<boost::undirectedS, double>]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/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<R_adjacency_list<boost::undirectedS, double> >]’
176 | BOOST_concept(VertexListGraph, (G)) : Graph< G >
| ^~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/biconnected_components.hpp:188:9: required from ‘std::pair<long unsigned int, OutputIterator> boost::detail::biconnected_components_impl(const Graph&, ComponentMap, OutputIterator, VertexIndexMap, DiscoverTimeMap, LowPointMap, PredecessorMap, DFSVisitor) [with Graph = R_adjacency_list<boost::undirectedS, double>; ComponentMap = boost::dummy_property_map; OutputIterator = std::back_insert_iterator<std::vector<long unsigned int> >; VertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>; DiscoverTimeMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; LowPointMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; PredecessorMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; DFSVisitor = boost::dfs_visitor<>]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/biconnected_components.hpp:250:47: required from ‘static std::pair<long unsigned int, OutputIterator> boost::detail::bicomp_dispatch3<boost::param_not_found>::apply(const Graph&, ComponentMap, OutputIterator, VertexIndexMap, DiscoverTimeMap, LowPointMap, const boost::bgl_named_params<P, T, R>&, boost::param_not_found) [with Graph = R_adjacency_list<boost::undirectedS, double>; ComponentMap = boost::dummy_property_map; OutputIterator = std::back_insert_iterator<std::vector<long unsigned int> >; VertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>; DiscoverTimeMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; LowPointMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; P = int; T = boost::buffer_param_t; R = boost::no_property]’
250 | return biconnected_components_impl(g, comp, out, index_map, dtm,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
251 | lowpt,
| ~~~~~~
252 | make_iterator_property_map(pred.begin(), index_map, vert),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
253 | choose_param(get_param(params, graph_visitor),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
254 | make_dfs_visitor(null_visitor())));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/biconnected_components.hpp:295:60: required from ‘static std::pair<long unsigned int, OutputIterator> boost::detail::bicomp_dispatch2<boost::param_not_found>::apply(const Graph&, ComponentMap, OutputIterator, VertexIndexMap, DiscoverTimeMap, const boost::bgl_named_params<P, T, R>&, boost::param_not_found) [with Graph = R_adjacency_list<boost::undirectedS, double>; ComponentMap = boost::dummy_property_map; OutputIterator = std::back_insert_iterator<std::vector<long unsigned int> >; VertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>; DiscoverTimeMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; P = int; T = boost::buffer_param_t; R = boost::no_property]’
295 | return bicomp_dispatch3< dispatch_type >::apply(g, comp, out,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
296 | index_map, dtm,
| ~~~~~~~~~~~~~~~
297 | make_iterator_property_map(lowpt.begin(), index_map, vst),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
298 | params, get_param(params, vertex_predecessor));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/biconnected_components.hpp:336:60: required from ‘static std::pair<long unsigned int, OutputIterator> boost::detail::bicomp_dispatch1<boost::param_not_found>::apply(const Graph&, ComponentMap, OutputIterator, VertexIndexMap, const boost::bgl_named_params<P, T, R>&, boost::param_not_found) [with Graph = R_adjacency_list<boost::undirectedS, double>; ComponentMap = boost::dummy_property_map; OutputIterator = std::back_insert_iterator<std::vector<long unsigned int> >; VertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>; P = int; T = boost::buffer_param_t; R = boost::no_property]’
336 | return bicomp_dispatch2< dispatch_type >::apply(g, comp, out,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
337 | index_map,
| ~~~~~~~~~~
338 | make_iterator_property_map(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~
339 | discover_time.begin(), index_map, vst),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
340 | params, get_param(params, vertex_lowpoint));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/biconnected_components.hpp:368:60: required from ‘std::pair<long unsigned int, OutputIterator> boost::biconnected_components(const Graph&, ComponentMap, OutputIterator, const bgl_named_params<P, T, R>&) [with Graph = R_adjacency_list<undirectedS, double>; ComponentMap = dummy_property_map; OutputIterator = std::back_insert_iterator<std::vector<long unsigned int> >; P = int; T = buffer_param_t; R = no_property]’
368 | return detail::bicomp_dispatch1< dispatch_type >::apply(g, comp, out,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
369 | choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
370 | params, get_param(params, vertex_discover_time));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/biconnected_components.hpp:433:34: required from ‘OutputIterator boost::articulation_points(const Graph&, OutputIterator) [with Graph = R_adjacency_list<undirectedS, double>; OutputIterator = std::back_insert_iterator<std::vector<long unsigned int> >]’
433 | return biconnected_components(g, dummy_property_map(), out,
| ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
434 | bgl_named_params< int, buffer_param_t >(0))
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
interfaces.cpp:300:28: required from here
300 | articulation_points(g, std::back_inserter(art_points));
| ~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::InputIterator<TT>::~InputIterator() [with TT = boost::range_detail::integer_iterator<long unsigned int>]’
37 | ~model()
| ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:512:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
512 | BOOST_CONCEPT_USAGE(InputIterator)
| ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::constraint<Model>::failed() [with Model = boost::DFSVisitorConcept<boost::detail::biconnected_components_visitor<boost::dummy_property_map, boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>, std::back_insert_iterator<std::vector<long unsigned int> >, std::stack<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::deque<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > > >, std::vector<char>, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, boost::dfs_visitor<> >, R_adjacency_list<boost::undirectedS, double> >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:130:9: required from ‘void boost::depth_first_search(const VertexListGraph&, DFSVisitor, ColorMap, typename graph_traits<Graph>::vertex_descriptor) [with VertexListGraph = R_adjacency_list<undirectedS, double>; DFSVisitor = detail::biconnected_components_visitor<dummy_property_map, iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>, iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>, iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>, std::back_insert_iterator<std::vector<long unsigned int> >, std::stack<detail::edge_desc_impl<undirected_tag, long unsigned int>, std::deque<detail::edge_desc_impl<undirected_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<undirected_tag, long unsigned int> > > >, std::vector<char>, vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>, dfs_visitor<> >; ColorMap = shared_array_property_map<default_color_type, vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int> >; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/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::vertex_index_map, const boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int> >, boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<boost::graph::keywords::tag::visitor, const boost::detail::biconnected_components_visitor<boost::dummy_property_map, boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>, std::back_insert_iterator<std::vector<long unsigned int> >, std::stack<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::deque<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > > >, std::vector<char>, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, boost::dfs_visitor<> > >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >, std::integral_constant<bool, true> >; Graph = R_adjacency_list<boost::undirectedS, double>]’
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)]);
| ~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/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 = R_adjacency_list<boost::undirectedS, double>; ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<keywords::tag::vertex_index_map, const boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int> >, boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<keywords::tag::visitor, const boost::detail::biconnected_components_visitor<boost::dummy_property_map, boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>, std::back_insert_iterator<std::vector<long unsigned int> >, std::stack<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::deque<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > > >, std::vector<char>, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, boost::dfs_visitor<> > >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >, std::integral_constant<bool, true> >; typename boost::result_of<detail::depth_first_search_impl<Param0>(Param0, const ArgPack&)>::type = void]’
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); \
| ~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/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 = R_adjacency_list<undirectedS, double>; P = vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>; T = vertex_index_t; R = bgl_named_params<detail::biconnected_components_visitor<dummy_property_map, iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>, iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>, iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>, std::back_insert_iterator<std::vector<long unsigned int> >, std::stack<detail::edge_desc_impl<undirected_tag, long unsigned int>, std::deque<detail::edge_desc_impl<undirected_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<undirected_tag, long unsigned int> > > >, std::vector<char>, vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>, dfs_visitor<> >, graph_visitor_t, 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::vertex_index_map, const vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int> >, parameter::aux::arg_list<parameter::aux::tagged_argument<graph::keywords::tag::visitor, const detail::biconnected_components_visitor<dummy_property_map, iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>, iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>, iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>, std::back_insert_iterator<std::vector<long unsigned int> >, std::stack<detail::edge_desc_impl<undirected_tag, long unsigned int>, std::deque<detail::edge_desc_impl<undirected_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<undirected_tag, long unsigned int> > > >, std::vector<char>, vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>, dfs_visitor<> > >, parameter::aux::empty_arg_list, std::integral_constant<bool, true> >, 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); \
| ~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/biconnected_components.hpp:211:27: required from ‘std::pair<long unsigned int, OutputIterator> boost::detail::biconnected_components_impl(const Graph&, ComponentMap, OutputIterator, VertexIndexMap, DiscoverTimeMap, LowPointMap, PredecessorMap, DFSVisitor) [with Graph = R_adjacency_list<boost::undirectedS, double>; ComponentMap = boost::dummy_property_map; OutputIterator = std::back_insert_iterator<std::vector<long unsigned int> >; VertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>; DiscoverTimeMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; LowPointMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; PredecessorMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; DFSVisitor = boost::dfs_visitor<>]’
211 | depth_first_search(g, visitor(vis).vertex_index_map(index_map));
| ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/biconnected_components.hpp:250:47: required from ‘static std::pair<long unsigned int, OutputIterator> boost::detail::bicomp_dispatch3<boost::param_not_found>::apply(const Graph&, ComponentMap, OutputIterator, VertexIndexMap, DiscoverTimeMap, LowPointMap, const boost::bgl_named_params<P, T, R>&, boost::param_not_found) [with Graph = R_adjacency_list<boost::undirectedS, double>; ComponentMap = boost::dummy_property_map; OutputIterator = std::back_insert_iterator<std::vector<long unsigned int> >; VertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>; DiscoverTimeMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; LowPointMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; P = int; T = boost::buffer_param_t; R = boost::no_property]’
250 | return biconnected_components_impl(g, comp, out, index_map, dtm,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
251 | lowpt,
| ~~~~~~
252 | make_iterator_property_map(pred.begin(), index_map, vert),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
253 | choose_param(get_param(params, graph_visitor),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
254 | make_dfs_visitor(null_visitor())));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/biconnected_components.hpp:295:60: required from ‘static std::pair<long unsigned int, OutputIterator> boost::detail::bicomp_dispatch2<boost::param_not_found>::apply(const Graph&, ComponentMap, OutputIterator, VertexIndexMap, DiscoverTimeMap, const boost::bgl_named_params<P, T, R>&, boost::param_not_found) [with Graph = R_adjacency_list<boost::undirectedS, double>; ComponentMap = boost::dummy_property_map; OutputIterator = std::back_insert_iterator<std::vector<long unsigned int> >; VertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>; DiscoverTimeMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; P = int; T = boost::buffer_param_t; R = boost::no_property]’
295 | return bicomp_dispatch3< dispatch_type >::apply(g, comp, out,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
296 | index_map, dtm,
| ~~~~~~~~~~~~~~~
297 | make_iterator_property_map(lowpt.begin(), index_map, vst),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
298 | params, get_param(params, vertex_predecessor));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/biconnected_components.hpp:336:60: required from ‘static std::pair<long unsigned int, OutputIterator> boost::detail::bicomp_dispatch1<boost::param_not_found>::apply(const Graph&, ComponentMap, OutputIterator, VertexIndexMap, const boost::bgl_named_params<P, T, R>&, boost::param_not_found) [with Graph = R_adjacency_list<boost::undirectedS, double>; ComponentMap = boost::dummy_property_map; OutputIterator = std::back_insert_iterator<std::vector<long unsigned int> >; VertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>; P = int; T = boost::buffer_param_t; R = boost::no_property]’
336 | return bicomp_dispatch2< dispatch_type >::apply(g, comp, out,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
337 | index_map,
| ~~~~~~~~~~
338 | make_iterator_property_map(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~
339 | discover_time.begin(), index_map, vst),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
340 | params, get_param(params, vertex_lowpoint));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/biconnected_components.hpp:368:60: required from ‘std::pair<long unsigned int, OutputIterator> boost::biconnected_components(const Graph&, ComponentMap, OutputIterator, const bgl_named_params<P, T, R>&) [with Graph = R_adjacency_list<undirectedS, double>; ComponentMap = dummy_property_map; OutputIterator = std::back_insert_iterator<std::vector<long unsigned int> >; P = int; T = buffer_param_t; R = no_property]’
368 | return detail::bicomp_dispatch1< dispatch_type >::apply(g, comp, out,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
369 | choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
370 | params, get_param(params, vertex_discover_time));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/biconnected_components.hpp:433:34: required from ‘OutputIterator boost::articulation_points(const Graph&, OutputIterator) [with Graph = R_adjacency_list<undirectedS, double>; OutputIterator = std::back_insert_iterator<std::vector<long unsigned int> >]’
433 | return biconnected_components(g, dummy_property_map(), out,
| ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
434 | bgl_named_params< int, buffer_param_t >(0))
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
interfaces.cpp:300:28: required from here
300 | articulation_points(g, std::back_inserter(art_points));
| ~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:65:52: warning: ‘this’ pointer is null [-Wnonnull]
65 | static void failed() { ((Model*)0)->constraints(); }
| ~~~~~~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/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::biconnected_components_visitor<boost::dummy_property_map, boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>, std::back_insert_iterator<std::vector<long unsigned int> >, std::stack<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::deque<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > > >, std::vector<char>, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, boost::dfs_visitor<> >; Graph = R_adjacency_list<boost::undirectedS, double>]’
39 | void constraints()
| ^~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Assignable<boost::iterators::filter_iterator<boost::detail::out_edge_predicate<boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long unsigned int, long unsigned int&, long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::no_property, boost::listS>, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long unsigned int, long unsigned int&, long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int> > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Assignable<boost::iterators::filter_iterator<boost::detail::out_edge_predicate<boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long unsigned int, long unsigned int&, long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::no_property, boost::listS>, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long unsigned int, long unsigned int&, long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int> > > >]’
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:145:5: required from ‘struct boost::Assignable<boost::iterators::filter_iterator<boost::detail::out_edge_predicate<boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long unsigned int, long unsigned int&, long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::no_property, boost::listS>, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long unsigned int, long unsigned int&, long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int> > >’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator<boost::iterators::filter_iterator<boost::detail::out_edge_predicate<boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long unsigned int, long unsigned int&, long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::no_property, boost::listS>, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long unsigned int, long unsigned int&, long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int> > >’
502 | BOOST_concept(InputIterator,(TT))
| ^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::InputIterator<boost::iterators::filter_iterator<boost::detail::out_edge_predicate<boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long unsigned int, long unsigned int&, long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::no_property, boost::listS>, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long unsigned int, long unsigned int&, long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int> > >]’
32 | inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
| ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied<boost::InputIterator<boost::iterators::filter_iterator<boost::detail::out_edge_predicate<boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long unsigned int, long unsigned int&, long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::no_property, boost::listS>, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long unsigned int, long unsigned int&, long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int> > > >::value’
44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 6 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:129:9: required from ‘void boost::breadth_first_visit(const IncidenceGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with IncidenceGraph = filtered_graph<adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, no_property, listS>, is_residual_edge<adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_residual_capacity_t> >, keep_all>; Buffer = queue<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > >; BFSVisitor = bfs_visitor<edge_predecessor_recorder<detail::edge_desc_impl<directed_tag, long unsigned int>*, on_tree_edge> >; ColorMap = default_color_type*; SourceIterator = long unsigned int*]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:136:24: required from ‘void boost::breadth_first_search(const VertexListGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph<adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, no_property, listS>, is_residual_edge<adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_residual_capacity_t> >, keep_all>; SourceIterator = long unsigned int*; Buffer = queue<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > >; BFSVisitor = bfs_visitor<edge_predecessor_recorder<detail::edge_desc_impl<directed_tag, long unsigned int>*, on_tree_edge> >; ColorMap = default_color_type*]’
136 | breadth_first_visit(g, sources_begin, sources_end, Q, vis, color);
| ~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:147:25: required from ‘void boost::breadth_first_search(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph<adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, no_property, listS>, is_residual_edge<adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_residual_capacity_t> >, keep_all>; Buffer = queue<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > >; BFSVisitor = bfs_visitor<edge_predecessor_recorder<detail::edge_desc_impl<directed_tag, long unsigned int>*, on_tree_edge> >; ColorMap = default_color_type*; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
147 | breadth_first_search(g, sources, sources + 1, Q, vis, color);
| ~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/edmonds_karp_max_flow.hpp:101:29: required from ‘typename boost::property_traits<IndexMap>::value_type boost::edmonds_karp_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, ColorMap, PredEdgeMap) [with Graph = adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, no_property, listS>; CapacityEdgeMap = adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map<directed_tag, detail::edge_desc_impl<directed_tag, long unsigned int>, detail::edge_desc_impl<directed_tag, long unsigned int>&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_reverse_t>; ColorMap = default_color_type*; PredEdgeMap = detail::edge_desc_impl<directed_tag, long unsigned int>*; typename property_traits<IndexMap>::value_type = long unsigned int; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
101 | breadth_first_search(detail::residual_graph(g, res), src, Q,
| ~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
102 | make_bfs_visitor(record_edge_predecessors(pred, on_tree_edge())),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
103 | color);
| ~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/edge_connectivity.hpp:146:42: required from ‘typename boost::graph_traits<G>::degree_size_type boost::edge_connectivity(VertexListGraph&, OutputIterator) [with VertexListGraph = R_adjacency_list<undirectedS, double>; OutputIterator = std::back_insert_iterator<std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int> > >; typename graph_traits<G>::degree_size_type = long unsigned int]’
146 | alpha_S_k = edmonds_karp_max_flow(
| ~~~~~~~~~~~~~~~~~~~~~^
147 | flow_g, p, k, cap, res_cap, rev_edge, &color[0], &pred[0]);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
interfaces.cpp:326:34: required from here
326 | dst c = edge_connectivity( g, std::back_inserter(disconnecting_set) );
| ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
20 | ~usage_requirements() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Assignable<TT>::~Assignable() [with TT = boost::iterators::filter_iterator<boost::detail::out_edge_predicate<boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long unsigned int, long unsigned int&, long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::no_property, boost::listS>, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long unsigned int, long unsigned int&, long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int> >]’
37 | ~model()
| ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:145:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
145 | BOOST_CONCEPT_USAGE(Assignable) {
| ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::EqualityComparable<boost::iterators::filter_iterator<boost::detail::out_edge_predicate<boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long unsigned int, long unsigned int&, long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::no_property, boost::listS>, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long unsigned int, long unsigned int&, long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int> > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::EqualityComparable<boost::iterators::filter_iterator<boost::detail::out_edge_predicate<boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long unsigned int, long unsigned int&, long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::no_property, boost::listS>, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long unsigned int, long unsigned int&, long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int> > > >]’
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable<boost::iterators::filter_iterator<boost::detail::out_edge_predicate<boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long unsigned int, long unsigned int&, long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::no_property, boost::listS>, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long unsigned int, long unsigned int&, long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int> > >’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator<boost::iterators::filter_iterator<boost::detail::out_edge_predicate<boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long unsigned int, long unsigned int&, long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::no_property, boost::listS>, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long unsigned int, long unsigned int&, long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int> > >’
502 | BOOST_concept(InputIterator,(TT))
| ^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::InputIterator<boost::iterators::filter_iterator<boost::detail::out_edge_predicate<boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long unsigned int, long unsigned int&, long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::no_property, boost::listS>, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long unsigned int, long unsigned int&, long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int> > >]’
32 | inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
| ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied<boost::InputIterator<boost::iterators::filter_iterator<boost::detail::out_edge_predicate<boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long unsigned int, long unsigned int&, long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::no_property, boost::listS>, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long unsigned int, long unsigned int&, long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int> > > >::value’
44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 6 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:129:9: required from ‘void boost::breadth_first_visit(const IncidenceGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with IncidenceGraph = filtered_graph<adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, no_property, listS>, is_residual_edge<adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_residual_capacity_t> >, keep_all>; Buffer = queue<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > >; BFSVisitor = bfs_visitor<edge_predecessor_recorder<detail::edge_desc_impl<directed_tag, long unsigned int>*, on_tree_edge> >; ColorMap = default_color_type*; SourceIterator = long unsigned int*]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:136:24: required from ‘void boost::breadth_first_search(const VertexListGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph<adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, no_property, listS>, is_residual_edge<adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_residual_capacity_t> >, keep_all>; SourceIterator = long unsigned int*; Buffer = queue<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > >; BFSVisitor = bfs_visitor<edge_predecessor_recorder<detail::edge_desc_impl<directed_tag, long unsigned int>*, on_tree_edge> >; ColorMap = default_color_type*]’
136 | breadth_first_visit(g, sources_begin, sources_end, Q, vis, color);
| ~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:147:25: required from ‘void boost::breadth_first_search(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph<adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, no_property, listS>, is_residual_edge<adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_residual_capacity_t> >, keep_all>; Buffer = queue<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > >; BFSVisitor = bfs_visitor<edge_predecessor_recorder<detail::edge_desc_impl<directed_tag, long unsigned int>*, on_tree_edge> >; ColorMap = default_color_type*; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
147 | breadth_first_search(g, sources, sources + 1, Q, vis, color);
| ~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/edmonds_karp_max_flow.hpp:101:29: required from ‘typename boost::property_traits<IndexMap>::value_type boost::edmonds_karp_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, ColorMap, PredEdgeMap) [with Graph = adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, no_property, listS>; CapacityEdgeMap = adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map<directed_tag, detail::edge_desc_impl<directed_tag, long unsigned int>, detail::edge_desc_impl<directed_tag, long unsigned int>&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_reverse_t>; ColorMap = default_color_type*; PredEdgeMap = detail::edge_desc_impl<directed_tag, long unsigned int>*; typename property_traits<IndexMap>::value_type = long unsigned int; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
101 | breadth_first_search(detail::residual_graph(g, res), src, Q,
| ~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
102 | make_bfs_visitor(record_edge_predecessors(pred, on_tree_edge())),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
103 | color);
| ~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/edge_connectivity.hpp:146:42: required from ‘typename boost::graph_traits<G>::degree_size_type boost::edge_connectivity(VertexListGraph&, OutputIterator) [with VertexListGraph = R_adjacency_list<undirectedS, double>; OutputIterator = std::back_insert_iterator<std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int> > >; typename graph_traits<G>::degree_size_type = long unsigned int]’
146 | alpha_S_k = edmonds_karp_max_flow(
| ~~~~~~~~~~~~~~~~~~~~~^
147 | flow_g, p, k, cap, res_cap, rev_edge, &color[0], &pred[0]);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
interfaces.cpp:326:34: required from here
326 | dst c = edge_connectivity( g, std::back_inserter(disconnecting_set) );
| ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
20 | ~usage_requirements() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::EqualityComparable<TT>::~EqualityComparable() [with TT = boost::iterators::filter_iterator<boost::detail::out_edge_predicate<boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long unsigned int, long unsigned int&, long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::no_property, boost::listS>, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long unsigned int, long unsigned int&, long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int> >]’
37 | ~model()
| ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:233:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
233 | BOOST_CONCEPT_USAGE(EqualityComparable) {
| ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::InputIterator<boost::iterators::filter_iterator<boost::detail::out_edge_predicate<boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long unsigned int, long unsigned int&, long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::no_property, boost::listS>, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long unsigned int, long unsigned int&, long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int> > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::InputIterator<boost::iterators::filter_iterator<boost::detail::out_edge_predicate<boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long unsigned int, long unsigned int&, long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::no_property, boost::listS>, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long unsigned int, long unsigned int&, long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int> > > >]’
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:512:7: required from ‘struct boost::InputIterator<boost::iterators::filter_iterator<boost::detail::out_edge_predicate<boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long unsigned int, long unsigned int&, long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::no_property, boost::listS>, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long unsigned int, long unsigned int&, long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int> > >’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::InputIterator<boost::iterators::filter_iterator<boost::detail::out_edge_predicate<boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long unsigned int, long unsigned int&, long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::no_property, boost::listS>, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long unsigned int, long unsigned int&, long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int> > >]’
32 | inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
| ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied<boost::InputIterator<boost::iterators::filter_iterator<boost::detail::out_edge_predicate<boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long unsigned int, long unsigned int&, long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::no_property, boost::listS>, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long unsigned int, long unsigned int&, long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int> > > >::value’
44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied<boost::InputIterator<boost::iterators::filter_iterator<boost::detail::out_edge_predicate<boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long unsigned int, long unsigned int&, long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::no_property, boost::listS>, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long unsigned int, long unsigned int&, long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int> > > >’
45 | typedef boost::integral_constant<bool, value> type;
| ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:129:9: required from ‘void boost::breadth_first_visit(const IncidenceGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with IncidenceGraph = filtered_graph<adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, no_property, listS>, is_residual_edge<adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_residual_capacity_t> >, keep_all>; Buffer = queue<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > >; BFSVisitor = bfs_visitor<edge_predecessor_recorder<detail::edge_desc_impl<directed_tag, long unsigned int>*, on_tree_edge> >; ColorMap = default_color_type*; SourceIterator = long unsigned int*]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:136:24: required from ‘void boost::breadth_first_search(const VertexListGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph<adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, no_property, listS>, is_residual_edge<adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_residual_capacity_t> >, keep_all>; SourceIterator = long unsigned int*; Buffer = queue<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > >; BFSVisitor = bfs_visitor<edge_predecessor_recorder<detail::edge_desc_impl<directed_tag, long unsigned int>*, on_tree_edge> >; ColorMap = default_color_type*]’
136 | breadth_first_visit(g, sources_begin, sources_end, Q, vis, color);
| ~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:147:25: required from ‘void boost::breadth_first_search(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph<adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, no_property, listS>, is_residual_edge<adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_residual_capacity_t> >, keep_all>; Buffer = queue<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > >; BFSVisitor = bfs_visitor<edge_predecessor_recorder<detail::edge_desc_impl<directed_tag, long unsigned int>*, on_tree_edge> >; ColorMap = default_color_type*; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
147 | breadth_first_search(g, sources, sources + 1, Q, vis, color);
| ~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/edmonds_karp_max_flow.hpp:101:29: required from ‘typename boost::property_traits<IndexMap>::value_type boost::edmonds_karp_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, ColorMap, PredEdgeMap) [with Graph = adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, no_property, listS>; CapacityEdgeMap = adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map<directed_tag, detail::edge_desc_impl<directed_tag, long unsigned int>, detail::edge_desc_impl<directed_tag, long unsigned int>&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_reverse_t>; ColorMap = default_color_type*; PredEdgeMap = detail::edge_desc_impl<directed_tag, long unsigned int>*; typename property_traits<IndexMap>::value_type = long unsigned int; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
101 | breadth_first_search(detail::residual_graph(g, res), src, Q,
| ~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
102 | make_bfs_visitor(record_edge_predecessors(pred, on_tree_edge())),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
103 | color);
| ~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/edge_connectivity.hpp:146:42: required from ‘typename boost::graph_traits<G>::degree_size_type boost::edge_connectivity(VertexListGraph&, OutputIterator) [with VertexListGraph = R_adjacency_list<undirectedS, double>; OutputIterator = std::back_insert_iterator<std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int> > >; typename graph_traits<G>::degree_size_type = long unsigned int]’
146 | alpha_S_k = edmonds_karp_max_flow(
| ~~~~~~~~~~~~~~~~~~~~~^
147 | flow_g, p, k, cap, res_cap, rev_edge, &color[0], &pred[0]);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
interfaces.cpp:326:34: required from here
326 | dst c = edge_connectivity( g, std::back_inserter(disconnecting_set) );
| ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
20 | ~usage_requirements() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::InputIterator<TT>::~InputIterator() [with TT = boost::iterators::filter_iterator<boost::detail::out_edge_predicate<boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long unsigned int, long unsigned int&, long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::no_property, boost::listS>, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long unsigned int, long unsigned int&, long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int> >]’
37 | ~model()
| ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:512:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
512 | BOOST_CONCEPT_USAGE(InputIterator)
| ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Convertible<boost::iterators::detail::iterator_category_with_traversal<std::input_iterator_tag, boost::iterators::random_access_traversal_tag>, std::input_iterator_tag> >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/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> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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);
| ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/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) );
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/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;
| ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/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)>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:515:9: [ skipping 6 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:129:9: required from ‘void boost::detail::depth_first_visit_impl(const IncidenceGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, DFSVisitor&, ColorMap, TerminatorFunc) [with IncidenceGraph = R_adjacency_list<boost::directedS, double>; DFSVisitor = dfs_time_visitor<long unsigned int*>; ColorMap = boost::shared_array_property_map<boost::default_color_type, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int> >; TerminatorFunc = nontruth2; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:286:39: required from ‘void boost::depth_first_search(const VertexListGraph&, DFSVisitor, ColorMap, typename graph_traits<Graph>::vertex_descriptor) [with VertexListGraph = R_adjacency_list<directedS, double>; DFSVisitor = dfs_time_visitor<long unsigned int*>; ColorMap = shared_array_property_map<default_color_type, vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int> >; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
286 | detail::depth_first_visit_impl(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
287 | g, start_vertex, vis, color, detail::nontruth2());
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/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 dfs_time_visitor<long unsigned int*> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; Graph = R_adjacency_list<boost::directedS, double>]’
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)]);
| ~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/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 = R_adjacency_list<boost::directedS, double>; ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<keywords::tag::visitor, const dfs_time_visitor<long unsigned 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); \
| ~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/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 = R_adjacency_list<directedS, double>; P = dfs_time_visitor<long unsigned 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 dfs_time_visitor<long unsigned 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); \
| ~~~~~~~~~
interfaces.cpp:158:27: required from here
158 | depth_first_search(g, visitor(vis));
| ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Convertible<boost::iterators::detail::iterator_category_with_traversal<std::input_iterator_tag, boost::iterators::random_access_traversal_tag>, std::input_iterator_tag>]’
20 | ~usage_requirements() { ((Model*)0)->~Model(); }
| ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::Convertible<boost::iterators::detail::iterator_category_with_traversal<std::input_iterator_tag, boost::iterators::random_access_traversal_tag>, std::input_iterator_tag>]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/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<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int>]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/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<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int> >]’
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:53:35: required from ‘boost::concepts::MultiPassInputIterator<T>::~MultiPassInputIterator() [with T = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int>]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::MultiPassInputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int> >]’
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:89:9: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:129:9: required from ‘void boost::detail::depth_first_visit_impl(const IncidenceGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, DFSVisitor&, ColorMap, TerminatorFunc) [with IncidenceGraph = R_adjacency_list<boost::directedS, double>; DFSVisitor = dfs_time_visitor<long unsigned int*>; ColorMap = boost::shared_array_property_map<boost::default_color_type, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int> >; TerminatorFunc = nontruth2; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:286:39: required from ‘void boost::depth_first_search(const VertexListGraph&, DFSVisitor, ColorMap, typename graph_traits<Graph>::vertex_descriptor) [with VertexListGraph = R_adjacency_list<directedS, double>; DFSVisitor = dfs_time_visitor<long unsigned int*>; ColorMap = shared_array_property_map<default_color_type, vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int> >; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
286 | detail::depth_first_visit_impl(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
287 | g, start_vertex, vis, color, detail::nontruth2());
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/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 dfs_time_visitor<long unsigned int*> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; Graph = R_adjacency_list<boost::directedS, double>]’
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)]);
| ~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/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 = R_adjacency_list<boost::directedS, double>; ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<keywords::tag::visitor, const dfs_time_visitor<long unsigned 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); \
| ~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/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 = R_adjacency_list<directedS, double>; P = dfs_time_visitor<long unsigned 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 dfs_time_visitor<long unsigned 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); \
| ~~~~~~~~~
interfaces.cpp:158:27: required from here
158 | depth_first_search(g, visitor(vis));
| ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible<X, Y>::~Convertible() [with X = boost::iterators::detail::iterator_category_with_traversal<std::input_iterator_tag, boost::iterators::random_access_traversal_tag>; Y = std::input_iterator_tag]’
37 | ~model()
| ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
208 | BOOST_CONCEPT_USAGE(Convertible) {
| ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Assignable<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > >, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > >, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > >, boost::property<boost::edge_weight_t, double, boost::no_property> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Assignable<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > >, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > >, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > >, boost::property<boost::edge_weight_t, double, 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(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:145:5: required from ‘struct boost::Assignable<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > >, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > >, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > >, boost::property<boost::edge_weight_t, double, 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> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > >, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > >, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > >, boost::property<boost::edge_weight_t, double, boost::no_property> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> >’
502 | BOOST_concept(InputIterator,(TT))
| ^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::InputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > >, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > >, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > >, boost::property<boost::edge_weight_t, double, 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);
| ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied<boost::InputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > >, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > >, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > >, boost::property<boost::edge_weight_t, double, 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) );
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 7 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:286:39: required from ‘void boost::depth_first_search(const VertexListGraph&, DFSVisitor, ColorMap, typename graph_traits<Graph>::vertex_descriptor) [with VertexListGraph = R_adjacency_list<undirectedS, double>; DFSVisitor = detail::components_recorder<int*>; ColorMap = shared_array_property_map<default_color_type, vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int> >; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
286 | detail::depth_first_visit_impl(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
287 | g, start_vertex, vis, color, detail::nontruth2());
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:397:42: required from ‘void boost::graph::detail::depth_first_search_impl<Graph>::operator()(const Graph&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<boost::graph::keywords::tag::visitor, const boost::detail::components_recorder<int*> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; Graph = R_adjacency_list<boost::undirectedS, double>]’
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)]);
| ~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/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 = R_adjacency_list<boost::undirectedS, double>; ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<keywords::tag::visitor, const boost::detail::components_recorder<int*> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; typename boost::result_of<detail::depth_first_search_impl<Param0>(Param0, const ArgPack&)>::type = void]’
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); \
| ~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/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 = R_adjacency_list<undirectedS, double>; P = detail::components_recorder<int*>; T = graph_visitor_t; R = no_property; typename result_of<graph::detail::depth_first_search_impl<Param0>(Param0, const typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<T, Tag, Base> >::type&)>::type = void; typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<T, Tag, Base> >::type = parameter::aux::arg_list<parameter::aux::tagged_argument<graph::keywords::tag::visitor, const detail::components_recorder<int*> >, parameter::aux::empty_arg_list, std::integral_constant<bool, true> >]’
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); \
| ~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/connected_components.hpp:106:23: required from ‘typename boost::property_traits<IndexMap>::value_type boost::connected_components(const Graph&, ComponentMap, typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = R_adjacency_list<undirectedS, double>; ComponentMap = int*; typename property_traits<IndexMap>::value_type = int; typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits<Graph>::traversal_category = undir_adj_list_traversal_tag]’
106 | depth_first_search(g, visitor(vis));
| ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~
interfaces.cpp:205:29: required from here
205 | connected_components(g, &component[0]);
| ~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
20 | ~usage_requirements() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Assignable<TT>::~Assignable() [with TT = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > >, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > >, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > >, boost::property<boost::edge_weight_t, double, boost::no_property> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int>]’
37 | ~model()
| ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:145:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
145 | BOOST_CONCEPT_USAGE(Assignable) {
| ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::EqualityComparable<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > >, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > >, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > >, boost::property<boost::edge_weight_t, double, boost::no_property> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::EqualityComparable<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > >, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > >, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > >, boost::property<boost::edge_weight_t, double, 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(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > >, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > >, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > >, boost::property<boost::edge_weight_t, double, 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> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > >, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > >, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > >, boost::property<boost::edge_weight_t, double, boost::no_property> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> >’
502 | BOOST_concept(InputIterator,(TT))
| ^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::InputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > >, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > >, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > >, boost::property<boost::edge_weight_t, double, 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);
| ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied<boost::InputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > >, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > >, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > >, boost::property<boost::edge_weight_t, double, 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) );
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 7 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:286:39: required from ‘void boost::depth_first_search(const VertexListGraph&, DFSVisitor, ColorMap, typename graph_traits<Graph>::vertex_descriptor) [with VertexListGraph = R_adjacency_list<undirectedS, double>; DFSVisitor = detail::components_recorder<int*>; ColorMap = shared_array_property_map<default_color_type, vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int> >; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
286 | detail::depth_first_visit_impl(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
287 | g, start_vertex, vis, color, detail::nontruth2());
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:397:42: required from ‘void boost::graph::detail::depth_first_search_impl<Graph>::operator()(const Graph&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<boost::graph::keywords::tag::visitor, const boost::detail::components_recorder<int*> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; Graph = R_adjacency_list<boost::undirectedS, double>]’
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)]);
| ~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/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 = R_adjacency_list<boost::undirectedS, double>; ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<keywords::tag::visitor, const boost::detail::components_recorder<int*> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; typename boost::result_of<detail::depth_first_search_impl<Param0>(Param0, const ArgPack&)>::type = void]’
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); \
| ~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/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 = R_adjacency_list<undirectedS, double>; P = detail::components_recorder<int*>; T = graph_visitor_t; R = no_property; typename result_of<graph::detail::depth_first_search_impl<Param0>(Param0, const typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<T, Tag, Base> >::type&)>::type = void; typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<T, Tag, Base> >::type = parameter::aux::arg_list<parameter::aux::tagged_argument<graph::keywords::tag::visitor, const detail::components_recorder<int*> >, parameter::aux::empty_arg_list, std::integral_constant<bool, true> >]’
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); \
| ~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/connected_components.hpp:106:23: required from ‘typename boost::property_traits<IndexMap>::value_type boost::connected_components(const Graph&, ComponentMap, typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = R_adjacency_list<undirectedS, double>; ComponentMap = int*; typename property_traits<IndexMap>::value_type = int; typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits<Graph>::traversal_category = undir_adj_list_traversal_tag]’
106 | depth_first_search(g, visitor(vis));
| ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~
interfaces.cpp:205:29: required from here
205 | connected_components(g, &component[0]);
| ~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
20 | ~usage_requirements() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::EqualityComparable<TT>::~EqualityComparable() [with TT = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > >, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > >, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > >, boost::property<boost::edge_weight_t, double, boost::no_property> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int>]’
37 | ~model()
| ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:233:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
233 | BOOST_CONCEPT_USAGE(EqualityComparable) {
| ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::InputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > >, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > >, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > >, boost::property<boost::edge_weight_t, double, boost::no_property> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::InputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > >, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > >, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > >, boost::property<boost::edge_weight_t, double, 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(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:512:7: required from ‘struct boost::InputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > >, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > >, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > >, boost::property<boost::edge_weight_t, double, 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> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::InputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > >, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > >, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > >, boost::property<boost::edge_weight_t, double, 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);
| ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied<boost::InputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > >, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > >, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > >, boost::property<boost::edge_weight_t, double, 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) );
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied<boost::InputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > >, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > >, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > >, boost::property<boost::edge_weight_t, double, 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;
| ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 6 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:286:39: required from ‘void boost::depth_first_search(const VertexListGraph&, DFSVisitor, ColorMap, typename graph_traits<Graph>::vertex_descriptor) [with VertexListGraph = R_adjacency_list<undirectedS, double>; DFSVisitor = detail::components_recorder<int*>; ColorMap = shared_array_property_map<default_color_type, vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int> >; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
286 | detail::depth_first_visit_impl(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
287 | g, start_vertex, vis, color, detail::nontruth2());
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:397:42: required from ‘void boost::graph::detail::depth_first_search_impl<Graph>::operator()(const Graph&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<boost::graph::keywords::tag::visitor, const boost::detail::components_recorder<int*> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; Graph = R_adjacency_list<boost::undirectedS, double>]’
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)]);
| ~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/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 = R_adjacency_list<boost::undirectedS, double>; ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<keywords::tag::visitor, const boost::detail::components_recorder<int*> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; typename boost::result_of<detail::depth_first_search_impl<Param0>(Param0, const ArgPack&)>::type = void]’
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); \
| ~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/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 = R_adjacency_list<undirectedS, double>; P = detail::components_recorder<int*>; T = graph_visitor_t; R = no_property; typename result_of<graph::detail::depth_first_search_impl<Param0>(Param0, const typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<T, Tag, Base> >::type&)>::type = void; typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<T, Tag, Base> >::type = parameter::aux::arg_list<parameter::aux::tagged_argument<graph::keywords::tag::visitor, const detail::components_recorder<int*> >, parameter::aux::empty_arg_list, std::integral_constant<bool, true> >]’
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); \
| ~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/connected_components.hpp:106:23: required from ‘typename boost::property_traits<IndexMap>::value_type boost::connected_components(const Graph&, ComponentMap, typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = R_adjacency_list<undirectedS, double>; ComponentMap = int*; typename property_traits<IndexMap>::value_type = int; typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits<Graph>::traversal_category = undir_adj_list_traversal_tag]’
106 | depth_first_search(g, visitor(vis));
| ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~
interfaces.cpp:205:29: required from here
205 | connected_components(g, &component[0]);
| ~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
20 | ~usage_requirements() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::InputIterator<TT>::~InputIterator() [with TT = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > >, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > >, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > >, boost::property<boost::edge_weight_t, double, boost::no_property> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int>]’
37 | ~model()
| ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:512:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
512 | BOOST_CONCEPT_USAGE(InputIterator)
| ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::constraint<Model>::failed() [with Model = boost::DFSVisitorConcept<boost::detail::tarjan_scc_visitor<int*, boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>, std::stack<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > > >, R_adjacency_list<boost::directedS, double> >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:130:9: required from ‘void boost::depth_first_search(const VertexListGraph&, DFSVisitor, ColorMap, typename graph_traits<Graph>::vertex_descriptor) [with VertexListGraph = R_adjacency_list<directedS, double>; DFSVisitor = detail::tarjan_scc_visitor<int*, iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>, iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>, std::stack<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > > >; ColorMap = shared_array_property_map<default_color_type, vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int> >; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/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::tarjan_scc_visitor<int*, boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>, std::stack<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > > > >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; Graph = R_adjacency_list<boost::directedS, double>]’
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)]);
| ~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/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 = R_adjacency_list<boost::directedS, double>; ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<keywords::tag::visitor, const boost::detail::tarjan_scc_visitor<int*, boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>, std::stack<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned 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); \
| ~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/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 = R_adjacency_list<directedS, double>; P = detail::tarjan_scc_visitor<int*, iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>, iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>, std::stack<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > > >; T = graph_visitor_t; R = bgl_named_params<int, int>; 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::tarjan_scc_visitor<int*, iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>, iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>, std::stack<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned 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); \
| ~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/strong_components.hpp:129:27: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/strong_components.hpp:177:63: required from ‘typename boost::property_traits<IndexMap>::value_type boost::detail::scc_helper2(const Graph&, ComponentMap, RootMap, const boost::bgl_named_params<P, T, R>&, DiscoverTimeMap) [with Graph = R_adjacency_list<boost::directedS, double>; ComponentMap = int*; RootMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; P = int; T = int; R = boost::no_property; DiscoverTimeMap = boost::param_not_found; typename boost::property_traits<IndexMap>::value_type = int]’
177 | return strong_comp_dispatch2< DiscoverTimeMap >::apply(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
178 | g, comp, r_map, params, time_map);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/strong_components.hpp:205:31: required from ‘static typename boost::property_traits<IndexMap>::value_type boost::detail::strong_comp_dispatch1<boost::param_not_found>::apply(const Graph&, ComponentMap, const boost::bgl_named_params<P, T, R>&, boost::param_not_found) [with Graph = R_adjacency_list<boost::directedS, double>; ComponentMap = int*; P = int; T = int; R = boost::no_property; typename boost::property_traits<IndexMap>::value_type = int]’
205 | return scc_helper2(g, comp,
| ~~~~~~~~~~~^~~~~~~~~
206 | make_iterator_property_map(root_vec.begin(),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
207 | choose_const_pmap(
| ~~~~~~~~~~~~~~~~~~
208 | get_param(params, vertex_index), g, vertex_index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
209 | root_vec[0]),
| ~~~~~~~~~~~~~
210 | params, get_param(params, vertex_discover_time));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/strong_components.hpp:220:63: required from ‘typename boost::property_traits<IndexMap>::value_type boost::detail::scc_helper1(const Graph&, ComponentMap, const boost::bgl_named_params<P, T, R>&, RootMap) [with Graph = R_adjacency_list<boost::directedS, double>; ComponentMap = int*; RootMap = boost::param_not_found; P = int; T = int; R = boost::no_property; typename boost::property_traits<IndexMap>::value_type = int]’
220 | return detail::strong_comp_dispatch1< RootMap >::apply(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
221 | g, comp, params, r_map);
| ~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/strong_components.hpp:235:31: required from ‘typename boost::property_traits<IndexMap>::value_type boost::strong_components(const Graph&, ComponentMap, const bgl_named_params<P, T, R>&, typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = R_adjacency_list<directedS, double>; ComponentMap = int*; P = int; T = int; R = no_property; typename property_traits<IndexMap>::value_type = int; typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits<Graph>::traversal_category = adj_list_dir_traversal_tag]’
235 | return detail::scc_helper1(
| ~~~~~~~~~~~~~~~~~~~^
236 | g, comp, params, get_param(params, vertex_root_t()));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/strong_components.hpp:249:29: required from ‘typename boost::property_traits<IndexMap>::value_type boost::strong_components(const Graph&, ComponentMap, typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = R_adjacency_list<directedS, double>; ComponentMap = int*; typename property_traits<IndexMap>::value_type = int; typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits<Graph>::traversal_category = adj_list_dir_traversal_tag]’
249 | return strong_components(g, comp, params);
| ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~
interfaces.cpp:232:26: required from here
232 | strong_components(g, &component[0]);
| ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:65:52: warning: ‘this’ pointer is null [-Wnonnull]
65 | static void failed() { ((Model*)0)->constraints(); }
| ~~~~~~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/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::tarjan_scc_visitor<int*, boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>, std::stack<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > > >; Graph = R_adjacency_list<boost::directedS, double>]’
39 | void constraints()
| ^~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::constraint<Model>::failed() [with Model = boost::DFSVisitorConcept<boost::detail::biconnected_components_visitor<boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>, boost::graph_detail::dummy_output_iterator, std::stack<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::deque<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > > >, std::vector<char>, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, boost::dfs_visitor<> >, R_adjacency_list<boost::undirectedS, double> >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:130:9: required from ‘void boost::depth_first_search(const VertexListGraph&, DFSVisitor, ColorMap, typename graph_traits<Graph>::vertex_descriptor) [with VertexListGraph = R_adjacency_list<undirectedS, double>; DFSVisitor = detail::biconnected_components_visitor<adj_list_edge_property_map<undirected_tag, double, double&, long unsigned int, property<edge_weight_t, double, no_property>, edge_weight_t>, iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>, iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>, iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>, graph_detail::dummy_output_iterator, std::stack<detail::edge_desc_impl<undirected_tag, long unsigned int>, std::deque<detail::edge_desc_impl<undirected_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<undirected_tag, long unsigned int> > > >, std::vector<char>, vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>, dfs_visitor<> >; ColorMap = shared_array_property_map<default_color_type, vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int> >; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/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::vertex_index_map, const boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int> >, boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<boost::graph::keywords::tag::visitor, const boost::detail::biconnected_components_visitor<boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>, boost::graph_detail::dummy_output_iterator, std::stack<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::deque<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > > >, std::vector<char>, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, boost::dfs_visitor<> > >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >, std::integral_constant<bool, true> >; Graph = R_adjacency_list<boost::undirectedS, double>]’
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)]);
| ~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/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 = R_adjacency_list<boost::undirectedS, double>; ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<keywords::tag::vertex_index_map, const boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int> >, boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<keywords::tag::visitor, const boost::detail::biconnected_components_visitor<boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>, boost::graph_detail::dummy_output_iterator, std::stack<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::deque<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > > >, std::vector<char>, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, boost::dfs_visitor<> > >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >, std::integral_constant<bool, true> >; typename boost::result_of<detail::depth_first_search_impl<Param0>(Param0, const ArgPack&)>::type = void]’
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); \
| ~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/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 = R_adjacency_list<undirectedS, double>; P = vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>; T = vertex_index_t; R = bgl_named_params<detail::biconnected_components_visitor<adj_list_edge_property_map<undirected_tag, double, double&, long unsigned int, property<edge_weight_t, double, no_property>, edge_weight_t>, iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>, iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>, iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>, graph_detail::dummy_output_iterator, std::stack<detail::edge_desc_impl<undirected_tag, long unsigned int>, std::deque<detail::edge_desc_impl<undirected_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<undirected_tag, long unsigned int> > > >, std::vector<char>, vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>, dfs_visitor<> >, graph_visitor_t, 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::vertex_index_map, const vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int> >, parameter::aux::arg_list<parameter::aux::tagged_argument<graph::keywords::tag::visitor, const detail::biconnected_components_visitor<adj_list_edge_property_map<undirected_tag, double, double&, long unsigned int, property<edge_weight_t, double, no_property>, edge_weight_t>, iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>, iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>, iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>, graph_detail::dummy_output_iterator, std::stack<detail::edge_desc_impl<undirected_tag, long unsigned int>, std::deque<detail::edge_desc_impl<undirected_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<undirected_tag, long unsigned int> > > >, std::vector<char>, vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>, dfs_visitor<> > >, parameter::aux::empty_arg_list, std::integral_constant<bool, true> >, 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); \
| ~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/biconnected_components.hpp:211:27: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/biconnected_components.hpp:295:60: required from ‘static std::pair<long unsigned int, OutputIterator> boost::detail::bicomp_dispatch2<boost::param_not_found>::apply(const Graph&, ComponentMap, OutputIterator, VertexIndexMap, DiscoverTimeMap, const boost::bgl_named_params<P, T, R>&, boost::param_not_found) [with Graph = R_adjacency_list<boost::undirectedS, double>; ComponentMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>; OutputIterator = boost::graph_detail::dummy_output_iterator; VertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>; DiscoverTimeMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; P = int; T = boost::buffer_param_t; R = boost::no_property]’
295 | return bicomp_dispatch3< dispatch_type >::apply(g, comp, out,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
296 | index_map, dtm,
| ~~~~~~~~~~~~~~~
297 | make_iterator_property_map(lowpt.begin(), index_map, vst),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
298 | params, get_param(params, vertex_predecessor));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/biconnected_components.hpp:336:60: required from ‘static std::pair<long unsigned int, OutputIterator> boost::detail::bicomp_dispatch1<boost::param_not_found>::apply(const Graph&, ComponentMap, OutputIterator, VertexIndexMap, const boost::bgl_named_params<P, T, R>&, boost::param_not_found) [with Graph = R_adjacency_list<boost::undirectedS, double>; ComponentMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>; OutputIterator = boost::graph_detail::dummy_output_iterator; VertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>; P = int; T = boost::buffer_param_t; R = boost::no_property]’
336 | return bicomp_dispatch2< dispatch_type >::apply(g, comp, out,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
337 | index_map,
| ~~~~~~~~~~
338 | make_iterator_property_map(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~
339 | discover_time.begin(), index_map, vst),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
340 | params, get_param(params, vertex_lowpoint));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/biconnected_components.hpp:368:60: required from ‘std::pair<long unsigned int, OutputIterator> boost::biconnected_components(const Graph&, ComponentMap, OutputIterator, const bgl_named_params<P, T, R>&) [with Graph = R_adjacency_list<undirectedS, double>; ComponentMap = adj_list_edge_property_map<undirected_tag, double, double&, long unsigned int, property<edge_weight_t, double, no_property>, edge_weight_t>; OutputIterator = graph_detail::dummy_output_iterator; P = int; T = buffer_param_t; R = no_property]’
368 | return detail::bicomp_dispatch1< dispatch_type >::apply(g, comp, out,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
369 | choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
370 | params, get_param(params, vertex_discover_time));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/biconnected_components.hpp:377:34: required from ‘std::pair<long unsigned int, OutputIterator> boost::biconnected_components(const Graph&, ComponentMap, OutputIterator) [with Graph = R_adjacency_list<undirectedS, double>; ComponentMap = adj_list_edge_property_map<undirected_tag, double, double&, long unsigned int, property<edge_weight_t, double, no_property>, edge_weight_t>; OutputIterator = graph_detail::dummy_output_iterator]’
377 | return biconnected_components(
| ~~~~~~~~~~~~~~~~~~~~~~^
378 | g, comp, out, bgl_named_params< int, buffer_param_t >(0));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/biconnected_components.hpp:417:34: required from ‘std::size_t boost::biconnected_components(const Graph&, ComponentMap) [with Graph = R_adjacency_list<undirectedS, double>; ComponentMap = adj_list_edge_property_map<undirected_tag, double, double&, long unsigned int, property<edge_weight_t, double, no_property>, edge_weight_t>; std::size_t = long unsigned int]’
417 | return biconnected_components(
| ~~~~~~~~~~~~~~~~~~~~~~^
418 | g, comp, graph_detail::dummy_output_iterator())
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
interfaces.cpp:264:47: required from here
264 | int num_comps = biconnected_components(g, component);
| ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:65:52: warning: ‘this’ pointer is null [-Wnonnull]
65 | static void failed() { ((Model*)0)->constraints(); }
| ~~~~~~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/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::biconnected_components_visitor<boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>, boost::graph_detail::dummy_output_iterator, std::stack<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::deque<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > > >, std::vector<char>, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, boost::dfs_visitor<> >; Graph = R_adjacency_list<boost::undirectedS, double>]’
39 | void constraints()
| ^~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Assignable<boost::range_detail::integer_iterator<long unsigned int> >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Assignable<boost::range_detail::integer_iterator<long unsigned int> > >]’
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:145:5: required from ‘struct boost::Assignable<boost::range_detail::integer_iterator<long unsigned int> >’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator<boost::range_detail::integer_iterator<long unsigned int> >’
502 | BOOST_concept(InputIterator,(TT))
| ^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::InputIterator<boost::range_detail::integer_iterator<long unsigned int> >]’
32 | inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
| ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied<boost::InputIterator<boost::range_detail::integer_iterator<long unsigned int> > >::value’
44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 7 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/biconnected_components.hpp:250:47: required from ‘static std::pair<long unsigned int, OutputIterator> boost::detail::bicomp_dispatch3<boost::param_not_found>::apply(const Graph&, ComponentMap, OutputIterator, VertexIndexMap, DiscoverTimeMap, LowPointMap, const boost::bgl_named_params<P, T, R>&, boost::param_not_found) [with Graph = R_adjacency_list<boost::undirectedS, double>; ComponentMap = boost::dummy_property_map; OutputIterator = std::back_insert_iterator<std::vector<long unsigned int> >; VertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>; DiscoverTimeMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; LowPointMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; P = int; T = boost::buffer_param_t; R = boost::no_property]’
250 | return biconnected_components_impl(g, comp, out, index_map, dtm,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
251 | lowpt,
| ~~~~~~
252 | make_iterator_property_map(pred.begin(), index_map, vert),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
253 | choose_param(get_param(params, graph_visitor),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
254 | make_dfs_visitor(null_visitor())));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/biconnected_components.hpp:295:60: required from ‘static std::pair<long unsigned int, OutputIterator> boost::detail::bicomp_dispatch2<boost::param_not_found>::apply(const Graph&, ComponentMap, OutputIterator, VertexIndexMap, DiscoverTimeMap, const boost::bgl_named_params<P, T, R>&, boost::param_not_found) [with Graph = R_adjacency_list<boost::undirectedS, double>; ComponentMap = boost::dummy_property_map; OutputIterator = std::back_insert_iterator<std::vector<long unsigned int> >; VertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>; DiscoverTimeMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; P = int; T = boost::buffer_param_t; R = boost::no_property]’
295 | return bicomp_dispatch3< dispatch_type >::apply(g, comp, out,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
296 | index_map, dtm,
| ~~~~~~~~~~~~~~~
297 | make_iterator_property_map(lowpt.begin(), index_map, vst),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
298 | params, get_param(params, vertex_predecessor));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/biconnected_components.hpp:336:60: required from ‘static std::pair<long unsigned int, OutputIterator> boost::detail::bicomp_dispatch1<boost::param_not_found>::apply(const Graph&, ComponentMap, OutputIterator, VertexIndexMap, const boost::bgl_named_params<P, T, R>&, boost::param_not_found) [with Graph = R_adjacency_list<boost::undirectedS, double>; ComponentMap = boost::dummy_property_map; OutputIterator = std::back_insert_iterator<std::vector<long unsigned int> >; VertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>; P = int; T = boost::buffer_param_t; R = boost::no_property]’
336 | return bicomp_dispatch2< dispatch_type >::apply(g, comp, out,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
337 | index_map,
| ~~~~~~~~~~
338 | make_iterator_property_map(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~
339 | discover_time.begin(), index_map, vst),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
340 | params, get_param(params, vertex_lowpoint));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/biconnected_components.hpp:368:60: required from ‘std::pair<long unsigned int, OutputIterator> boost::biconnected_components(const Graph&, ComponentMap, OutputIterator, const bgl_named_params<P, T, R>&) [with Graph = R_adjacency_list<undirectedS, double>; ComponentMap = dummy_property_map; OutputIterator = std::back_insert_iterator<std::vector<long unsigned int> >; P = int; T = buffer_param_t; R = no_property]’
368 | return detail::bicomp_dispatch1< dispatch_type >::apply(g, comp, out,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
369 | choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
370 | params, get_param(params, vertex_discover_time));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/biconnected_components.hpp:433:34: required from ‘OutputIterator boost::articulation_points(const Graph&, OutputIterator) [with Graph = R_adjacency_list<undirectedS, double>; OutputIterator = std::back_insert_iterator<std::vector<long unsigned int> >]’
433 | return biconnected_components(g, dummy_property_map(), out,
| ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
434 | bgl_named_params< int, buffer_param_t >(0))
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
interfaces.cpp:300:28: required from here
300 | articulation_points(g, std::back_inserter(art_points));
| ~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
20 | ~usage_requirements() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Assignable<TT>::~Assignable() [with TT = boost::range_detail::integer_iterator<long unsigned int>]’
37 | ~model()
| ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:145:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
145 | BOOST_CONCEPT_USAGE(Assignable) {
| ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::EqualityComparable<boost::range_detail::integer_iterator<long unsigned int> >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::EqualityComparable<boost::range_detail::integer_iterator<long unsigned int> > >]’
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable<boost::range_detail::integer_iterator<long unsigned int> >’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator<boost::range_detail::integer_iterator<long unsigned int> >’
502 | BOOST_concept(InputIterator,(TT))
| ^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::InputIterator<boost::range_detail::integer_iterator<long unsigned int> >]’
32 | inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
| ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied<boost::InputIterator<boost::range_detail::integer_iterator<long unsigned int> > >::value’
44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 7 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/biconnected_components.hpp:250:47: required from ‘static std::pair<long unsigned int, OutputIterator> boost::detail::bicomp_dispatch3<boost::param_not_found>::apply(const Graph&, ComponentMap, OutputIterator, VertexIndexMap, DiscoverTimeMap, LowPointMap, const boost::bgl_named_params<P, T, R>&, boost::param_not_found) [with Graph = R_adjacency_list<boost::undirectedS, double>; ComponentMap = boost::dummy_property_map; OutputIterator = std::back_insert_iterator<std::vector<long unsigned int> >; VertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>; DiscoverTimeMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; LowPointMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; P = int; T = boost::buffer_param_t; R = boost::no_property]’
250 | return biconnected_components_impl(g, comp, out, index_map, dtm,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
251 | lowpt,
| ~~~~~~
252 | make_iterator_property_map(pred.begin(), index_map, vert),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
253 | choose_param(get_param(params, graph_visitor),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
254 | make_dfs_visitor(null_visitor())));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/biconnected_components.hpp:295:60: required from ‘static std::pair<long unsigned int, OutputIterator> boost::detail::bicomp_dispatch2<boost::param_not_found>::apply(const Graph&, ComponentMap, OutputIterator, VertexIndexMap, DiscoverTimeMap, const boost::bgl_named_params<P, T, R>&, boost::param_not_found) [with Graph = R_adjacency_list<boost::undirectedS, double>; ComponentMap = boost::dummy_property_map; OutputIterator = std::back_insert_iterator<std::vector<long unsigned int> >; VertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>; DiscoverTimeMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; P = int; T = boost::buffer_param_t; R = boost::no_property]’
295 | return bicomp_dispatch3< dispatch_type >::apply(g, comp, out,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
296 | index_map, dtm,
| ~~~~~~~~~~~~~~~
297 | make_iterator_property_map(lowpt.begin(), index_map, vst),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
298 | params, get_param(params, vertex_predecessor));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/biconnected_components.hpp:336:60: required from ‘static std::pair<long unsigned int, OutputIterator> boost::detail::bicomp_dispatch1<boost::param_not_found>::apply(const Graph&, ComponentMap, OutputIterator, VertexIndexMap, const boost::bgl_named_params<P, T, R>&, boost::param_not_found) [with Graph = R_adjacency_list<boost::undirectedS, double>; ComponentMap = boost::dummy_property_map; OutputIterator = std::back_insert_iterator<std::vector<long unsigned int> >; VertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>; P = int; T = boost::buffer_param_t; R = boost::no_property]’
336 | return bicomp_dispatch2< dispatch_type >::apply(g, comp, out,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
337 | index_map,
| ~~~~~~~~~~
338 | make_iterator_property_map(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~
339 | discover_time.begin(), index_map, vst),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
340 | params, get_param(params, vertex_lowpoint));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/biconnected_components.hpp:368:60: required from ‘std::pair<long unsigned int, OutputIterator> boost::biconnected_components(const Graph&, ComponentMap, OutputIterator, const bgl_named_params<P, T, R>&) [with Graph = R_adjacency_list<undirectedS, double>; ComponentMap = dummy_property_map; OutputIterator = std::back_insert_iterator<std::vector<long unsigned int> >; P = int; T = buffer_param_t; R = no_property]’
368 | return detail::bicomp_dispatch1< dispatch_type >::apply(g, comp, out,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
369 | choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
370 | params, get_param(params, vertex_discover_time));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/biconnected_components.hpp:433:34: required from ‘OutputIterator boost::articulation_points(const Graph&, OutputIterator) [with Graph = R_adjacency_list<undirectedS, double>; OutputIterator = std::back_insert_iterator<std::vector<long unsigned int> >]’
433 | return biconnected_components(g, dummy_property_map(), out,
| ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
434 | bgl_named_params< int, buffer_param_t >(0))
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
interfaces.cpp:300:28: required from here
300 | articulation_points(g, std::back_inserter(art_points));
| ~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
20 | ~usage_requirements() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::EqualityComparable<TT>::~EqualityComparable() [with TT = boost::range_detail::integer_iterator<long unsigned int>]’
37 | ~model()
| ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:233:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
233 | BOOST_CONCEPT_USAGE(EqualityComparable) {
| ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::InputIterator<boost::range_detail::integer_iterator<long unsigned int> >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::InputIterator<boost::range_detail::integer_iterator<long unsigned int> > >]’
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:512:7: required from ‘struct boost::InputIterator<boost::range_detail::integer_iterator<long unsigned int> >’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::InputIterator<boost::range_detail::integer_iterator<long unsigned int> >]’
32 | inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
| ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied<boost::InputIterator<boost::range_detail::integer_iterator<long unsigned int> > >::value’
44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied<boost::InputIterator<boost::range_detail::integer_iterator<long unsigned int> > >’
45 | typedef boost::integral_constant<bool, value> type;
| ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 6 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/biconnected_components.hpp:250:47: required from ‘static std::pair<long unsigned int, OutputIterator> boost::detail::bicomp_dispatch3<boost::param_not_found>::apply(const Graph&, ComponentMap, OutputIterator, VertexIndexMap, DiscoverTimeMap, LowPointMap, const boost::bgl_named_params<P, T, R>&, boost::param_not_found) [with Graph = R_adjacency_list<boost::undirectedS, double>; ComponentMap = boost::dummy_property_map; OutputIterator = std::back_insert_iterator<std::vector<long unsigned int> >; VertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>; DiscoverTimeMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; LowPointMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; P = int; T = boost::buffer_param_t; R = boost::no_property]’
250 | return biconnected_components_impl(g, comp, out, index_map, dtm,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
251 | lowpt,
| ~~~~~~
252 | make_iterator_property_map(pred.begin(), index_map, vert),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
253 | choose_param(get_param(params, graph_visitor),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
254 | make_dfs_visitor(null_visitor())));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/biconnected_components.hpp:295:60: required from ‘static std::pair<long unsigned int, OutputIterator> boost::detail::bicomp_dispatch2<boost::param_not_found>::apply(const Graph&, ComponentMap, OutputIterator, VertexIndexMap, DiscoverTimeMap, const boost::bgl_named_params<P, T, R>&, boost::param_not_found) [with Graph = R_adjacency_list<boost::undirectedS, double>; ComponentMap = boost::dummy_property_map; OutputIterator = std::back_insert_iterator<std::vector<long unsigned int> >; VertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>; DiscoverTimeMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; P = int; T = boost::buffer_param_t; R = boost::no_property]’
295 | return bicomp_dispatch3< dispatch_type >::apply(g, comp, out,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
296 | index_map, dtm,
| ~~~~~~~~~~~~~~~
297 | make_iterator_property_map(lowpt.begin(), index_map, vst),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
298 | params, get_param(params, vertex_predecessor));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/biconnected_components.hpp:336:60: required from ‘static std::pair<long unsigned int, OutputIterator> boost::detail::bicomp_dispatch1<boost::param_not_found>::apply(const Graph&, ComponentMap, OutputIterator, VertexIndexMap, const boost::bgl_named_params<P, T, R>&, boost::param_not_found) [with Graph = R_adjacency_list<boost::undirectedS, double>; ComponentMap = boost::dummy_property_map; OutputIterator = std::back_insert_iterator<std::vector<long unsigned int> >; VertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>; P = int; T = boost::buffer_param_t; R = boost::no_property]’
336 | return bicomp_dispatch2< dispatch_type >::apply(g, comp, out,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
337 | index_map,
| ~~~~~~~~~~
338 | make_iterator_property_map(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~
339 | discover_time.begin(), index_map, vst),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
340 | params, get_param(params, vertex_lowpoint));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/biconnected_components.hpp:368:60: required from ‘std::pair<long unsigned int, OutputIterator> boost::biconnected_components(const Graph&, ComponentMap, OutputIterator, const bgl_named_params<P, T, R>&) [with Graph = R_adjacency_list<undirectedS, double>; ComponentMap = dummy_property_map; OutputIterator = std::back_insert_iterator<std::vector<long unsigned int> >; P = int; T = buffer_param_t; R = no_property]’
368 | return detail::bicomp_dispatch1< dispatch_type >::apply(g, comp, out,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
369 | choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
370 | params, get_param(params, vertex_discover_time));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/biconnected_components.hpp:433:34: required from ‘OutputIterator boost::articulation_points(const Graph&, OutputIterator) [with Graph = R_adjacency_list<undirectedS, double>; OutputIterator = std::back_insert_iterator<std::vector<long unsigned int> >]’
433 | return biconnected_components(g, dummy_property_map(), out,
| ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
434 | bgl_named_params< int, buffer_param_t >(0))
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
interfaces.cpp:300:28: required from here
300 | articulation_points(g, std::back_inserter(art_points));
| ~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
20 | ~usage_requirements() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::InputIterator<TT>::~InputIterator() [with TT = boost::range_detail::integer_iterator<long unsigned int>]’
37 | ~model()
| ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:512:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
512 | BOOST_CONCEPT_USAGE(InputIterator)
| ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/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::biconnected_components_visitor<boost::dummy_property_map, boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>, std::back_insert_iterator<std::vector<long unsigned int> >, std::stack<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::deque<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > > >, std::vector<char>, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, boost::dfs_visitor<> > > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:167:5: required from ‘struct boost::CopyConstructible<boost::detail::biconnected_components_visitor<boost::dummy_property_map, boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>, std::back_insert_iterator<std::vector<long unsigned int> >, std::stack<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::deque<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > > >, std::vector<char>, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, boost::dfs_visitor<> > >’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:165:3: required from ‘struct boost::CopyConstructibleConcept<boost::detail::biconnected_components_visitor<boost::dummy_property_map, boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>, std::back_insert_iterator<std::vector<long unsigned int> >, std::stack<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::deque<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > > >, std::vector<char>, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, boost::dfs_visitor<> > >’
165 | BOOST_concept(CopyConstructible,(TT))
| ^~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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::biconnected_components_visitor<boost::dummy_property_map, boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>, std::back_insert_iterator<std::vector<long unsigned int> >, std::stack<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::deque<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > > >, std::vector<char>, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, boost::dfs_visitor<> > >]’
32 | inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
| ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied<boost::CopyConstructibleConcept<boost::detail::biconnected_components_visitor<boost::dummy_property_map, boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>, std::back_insert_iterator<std::vector<long unsigned int> >, std::stack<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::deque<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > > >, std::vector<char>, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, boost::dfs_visitor<> > > >::value’
44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied<boost::CopyConstructibleConcept<boost::detail::biconnected_components_visitor<boost::dummy_property_map, boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>, std::back_insert_iterator<std::vector<long unsigned int> >, std::stack<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::deque<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > > >, std::vector<char>, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, boost::dfs_visitor<> > > >’
45 | typedef boost::integral_constant<bool, value> type;
| ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 11 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/biconnected_components.hpp:250:47: required from ‘static std::pair<long unsigned int, OutputIterator> boost::detail::bicomp_dispatch3<boost::param_not_found>::apply(const Graph&, ComponentMap, OutputIterator, VertexIndexMap, DiscoverTimeMap, LowPointMap, const boost::bgl_named_params<P, T, R>&, boost::param_not_found) [with Graph = R_adjacency_list<boost::undirectedS, double>; ComponentMap = boost::dummy_property_map; OutputIterator = std::back_insert_iterator<std::vector<long unsigned int> >; VertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>; DiscoverTimeMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; LowPointMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; P = int; T = boost::buffer_param_t; R = boost::no_property]’
250 | return biconnected_components_impl(g, comp, out, index_map, dtm,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
251 | lowpt,
| ~~~~~~
252 | make_iterator_property_map(pred.begin(), index_map, vert),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
253 | choose_param(get_param(params, graph_visitor),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
254 | make_dfs_visitor(null_visitor())));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/biconnected_components.hpp:295:60: required from ‘static std::pair<long unsigned int, OutputIterator> boost::detail::bicomp_dispatch2<boost::param_not_found>::apply(const Graph&, ComponentMap, OutputIterator, VertexIndexMap, DiscoverTimeMap, const boost::bgl_named_params<P, T, R>&, boost::param_not_found) [with Graph = R_adjacency_list<boost::undirectedS, double>; ComponentMap = boost::dummy_property_map; OutputIterator = std::back_insert_iterator<std::vector<long unsigned int> >; VertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>; DiscoverTimeMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; P = int; T = boost::buffer_param_t; R = boost::no_property]’
295 | return bicomp_dispatch3< dispatch_type >::apply(g, comp, out,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
296 | index_map, dtm,
| ~~~~~~~~~~~~~~~
297 | make_iterator_property_map(lowpt.begin(), index_map, vst),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
298 | params, get_param(params, vertex_predecessor));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/biconnected_components.hpp:336:60: required from ‘static std::pair<long unsigned int, OutputIterator> boost::detail::bicomp_dispatch1<boost::param_not_found>::apply(const Graph&, ComponentMap, OutputIterator, VertexIndexMap, const boost::bgl_named_params<P, T, R>&, boost::param_not_found) [with Graph = R_adjacency_list<boost::undirectedS, double>; ComponentMap = boost::dummy_property_map; OutputIterator = std::back_insert_iterator<std::vector<long unsigned int> >; VertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>; P = int; T = boost::buffer_param_t; R = boost::no_property]’
336 | return bicomp_dispatch2< dispatch_type >::apply(g, comp, out,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
337 | index_map,
| ~~~~~~~~~~
338 | make_iterator_property_map(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~
339 | discover_time.begin(), index_map, vst),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
340 | params, get_param(params, vertex_lowpoint));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/biconnected_components.hpp:368:60: required from ‘std::pair<long unsigned int, OutputIterator> boost::biconnected_components(const Graph&, ComponentMap, OutputIterator, const bgl_named_params<P, T, R>&) [with Graph = R_adjacency_list<undirectedS, double>; ComponentMap = dummy_property_map; OutputIterator = std::back_insert_iterator<std::vector<long unsigned int> >; P = int; T = buffer_param_t; R = no_property]’
368 | return detail::bicomp_dispatch1< dispatch_type >::apply(g, comp, out,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
369 | choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
370 | params, get_param(params, vertex_discover_time));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/biconnected_components.hpp:433:34: required from ‘OutputIterator boost::articulation_points(const Graph&, OutputIterator) [with Graph = R_adjacency_list<undirectedS, double>; OutputIterator = std::back_insert_iterator<std::vector<long unsigned int> >]’
433 | return biconnected_components(g, dummy_property_map(), out,
| ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
434 | bgl_named_params< int, buffer_param_t >(0))
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
interfaces.cpp:300:28: required from here
300 | articulation_points(g, std::back_inserter(art_points));
| ~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/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::biconnected_components_visitor<boost::dummy_property_map, boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>, std::back_insert_iterator<std::vector<long unsigned int> >, std::stack<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::deque<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > > >, std::vector<char>, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, boost::dfs_visitor<> > >]’
20 | ~usage_requirements() { ((Model*)0)->~Model(); }
| ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/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::biconnected_components_visitor<boost::dummy_property_map, boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>, std::back_insert_iterator<std::vector<long unsigned int> >, std::stack<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::deque<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > > >, std::vector<char>, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, boost::dfs_visitor<> > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:41:9: required from ‘void boost::DFSVisitorConcept<Visitor, Graph>::constraints() [with Visitor = boost::detail::biconnected_components_visitor<boost::dummy_property_map, boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>, std::back_insert_iterator<std::vector<long unsigned int> >, std::stack<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::deque<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > > >, std::vector<char>, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, boost::dfs_visitor<> >; Graph = R_adjacency_list<boost::undirectedS, double>]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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::biconnected_components_visitor<boost::dummy_property_map, boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>, std::back_insert_iterator<std::vector<long unsigned int> >, std::stack<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::deque<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > > >, std::vector<char>, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, boost::dfs_visitor<> >, R_adjacency_list<boost::undirectedS, double> >]’
32 | inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
| ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied<boost::DFSVisitorConcept<boost::detail::biconnected_components_visitor<boost::dummy_property_map, boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>, std::back_insert_iterator<std::vector<long unsigned int> >, std::stack<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::deque<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > > >, std::vector<char>, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, boost::dfs_visitor<> >, R_adjacency_list<boost::undirectedS, double> > >::value’
44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied<boost::DFSVisitorConcept<boost::detail::biconnected_components_visitor<boost::dummy_property_map, boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>, std::back_insert_iterator<std::vector<long unsigned int> >, std::stack<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::deque<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > > >, std::vector<char>, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, boost::dfs_visitor<> >, R_adjacency_list<boost::undirectedS, double> > >’
45 | typedef boost::integral_constant<bool, value> type;
| ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_<void (*)(boost::DFSVisitorConcept<boost::detail::biconnected_components_visitor<boost::dummy_property_map, boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>, std::back_insert_iterator<std::vector<long unsigned int> >, std::stack<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::deque<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > > >, std::vector<char>, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, boost::dfs_visitor<> >, R_adjacency_list<boost::undirectedS, double> >)>’
72 | struct requirement_<void(*)(Model)>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:130:9: [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/biconnected_components.hpp:250:47: required from ‘static std::pair<long unsigned int, OutputIterator> boost::detail::bicomp_dispatch3<boost::param_not_found>::apply(const Graph&, ComponentMap, OutputIterator, VertexIndexMap, DiscoverTimeMap, LowPointMap, const boost::bgl_named_params<P, T, R>&, boost::param_not_found) [with Graph = R_adjacency_list<boost::undirectedS, double>; ComponentMap = boost::dummy_property_map; OutputIterator = std::back_insert_iterator<std::vector<long unsigned int> >; VertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>; DiscoverTimeMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; LowPointMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; P = int; T = boost::buffer_param_t; R = boost::no_property]’
250 | return biconnected_components_impl(g, comp, out, index_map, dtm,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
251 | lowpt,
| ~~~~~~
252 | make_iterator_property_map(pred.begin(), index_map, vert),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
253 | choose_param(get_param(params, graph_visitor),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
254 | make_dfs_visitor(null_visitor())));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/biconnected_components.hpp:295:60: required from ‘static std::pair<long unsigned int, OutputIterator> boost::detail::bicomp_dispatch2<boost::param_not_found>::apply(const Graph&, ComponentMap, OutputIterator, VertexIndexMap, DiscoverTimeMap, const boost::bgl_named_params<P, T, R>&, boost::param_not_found) [with Graph = R_adjacency_list<boost::undirectedS, double>; ComponentMap = boost::dummy_property_map; OutputIterator = std::back_insert_iterator<std::vector<long unsigned int> >; VertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>; DiscoverTimeMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; P = int; T = boost::buffer_param_t; R = boost::no_property]’
295 | return bicomp_dispatch3< dispatch_type >::apply(g, comp, out,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
296 | index_map, dtm,
| ~~~~~~~~~~~~~~~
297 | make_iterator_property_map(lowpt.begin(), index_map, vst),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
298 | params, get_param(params, vertex_predecessor));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/biconnected_components.hpp:336:60: required from ‘static std::pair<long unsigned int, OutputIterator> boost::detail::bicomp_dispatch1<boost::param_not_found>::apply(const Graph&, ComponentMap, OutputIterator, VertexIndexMap, const boost::bgl_named_params<P, T, R>&, boost::param_not_found) [with Graph = R_adjacency_list<boost::undirectedS, double>; ComponentMap = boost::dummy_property_map; OutputIterator = std::back_insert_iterator<std::vector<long unsigned int> >; VertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>; P = int; T = boost::buffer_param_t; R = boost::no_property]’
336 | return bicomp_dispatch2< dispatch_type >::apply(g, comp, out,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
337 | index_map,
| ~~~~~~~~~~
338 | make_iterator_property_map(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~
339 | discover_time.begin(), index_map, vst),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
340 | params, get_param(params, vertex_lowpoint));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/biconnected_components.hpp:368:60: required from ‘std::pair<long unsigned int, OutputIterator> boost::biconnected_components(const Graph&, ComponentMap, OutputIterator, const bgl_named_params<P, T, R>&) [with Graph = R_adjacency_list<undirectedS, double>; ComponentMap = dummy_property_map; OutputIterator = std::back_insert_iterator<std::vector<long unsigned int> >; P = int; T = buffer_param_t; R = no_property]’
368 | return detail::bicomp_dispatch1< dispatch_type >::apply(g, comp, out,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
369 | choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
370 | params, get_param(params, vertex_discover_time));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/biconnected_components.hpp:433:34: required from ‘OutputIterator boost::articulation_points(const Graph&, OutputIterator) [with Graph = R_adjacency_list<undirectedS, double>; OutputIterator = std::back_insert_iterator<std::vector<long unsigned int> >]’
433 | return biconnected_components(g, dummy_property_map(), out,
| ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
434 | bgl_named_params< int, buffer_param_t >(0))
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
interfaces.cpp:300:28: required from here
300 | articulation_points(g, std::back_inserter(art_points));
| ~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:165:17: note: in a call to non-static member function ‘boost::CopyConstructibleConcept<boost::detail::biconnected_components_visitor<boost::dummy_property_map, boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>, std::back_insert_iterator<std::vector<long unsigned int> >, std::stack<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::deque<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > > >, std::vector<char>, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, boost::dfs_visitor<> > >::~CopyConstructibleConcept()’
165 | BOOST_concept(CopyConstructible,(TT))
| ^~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/preprocessor/cat.hpp:29:34: note: in definition of macro ‘BOOST_PP_CAT_I’
29 | # define BOOST_PP_CAT_I(a, b) a ## b
| ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/concept_def.hpp:23:12: note: in expansion of macro ‘BOOST_PP_CAT’
23 | struct BOOST_PP_CAT(name,Concept) \
| ^~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:165:3: note: in expansion of macro ‘BOOST_concept’
165 | BOOST_concept(CopyConstructible,(TT))
| ^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Convertible<boost::iterators::detail::iterator_category_with_traversal<std::input_iterator_tag, boost::iterators::bidirectional_traversal_tag>, std::input_iterator_tag> >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible<boost::iterators::detail::iterator_category_with_traversal<std::input_iterator_tag, boost::iterators::bidirectional_traversal_tag>, std::input_iterator_tag>’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::Convertible<boost::iterators::detail::iterator_category_with_traversal<std::input_iterator_tag, boost::iterators::bidirectional_traversal_tag>, std::input_iterator_tag>]’
32 | inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
| ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied<boost::Convertible<boost::iterators::detail::iterator_category_with_traversal<std::input_iterator_tag, boost::iterators::bidirectional_traversal_tag>, std::input_iterator_tag> >::value’
44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied<boost::Convertible<boost::iterators::detail::iterator_category_with_traversal<std::input_iterator_tag, boost::iterators::bidirectional_traversal_tag>, std::input_iterator_tag> >’
45 | typedef boost::integral_constant<bool, value> type;
| ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_<void (*)(boost::Convertible<boost::iterators::detail::iterator_category_with_traversal<std::input_iterator_tag, boost::iterators::bidirectional_traversal_tag>, std::input_iterator_tag>)>’
72 | struct requirement_<void(*)(Model)>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:515:9: [ skipping 6 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:129:9: required from ‘void boost::breadth_first_visit(const IncidenceGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with IncidenceGraph = filtered_graph<adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, no_property, listS>, is_residual_edge<adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_residual_capacity_t> >, keep_all>; Buffer = queue<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > >; BFSVisitor = bfs_visitor<edge_predecessor_recorder<detail::edge_desc_impl<directed_tag, long unsigned int>*, on_tree_edge> >; ColorMap = default_color_type*; SourceIterator = long unsigned int*]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:136:24: required from ‘void boost::breadth_first_search(const VertexListGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph<adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, no_property, listS>, is_residual_edge<adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_residual_capacity_t> >, keep_all>; SourceIterator = long unsigned int*; Buffer = queue<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > >; BFSVisitor = bfs_visitor<edge_predecessor_recorder<detail::edge_desc_impl<directed_tag, long unsigned int>*, on_tree_edge> >; ColorMap = default_color_type*]’
136 | breadth_first_visit(g, sources_begin, sources_end, Q, vis, color);
| ~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:147:25: required from ‘void boost::breadth_first_search(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph<adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, no_property, listS>, is_residual_edge<adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_residual_capacity_t> >, keep_all>; Buffer = queue<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > >; BFSVisitor = bfs_visitor<edge_predecessor_recorder<detail::edge_desc_impl<directed_tag, long unsigned int>*, on_tree_edge> >; ColorMap = default_color_type*; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
147 | breadth_first_search(g, sources, sources + 1, Q, vis, color);
| ~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/edmonds_karp_max_flow.hpp:101:29: required from ‘typename boost::property_traits<IndexMap>::value_type boost::edmonds_karp_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, ColorMap, PredEdgeMap) [with Graph = adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, no_property, listS>; CapacityEdgeMap = adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map<directed_tag, detail::edge_desc_impl<directed_tag, long unsigned int>, detail::edge_desc_impl<directed_tag, long unsigned int>&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_reverse_t>; ColorMap = default_color_type*; PredEdgeMap = detail::edge_desc_impl<directed_tag, long unsigned int>*; typename property_traits<IndexMap>::value_type = long unsigned int; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
101 | breadth_first_search(detail::residual_graph(g, res), src, Q,
| ~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
102 | make_bfs_visitor(record_edge_predecessors(pred, on_tree_edge())),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
103 | color);
| ~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/edge_connectivity.hpp:146:42: required from ‘typename boost::graph_traits<G>::degree_size_type boost::edge_connectivity(VertexListGraph&, OutputIterator) [with VertexListGraph = R_adjacency_list<undirectedS, double>; OutputIterator = std::back_insert_iterator<std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int> > >; typename graph_traits<G>::degree_size_type = long unsigned int]’
146 | alpha_S_k = edmonds_karp_max_flow(
| ~~~~~~~~~~~~~~~~~~~~~^
147 | flow_g, p, k, cap, res_cap, rev_edge, &color[0], &pred[0]);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
interfaces.cpp:326:34: required from here
326 | dst c = edge_connectivity( g, std::back_inserter(disconnecting_set) );
| ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Convertible<boost::iterators::detail::iterator_category_with_traversal<std::input_iterator_tag, boost::iterators::bidirectional_traversal_tag>, std::input_iterator_tag>]’
20 | ~usage_requirements() { ((Model*)0)->~Model(); }
| ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::Convertible<boost::iterators::detail::iterator_category_with_traversal<std::input_iterator_tag, boost::iterators::bidirectional_traversal_tag>, std::input_iterator_tag>]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:515:9: required from ‘boost::InputIterator<TT>::~InputIterator() [with TT = boost::iterators::filter_iterator<boost::detail::out_edge_predicate<boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long unsigned int, long unsigned int&, long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::no_property, boost::listS>, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long unsigned int, long unsigned int&, long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int> >]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::InputIterator<boost::iterators::filter_iterator<boost::detail::out_edge_predicate<boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long unsigned int, long unsigned int&, long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::no_property, boost::listS>, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long unsigned int, long unsigned int&, long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int> > >]’
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:53:35: required from ‘boost::concepts::MultiPassInputIterator<T>::~MultiPassInputIterator() [with T = boost::iterators::filter_iterator<boost::detail::out_edge_predicate<boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long unsigned int, long unsigned int&, long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::no_property, boost::listS>, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long unsigned int, long unsigned int&, long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int> >]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::MultiPassInputIterator<boost::iterators::filter_iterator<boost::detail::out_edge_predicate<boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long unsigned int, long unsigned int&, long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::no_property, boost::listS>, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long unsigned int, long unsigned int&, long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int> > >]’
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:89:9: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:129:9: required from ‘void boost::breadth_first_visit(const IncidenceGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with IncidenceGraph = filtered_graph<adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, no_property, listS>, is_residual_edge<adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_residual_capacity_t> >, keep_all>; Buffer = queue<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > >; BFSVisitor = bfs_visitor<edge_predecessor_recorder<detail::edge_desc_impl<directed_tag, long unsigned int>*, on_tree_edge> >; ColorMap = default_color_type*; SourceIterator = long unsigned int*]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:136:24: required from ‘void boost::breadth_first_search(const VertexListGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph<adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, no_property, listS>, is_residual_edge<adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_residual_capacity_t> >, keep_all>; SourceIterator = long unsigned int*; Buffer = queue<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > >; BFSVisitor = bfs_visitor<edge_predecessor_recorder<detail::edge_desc_impl<directed_tag, long unsigned int>*, on_tree_edge> >; ColorMap = default_color_type*]’
136 | breadth_first_visit(g, sources_begin, sources_end, Q, vis, color);
| ~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:147:25: required from ‘void boost::breadth_first_search(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph<adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, no_property, listS>, is_residual_edge<adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_residual_capacity_t> >, keep_all>; Buffer = queue<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > >; BFSVisitor = bfs_visitor<edge_predecessor_recorder<detail::edge_desc_impl<directed_tag, long unsigned int>*, on_tree_edge> >; ColorMap = default_color_type*; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
147 | breadth_first_search(g, sources, sources + 1, Q, vis, color);
| ~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/edmonds_karp_max_flow.hpp:101:29: required from ‘typename boost::property_traits<IndexMap>::value_type boost::edmonds_karp_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, ColorMap, PredEdgeMap) [with Graph = adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, no_property, listS>; CapacityEdgeMap = adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map<directed_tag, detail::edge_desc_impl<directed_tag, long unsigned int>, detail::edge_desc_impl<directed_tag, long unsigned int>&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_reverse_t>; ColorMap = default_color_type*; PredEdgeMap = detail::edge_desc_impl<directed_tag, long unsigned int>*; typename property_traits<IndexMap>::value_type = long unsigned int; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
101 | breadth_first_search(detail::residual_graph(g, res), src, Q,
| ~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
102 | make_bfs_visitor(record_edge_predecessors(pred, on_tree_edge())),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
103 | color);
| ~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/edge_connectivity.hpp:146:42: required from ‘typename boost::graph_traits<G>::degree_size_type boost::edge_connectivity(VertexListGraph&, OutputIterator) [with VertexListGraph = R_adjacency_list<undirectedS, double>; OutputIterator = std::back_insert_iterator<std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int> > >; typename graph_traits<G>::degree_size_type = long unsigned int]’
146 | alpha_S_k = edmonds_karp_max_flow(
| ~~~~~~~~~~~~~~~~~~~~~^
147 | flow_g, p, k, cap, res_cap, rev_edge, &color[0], &pred[0]);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
interfaces.cpp:326:34: required from here
326 | dst c = edge_connectivity( g, std::back_inserter(disconnecting_set) );
| ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible<X, Y>::~Convertible() [with X = boost::iterators::detail::iterator_category_with_traversal<std::input_iterator_tag, boost::iterators::bidirectional_traversal_tag>; Y = std::input_iterator_tag]’
37 | ~model()
| ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
208 | BOOST_CONCEPT_USAGE(Convertible) {
| ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Convertible<boost::iterators::detail::iterator_category_with_traversal<std::input_iterator_tag, boost::iterators::random_access_traversal_tag>, std::input_iterator_tag>]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/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(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/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> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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);
| ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/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) );
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/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;
| ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 7 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:129:9: required from ‘void boost::detail::depth_first_visit_impl(const IncidenceGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, DFSVisitor&, ColorMap, TerminatorFunc) [with IncidenceGraph = R_adjacency_list<boost::directedS, double>; DFSVisitor = dfs_time_visitor<long unsigned int*>; ColorMap = boost::shared_array_property_map<boost::default_color_type, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int> >; TerminatorFunc = nontruth2; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:286:39: required from ‘void boost::depth_first_search(const VertexListGraph&, DFSVisitor, ColorMap, typename graph_traits<Graph>::vertex_descriptor) [with VertexListGraph = R_adjacency_list<directedS, double>; DFSVisitor = dfs_time_visitor<long unsigned int*>; ColorMap = shared_array_property_map<default_color_type, vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int> >; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
286 | detail::depth_first_visit_impl(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
287 | g, start_vertex, vis, color, detail::nontruth2());
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/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 dfs_time_visitor<long unsigned int*> >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; Graph = R_adjacency_list<boost::directedS, double>]’
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)]);
| ~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/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 = R_adjacency_list<boost::directedS, double>; ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<keywords::tag::visitor, const dfs_time_visitor<long unsigned 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); \
| ~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/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 = R_adjacency_list<directedS, double>; P = dfs_time_visitor<long unsigned 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 dfs_time_visitor<long unsigned 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); \
| ~~~~~~~~~
interfaces.cpp:158:27: required from here
158 | depth_first_search(g, visitor(vis));
| ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
20 | ~usage_requirements() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible<X, Y>::~Convertible() [with X = boost::iterators::detail::iterator_category_with_traversal<std::input_iterator_tag, boost::iterators::random_access_traversal_tag>; Y = std::input_iterator_tag]’
37 | ~model()
| ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
208 | BOOST_CONCEPT_USAGE(Convertible) {
| ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/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::tarjan_scc_visitor<int*, boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>, std::stack<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > > > > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:167:5: required from ‘struct boost::CopyConstructible<boost::detail::tarjan_scc_visitor<int*, boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>, std::stack<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > > > >’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:165:3: required from ‘struct boost::CopyConstructibleConcept<boost::detail::tarjan_scc_visitor<int*, boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>, std::stack<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > > > >’
165 | BOOST_concept(CopyConstructible,(TT))
| ^~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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::tarjan_scc_visitor<int*, boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>, std::stack<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > > > >]’
32 | inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
| ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied<boost::CopyConstructibleConcept<boost::detail::tarjan_scc_visitor<int*, boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>, std::stack<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > > > > >::value’
44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied<boost::CopyConstructibleConcept<boost::detail::tarjan_scc_visitor<int*, boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>, std::stack<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > > > > >’
45 | typedef boost::integral_constant<bool, value> type;
| ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 12 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/strong_components.hpp:177:63: required from ‘typename boost::property_traits<IndexMap>::value_type boost::detail::scc_helper2(const Graph&, ComponentMap, RootMap, const boost::bgl_named_params<P, T, R>&, DiscoverTimeMap) [with Graph = R_adjacency_list<boost::directedS, double>; ComponentMap = int*; RootMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; P = int; T = int; R = boost::no_property; DiscoverTimeMap = boost::param_not_found; typename boost::property_traits<IndexMap>::value_type = int]’
177 | return strong_comp_dispatch2< DiscoverTimeMap >::apply(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
178 | g, comp, r_map, params, time_map);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/strong_components.hpp:205:31: required from ‘static typename boost::property_traits<IndexMap>::value_type boost::detail::strong_comp_dispatch1<boost::param_not_found>::apply(const Graph&, ComponentMap, const boost::bgl_named_params<P, T, R>&, boost::param_not_found) [with Graph = R_adjacency_list<boost::directedS, double>; ComponentMap = int*; P = int; T = int; R = boost::no_property; typename boost::property_traits<IndexMap>::value_type = int]’
205 | return scc_helper2(g, comp,
| ~~~~~~~~~~~^~~~~~~~~
206 | make_iterator_property_map(root_vec.begin(),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
207 | choose_const_pmap(
| ~~~~~~~~~~~~~~~~~~
208 | get_param(params, vertex_index), g, vertex_index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
209 | root_vec[0]),
| ~~~~~~~~~~~~~
210 | params, get_param(params, vertex_discover_time));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/strong_components.hpp:220:63: required from ‘typename boost::property_traits<IndexMap>::value_type boost::detail::scc_helper1(const Graph&, ComponentMap, const boost::bgl_named_params<P, T, R>&, RootMap) [with Graph = R_adjacency_list<boost::directedS, double>; ComponentMap = int*; RootMap = boost::param_not_found; P = int; T = int; R = boost::no_property; typename boost::property_traits<IndexMap>::value_type = int]’
220 | return detail::strong_comp_dispatch1< RootMap >::apply(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
221 | g, comp, params, r_map);
| ~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/strong_components.hpp:235:31: required from ‘typename boost::property_traits<IndexMap>::value_type boost::strong_components(const Graph&, ComponentMap, const bgl_named_params<P, T, R>&, typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = R_adjacency_list<directedS, double>; ComponentMap = int*; P = int; T = int; R = no_property; typename property_traits<IndexMap>::value_type = int; typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits<Graph>::traversal_category = adj_list_dir_traversal_tag]’
235 | return detail::scc_helper1(
| ~~~~~~~~~~~~~~~~~~~^
236 | g, comp, params, get_param(params, vertex_root_t()));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/strong_components.hpp:249:29: required from ‘typename boost::property_traits<IndexMap>::value_type boost::strong_components(const Graph&, ComponentMap, typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = R_adjacency_list<directedS, double>; ComponentMap = int*; typename property_traits<IndexMap>::value_type = int; typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits<Graph>::traversal_category = adj_list_dir_traversal_tag]’
249 | return strong_components(g, comp, params);
| ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~
interfaces.cpp:232:26: required from here
232 | strong_components(g, &component[0]);
| ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/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::tarjan_scc_visitor<int*, boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>, std::stack<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > > > >]’
20 | ~usage_requirements() { ((Model*)0)->~Model(); }
| ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/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::tarjan_scc_visitor<int*, boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>, std::stack<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > > > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:41:9: required from ‘void boost::DFSVisitorConcept<Visitor, Graph>::constraints() [with Visitor = boost::detail::tarjan_scc_visitor<int*, boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>, std::stack<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > > >; Graph = R_adjacency_list<boost::directedS, double>]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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::tarjan_scc_visitor<int*, boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>, std::stack<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > > >, R_adjacency_list<boost::directedS, double> >]’
32 | inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
| ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied<boost::DFSVisitorConcept<boost::detail::tarjan_scc_visitor<int*, boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>, std::stack<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > > >, R_adjacency_list<boost::directedS, double> > >::value’
44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied<boost::DFSVisitorConcept<boost::detail::tarjan_scc_visitor<int*, boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>, std::stack<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > > >, R_adjacency_list<boost::directedS, double> > >’
45 | typedef boost::integral_constant<bool, value> type;
| ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_<void (*)(boost::DFSVisitorConcept<boost::detail::tarjan_scc_visitor<int*, boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>, std::stack<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > > >, R_adjacency_list<boost::directedS, double> >)>’
72 | struct requirement_<void(*)(Model)>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:130:9: [ skipping 6 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/strong_components.hpp:177:63: required from ‘typename boost::property_traits<IndexMap>::value_type boost::detail::scc_helper2(const Graph&, ComponentMap, RootMap, const boost::bgl_named_params<P, T, R>&, DiscoverTimeMap) [with Graph = R_adjacency_list<boost::directedS, double>; ComponentMap = int*; RootMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; P = int; T = int; R = boost::no_property; DiscoverTimeMap = boost::param_not_found; typename boost::property_traits<IndexMap>::value_type = int]’
177 | return strong_comp_dispatch2< DiscoverTimeMap >::apply(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
178 | g, comp, r_map, params, time_map);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/strong_components.hpp:205:31: required from ‘static typename boost::property_traits<IndexMap>::value_type boost::detail::strong_comp_dispatch1<boost::param_not_found>::apply(const Graph&, ComponentMap, const boost::bgl_named_params<P, T, R>&, boost::param_not_found) [with Graph = R_adjacency_list<boost::directedS, double>; ComponentMap = int*; P = int; T = int; R = boost::no_property; typename boost::property_traits<IndexMap>::value_type = int]’
205 | return scc_helper2(g, comp,
| ~~~~~~~~~~~^~~~~~~~~
206 | make_iterator_property_map(root_vec.begin(),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
207 | choose_const_pmap(
| ~~~~~~~~~~~~~~~~~~
208 | get_param(params, vertex_index), g, vertex_index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
209 | root_vec[0]),
| ~~~~~~~~~~~~~
210 | params, get_param(params, vertex_discover_time));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/strong_components.hpp:220:63: required from ‘typename boost::property_traits<IndexMap>::value_type boost::detail::scc_helper1(const Graph&, ComponentMap, const boost::bgl_named_params<P, T, R>&, RootMap) [with Graph = R_adjacency_list<boost::directedS, double>; ComponentMap = int*; RootMap = boost::param_not_found; P = int; T = int; R = boost::no_property; typename boost::property_traits<IndexMap>::value_type = int]’
220 | return detail::strong_comp_dispatch1< RootMap >::apply(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
221 | g, comp, params, r_map);
| ~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/strong_components.hpp:235:31: required from ‘typename boost::property_traits<IndexMap>::value_type boost::strong_components(const Graph&, ComponentMap, const bgl_named_params<P, T, R>&, typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = R_adjacency_list<directedS, double>; ComponentMap = int*; P = int; T = int; R = no_property; typename property_traits<IndexMap>::value_type = int; typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits<Graph>::traversal_category = adj_list_dir_traversal_tag]’
235 | return detail::scc_helper1(
| ~~~~~~~~~~~~~~~~~~~^
236 | g, comp, params, get_param(params, vertex_root_t()));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/strong_components.hpp:249:29: required from ‘typename boost::property_traits<IndexMap>::value_type boost::strong_components(const Graph&, ComponentMap, typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = R_adjacency_list<directedS, double>; ComponentMap = int*; typename property_traits<IndexMap>::value_type = int; typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits<Graph>::traversal_category = adj_list_dir_traversal_tag]’
249 | return strong_components(g, comp, params);
| ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~
interfaces.cpp:232:26: required from here
232 | strong_components(g, &component[0]);
| ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:165:17: note: in a call to non-static member function ‘boost::CopyConstructibleConcept<boost::detail::tarjan_scc_visitor<int*, boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>, std::stack<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > > > >::~CopyConstructibleConcept()’
165 | BOOST_concept(CopyConstructible,(TT))
| ^~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/preprocessor/cat.hpp:29:34: note: in definition of macro ‘BOOST_PP_CAT_I’
29 | # define BOOST_PP_CAT_I(a, b) a ## b
| ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/concept_def.hpp:23:12: note: in expansion of macro ‘BOOST_PP_CAT’
23 | struct BOOST_PP_CAT(name,Concept) \
| ^~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:165:3: note: in expansion of macro ‘BOOST_concept’
165 | BOOST_concept(CopyConstructible,(TT))
| ^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/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::biconnected_components_visitor<boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>, boost::graph_detail::dummy_output_iterator, std::stack<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::deque<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > > >, std::vector<char>, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, boost::dfs_visitor<> > > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:167:5: required from ‘struct boost::CopyConstructible<boost::detail::biconnected_components_visitor<boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>, boost::graph_detail::dummy_output_iterator, std::stack<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::deque<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > > >, std::vector<char>, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, boost::dfs_visitor<> > >’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:165:3: required from ‘struct boost::CopyConstructibleConcept<boost::detail::biconnected_components_visitor<boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>, boost::graph_detail::dummy_output_iterator, std::stack<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::deque<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > > >, std::vector<char>, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, boost::dfs_visitor<> > >’
165 | BOOST_concept(CopyConstructible,(TT))
| ^~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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::biconnected_components_visitor<boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>, boost::graph_detail::dummy_output_iterator, std::stack<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::deque<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > > >, std::vector<char>, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, boost::dfs_visitor<> > >]’
32 | inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
| ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied<boost::CopyConstructibleConcept<boost::detail::biconnected_components_visitor<boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>, boost::graph_detail::dummy_output_iterator, std::stack<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::deque<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > > >, std::vector<char>, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, boost::dfs_visitor<> > > >::value’
44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied<boost::CopyConstructibleConcept<boost::detail::biconnected_components_visitor<boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>, boost::graph_detail::dummy_output_iterator, std::stack<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::deque<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > > >, std::vector<char>, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, boost::dfs_visitor<> > > >’
45 | typedef boost::integral_constant<bool, value> type;
| ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 12 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/biconnected_components.hpp:295:60: required from ‘static std::pair<long unsigned int, OutputIterator> boost::detail::bicomp_dispatch2<boost::param_not_found>::apply(const Graph&, ComponentMap, OutputIterator, VertexIndexMap, DiscoverTimeMap, const boost::bgl_named_params<P, T, R>&, boost::param_not_found) [with Graph = R_adjacency_list<boost::undirectedS, double>; ComponentMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>; OutputIterator = boost::graph_detail::dummy_output_iterator; VertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>; DiscoverTimeMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; P = int; T = boost::buffer_param_t; R = boost::no_property]’
295 | return bicomp_dispatch3< dispatch_type >::apply(g, comp, out,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
296 | index_map, dtm,
| ~~~~~~~~~~~~~~~
297 | make_iterator_property_map(lowpt.begin(), index_map, vst),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
298 | params, get_param(params, vertex_predecessor));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/biconnected_components.hpp:336:60: required from ‘static std::pair<long unsigned int, OutputIterator> boost::detail::bicomp_dispatch1<boost::param_not_found>::apply(const Graph&, ComponentMap, OutputIterator, VertexIndexMap, const boost::bgl_named_params<P, T, R>&, boost::param_not_found) [with Graph = R_adjacency_list<boost::undirectedS, double>; ComponentMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>; OutputIterator = boost::graph_detail::dummy_output_iterator; VertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>; P = int; T = boost::buffer_param_t; R = boost::no_property]’
336 | return bicomp_dispatch2< dispatch_type >::apply(g, comp, out,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
337 | index_map,
| ~~~~~~~~~~
338 | make_iterator_property_map(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~
339 | discover_time.begin(), index_map, vst),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
340 | params, get_param(params, vertex_lowpoint));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/biconnected_components.hpp:368:60: required from ‘std::pair<long unsigned int, OutputIterator> boost::biconnected_components(const Graph&, ComponentMap, OutputIterator, const bgl_named_params<P, T, R>&) [with Graph = R_adjacency_list<undirectedS, double>; ComponentMap = adj_list_edge_property_map<undirected_tag, double, double&, long unsigned int, property<edge_weight_t, double, no_property>, edge_weight_t>; OutputIterator = graph_detail::dummy_output_iterator; P = int; T = buffer_param_t; R = no_property]’
368 | return detail::bicomp_dispatch1< dispatch_type >::apply(g, comp, out,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
369 | choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
370 | params, get_param(params, vertex_discover_time));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/biconnected_components.hpp:377:34: required from ‘std::pair<long unsigned int, OutputIterator> boost::biconnected_components(const Graph&, ComponentMap, OutputIterator) [with Graph = R_adjacency_list<undirectedS, double>; ComponentMap = adj_list_edge_property_map<undirected_tag, double, double&, long unsigned int, property<edge_weight_t, double, no_property>, edge_weight_t>; OutputIterator = graph_detail::dummy_output_iterator]’
377 | return biconnected_components(
| ~~~~~~~~~~~~~~~~~~~~~~^
378 | g, comp, out, bgl_named_params< int, buffer_param_t >(0));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/biconnected_components.hpp:417:34: required from ‘std::size_t boost::biconnected_components(const Graph&, ComponentMap) [with Graph = R_adjacency_list<undirectedS, double>; ComponentMap = adj_list_edge_property_map<undirected_tag, double, double&, long unsigned int, property<edge_weight_t, double, no_property>, edge_weight_t>; std::size_t = long unsigned int]’
417 | return biconnected_components(
| ~~~~~~~~~~~~~~~~~~~~~~^
418 | g, comp, graph_detail::dummy_output_iterator())
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
interfaces.cpp:264:47: required from here
264 | int num_comps = biconnected_components(g, component);
| ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/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::biconnected_components_visitor<boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>, boost::graph_detail::dummy_output_iterator, std::stack<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::deque<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > > >, std::vector<char>, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, boost::dfs_visitor<> > >]’
20 | ~usage_requirements() { ((Model*)0)->~Model(); }
| ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/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::biconnected_components_visitor<boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>, boost::graph_detail::dummy_output_iterator, std::stack<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::deque<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > > >, std::vector<char>, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, boost::dfs_visitor<> > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:41:9: required from ‘void boost::DFSVisitorConcept<Visitor, Graph>::constraints() [with Visitor = boost::detail::biconnected_components_visitor<boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>, boost::graph_detail::dummy_output_iterator, std::stack<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::deque<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > > >, std::vector<char>, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, boost::dfs_visitor<> >; Graph = R_adjacency_list<boost::undirectedS, double>]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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::biconnected_components_visitor<boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>, boost::graph_detail::dummy_output_iterator, std::stack<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::deque<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > > >, std::vector<char>, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, boost::dfs_visitor<> >, R_adjacency_list<boost::undirectedS, double> >]’
32 | inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
| ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied<boost::DFSVisitorConcept<boost::detail::biconnected_components_visitor<boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>, boost::graph_detail::dummy_output_iterator, std::stack<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::deque<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > > >, std::vector<char>, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, boost::dfs_visitor<> >, R_adjacency_list<boost::undirectedS, double> > >::value’
44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied<boost::DFSVisitorConcept<boost::detail::biconnected_components_visitor<boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>, boost::graph_detail::dummy_output_iterator, std::stack<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::deque<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > > >, std::vector<char>, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, boost::dfs_visitor<> >, R_adjacency_list<boost::undirectedS, double> > >’
45 | typedef boost::integral_constant<bool, value> type;
| ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_<void (*)(boost::DFSVisitorConcept<boost::detail::biconnected_components_visitor<boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>, boost::graph_detail::dummy_output_iterator, std::stack<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::deque<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > > >, std::vector<char>, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, boost::dfs_visitor<> >, R_adjacency_list<boost::undirectedS, double> >)>’
72 | struct requirement_<void(*)(Model)>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:130:9: [ skipping 6 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/biconnected_components.hpp:295:60: required from ‘static std::pair<long unsigned int, OutputIterator> boost::detail::bicomp_dispatch2<boost::param_not_found>::apply(const Graph&, ComponentMap, OutputIterator, VertexIndexMap, DiscoverTimeMap, const boost::bgl_named_params<P, T, R>&, boost::param_not_found) [with Graph = R_adjacency_list<boost::undirectedS, double>; ComponentMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>; OutputIterator = boost::graph_detail::dummy_output_iterator; VertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>; DiscoverTimeMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; P = int; T = boost::buffer_param_t; R = boost::no_property]’
295 | return bicomp_dispatch3< dispatch_type >::apply(g, comp, out,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
296 | index_map, dtm,
| ~~~~~~~~~~~~~~~
297 | make_iterator_property_map(lowpt.begin(), index_map, vst),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
298 | params, get_param(params, vertex_predecessor));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/biconnected_components.hpp:336:60: required from ‘static std::pair<long unsigned int, OutputIterator> boost::detail::bicomp_dispatch1<boost::param_not_found>::apply(const Graph&, ComponentMap, OutputIterator, VertexIndexMap, const boost::bgl_named_params<P, T, R>&, boost::param_not_found) [with Graph = R_adjacency_list<boost::undirectedS, double>; ComponentMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>; OutputIterator = boost::graph_detail::dummy_output_iterator; VertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>; P = int; T = boost::buffer_param_t; R = boost::no_property]’
336 | return bicomp_dispatch2< dispatch_type >::apply(g, comp, out,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
337 | index_map,
| ~~~~~~~~~~
338 | make_iterator_property_map(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~
339 | discover_time.begin(), index_map, vst),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
340 | params, get_param(params, vertex_lowpoint));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/biconnected_components.hpp:368:60: required from ‘std::pair<long unsigned int, OutputIterator> boost::biconnected_components(const Graph&, ComponentMap, OutputIterator, const bgl_named_params<P, T, R>&) [with Graph = R_adjacency_list<undirectedS, double>; ComponentMap = adj_list_edge_property_map<undirected_tag, double, double&, long unsigned int, property<edge_weight_t, double, no_property>, edge_weight_t>; OutputIterator = graph_detail::dummy_output_iterator; P = int; T = buffer_param_t; R = no_property]’
368 | return detail::bicomp_dispatch1< dispatch_type >::apply(g, comp, out,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
369 | choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
370 | params, get_param(params, vertex_discover_time));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/biconnected_components.hpp:377:34: required from ‘std::pair<long unsigned int, OutputIterator> boost::biconnected_components(const Graph&, ComponentMap, OutputIterator) [with Graph = R_adjacency_list<undirectedS, double>; ComponentMap = adj_list_edge_property_map<undirected_tag, double, double&, long unsigned int, property<edge_weight_t, double, no_property>, edge_weight_t>; OutputIterator = graph_detail::dummy_output_iterator]’
377 | return biconnected_components(
| ~~~~~~~~~~~~~~~~~~~~~~^
378 | g, comp, out, bgl_named_params< int, buffer_param_t >(0));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/biconnected_components.hpp:417:34: required from ‘std::size_t boost::biconnected_components(const Graph&, ComponentMap) [with Graph = R_adjacency_list<undirectedS, double>; ComponentMap = adj_list_edge_property_map<undirected_tag, double, double&, long unsigned int, property<edge_weight_t, double, no_property>, edge_weight_t>; std::size_t = long unsigned int]’
417 | return biconnected_components(
| ~~~~~~~~~~~~~~~~~~~~~~^
418 | g, comp, graph_detail::dummy_output_iterator())
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
interfaces.cpp:264:47: required from here
264 | int num_comps = biconnected_components(g, component);
| ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:165:17: note: in a call to non-static member function ‘boost::CopyConstructibleConcept<boost::detail::biconnected_components_visitor<boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>, boost::graph_detail::dummy_output_iterator, std::stack<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::deque<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > > >, std::vector<char>, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, boost::dfs_visitor<> > >::~CopyConstructibleConcept()’
165 | BOOST_concept(CopyConstructible,(TT))
| ^~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/preprocessor/cat.hpp:29:34: note: in definition of macro ‘BOOST_PP_CAT_I’
29 | # define BOOST_PP_CAT_I(a, b) a ## b
| ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/concept_def.hpp:23:12: note: in expansion of macro ‘BOOST_PP_CAT’
23 | struct BOOST_PP_CAT(name,Concept) \
| ^~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:165:3: note: in expansion of macro ‘BOOST_concept’
165 | BOOST_concept(CopyConstructible,(TT))
| ^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::CopyConstructible<boost::detail::biconnected_components_visitor<boost::dummy_property_map, boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>, std::back_insert_iterator<std::vector<long unsigned int> >, std::stack<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::deque<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > > >, std::vector<char>, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, boost::dfs_visitor<> > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/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::biconnected_components_visitor<boost::dummy_property_map, boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>, std::back_insert_iterator<std::vector<long unsigned int> >, std::stack<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::deque<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > > >, std::vector<char>, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, boost::dfs_visitor<> > > >]’
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:167:5: required from ‘struct boost::CopyConstructible<boost::detail::biconnected_components_visitor<boost::dummy_property_map, boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>, std::back_insert_iterator<std::vector<long unsigned int> >, std::stack<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::deque<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > > >, std::vector<char>, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, boost::dfs_visitor<> > >’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:165:3: required from ‘struct boost::CopyConstructibleConcept<boost::detail::biconnected_components_visitor<boost::dummy_property_map, boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>, std::back_insert_iterator<std::vector<long unsigned int> >, std::stack<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::deque<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > > >, std::vector<char>, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, boost::dfs_visitor<> > >’
165 | BOOST_concept(CopyConstructible,(TT))
| ^~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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::biconnected_components_visitor<boost::dummy_property_map, boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>, std::back_insert_iterator<std::vector<long unsigned int> >, std::stack<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::deque<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > > >, std::vector<char>, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, boost::dfs_visitor<> > >]’
32 | inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
| ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied<boost::CopyConstructibleConcept<boost::detail::biconnected_components_visitor<boost::dummy_property_map, boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>, std::back_insert_iterator<std::vector<long unsigned int> >, std::stack<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::deque<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > > >, std::vector<char>, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, boost::dfs_visitor<> > > >::value’
44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 12 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/biconnected_components.hpp:250:47: required from ‘static std::pair<long unsigned int, OutputIterator> boost::detail::bicomp_dispatch3<boost::param_not_found>::apply(const Graph&, ComponentMap, OutputIterator, VertexIndexMap, DiscoverTimeMap, LowPointMap, const boost::bgl_named_params<P, T, R>&, boost::param_not_found) [with Graph = R_adjacency_list<boost::undirectedS, double>; ComponentMap = boost::dummy_property_map; OutputIterator = std::back_insert_iterator<std::vector<long unsigned int> >; VertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>; DiscoverTimeMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; LowPointMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; P = int; T = boost::buffer_param_t; R = boost::no_property]’
250 | return biconnected_components_impl(g, comp, out, index_map, dtm,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
251 | lowpt,
| ~~~~~~
252 | make_iterator_property_map(pred.begin(), index_map, vert),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
253 | choose_param(get_param(params, graph_visitor),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
254 | make_dfs_visitor(null_visitor())));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/biconnected_components.hpp:295:60: required from ‘static std::pair<long unsigned int, OutputIterator> boost::detail::bicomp_dispatch2<boost::param_not_found>::apply(const Graph&, ComponentMap, OutputIterator, VertexIndexMap, DiscoverTimeMap, const boost::bgl_named_params<P, T, R>&, boost::param_not_found) [with Graph = R_adjacency_list<boost::undirectedS, double>; ComponentMap = boost::dummy_property_map; OutputIterator = std::back_insert_iterator<std::vector<long unsigned int> >; VertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>; DiscoverTimeMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; P = int; T = boost::buffer_param_t; R = boost::no_property]’
295 | return bicomp_dispatch3< dispatch_type >::apply(g, comp, out,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
296 | index_map, dtm,
| ~~~~~~~~~~~~~~~
297 | make_iterator_property_map(lowpt.begin(), index_map, vst),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
298 | params, get_param(params, vertex_predecessor));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/biconnected_components.hpp:336:60: required from ‘static std::pair<long unsigned int, OutputIterator> boost::detail::bicomp_dispatch1<boost::param_not_found>::apply(const Graph&, ComponentMap, OutputIterator, VertexIndexMap, const boost::bgl_named_params<P, T, R>&, boost::param_not_found) [with Graph = R_adjacency_list<boost::undirectedS, double>; ComponentMap = boost::dummy_property_map; OutputIterator = std::back_insert_iterator<std::vector<long unsigned int> >; VertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>; P = int; T = boost::buffer_param_t; R = boost::no_property]’
336 | return bicomp_dispatch2< dispatch_type >::apply(g, comp, out,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
337 | index_map,
| ~~~~~~~~~~
338 | make_iterator_property_map(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~
339 | discover_time.begin(), index_map, vst),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
340 | params, get_param(params, vertex_lowpoint));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/biconnected_components.hpp:368:60: required from ‘std::pair<long unsigned int, OutputIterator> boost::biconnected_components(const Graph&, ComponentMap, OutputIterator, const bgl_named_params<P, T, R>&) [with Graph = R_adjacency_list<undirectedS, double>; ComponentMap = dummy_property_map; OutputIterator = std::back_insert_iterator<std::vector<long unsigned int> >; P = int; T = buffer_param_t; R = no_property]’
368 | return detail::bicomp_dispatch1< dispatch_type >::apply(g, comp, out,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
369 | choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
370 | params, get_param(params, vertex_discover_time));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/biconnected_components.hpp:433:34: required from ‘OutputIterator boost::articulation_points(const Graph&, OutputIterator) [with Graph = R_adjacency_list<undirectedS, double>; OutputIterator = std::back_insert_iterator<std::vector<long unsigned int> >]’
433 | return biconnected_components(g, dummy_property_map(), out,
| ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
434 | bgl_named_params< int, buffer_param_t >(0))
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
interfaces.cpp:300:28: required from here
300 | articulation_points(g, std::back_inserter(art_points));
| ~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
20 | ~usage_requirements() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/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::biconnected_components_visitor<boost::dummy_property_map, boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>, std::back_insert_iterator<std::vector<long unsigned int> >, std::stack<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::deque<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > > >, std::vector<char>, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, boost::dfs_visitor<> >]’
37 | ~model()
| ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:167:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
167 | BOOST_CONCEPT_USAGE(CopyConstructible) {
| ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Convertible<boost::iterators::detail::iterator_category_with_traversal<std::input_iterator_tag, boost::iterators::bidirectional_traversal_tag>, std::input_iterator_tag>]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Convertible<boost::iterators::detail::iterator_category_with_traversal<std::input_iterator_tag, boost::iterators::bidirectional_traversal_tag>, std::input_iterator_tag> >]’
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible<boost::iterators::detail::iterator_category_with_traversal<std::input_iterator_tag, boost::iterators::bidirectional_traversal_tag>, std::input_iterator_tag>’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::Convertible<boost::iterators::detail::iterator_category_with_traversal<std::input_iterator_tag, boost::iterators::bidirectional_traversal_tag>, std::input_iterator_tag>]’
32 | inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
| ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied<boost::Convertible<boost::iterators::detail::iterator_category_with_traversal<std::input_iterator_tag, boost::iterators::bidirectional_traversal_tag>, std::input_iterator_tag> >::value’
44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied<boost::Convertible<boost::iterators::detail::iterator_category_with_traversal<std::input_iterator_tag, boost::iterators::bidirectional_traversal_tag>, std::input_iterator_tag> >’
45 | typedef boost::integral_constant<bool, value> type;
| ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 7 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/depth_first_search.hpp:129:9: required from ‘void boost::breadth_first_visit(const IncidenceGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with IncidenceGraph = filtered_graph<adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, no_property, listS>, is_residual_edge<adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_residual_capacity_t> >, keep_all>; Buffer = queue<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > >; BFSVisitor = bfs_visitor<edge_predecessor_recorder<detail::edge_desc_impl<directed_tag, long unsigned int>*, on_tree_edge> >; ColorMap = default_color_type*; SourceIterator = long unsigned int*]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:136:24: required from ‘void boost::breadth_first_search(const VertexListGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph<adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, no_property, listS>, is_residual_edge<adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_residual_capacity_t> >, keep_all>; SourceIterator = long unsigned int*; Buffer = queue<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > >; BFSVisitor = bfs_visitor<edge_predecessor_recorder<detail::edge_desc_impl<directed_tag, long unsigned int>*, on_tree_edge> >; ColorMap = default_color_type*]’
136 | breadth_first_visit(g, sources_begin, sources_end, Q, vis, color);
| ~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:147:25: required from ‘void boost::breadth_first_search(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph<adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, no_property, listS>, is_residual_edge<adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_residual_capacity_t> >, keep_all>; Buffer = queue<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > >; BFSVisitor = bfs_visitor<edge_predecessor_recorder<detail::edge_desc_impl<directed_tag, long unsigned int>*, on_tree_edge> >; ColorMap = default_color_type*; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
147 | breadth_first_search(g, sources, sources + 1, Q, vis, color);
| ~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/edmonds_karp_max_flow.hpp:101:29: required from ‘typename boost::property_traits<IndexMap>::value_type boost::edmonds_karp_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, ColorMap, PredEdgeMap) [with Graph = adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, no_property, listS>; CapacityEdgeMap = adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map<directed_tag, detail::edge_desc_impl<directed_tag, long unsigned int>, detail::edge_desc_impl<directed_tag, long unsigned int>&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_reverse_t>; ColorMap = default_color_type*; PredEdgeMap = detail::edge_desc_impl<directed_tag, long unsigned int>*; typename property_traits<IndexMap>::value_type = long unsigned int; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
101 | breadth_first_search(detail::residual_graph(g, res), src, Q,
| ~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
102 | make_bfs_visitor(record_edge_predecessors(pred, on_tree_edge())),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
103 | color);
| ~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/edge_connectivity.hpp:146:42: required from ‘typename boost::graph_traits<G>::degree_size_type boost::edge_connectivity(VertexListGraph&, OutputIterator) [with VertexListGraph = R_adjacency_list<undirectedS, double>; OutputIterator = std::back_insert_iterator<std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int> > >; typename graph_traits<G>::degree_size_type = long unsigned int]’
146 | alpha_S_k = edmonds_karp_max_flow(
| ~~~~~~~~~~~~~~~~~~~~~^
147 | flow_g, p, k, cap, res_cap, rev_edge, &color[0], &pred[0]);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
interfaces.cpp:326:34: required from here
326 | dst c = edge_connectivity( g, std::back_inserter(disconnecting_set) );
| ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
20 | ~usage_requirements() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible<X, Y>::~Convertible() [with X = boost::iterators::detail::iterator_category_with_traversal<std::input_iterator_tag, boost::iterators::bidirectional_traversal_tag>; Y = std::input_iterator_tag]’
37 | ~model()
| ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
208 | BOOST_CONCEPT_USAGE(Convertible) {
| ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::CopyConstructible<boost::detail::tarjan_scc_visitor<int*, boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>, std::stack<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > > > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/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::tarjan_scc_visitor<int*, boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>, std::stack<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > > > > >]’
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:167:5: required from ‘struct boost::CopyConstructible<boost::detail::tarjan_scc_visitor<int*, boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>, std::stack<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > > > >’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:165:3: required from ‘struct boost::CopyConstructibleConcept<boost::detail::tarjan_scc_visitor<int*, boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>, std::stack<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > > > >’
165 | BOOST_concept(CopyConstructible,(TT))
| ^~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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::tarjan_scc_visitor<int*, boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>, std::stack<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > > > >]’
32 | inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
| ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied<boost::CopyConstructibleConcept<boost::detail::tarjan_scc_visitor<int*, boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>, std::stack<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > > > > >::value’
44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 13 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/strong_components.hpp:177:63: required from ‘typename boost::property_traits<IndexMap>::value_type boost::detail::scc_helper2(const Graph&, ComponentMap, RootMap, const boost::bgl_named_params<P, T, R>&, DiscoverTimeMap) [with Graph = R_adjacency_list<boost::directedS, double>; ComponentMap = int*; RootMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; P = int; T = int; R = boost::no_property; DiscoverTimeMap = boost::param_not_found; typename boost::property_traits<IndexMap>::value_type = int]’
177 | return strong_comp_dispatch2< DiscoverTimeMap >::apply(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
178 | g, comp, r_map, params, time_map);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/strong_components.hpp:205:31: required from ‘static typename boost::property_traits<IndexMap>::value_type boost::detail::strong_comp_dispatch1<boost::param_not_found>::apply(const Graph&, ComponentMap, const boost::bgl_named_params<P, T, R>&, boost::param_not_found) [with Graph = R_adjacency_list<boost::directedS, double>; ComponentMap = int*; P = int; T = int; R = boost::no_property; typename boost::property_traits<IndexMap>::value_type = int]’
205 | return scc_helper2(g, comp,
| ~~~~~~~~~~~^~~~~~~~~
206 | make_iterator_property_map(root_vec.begin(),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
207 | choose_const_pmap(
| ~~~~~~~~~~~~~~~~~~
208 | get_param(params, vertex_index), g, vertex_index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
209 | root_vec[0]),
| ~~~~~~~~~~~~~
210 | params, get_param(params, vertex_discover_time));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/strong_components.hpp:220:63: required from ‘typename boost::property_traits<IndexMap>::value_type boost::detail::scc_helper1(const Graph&, ComponentMap, const boost::bgl_named_params<P, T, R>&, RootMap) [with Graph = R_adjacency_list<boost::directedS, double>; ComponentMap = int*; RootMap = boost::param_not_found; P = int; T = int; R = boost::no_property; typename boost::property_traits<IndexMap>::value_type = int]’
220 | return detail::strong_comp_dispatch1< RootMap >::apply(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
221 | g, comp, params, r_map);
| ~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/strong_components.hpp:235:31: required from ‘typename boost::property_traits<IndexMap>::value_type boost::strong_components(const Graph&, ComponentMap, const bgl_named_params<P, T, R>&, typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = R_adjacency_list<directedS, double>; ComponentMap = int*; P = int; T = int; R = no_property; typename property_traits<IndexMap>::value_type = int; typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits<Graph>::traversal_category = adj_list_dir_traversal_tag]’
235 | return detail::scc_helper1(
| ~~~~~~~~~~~~~~~~~~~^
236 | g, comp, params, get_param(params, vertex_root_t()));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/strong_components.hpp:249:29: required from ‘typename boost::property_traits<IndexMap>::value_type boost::strong_components(const Graph&, ComponentMap, typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = R_adjacency_list<directedS, double>; ComponentMap = int*; typename property_traits<IndexMap>::value_type = int; typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits<Graph>::traversal_category = adj_list_dir_traversal_tag]’
249 | return strong_components(g, comp, params);
| ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~
interfaces.cpp:232:26: required from here
232 | strong_components(g, &component[0]);
| ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
20 | ~usage_requirements() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/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::tarjan_scc_visitor<int*, boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>, std::stack<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > > >]’
37 | ~model()
| ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:167:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
167 | BOOST_CONCEPT_USAGE(CopyConstructible) {
| ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::CopyConstructible<boost::detail::biconnected_components_visitor<boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>, boost::graph_detail::dummy_output_iterator, std::stack<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::deque<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > > >, std::vector<char>, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, boost::dfs_visitor<> > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/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::biconnected_components_visitor<boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>, boost::graph_detail::dummy_output_iterator, std::stack<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::deque<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > > >, std::vector<char>, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, boost::dfs_visitor<> > > >]’
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:167:5: required from ‘struct boost::CopyConstructible<boost::detail::biconnected_components_visitor<boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>, boost::graph_detail::dummy_output_iterator, std::stack<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::deque<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > > >, std::vector<char>, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, boost::dfs_visitor<> > >’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:165:3: required from ‘struct boost::CopyConstructibleConcept<boost::detail::biconnected_components_visitor<boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>, boost::graph_detail::dummy_output_iterator, std::stack<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::deque<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > > >, std::vector<char>, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, boost::dfs_visitor<> > >’
165 | BOOST_concept(CopyConstructible,(TT))
| ^~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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::biconnected_components_visitor<boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>, boost::graph_detail::dummy_output_iterator, std::stack<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::deque<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > > >, std::vector<char>, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, boost::dfs_visitor<> > >]’
32 | inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
| ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied<boost::CopyConstructibleConcept<boost::detail::biconnected_components_visitor<boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>, boost::graph_detail::dummy_output_iterator, std::stack<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::deque<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > > >, std::vector<char>, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, boost::dfs_visitor<> > > >::value’
44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 13 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/biconnected_components.hpp:295:60: required from ‘static std::pair<long unsigned int, OutputIterator> boost::detail::bicomp_dispatch2<boost::param_not_found>::apply(const Graph&, ComponentMap, OutputIterator, VertexIndexMap, DiscoverTimeMap, const boost::bgl_named_params<P, T, R>&, boost::param_not_found) [with Graph = R_adjacency_list<boost::undirectedS, double>; ComponentMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>; OutputIterator = boost::graph_detail::dummy_output_iterator; VertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>; DiscoverTimeMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; P = int; T = boost::buffer_param_t; R = boost::no_property]’
295 | return bicomp_dispatch3< dispatch_type >::apply(g, comp, out,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
296 | index_map, dtm,
| ~~~~~~~~~~~~~~~
297 | make_iterator_property_map(lowpt.begin(), index_map, vst),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
298 | params, get_param(params, vertex_predecessor));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/biconnected_components.hpp:336:60: required from ‘static std::pair<long unsigned int, OutputIterator> boost::detail::bicomp_dispatch1<boost::param_not_found>::apply(const Graph&, ComponentMap, OutputIterator, VertexIndexMap, const boost::bgl_named_params<P, T, R>&, boost::param_not_found) [with Graph = R_adjacency_list<boost::undirectedS, double>; ComponentMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>; OutputIterator = boost::graph_detail::dummy_output_iterator; VertexIndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>; P = int; T = boost::buffer_param_t; R = boost::no_property]’
336 | return bicomp_dispatch2< dispatch_type >::apply(g, comp, out,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
337 | index_map,
| ~~~~~~~~~~
338 | make_iterator_property_map(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~
339 | discover_time.begin(), index_map, vst),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
340 | params, get_param(params, vertex_lowpoint));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/biconnected_components.hpp:368:60: required from ‘std::pair<long unsigned int, OutputIterator> boost::biconnected_components(const Graph&, ComponentMap, OutputIterator, const bgl_named_params<P, T, R>&) [with Graph = R_adjacency_list<undirectedS, double>; ComponentMap = adj_list_edge_property_map<undirected_tag, double, double&, long unsigned int, property<edge_weight_t, double, no_property>, edge_weight_t>; OutputIterator = graph_detail::dummy_output_iterator; P = int; T = buffer_param_t; R = no_property]’
368 | return detail::bicomp_dispatch1< dispatch_type >::apply(g, comp, out,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
369 | choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
370 | params, get_param(params, vertex_discover_time));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/biconnected_components.hpp:377:34: required from ‘std::pair<long unsigned int, OutputIterator> boost::biconnected_components(const Graph&, ComponentMap, OutputIterator) [with Graph = R_adjacency_list<undirectedS, double>; ComponentMap = adj_list_edge_property_map<undirected_tag, double, double&, long unsigned int, property<edge_weight_t, double, no_property>, edge_weight_t>; OutputIterator = graph_detail::dummy_output_iterator]’
377 | return biconnected_components(
| ~~~~~~~~~~~~~~~~~~~~~~^
378 | g, comp, out, bgl_named_params< int, buffer_param_t >(0));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/biconnected_components.hpp:417:34: required from ‘std::size_t boost::biconnected_components(const Graph&, ComponentMap) [with Graph = R_adjacency_list<undirectedS, double>; ComponentMap = adj_list_edge_property_map<undirected_tag, double, double&, long unsigned int, property<edge_weight_t, double, no_property>, edge_weight_t>; std::size_t = long unsigned int]’
417 | return biconnected_components(
| ~~~~~~~~~~~~~~~~~~~~~~^
418 | g, comp, graph_detail::dummy_output_iterator())
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
interfaces.cpp:264:47: required from here
264 | int num_comps = biconnected_components(g, component);
| ~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
20 | ~usage_requirements() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/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::biconnected_components_visitor<boost::adj_list_edge_property_map<boost::undirected_tag, double, double&, long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>, boost::graph_detail::dummy_output_iterator, std::stack<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::deque<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > > >, std::vector<char>, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, boost::dfs_visitor<> >]’
37 | ~model()
| ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:167:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
167 | BOOST_CONCEPT_USAGE(CopyConstructible) {
| ^~~~~~~~~~~~~~~~~~~
In file included from /home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/tuple/tuple.hpp:28,
from /home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_traits.hpp:16,
from RBGL.hpp:37:
In member function ‘boost::tuples::tuple<T0, T1, T2, T3, T4, T5, T6, T7, T8, T9>& boost::tuples::tuple<T0, T1, T2, T3, T4, T5, T6, T7, T8, T9>::operator=(const std::pair<_U1, _U2>&) [with U1 = long unsigned int; U2 = long unsigned int; T0 = long unsigned int&; T1 = long unsigned int&; T2 = boost::tuples::null_type; T3 = boost::tuples::null_type; T4 = boost::tuples::null_type; T5 = boost::tuples::null_type; T6 = boost::tuples::null_type; T7 = boost::tuples::null_type; T8 = boost::tuples::null_type; T9 = boost::tuples::null_type]’,
inlined from ‘typename boost::graph_traits<G>::degree_size_type boost::edge_connectivity(VertexListGraph&, OutputIterator) [with VertexListGraph = R_adjacency_list<undirectedS, double>; OutputIterator = std::back_insert_iterator<std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int> > >]’ at /home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/edge_connectivity.hpp:130:26:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/tuple/detail/tuple_basic.hpp:592:16: warning: ‘p’ may be used uninitialized [-Wmaybe-uninitialized]
592 | this->head = k.first;
| ~~~~~~~~~~~^~~~~~~~~
In file included from interfaces.cpp:7:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/edge_connectivity.hpp: In function ‘typename boost::graph_traits<G>::degree_size_type boost::edge_connectivity(VertexListGraph&, OutputIterator) [with VertexListGraph = R_adjacency_list<undirectedS, double>; OutputIterator = std::back_insert_iterator<std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int> > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/edge_connectivity.hpp:34:44: note: ‘p’ was declared here
34 | typename Traits::vertex_descriptor p;
| ^
/opt/ohpc/pub/compiler/gcc/14.2.0/bin/aarch64-unknown-linux-gnu-g++ -std=gnu++17 -I"/home/biocbuild/R/R/include" -DNDEBUG -I'/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include' -I/usr/local/include -fPIC -g -O2 -Wall -Werror=format-security -DR_NO_REMAP -c minST.cpp -o minST.o
In file included from minST.cpp:1:
RBGL.hpp:41:9: warning: "R_NO_REMAP" redefined
41 | #define R_NO_REMAP
| ^~~~~~~~~~
<command-line>: note: this is the location of the previous definition
In file included from /home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:22,
from RBGL.hpp:17:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/mpl/assert.hpp:194:21: warning: unnecessary parentheses in declaration of ‘assert_arg’ [-Wparentheses]
194 | failed ************ (Pred::************
| ^~~~~~~~~~~~~~~~~~~
195 | assert_arg( void (*)(Pred), typename assert_arg_pred<Pred>::type )
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
196 | );
| ~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/mpl/assert.hpp:194:21: note: remove parentheses
194 | failed ************ (Pred::************
| ^~~~~~~~~~~~~~~~~~~
| -
195 | assert_arg( void (*)(Pred), typename assert_arg_pred<Pred>::type )
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
196 | );
| ~
| -
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/mpl/assert.hpp:199:21: warning: unnecessary parentheses in declaration of ‘assert_not_arg’ [-Wparentheses]
199 | failed ************ (boost::mpl::not_<Pred>::************
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
200 | assert_not_arg( void (*)(Pred), typename assert_arg_pred_not<Pred>::type )
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
201 | );
| ~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/mpl/assert.hpp:199:21: note: remove parentheses
199 | failed ************ (boost::mpl::not_<Pred>::************
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
| -
200 | assert_not_arg( void (*)(Pred), typename assert_arg_pred_not<Pred>::type )
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
201 | );
| ~
| -
In file included from /home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/smart_ptr/shared_ptr.hpp:17,
from /home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/vector_property_map.hpp:14,
from /home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:598:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/smart_ptr/detail/shared_count.hpp:326:33: warning: ‘template<class> class std::auto_ptr’ is deprecated: use 'std::unique_ptr' instead [-Wdeprecated-declarations]
326 | explicit shared_count( std::auto_ptr<Y> & r ): pi_( new sp_counted_impl_p<Y>( r.get() ) )
| ^~~~~~~~
In file included from /opt/ohpc/pub/compiler/gcc/14.2.0/include/c++/14.2.0/memory:78,
from /home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/smart_ptr/detail/sp_counted_impl.hpp:35,
from /home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/smart_ptr/detail/shared_count.hpp:23:
/opt/ohpc/pub/compiler/gcc/14.2.0/include/c++/14.2.0/bits/unique_ptr.h:59:28: note: declared here
59 | template<typename> class auto_ptr;
| ^~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/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()
| ^~~~~~~~
/opt/ohpc/pub/compiler/gcc/14.2.0/include/c++/14.2.0/bits/unique_ptr.h:59:28: note: declared here
59 | template<typename> class auto_ptr;
| ^~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/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()
| ^~~~~~~~
/opt/ohpc/pub/compiler/gcc/14.2.0/include/c++/14.2.0/bits/unique_ptr.h:59:28: note: declared here
59 | template<typename> class auto_ptr;
| ^~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/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 )
| ^~~~~~~~
/opt/ohpc/pub/compiler/gcc/14.2.0/include/c++/14.2.0/bits/unique_ptr.h:59:28: note: declared here
59 | template<typename> class auto_ptr;
| ^~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/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 )
| ^~~~~~~~
/opt/ohpc/pub/compiler/gcc/14.2.0/include/c++/14.2.0/bits/unique_ptr.h:59:28: note: declared here
59 | template<typename> class auto_ptr;
| ^~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/smart_ptr/shared_ptr.hpp: In member function ‘boost::shared_ptr<T>& boost::shared_ptr<T>::operator=(std::auto_ptr<_Up>&&)’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/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 );
| ^~~~~~~~
/opt/ohpc/pub/compiler/gcc/14.2.0/include/c++/14.2.0/bits/unique_ptr.h:59:28: note: declared here
59 | template<typename> class auto_ptr;
| ^~~~~~~~
In file included from /home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/scoped_ptr.hpp:13,
from /home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/adjacency_list.hpp:22,
from RBGL.hpp:38:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/smart_ptr/scoped_ptr.hpp: At global scope:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/smart_ptr/scoped_ptr.hpp:75:31: warning: ‘template<class> class std::auto_ptr’ is deprecated: use 'std::unique_ptr' instead [-Wdeprecated-declarations]
75 | explicit scoped_ptr( std::auto_ptr<T> p ) noexcept : px( p.release() )
| ^~~~~~~~
/opt/ohpc/pub/compiler/gcc/14.2.0/include/c++/14.2.0/bits/unique_ptr.h:59:28: note: declared here
59 | template<typename> class auto_ptr;
| ^~~~~~~~
minST.cpp: In function ‘SEXPREC* BGL_KMST_D(SEXP, SEXP, SEXP, SEXP)’:
minST.cpp:14:62: warning: typedef ‘Vertex’ locally defined but not used [-Wunused-local-typedefs]
14 | typedef graph_traits < Graph_dd >::vertex_descriptor Vertex;
| ^~~~~~
minST.cpp: In function ‘SEXPREC* BGL_KMST_U(SEXP, SEXP, SEXP, SEXP)’:
minST.cpp:48:62: warning: typedef ‘Vertex’ locally defined but not used [-Wunused-local-typedefs]
48 | typedef graph_traits < Graph_ud >::vertex_descriptor Vertex;
| ^~~~~~
minST.cpp: In function ‘SEXPREC* BGL_PRIM_U(SEXP, SEXP, SEXP, SEXP)’:
minST.cpp:81:60: warning: typedef ‘Edge’ locally defined but not used [-Wunused-local-typedefs]
81 | typedef graph_traits < Graph_ud >::edge_descriptor Edge;
| ^~~~
In file included from /home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/assert.hpp:35,
from /home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:19:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Assignable<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:145:5: required from ‘struct boost::Assignable<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > >’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > >’
502 | BOOST_concept(InputIterator,(TT))
| ^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:540:3: required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > >’
540 | BOOST_concept(ForwardIterator,(TT))
| ^~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > >’
568 | BOOST_concept(BidirectionalIterator,(TT))
| ^~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > >’
597 | BOOST_concept(RandomAccessIterator,(TT))
| ^~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied<boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > > >::value’
44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied<boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > > >’
45 | typedef boost::integral_constant<bool, value> type;
| ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_<void (*)(boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > >)>’
72 | struct requirement_<void(*)(Model)>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map<RAIter, ID, Value, Value&> boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >; Value = long unsigned int; ID = vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:113:35: required from ‘void boost::kruskal_minimum_spanning_tree(const Graph&, OutputIterator) [with Graph = R_adjacency_list<directedS, double>; OutputIterator = std::back_insert_iterator<std::vector<detail::edge_desc_impl<directed_tag, long unsigned int> > >]’
113 | make_iterator_property_map(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^
114 | rank_map.begin(), get(vertex_index, g), rank_map[0]),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
minST.cpp:20:38: required from here
20 | kruskal_minimum_spanning_tree(g, std::back_inserter(spanning_tree));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
In file included from /home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:31,
from /home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:20:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Assignable<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > >]’
20 | ~usage_requirements() { ((Model*)0)->~Model(); }
| ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::EqualityComparable<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > >’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > >’
502 | BOOST_concept(InputIterator,(TT))
| ^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:540:3: required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > >’
540 | BOOST_concept(ForwardIterator,(TT))
| ^~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > >’
568 | BOOST_concept(BidirectionalIterator,(TT))
| ^~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > >’
597 | BOOST_concept(RandomAccessIterator,(TT))
| ^~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied<boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > > >::value’
44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied<boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > > >’
45 | typedef boost::integral_constant<bool, value> type;
| ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_<void (*)(boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > >)>’
72 | struct requirement_<void(*)(Model)>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map<RAIter, ID, Value, Value&> boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >; Value = long unsigned int; ID = vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:113:35: required from ‘void boost::kruskal_minimum_spanning_tree(const Graph&, OutputIterator) [with Graph = R_adjacency_list<directedS, double>; OutputIterator = std::back_insert_iterator<std::vector<detail::edge_desc_impl<directed_tag, long unsigned int> > >]’
113 | make_iterator_property_map(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^
114 | rank_map.begin(), get(vertex_index, g), rank_map[0]),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
minST.cpp:20:38: required from here
20 | kruskal_minimum_spanning_tree(g, std::back_inserter(spanning_tree));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::EqualityComparable<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > >]’
20 | ~usage_requirements() { ((Model*)0)->~Model(); }
| ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::InputIterator<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:512:7: required from ‘struct boost::InputIterator<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > >’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:540:3: required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > >’
540 | BOOST_concept(ForwardIterator,(TT))
| ^~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > >’
568 | BOOST_concept(BidirectionalIterator,(TT))
| ^~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > >’
597 | BOOST_concept(RandomAccessIterator,(TT))
| ^~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied<boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > > >::value’
44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied<boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > > >’
45 | typedef boost::integral_constant<bool, value> type;
| ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_<void (*)(boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > >)>’
72 | struct requirement_<void(*)(Model)>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map<RAIter, ID, Value, Value&> boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >; Value = long unsigned int; ID = vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:113:35: required from ‘void boost::kruskal_minimum_spanning_tree(const Graph&, OutputIterator) [with Graph = R_adjacency_list<directedS, double>; OutputIterator = std::back_insert_iterator<std::vector<detail::edge_desc_impl<directed_tag, long unsigned int> > >]’
113 | make_iterator_property_map(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^
114 | rank_map.begin(), get(vertex_index, g), rank_map[0]),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
minST.cpp:20:38: required from here
20 | kruskal_minimum_spanning_tree(g, std::back_inserter(spanning_tree));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::InputIterator<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > >]’
20 | ~usage_requirements() { ((Model*)0)->~Model(); }
| ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::ForwardIterator<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:543:7: required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > >’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > >’
568 | BOOST_concept(BidirectionalIterator,(TT))
| ^~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > >’
597 | BOOST_concept(RandomAccessIterator,(TT))
| ^~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > >’
597 | BOOST_concept(RandomAccessIterator,(TT))
| ^~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > >]’
32 | inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
| ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied<boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > > >::value’
44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied<boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > > >’
45 | typedef boost::integral_constant<bool, value> type;
| ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_<void (*)(boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > >)>’
72 | struct requirement_<void(*)(Model)>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map<RAIter, ID, Value, Value&> boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >; Value = long unsigned int; ID = vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:113:35: required from ‘void boost::kruskal_minimum_spanning_tree(const Graph&, OutputIterator) [with Graph = R_adjacency_list<directedS, double>; OutputIterator = std::back_insert_iterator<std::vector<detail::edge_desc_impl<directed_tag, long unsigned int> > >]’
113 | make_iterator_property_map(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^
114 | rank_map.begin(), get(vertex_index, g), rank_map[0]),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
minST.cpp:20:38: required from here
20 | kruskal_minimum_spanning_tree(g, std::back_inserter(spanning_tree));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::ForwardIterator<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > >]’
20 | ~usage_requirements() { ((Model*)0)->~Model(); }
| ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::BidirectionalIterator<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:571:7: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > >’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > >’
597 | BOOST_concept(RandomAccessIterator,(TT))
| ^~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > >’
597 | BOOST_concept(RandomAccessIterator,(TT))
| ^~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > >]’
32 | inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
| ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied<boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > > >::value’
44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied<boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > > >’
45 | typedef boost::integral_constant<bool, value> type;
| ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_<void (*)(boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > >)>’
72 | struct requirement_<void(*)(Model)>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map<RAIter, ID, Value, Value&> boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >; Value = long unsigned int; ID = vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:113:35: required from ‘void boost::kruskal_minimum_spanning_tree(const Graph&, OutputIterator) [with Graph = R_adjacency_list<directedS, double>; OutputIterator = std::back_insert_iterator<std::vector<detail::edge_desc_impl<directed_tag, long unsigned int> > >]’
113 | make_iterator_property_map(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^
114 | rank_map.begin(), get(vertex_index, g), rank_map[0]),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
minST.cpp:20:38: required from here
20 | kruskal_minimum_spanning_tree(g, std::back_inserter(spanning_tree));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::BidirectionalIterator<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > >]’
20 | ~usage_requirements() { ((Model*)0)->~Model(); }
| ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Comparable<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:253:5: required from ‘struct boost::Comparable<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > >’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > >’
597 | BOOST_concept(RandomAccessIterator,(TT))
| ^~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > >’
597 | BOOST_concept(RandomAccessIterator,(TT))
| ^~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > >]’
32 | inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
| ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied<boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > > >::value’
44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied<boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > > >’
45 | typedef boost::integral_constant<bool, value> type;
| ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_<void (*)(boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > >)>’
72 | struct requirement_<void(*)(Model)>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map<RAIter, ID, Value, Value&> boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >; Value = long unsigned int; ID = vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:113:35: required from ‘void boost::kruskal_minimum_spanning_tree(const Graph&, OutputIterator) [with Graph = R_adjacency_list<directedS, double>; OutputIterator = std::back_insert_iterator<std::vector<detail::edge_desc_impl<directed_tag, long unsigned int> > >]’
113 | make_iterator_property_map(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^
114 | rank_map.begin(), get(vertex_index, g), rank_map[0]),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
minST.cpp:20:38: required from here
20 | kruskal_minimum_spanning_tree(g, std::back_inserter(spanning_tree));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Comparable<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > >]’
20 | ~usage_requirements() { ((Model*)0)->~Model(); }
| ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::RandomAccessIterator<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:601:7: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > >’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > >’
597 | BOOST_concept(RandomAccessIterator,(TT))
| ^~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > >]’
32 | inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
| ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied<boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > > >::value’
44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied<boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > > >’
45 | typedef boost::integral_constant<bool, value> type;
| ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_<void (*)(boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > >)>’
72 | struct requirement_<void(*)(Model)>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map<RAIter, ID, Value, Value&> boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >; Value = long unsigned int; ID = vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:113:35: required from ‘void boost::kruskal_minimum_spanning_tree(const Graph&, OutputIterator) [with Graph = R_adjacency_list<directedS, double>; OutputIterator = std::back_insert_iterator<std::vector<detail::edge_desc_impl<directed_tag, long unsigned int> > >]’
113 | make_iterator_property_map(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^
114 | rank_map.begin(), get(vertex_index, g), rank_map[0]),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
minST.cpp:20:38: required from here
20 | kruskal_minimum_spanning_tree(g, std::back_inserter(spanning_tree));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::RandomAccessIterator<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > >]’
20 | ~usage_requirements() { ((Model*)0)->~Model(); }
| ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map<RAIter, ID, Value, Value&> boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >; Value = long unsigned int; ID = vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:113:35: required from ‘void boost::kruskal_minimum_spanning_tree(const Graph&, OutputIterator) [with Graph = R_adjacency_list<directedS, double>; OutputIterator = std::back_insert_iterator<std::vector<detail::edge_desc_impl<directed_tag, long unsigned int> > >]’
113 | make_iterator_property_map(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^
114 | rank_map.begin(), get(vertex_index, g), rank_map[0]),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
minST.cpp:20:38: required from here
20 | kruskal_minimum_spanning_tree(g, std::back_inserter(spanning_tree));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
In file included from /home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/preprocessor/repetition/enum_binary_params.hpp:15,
from /home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/utility/base_from_member.hpp:15,
from /home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/utility.hpp:15,
from RBGL.hpp:16:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:17: note: in a call to non-static member function ‘boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > >::~RandomAccessIteratorConcept()’
597 | BOOST_concept(RandomAccessIterator,(TT))
| ^~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/preprocessor/cat.hpp:29:34: note: in definition of macro ‘BOOST_PP_CAT_I’
29 | # define BOOST_PP_CAT_I(a, b) a ## b
| ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/concept_def.hpp:23:12: note: in expansion of macro ‘BOOST_PP_CAT’
23 | struct BOOST_PP_CAT(name,Concept) \
| ^~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3: note: in expansion of macro ‘BOOST_concept’
597 | BOOST_concept(RandomAccessIterator,(TT))
| ^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/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<R_adjacency_list<boost::directedS, double> > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:66:5: required from ‘struct boost::concepts::Graph<R_adjacency_list<boost::directedS, double> >’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:176:1: required from ‘struct boost::concepts::VertexListGraph<R_adjacency_list<boost::directedS, double> >’
176 | BOOST_concept(VertexListGraph, (G)) : Graph< G >
| ^~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:176:1: required from ‘struct boost::concepts::VertexListGraphConcept<R_adjacency_list<boost::directedS, double> >’
176 | BOOST_concept(VertexListGraph, (G)) : Graph< G >
| ^~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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<R_adjacency_list<boost::directedS, double> >]’
32 | inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
| ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied<boost::concepts::VertexListGraphConcept<R_adjacency_list<boost::directedS, double> > >::value’
44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied<boost::concepts::VertexListGraphConcept<R_adjacency_list<boost::directedS, double> > >’
45 | typedef boost::integral_constant<bool, value> type;
| ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_<void (*)(boost::concepts::VertexListGraphConcept<R_adjacency_list<boost::directedS, double> >)>’
72 | struct requirement_<void(*)(Model)>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:55:9: required from ‘void boost::detail::kruskal_mst_impl(const Graph&, OutputIterator, Rank, Parent, Weight) [with Graph = R_adjacency_list<boost::directedS, double>; OutputIterator = std::back_insert_iterator<std::vector<edge_desc_impl<boost::directed_tag, long unsigned int> > >; Rank = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; Parent = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; Weight = boost::adj_list_edge_property_map<boost::directed_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:112:29: required from ‘void boost::kruskal_minimum_spanning_tree(const Graph&, OutputIterator) [with Graph = R_adjacency_list<directedS, double>; OutputIterator = std::back_insert_iterator<std::vector<detail::edge_desc_impl<directed_tag, long unsigned int> > >]’
112 | detail::kruskal_mst_impl(g, spanning_tree_edges,
| ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
113 | make_iterator_property_map(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~
114 | rank_map.begin(), get(vertex_index, g), rank_map[0]),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
115 | make_iterator_property_map(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~
116 | pred_map.begin(), get(vertex_index, g), pred_map[0]),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
117 | get(edge_weight, g));
| ~~~~~~~~~~~~~~~~~~~~
minST.cpp:20:38: required from here
20 | kruskal_minimum_spanning_tree(g, std::back_inserter(spanning_tree));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/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<R_adjacency_list<boost::directedS, double> >]’
20 | ~usage_requirements() { ((Model*)0)->~Model(); }
| ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/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<R_adjacency_list<boost::directedS, double> > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:182:5: required from ‘struct boost::concepts::VertexListGraph<R_adjacency_list<boost::directedS, double> >’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:176:1: required from ‘struct boost::concepts::VertexListGraphConcept<R_adjacency_list<boost::directedS, double> >’
176 | BOOST_concept(VertexListGraph, (G)) : Graph< G >
| ^~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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<R_adjacency_list<boost::directedS, double> >]’
32 | inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
| ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied<boost::concepts::VertexListGraphConcept<R_adjacency_list<boost::directedS, double> > >::value’
44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied<boost::concepts::VertexListGraphConcept<R_adjacency_list<boost::directedS, double> > >’
45 | typedef boost::integral_constant<bool, value> type;
| ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_<void (*)(boost::concepts::VertexListGraphConcept<R_adjacency_list<boost::directedS, double> >)>’
72 | struct requirement_<void(*)(Model)>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:55:9: required from ‘void boost::detail::kruskal_mst_impl(const Graph&, OutputIterator, Rank, Parent, Weight) [with Graph = R_adjacency_list<boost::directedS, double>; OutputIterator = std::back_insert_iterator<std::vector<edge_desc_impl<boost::directed_tag, long unsigned int> > >; Rank = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; Parent = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; Weight = boost::adj_list_edge_property_map<boost::directed_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:112:29: required from ‘void boost::kruskal_minimum_spanning_tree(const Graph&, OutputIterator) [with Graph = R_adjacency_list<directedS, double>; OutputIterator = std::back_insert_iterator<std::vector<detail::edge_desc_impl<directed_tag, long unsigned int> > >]’
112 | detail::kruskal_mst_impl(g, spanning_tree_edges,
| ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
113 | make_iterator_property_map(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~
114 | rank_map.begin(), get(vertex_index, g), rank_map[0]),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
115 | make_iterator_property_map(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~
116 | pred_map.begin(), get(vertex_index, g), pred_map[0]),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
117 | get(edge_weight, g));
| ~~~~~~~~~~~~~~~~~~~~
minST.cpp:20:38: required from here
20 | kruskal_minimum_spanning_tree(g, std::back_inserter(spanning_tree));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/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<R_adjacency_list<boost::directedS, double> >]’
20 | ~usage_requirements() { ((Model*)0)->~Model(); }
| ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/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<R_adjacency_list<boost::directedS, double> >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:55:9: required from ‘void boost::detail::kruskal_mst_impl(const Graph&, OutputIterator, Rank, Parent, Weight) [with Graph = R_adjacency_list<boost::directedS, double>; OutputIterator = std::back_insert_iterator<std::vector<edge_desc_impl<boost::directed_tag, long unsigned int> > >; Rank = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; Parent = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; Weight = boost::adj_list_edge_property_map<boost::directed_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:112:29: required from ‘void boost::kruskal_minimum_spanning_tree(const Graph&, OutputIterator) [with Graph = R_adjacency_list<directedS, double>; OutputIterator = std::back_insert_iterator<std::vector<detail::edge_desc_impl<directed_tag, long unsigned int> > >]’
112 | detail::kruskal_mst_impl(g, spanning_tree_edges,
| ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
113 | make_iterator_property_map(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~
114 | rank_map.begin(), get(vertex_index, g), rank_map[0]),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
115 | make_iterator_property_map(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~
116 | pred_map.begin(), get(vertex_index, g), pred_map[0]),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
117 | get(edge_weight, g));
| ~~~~~~~~~~~~~~~~~~~~
minST.cpp:20:38: required from here
20 | kruskal_minimum_spanning_tree(g, std::back_inserter(spanning_tree));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:176:15: note: in a call to non-static member function ‘boost::concepts::VertexListGraphConcept<R_adjacency_list<boost::directedS, double> >::~VertexListGraphConcept()’
176 | BOOST_concept(VertexListGraph, (G)) : Graph< G >
| ^~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/preprocessor/cat.hpp:29:34: note: in definition of macro ‘BOOST_PP_CAT_I’
29 | # define BOOST_PP_CAT_I(a, b) a ## b
| ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/concept_def.hpp:23:12: note: in expansion of macro ‘BOOST_PP_CAT’
23 | struct BOOST_PP_CAT(name,Concept) \
| ^~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:176:1: note: in expansion of macro ‘BOOST_concept’
176 | BOOST_concept(VertexListGraph, (G)) : Graph< G >
| ^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/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<R_adjacency_list<boost::directedS, double> > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:233:5: required from ‘struct boost::concepts::EdgeListGraph<R_adjacency_list<boost::directedS, double> >’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:226:1: required from ‘struct boost::concepts::EdgeListGraphConcept<R_adjacency_list<boost::directedS, double> >’
226 | BOOST_concept(EdgeListGraph, (G)) : Graph< G >
| ^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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<R_adjacency_list<boost::directedS, double> >]’
32 | inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
| ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied<boost::concepts::EdgeListGraphConcept<R_adjacency_list<boost::directedS, double> > >::value’
44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied<boost::concepts::EdgeListGraphConcept<R_adjacency_list<boost::directedS, double> > >’
45 | typedef boost::integral_constant<bool, value> type;
| ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_<void (*)(boost::concepts::EdgeListGraphConcept<R_adjacency_list<boost::directedS, double> >)>’
72 | struct requirement_<void(*)(Model)>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:56:9: required from ‘void boost::detail::kruskal_mst_impl(const Graph&, OutputIterator, Rank, Parent, Weight) [with Graph = R_adjacency_list<boost::directedS, double>; OutputIterator = std::back_insert_iterator<std::vector<edge_desc_impl<boost::directed_tag, long unsigned int> > >; Rank = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; Parent = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; Weight = boost::adj_list_edge_property_map<boost::directed_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:112:29: required from ‘void boost::kruskal_minimum_spanning_tree(const Graph&, OutputIterator) [with Graph = R_adjacency_list<directedS, double>; OutputIterator = std::back_insert_iterator<std::vector<detail::edge_desc_impl<directed_tag, long unsigned int> > >]’
112 | detail::kruskal_mst_impl(g, spanning_tree_edges,
| ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
113 | make_iterator_property_map(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~
114 | rank_map.begin(), get(vertex_index, g), rank_map[0]),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
115 | make_iterator_property_map(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~
116 | pred_map.begin(), get(vertex_index, g), pred_map[0]),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
117 | get(edge_weight, g));
| ~~~~~~~~~~~~~~~~~~~~
minST.cpp:20:38: required from here
20 | kruskal_minimum_spanning_tree(g, std::back_inserter(spanning_tree));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/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<R_adjacency_list<boost::directedS, double> >]’
20 | ~usage_requirements() { ((Model*)0)->~Model(); }
| ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/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<R_adjacency_list<boost::directedS, double> >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:56:9: required from ‘void boost::detail::kruskal_mst_impl(const Graph&, OutputIterator, Rank, Parent, Weight) [with Graph = R_adjacency_list<boost::directedS, double>; OutputIterator = std::back_insert_iterator<std::vector<edge_desc_impl<boost::directed_tag, long unsigned int> > >; Rank = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; Parent = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; Weight = boost::adj_list_edge_property_map<boost::directed_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:112:29: required from ‘void boost::kruskal_minimum_spanning_tree(const Graph&, OutputIterator) [with Graph = R_adjacency_list<directedS, double>; OutputIterator = std::back_insert_iterator<std::vector<detail::edge_desc_impl<directed_tag, long unsigned int> > >]’
112 | detail::kruskal_mst_impl(g, spanning_tree_edges,
| ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
113 | make_iterator_property_map(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~
114 | rank_map.begin(), get(vertex_index, g), rank_map[0]),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
115 | make_iterator_property_map(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~
116 | pred_map.begin(), get(vertex_index, g), pred_map[0]),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
117 | get(edge_weight, g));
| ~~~~~~~~~~~~~~~~~~~~
minST.cpp:20:38: required from here
20 | kruskal_minimum_spanning_tree(g, std::back_inserter(spanning_tree));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:226:15: note: in a call to non-static member function ‘boost::concepts::EdgeListGraphConcept<R_adjacency_list<boost::directedS, double> >::~EdgeListGraphConcept()’
226 | BOOST_concept(EdgeListGraph, (G)) : Graph< G >
| ^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/preprocessor/cat.hpp:29:34: note: in definition of macro ‘BOOST_PP_CAT_I’
29 | # define BOOST_PP_CAT_I(a, b) a ## b
| ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/concept_def.hpp:23:12: note: in expansion of macro ‘BOOST_PP_CAT’
23 | struct BOOST_PP_CAT(name,Concept) \
| ^~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:226:1: note: in expansion of macro ‘BOOST_concept’
226 | BOOST_concept(EdgeListGraph, (G)) : Graph< G >
| ^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Assignable<std::back_insert_iterator<std::vector<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:145:5: required from ‘struct boost::Assignable<std::back_insert_iterator<std::vector<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:526:3: required from ‘struct boost::OutputIterator<std::back_insert_iterator<std::vector<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > >, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> >’
526 | BOOST_concept(OutputIterator,(TT)(ValueT))
| ^~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:526:3: required from ‘struct boost::OutputIteratorConcept<std::back_insert_iterator<std::vector<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > >, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> >’
526 | BOOST_concept(OutputIterator,(TT)(ValueT))
| ^~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::OutputIteratorConcept<std::back_insert_iterator<std::vector<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > >, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> >]’
32 | inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
| ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied<boost::OutputIteratorConcept<std::back_insert_iterator<std::vector<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > >, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > >::value’
44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied<boost::OutputIteratorConcept<std::back_insert_iterator<std::vector<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > >, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > >’
45 | typedef boost::integral_constant<bool, value> type;
| ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_<void (*)(boost::OutputIteratorConcept<std::back_insert_iterator<std::vector<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > >, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> >)>’
72 | struct requirement_<void(*)(Model)>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:57:9: required from ‘void boost::detail::kruskal_mst_impl(const Graph&, OutputIterator, Rank, Parent, Weight) [with Graph = R_adjacency_list<boost::directedS, double>; OutputIterator = std::back_insert_iterator<std::vector<edge_desc_impl<boost::directed_tag, long unsigned int> > >; Rank = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; Parent = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; Weight = boost::adj_list_edge_property_map<boost::directed_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:112:29: required from ‘void boost::kruskal_minimum_spanning_tree(const Graph&, OutputIterator) [with Graph = R_adjacency_list<directedS, double>; OutputIterator = std::back_insert_iterator<std::vector<detail::edge_desc_impl<directed_tag, long unsigned int> > >]’
112 | detail::kruskal_mst_impl(g, spanning_tree_edges,
| ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
113 | make_iterator_property_map(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~
114 | rank_map.begin(), get(vertex_index, g), rank_map[0]),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
115 | make_iterator_property_map(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~
116 | pred_map.begin(), get(vertex_index, g), pred_map[0]),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
117 | get(edge_weight, g));
| ~~~~~~~~~~~~~~~~~~~~
minST.cpp:20:38: required from here
20 | kruskal_minimum_spanning_tree(g, std::back_inserter(spanning_tree));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Assignable<std::back_insert_iterator<std::vector<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >]’
20 | ~usage_requirements() { ((Model*)0)->~Model(); }
| ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::OutputIterator<std::back_insert_iterator<std::vector<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > >, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:529:5: required from ‘struct boost::OutputIterator<std::back_insert_iterator<std::vector<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > >, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> >’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:526:3: required from ‘struct boost::OutputIteratorConcept<std::back_insert_iterator<std::vector<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > >, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> >’
526 | BOOST_concept(OutputIterator,(TT)(ValueT))
| ^~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::OutputIteratorConcept<std::back_insert_iterator<std::vector<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > >, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> >]’
32 | inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
| ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied<boost::OutputIteratorConcept<std::back_insert_iterator<std::vector<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > >, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > >::value’
44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied<boost::OutputIteratorConcept<std::back_insert_iterator<std::vector<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > >, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > >’
45 | typedef boost::integral_constant<bool, value> type;
| ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_<void (*)(boost::OutputIteratorConcept<std::back_insert_iterator<std::vector<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > >, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> >)>’
72 | struct requirement_<void(*)(Model)>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:57:9: required from ‘void boost::detail::kruskal_mst_impl(const Graph&, OutputIterator, Rank, Parent, Weight) [with Graph = R_adjacency_list<boost::directedS, double>; OutputIterator = std::back_insert_iterator<std::vector<edge_desc_impl<boost::directed_tag, long unsigned int> > >; Rank = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; Parent = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; Weight = boost::adj_list_edge_property_map<boost::directed_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:112:29: required from ‘void boost::kruskal_minimum_spanning_tree(const Graph&, OutputIterator) [with Graph = R_adjacency_list<directedS, double>; OutputIterator = std::back_insert_iterator<std::vector<detail::edge_desc_impl<directed_tag, long unsigned int> > >]’
112 | detail::kruskal_mst_impl(g, spanning_tree_edges,
| ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
113 | make_iterator_property_map(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~
114 | rank_map.begin(), get(vertex_index, g), rank_map[0]),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
115 | make_iterator_property_map(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~
116 | pred_map.begin(), get(vertex_index, g), pred_map[0]),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
117 | get(edge_weight, g));
| ~~~~~~~~~~~~~~~~~~~~
minST.cpp:20:38: required from here
20 | kruskal_minimum_spanning_tree(g, std::back_inserter(spanning_tree));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::OutputIterator<std::back_insert_iterator<std::vector<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > >, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> >]’
20 | ~usage_requirements() { ((Model*)0)->~Model(); }
| ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::OutputIteratorConcept<std::back_insert_iterator<std::vector<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > >, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:57:9: required from ‘void boost::detail::kruskal_mst_impl(const Graph&, OutputIterator, Rank, Parent, Weight) [with Graph = R_adjacency_list<boost::directedS, double>; OutputIterator = std::back_insert_iterator<std::vector<edge_desc_impl<boost::directed_tag, long unsigned int> > >; Rank = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; Parent = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; Weight = boost::adj_list_edge_property_map<boost::directed_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:112:29: required from ‘void boost::kruskal_minimum_spanning_tree(const Graph&, OutputIterator) [with Graph = R_adjacency_list<directedS, double>; OutputIterator = std::back_insert_iterator<std::vector<detail::edge_desc_impl<directed_tag, long unsigned int> > >]’
112 | detail::kruskal_mst_impl(g, spanning_tree_edges,
| ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
113 | make_iterator_property_map(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~
114 | rank_map.begin(), get(vertex_index, g), rank_map[0]),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
115 | make_iterator_property_map(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~
116 | pred_map.begin(), get(vertex_index, g), pred_map[0]),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
117 | get(edge_weight, g));
| ~~~~~~~~~~~~~~~~~~~~
minST.cpp:20:38: required from here
20 | kruskal_minimum_spanning_tree(g, std::back_inserter(spanning_tree));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:526:17: note: in a call to non-static member function ‘boost::OutputIteratorConcept<std::back_insert_iterator<std::vector<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > >, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> >::~OutputIteratorConcept()’
526 | BOOST_concept(OutputIterator,(TT)(ValueT))
| ^~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/preprocessor/cat.hpp:29:34: note: in definition of macro ‘BOOST_PP_CAT_I’
29 | # define BOOST_PP_CAT_I(a, b) a ## b
| ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/concept_def.hpp:23:12: note: in expansion of macro ‘BOOST_PP_CAT’
23 | struct BOOST_PP_CAT(name,Concept) \
| ^~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:526:3: note: in expansion of macro ‘BOOST_concept’
526 | BOOST_concept(OutputIterator,(TT)(ValueT))
| ^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::constraint<Model>::failed() [with Model = boost::ReadWritePropertyMapConcept<boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>, long unsigned int>]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:58:9: required from ‘void boost::detail::kruskal_mst_impl(const Graph&, OutputIterator, Rank, Parent, Weight) [with Graph = R_adjacency_list<boost::directedS, double>; OutputIterator = std::back_insert_iterator<std::vector<edge_desc_impl<boost::directed_tag, long unsigned int> > >; Rank = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; Parent = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; Weight = boost::adj_list_edge_property_map<boost::directed_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:112:29: required from ‘void boost::kruskal_minimum_spanning_tree(const Graph&, OutputIterator) [with Graph = R_adjacency_list<directedS, double>; OutputIterator = std::back_insert_iterator<std::vector<detail::edge_desc_impl<directed_tag, long unsigned int> > >]’
112 | detail::kruskal_mst_impl(g, spanning_tree_edges,
| ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
113 | make_iterator_property_map(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~
114 | rank_map.begin(), get(vertex_index, g), rank_map[0]),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
115 | make_iterator_property_map(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~
116 | pred_map.begin(), get(vertex_index, g), pred_map[0]),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
117 | get(edge_weight, g));
| ~~~~~~~~~~~~~~~~~~~~
minST.cpp:20:38: required from here
20 | kruskal_minimum_spanning_tree(g, std::back_inserter(spanning_tree));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:65:52: warning: ‘this’ pointer is null [-Wnonnull]
65 | static void failed() { ((Model*)0)->constraints(); }
| ~~~~~~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:205:10: note: in a call to non-static member function ‘void boost::ReadWritePropertyMapConcept<PMap, Key>::constraints() [with PMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; Key = long unsigned int]’
205 | void constraints() {
| ^~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/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&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:60:9: required from ‘void boost::detail::kruskal_mst_impl(const Graph&, OutputIterator, Rank, Parent, Weight) [with Graph = R_adjacency_list<boost::directedS, double>; OutputIterator = std::back_insert_iterator<std::vector<edge_desc_impl<boost::directed_tag, long unsigned int> > >; Rank = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; Parent = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; Weight = boost::adj_list_edge_property_map<boost::directed_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:112:29: required from ‘void boost::kruskal_minimum_spanning_tree(const Graph&, OutputIterator) [with Graph = R_adjacency_list<directedS, double>; OutputIterator = std::back_insert_iterator<std::vector<detail::edge_desc_impl<directed_tag, long unsigned int> > >]’
112 | detail::kruskal_mst_impl(g, spanning_tree_edges,
| ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
113 | make_iterator_property_map(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~
114 | rank_map.begin(), get(vertex_index, g), rank_map[0]),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
115 | make_iterator_property_map(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~
116 | pred_map.begin(), get(vertex_index, g), pred_map[0]),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
117 | get(edge_weight, g));
| ~~~~~~~~~~~~~~~~~~~~
minST.cpp:20:38: required from here
20 | kruskal_minimum_spanning_tree(g, std::back_inserter(spanning_tree));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:65:52: warning: ‘this’ pointer is null [-Wnonnull]
65 | static void failed() { ((Model*)0)->constraints(); }
| ~~~~~~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/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&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>; Key = boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>]’
147 | void constraints() {
| ^~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Comparable<double> >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:253:5: required from ‘struct boost::Comparable<double>’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:251:3: required from ‘struct boost::ComparableConcept<double>’
251 | BOOST_concept(Comparable,(TT))
| ^~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::ComparableConcept<double>]’
32 | inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
| ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied<boost::ComparableConcept<double> >::value’
44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied<boost::ComparableConcept<double> >’
45 | typedef boost::integral_constant<bool, value> type;
| ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_<void (*)(boost::ComparableConcept<double>)>’
72 | struct requirement_<void(*)(Model)>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:64:9: required from ‘void boost::detail::kruskal_mst_impl(const Graph&, OutputIterator, Rank, Parent, Weight) [with Graph = R_adjacency_list<boost::directedS, double>; OutputIterator = std::back_insert_iterator<std::vector<edge_desc_impl<boost::directed_tag, long unsigned int> > >; Rank = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; Parent = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; Weight = boost::adj_list_edge_property_map<boost::directed_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:112:29: required from ‘void boost::kruskal_minimum_spanning_tree(const Graph&, OutputIterator) [with Graph = R_adjacency_list<directedS, double>; OutputIterator = std::back_insert_iterator<std::vector<detail::edge_desc_impl<directed_tag, long unsigned int> > >]’
112 | detail::kruskal_mst_impl(g, spanning_tree_edges,
| ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
113 | make_iterator_property_map(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~
114 | rank_map.begin(), get(vertex_index, g), rank_map[0]),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
115 | make_iterator_property_map(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~
116 | pred_map.begin(), get(vertex_index, g), pred_map[0]),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
117 | get(edge_weight, g));
| ~~~~~~~~~~~~~~~~~~~~
minST.cpp:20:38: required from here
20 | kruskal_minimum_spanning_tree(g, std::back_inserter(spanning_tree));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Comparable<double>]’
20 | ~usage_requirements() { ((Model*)0)->~Model(); }
| ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::ComparableConcept<double>]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:64:9: required from ‘void boost::detail::kruskal_mst_impl(const Graph&, OutputIterator, Rank, Parent, Weight) [with Graph = R_adjacency_list<boost::directedS, double>; OutputIterator = std::back_insert_iterator<std::vector<edge_desc_impl<boost::directed_tag, long unsigned int> > >; Rank = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; Parent = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; Weight = boost::adj_list_edge_property_map<boost::directed_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:112:29: required from ‘void boost::kruskal_minimum_spanning_tree(const Graph&, OutputIterator) [with Graph = R_adjacency_list<directedS, double>; OutputIterator = std::back_insert_iterator<std::vector<detail::edge_desc_impl<directed_tag, long unsigned int> > >]’
112 | detail::kruskal_mst_impl(g, spanning_tree_edges,
| ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
113 | make_iterator_property_map(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~
114 | rank_map.begin(), get(vertex_index, g), rank_map[0]),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
115 | make_iterator_property_map(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~
116 | pred_map.begin(), get(vertex_index, g), pred_map[0]),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
117 | get(edge_weight, g));
| ~~~~~~~~~~~~~~~~~~~~
minST.cpp:20:38: required from here
20 | kruskal_minimum_spanning_tree(g, std::back_inserter(spanning_tree));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:251:17: note: in a call to non-static member function ‘boost::ComparableConcept<double>::~ComparableConcept()’
251 | BOOST_concept(Comparable,(TT))
| ^~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/preprocessor/cat.hpp:29:34: note: in definition of macro ‘BOOST_PP_CAT_I’
29 | # define BOOST_PP_CAT_I(a, b) a ## b
| ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/concept_def.hpp:23:12: note: in expansion of macro ‘BOOST_PP_CAT’
23 | struct BOOST_PP_CAT(name,Concept) \
| ^~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:251:3: note: in expansion of macro ‘BOOST_concept’
251 | BOOST_concept(Comparable,(TT))
| ^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Convertible<long unsigned int, long unsigned int> >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible<long unsigned int, long unsigned int>’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:206:3: required from ‘struct boost::ConvertibleConcept<long unsigned int, long unsigned int>’
206 | BOOST_concept(Convertible,(X)(Y))
| ^~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::ConvertibleConcept<long unsigned int, long unsigned int>]’
32 | inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
| ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied<boost::ConvertibleConcept<long unsigned int, long unsigned int> >::value’
44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied<boost::ConvertibleConcept<long unsigned int, long unsigned int> >’
45 | typedef boost::integral_constant<bool, value> type;
| ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_<void (*)(boost::ConvertibleConcept<long unsigned int, long unsigned int>)>’
72 | struct requirement_<void(*)(Model)>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:65:9: required from ‘void boost::detail::kruskal_mst_impl(const Graph&, OutputIterator, Rank, Parent, Weight) [with Graph = R_adjacency_list<boost::directedS, double>; OutputIterator = std::back_insert_iterator<std::vector<edge_desc_impl<boost::directed_tag, long unsigned int> > >; Rank = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; Parent = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; Weight = boost::adj_list_edge_property_map<boost::directed_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:112:29: required from ‘void boost::kruskal_minimum_spanning_tree(const Graph&, OutputIterator) [with Graph = R_adjacency_list<directedS, double>; OutputIterator = std::back_insert_iterator<std::vector<detail::edge_desc_impl<directed_tag, long unsigned int> > >]’
112 | detail::kruskal_mst_impl(g, spanning_tree_edges,
| ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
113 | make_iterator_property_map(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~
114 | rank_map.begin(), get(vertex_index, g), rank_map[0]),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
115 | make_iterator_property_map(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~
116 | pred_map.begin(), get(vertex_index, g), pred_map[0]),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
117 | get(edge_weight, g));
| ~~~~~~~~~~~~~~~~~~~~
minST.cpp:20:38: required from here
20 | kruskal_minimum_spanning_tree(g, std::back_inserter(spanning_tree));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Convertible<long unsigned int, long unsigned int>]’
20 | ~usage_requirements() { ((Model*)0)->~Model(); }
| ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::ConvertibleConcept<long unsigned int, long unsigned int>]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:65:9: required from ‘void boost::detail::kruskal_mst_impl(const Graph&, OutputIterator, Rank, Parent, Weight) [with Graph = R_adjacency_list<boost::directedS, double>; OutputIterator = std::back_insert_iterator<std::vector<edge_desc_impl<boost::directed_tag, long unsigned int> > >; Rank = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; Parent = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; Weight = boost::adj_list_edge_property_map<boost::directed_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:112:29: required from ‘void boost::kruskal_minimum_spanning_tree(const Graph&, OutputIterator) [with Graph = R_adjacency_list<directedS, double>; OutputIterator = std::back_insert_iterator<std::vector<detail::edge_desc_impl<directed_tag, long unsigned int> > >]’
112 | detail::kruskal_mst_impl(g, spanning_tree_edges,
| ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
113 | make_iterator_property_map(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~
114 | rank_map.begin(), get(vertex_index, g), rank_map[0]),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
115 | make_iterator_property_map(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~
116 | pred_map.begin(), get(vertex_index, g), pred_map[0]),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
117 | get(edge_weight, g));
| ~~~~~~~~~~~~~~~~~~~~
minST.cpp:20:38: required from here
20 | kruskal_minimum_spanning_tree(g, std::back_inserter(spanning_tree));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:206:17: note: in a call to non-static member function ‘boost::ConvertibleConcept<long unsigned int, long unsigned int>::~ConvertibleConcept()’
206 | BOOST_concept(Convertible,(X)(Y))
| ^~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/preprocessor/cat.hpp:29:34: note: in definition of macro ‘BOOST_PP_CAT_I’
29 | # define BOOST_PP_CAT_I(a, b) a ## b
| ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/concept_def.hpp:23:12: note: in expansion of macro ‘BOOST_PP_CAT’
23 | struct BOOST_PP_CAT(name,Concept) \
| ^~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:206:3: note: in expansion of macro ‘BOOST_concept’
206 | BOOST_concept(Convertible,(X)(Y))
| ^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::IntegerConcept<long unsigned int>]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:66:9: required from ‘void boost::detail::kruskal_mst_impl(const Graph&, OutputIterator, Rank, Parent, Weight) [with Graph = R_adjacency_list<boost::directedS, double>; OutputIterator = std::back_insert_iterator<std::vector<edge_desc_impl<boost::directed_tag, long unsigned int> > >; Rank = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; Parent = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; Weight = boost::adj_list_edge_property_map<boost::directed_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:112:29: required from ‘void boost::kruskal_minimum_spanning_tree(const Graph&, OutputIterator) [with Graph = R_adjacency_list<directedS, double>; OutputIterator = std::back_insert_iterator<std::vector<detail::edge_desc_impl<directed_tag, long unsigned int> > >]’
112 | detail::kruskal_mst_impl(g, spanning_tree_edges,
| ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
113 | make_iterator_property_map(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~
114 | rank_map.begin(), get(vertex_index, g), rank_map[0]),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
115 | make_iterator_property_map(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~
116 | pred_map.begin(), get(vertex_index, g), pred_map[0]),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
117 | get(edge_weight, g));
| ~~~~~~~~~~~~~~~~~~~~
minST.cpp:20:38: required from here
20 | kruskal_minimum_spanning_tree(g, std::back_inserter(spanning_tree));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:70:17: note: in a call to non-static member function ‘boost::IntegerConcept<long unsigned int>::~IntegerConcept()’
70 | BOOST_concept(Integer, (T))
| ^~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/preprocessor/cat.hpp:29:34: note: in definition of macro ‘BOOST_PP_CAT_I’
29 | # define BOOST_PP_CAT_I(a, b) a ## b
| ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/concept_def.hpp:23:12: note: in expansion of macro ‘BOOST_PP_CAT’
23 | struct BOOST_PP_CAT(name,Concept) \
| ^~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:70:3: note: in expansion of macro ‘BOOST_concept’
70 | BOOST_concept(Integer, (T))
| ^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/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<R_adjacency_list<boost::undirectedS, double> > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:66:5: required from ‘struct boost::concepts::Graph<R_adjacency_list<boost::undirectedS, double> >’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:176:1: required from ‘struct boost::concepts::VertexListGraph<R_adjacency_list<boost::undirectedS, double> >’
176 | BOOST_concept(VertexListGraph, (G)) : Graph< G >
| ^~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:176:1: required from ‘struct boost::concepts::VertexListGraphConcept<R_adjacency_list<boost::undirectedS, double> >’
176 | BOOST_concept(VertexListGraph, (G)) : Graph< G >
| ^~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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<R_adjacency_list<boost::undirectedS, double> >]’
32 | inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
| ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied<boost::concepts::VertexListGraphConcept<R_adjacency_list<boost::undirectedS, double> > >::value’
44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied<boost::concepts::VertexListGraphConcept<R_adjacency_list<boost::undirectedS, double> > >’
45 | typedef boost::integral_constant<bool, value> type;
| ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_<void (*)(boost::concepts::VertexListGraphConcept<R_adjacency_list<boost::undirectedS, double> >)>’
72 | struct requirement_<void(*)(Model)>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:55:9: required from ‘void boost::detail::kruskal_mst_impl(const Graph&, OutputIterator, Rank, Parent, Weight) [with Graph = R_adjacency_list<boost::undirectedS, double>; OutputIterator = std::back_insert_iterator<std::vector<edge_desc_impl<boost::undirected_tag, long unsigned int> > >; Rank = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; Parent = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; Weight = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:112:29: required from ‘void boost::kruskal_minimum_spanning_tree(const Graph&, OutputIterator) [with Graph = R_adjacency_list<undirectedS, double>; OutputIterator = std::back_insert_iterator<std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int> > >]’
112 | detail::kruskal_mst_impl(g, spanning_tree_edges,
| ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
113 | make_iterator_property_map(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~
114 | rank_map.begin(), get(vertex_index, g), rank_map[0]),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
115 | make_iterator_property_map(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~
116 | pred_map.begin(), get(vertex_index, g), pred_map[0]),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
117 | get(edge_weight, g));
| ~~~~~~~~~~~~~~~~~~~~
minST.cpp:54:38: required from here
54 | kruskal_minimum_spanning_tree(g, std::back_inserter(spanning_tree));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/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<R_adjacency_list<boost::undirectedS, double> >]’
20 | ~usage_requirements() { ((Model*)0)->~Model(); }
| ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/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<R_adjacency_list<boost::undirectedS, double> > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:182:5: required from ‘struct boost::concepts::VertexListGraph<R_adjacency_list<boost::undirectedS, double> >’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:176:1: required from ‘struct boost::concepts::VertexListGraphConcept<R_adjacency_list<boost::undirectedS, double> >’
176 | BOOST_concept(VertexListGraph, (G)) : Graph< G >
| ^~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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<R_adjacency_list<boost::undirectedS, double> >]’
32 | inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
| ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied<boost::concepts::VertexListGraphConcept<R_adjacency_list<boost::undirectedS, double> > >::value’
44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied<boost::concepts::VertexListGraphConcept<R_adjacency_list<boost::undirectedS, double> > >’
45 | typedef boost::integral_constant<bool, value> type;
| ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_<void (*)(boost::concepts::VertexListGraphConcept<R_adjacency_list<boost::undirectedS, double> >)>’
72 | struct requirement_<void(*)(Model)>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:55:9: required from ‘void boost::detail::kruskal_mst_impl(const Graph&, OutputIterator, Rank, Parent, Weight) [with Graph = R_adjacency_list<boost::undirectedS, double>; OutputIterator = std::back_insert_iterator<std::vector<edge_desc_impl<boost::undirected_tag, long unsigned int> > >; Rank = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; Parent = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; Weight = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:112:29: required from ‘void boost::kruskal_minimum_spanning_tree(const Graph&, OutputIterator) [with Graph = R_adjacency_list<undirectedS, double>; OutputIterator = std::back_insert_iterator<std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int> > >]’
112 | detail::kruskal_mst_impl(g, spanning_tree_edges,
| ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
113 | make_iterator_property_map(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~
114 | rank_map.begin(), get(vertex_index, g), rank_map[0]),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
115 | make_iterator_property_map(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~
116 | pred_map.begin(), get(vertex_index, g), pred_map[0]),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
117 | get(edge_weight, g));
| ~~~~~~~~~~~~~~~~~~~~
minST.cpp:54:38: required from here
54 | kruskal_minimum_spanning_tree(g, std::back_inserter(spanning_tree));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/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<R_adjacency_list<boost::undirectedS, double> >]’
20 | ~usage_requirements() { ((Model*)0)->~Model(); }
| ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/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<R_adjacency_list<boost::undirectedS, double> >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:55:9: required from ‘void boost::detail::kruskal_mst_impl(const Graph&, OutputIterator, Rank, Parent, Weight) [with Graph = R_adjacency_list<boost::undirectedS, double>; OutputIterator = std::back_insert_iterator<std::vector<edge_desc_impl<boost::undirected_tag, long unsigned int> > >; Rank = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; Parent = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; Weight = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:112:29: required from ‘void boost::kruskal_minimum_spanning_tree(const Graph&, OutputIterator) [with Graph = R_adjacency_list<undirectedS, double>; OutputIterator = std::back_insert_iterator<std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int> > >]’
112 | detail::kruskal_mst_impl(g, spanning_tree_edges,
| ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
113 | make_iterator_property_map(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~
114 | rank_map.begin(), get(vertex_index, g), rank_map[0]),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
115 | make_iterator_property_map(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~
116 | pred_map.begin(), get(vertex_index, g), pred_map[0]),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
117 | get(edge_weight, g));
| ~~~~~~~~~~~~~~~~~~~~
minST.cpp:54:38: required from here
54 | kruskal_minimum_spanning_tree(g, std::back_inserter(spanning_tree));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:176:15: note: in a call to non-static member function ‘boost::concepts::VertexListGraphConcept<R_adjacency_list<boost::undirectedS, double> >::~VertexListGraphConcept()’
176 | BOOST_concept(VertexListGraph, (G)) : Graph< G >
| ^~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/preprocessor/cat.hpp:29:34: note: in definition of macro ‘BOOST_PP_CAT_I’
29 | # define BOOST_PP_CAT_I(a, b) a ## b
| ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/concept_def.hpp:23:12: note: in expansion of macro ‘BOOST_PP_CAT’
23 | struct BOOST_PP_CAT(name,Concept) \
| ^~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:176:1: note: in expansion of macro ‘BOOST_concept’
176 | BOOST_concept(VertexListGraph, (G)) : Graph< G >
| ^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/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<R_adjacency_list<boost::undirectedS, double> > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:233:5: required from ‘struct boost::concepts::EdgeListGraph<R_adjacency_list<boost::undirectedS, double> >’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:226:1: required from ‘struct boost::concepts::EdgeListGraphConcept<R_adjacency_list<boost::undirectedS, double> >’
226 | BOOST_concept(EdgeListGraph, (G)) : Graph< G >
| ^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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<R_adjacency_list<boost::undirectedS, double> >]’
32 | inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
| ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied<boost::concepts::EdgeListGraphConcept<R_adjacency_list<boost::undirectedS, double> > >::value’
44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied<boost::concepts::EdgeListGraphConcept<R_adjacency_list<boost::undirectedS, double> > >’
45 | typedef boost::integral_constant<bool, value> type;
| ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_<void (*)(boost::concepts::EdgeListGraphConcept<R_adjacency_list<boost::undirectedS, double> >)>’
72 | struct requirement_<void(*)(Model)>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:56:9: required from ‘void boost::detail::kruskal_mst_impl(const Graph&, OutputIterator, Rank, Parent, Weight) [with Graph = R_adjacency_list<boost::undirectedS, double>; OutputIterator = std::back_insert_iterator<std::vector<edge_desc_impl<boost::undirected_tag, long unsigned int> > >; Rank = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; Parent = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; Weight = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:112:29: required from ‘void boost::kruskal_minimum_spanning_tree(const Graph&, OutputIterator) [with Graph = R_adjacency_list<undirectedS, double>; OutputIterator = std::back_insert_iterator<std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int> > >]’
112 | detail::kruskal_mst_impl(g, spanning_tree_edges,
| ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
113 | make_iterator_property_map(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~
114 | rank_map.begin(), get(vertex_index, g), rank_map[0]),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
115 | make_iterator_property_map(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~
116 | pred_map.begin(), get(vertex_index, g), pred_map[0]),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
117 | get(edge_weight, g));
| ~~~~~~~~~~~~~~~~~~~~
minST.cpp:54:38: required from here
54 | kruskal_minimum_spanning_tree(g, std::back_inserter(spanning_tree));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/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<R_adjacency_list<boost::undirectedS, double> >]’
20 | ~usage_requirements() { ((Model*)0)->~Model(); }
| ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/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<R_adjacency_list<boost::undirectedS, double> >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:56:9: required from ‘void boost::detail::kruskal_mst_impl(const Graph&, OutputIterator, Rank, Parent, Weight) [with Graph = R_adjacency_list<boost::undirectedS, double>; OutputIterator = std::back_insert_iterator<std::vector<edge_desc_impl<boost::undirected_tag, long unsigned int> > >; Rank = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; Parent = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; Weight = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:112:29: required from ‘void boost::kruskal_minimum_spanning_tree(const Graph&, OutputIterator) [with Graph = R_adjacency_list<undirectedS, double>; OutputIterator = std::back_insert_iterator<std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int> > >]’
112 | detail::kruskal_mst_impl(g, spanning_tree_edges,
| ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
113 | make_iterator_property_map(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~
114 | rank_map.begin(), get(vertex_index, g), rank_map[0]),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
115 | make_iterator_property_map(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~
116 | pred_map.begin(), get(vertex_index, g), pred_map[0]),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
117 | get(edge_weight, g));
| ~~~~~~~~~~~~~~~~~~~~
minST.cpp:54:38: required from here
54 | kruskal_minimum_spanning_tree(g, std::back_inserter(spanning_tree));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:226:15: note: in a call to non-static member function ‘boost::concepts::EdgeListGraphConcept<R_adjacency_list<boost::undirectedS, double> >::~EdgeListGraphConcept()’
226 | BOOST_concept(EdgeListGraph, (G)) : Graph< G >
| ^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/preprocessor/cat.hpp:29:34: note: in definition of macro ‘BOOST_PP_CAT_I’
29 | # define BOOST_PP_CAT_I(a, b) a ## b
| ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/concept_def.hpp:23:12: note: in expansion of macro ‘BOOST_PP_CAT’
23 | struct BOOST_PP_CAT(name,Concept) \
| ^~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:226:1: note: in expansion of macro ‘BOOST_concept’
226 | BOOST_concept(EdgeListGraph, (G)) : Graph< G >
| ^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Assignable<std::back_insert_iterator<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > > > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:145:5: required from ‘struct boost::Assignable<std::back_insert_iterator<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > > >’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:526:3: required from ‘struct boost::OutputIterator<std::back_insert_iterator<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> >’
526 | BOOST_concept(OutputIterator,(TT)(ValueT))
| ^~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:526:3: required from ‘struct boost::OutputIteratorConcept<std::back_insert_iterator<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> >’
526 | BOOST_concept(OutputIterator,(TT)(ValueT))
| ^~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::OutputIteratorConcept<std::back_insert_iterator<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> >]’
32 | inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
| ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied<boost::OutputIteratorConcept<std::back_insert_iterator<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >::value’
44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied<boost::OutputIteratorConcept<std::back_insert_iterator<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >’
45 | typedef boost::integral_constant<bool, value> type;
| ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_<void (*)(boost::OutputIteratorConcept<std::back_insert_iterator<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> >)>’
72 | struct requirement_<void(*)(Model)>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:57:9: required from ‘void boost::detail::kruskal_mst_impl(const Graph&, OutputIterator, Rank, Parent, Weight) [with Graph = R_adjacency_list<boost::undirectedS, double>; OutputIterator = std::back_insert_iterator<std::vector<edge_desc_impl<boost::undirected_tag, long unsigned int> > >; Rank = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; Parent = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; Weight = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:112:29: required from ‘void boost::kruskal_minimum_spanning_tree(const Graph&, OutputIterator) [with Graph = R_adjacency_list<undirectedS, double>; OutputIterator = std::back_insert_iterator<std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int> > >]’
112 | detail::kruskal_mst_impl(g, spanning_tree_edges,
| ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
113 | make_iterator_property_map(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~
114 | rank_map.begin(), get(vertex_index, g), rank_map[0]),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
115 | make_iterator_property_map(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~
116 | pred_map.begin(), get(vertex_index, g), pred_map[0]),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
117 | get(edge_weight, g));
| ~~~~~~~~~~~~~~~~~~~~
minST.cpp:54:38: required from here
54 | kruskal_minimum_spanning_tree(g, std::back_inserter(spanning_tree));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Assignable<std::back_insert_iterator<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > > >]’
20 | ~usage_requirements() { ((Model*)0)->~Model(); }
| ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::OutputIterator<std::back_insert_iterator<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:529:5: required from ‘struct boost::OutputIterator<std::back_insert_iterator<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> >’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:526:3: required from ‘struct boost::OutputIteratorConcept<std::back_insert_iterator<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> >’
526 | BOOST_concept(OutputIterator,(TT)(ValueT))
| ^~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::OutputIteratorConcept<std::back_insert_iterator<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> >]’
32 | inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
| ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied<boost::OutputIteratorConcept<std::back_insert_iterator<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >::value’
44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied<boost::OutputIteratorConcept<std::back_insert_iterator<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >’
45 | typedef boost::integral_constant<bool, value> type;
| ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_<void (*)(boost::OutputIteratorConcept<std::back_insert_iterator<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> >)>’
72 | struct requirement_<void(*)(Model)>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:57:9: required from ‘void boost::detail::kruskal_mst_impl(const Graph&, OutputIterator, Rank, Parent, Weight) [with Graph = R_adjacency_list<boost::undirectedS, double>; OutputIterator = std::back_insert_iterator<std::vector<edge_desc_impl<boost::undirected_tag, long unsigned int> > >; Rank = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; Parent = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; Weight = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:112:29: required from ‘void boost::kruskal_minimum_spanning_tree(const Graph&, OutputIterator) [with Graph = R_adjacency_list<undirectedS, double>; OutputIterator = std::back_insert_iterator<std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int> > >]’
112 | detail::kruskal_mst_impl(g, spanning_tree_edges,
| ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
113 | make_iterator_property_map(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~
114 | rank_map.begin(), get(vertex_index, g), rank_map[0]),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
115 | make_iterator_property_map(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~
116 | pred_map.begin(), get(vertex_index, g), pred_map[0]),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
117 | get(edge_weight, g));
| ~~~~~~~~~~~~~~~~~~~~
minST.cpp:54:38: required from here
54 | kruskal_minimum_spanning_tree(g, std::back_inserter(spanning_tree));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::OutputIterator<std::back_insert_iterator<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> >]’
20 | ~usage_requirements() { ((Model*)0)->~Model(); }
| ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::OutputIteratorConcept<std::back_insert_iterator<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:57:9: required from ‘void boost::detail::kruskal_mst_impl(const Graph&, OutputIterator, Rank, Parent, Weight) [with Graph = R_adjacency_list<boost::undirectedS, double>; OutputIterator = std::back_insert_iterator<std::vector<edge_desc_impl<boost::undirected_tag, long unsigned int> > >; Rank = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; Parent = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; Weight = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:112:29: required from ‘void boost::kruskal_minimum_spanning_tree(const Graph&, OutputIterator) [with Graph = R_adjacency_list<undirectedS, double>; OutputIterator = std::back_insert_iterator<std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int> > >]’
112 | detail::kruskal_mst_impl(g, spanning_tree_edges,
| ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
113 | make_iterator_property_map(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~
114 | rank_map.begin(), get(vertex_index, g), rank_map[0]),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
115 | make_iterator_property_map(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~
116 | pred_map.begin(), get(vertex_index, g), pred_map[0]),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
117 | get(edge_weight, g));
| ~~~~~~~~~~~~~~~~~~~~
minST.cpp:54:38: required from here
54 | kruskal_minimum_spanning_tree(g, std::back_inserter(spanning_tree));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:526:17: note: in a call to non-static member function ‘boost::OutputIteratorConcept<std::back_insert_iterator<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> >::~OutputIteratorConcept()’
526 | BOOST_concept(OutputIterator,(TT)(ValueT))
| ^~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/preprocessor/cat.hpp:29:34: note: in definition of macro ‘BOOST_PP_CAT_I’
29 | # define BOOST_PP_CAT_I(a, b) a ## b
| ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/concept_def.hpp:23:12: note: in expansion of macro ‘BOOST_PP_CAT’
23 | struct BOOST_PP_CAT(name,Concept) \
| ^~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:526:3: note: in expansion of macro ‘BOOST_concept’
526 | BOOST_concept(OutputIterator,(TT)(ValueT))
| ^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::constraint<Model>::failed() [with Model = boost::ReadablePropertyMapConcept<boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:60:9: required from ‘void boost::detail::kruskal_mst_impl(const Graph&, OutputIterator, Rank, Parent, Weight) [with Graph = R_adjacency_list<boost::undirectedS, double>; OutputIterator = std::back_insert_iterator<std::vector<edge_desc_impl<boost::undirected_tag, long unsigned int> > >; Rank = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; Parent = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; Weight = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:112:29: required from ‘void boost::kruskal_minimum_spanning_tree(const Graph&, OutputIterator) [with Graph = R_adjacency_list<undirectedS, double>; OutputIterator = std::back_insert_iterator<std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int> > >]’
112 | detail::kruskal_mst_impl(g, spanning_tree_edges,
| ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
113 | make_iterator_property_map(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~
114 | rank_map.begin(), get(vertex_index, g), rank_map[0]),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
115 | make_iterator_property_map(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~
116 | pred_map.begin(), get(vertex_index, g), pred_map[0]),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
117 | get(edge_weight, g));
| ~~~~~~~~~~~~~~~~~~~~
minST.cpp:54:38: required from here
54 | kruskal_minimum_spanning_tree(g, std::back_inserter(spanning_tree));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:65:52: warning: ‘this’ pointer is null [-Wnonnull]
65 | static void failed() { ((Model*)0)->constraints(); }
| ~~~~~~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:147:10: note: in a call to non-static member function ‘void boost::ReadablePropertyMapConcept<PMap, Key>::constraints() [with PMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>; Key = boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>]’
147 | void constraints() {
| ^~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Assignable<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Assignable<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > > >]’
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:145:5: required from ‘struct boost::Assignable<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > >’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > >’
502 | BOOST_concept(InputIterator,(TT))
| ^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:540:3: required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > >’
540 | BOOST_concept(ForwardIterator,(TT))
| ^~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > >’
568 | BOOST_concept(BidirectionalIterator,(TT))
| ^~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied<boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > > >::value’
44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied<boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > > >’
45 | typedef boost::integral_constant<bool, value> type;
| ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_<void (*)(boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > >)>’
72 | struct requirement_<void(*)(Model)>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map<RAIter, ID, Value, Value&> boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >; Value = long unsigned int; ID = vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:113:35: required from ‘void boost::kruskal_minimum_spanning_tree(const Graph&, OutputIterator) [with Graph = R_adjacency_list<directedS, double>; OutputIterator = std::back_insert_iterator<std::vector<detail::edge_desc_impl<directed_tag, long unsigned int> > >]’
113 | make_iterator_property_map(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^
114 | rank_map.begin(), get(vertex_index, g), rank_map[0]),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
minST.cpp:20:38: required from here
20 | kruskal_minimum_spanning_tree(g, std::back_inserter(spanning_tree));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
20 | ~usage_requirements() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Assignable<TT>::~Assignable() [with TT = __gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >]’
37 | ~model()
| ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:145:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
145 | BOOST_CONCEPT_USAGE(Assignable) {
| ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::EqualityComparable<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::EqualityComparable<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > > >]’
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > >’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > >’
502 | BOOST_concept(InputIterator,(TT))
| ^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:540:3: required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > >’
540 | BOOST_concept(ForwardIterator,(TT))
| ^~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > >’
568 | BOOST_concept(BidirectionalIterator,(TT))
| ^~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied<boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > > >::value’
44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied<boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > > >’
45 | typedef boost::integral_constant<bool, value> type;
| ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_<void (*)(boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > >)>’
72 | struct requirement_<void(*)(Model)>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map<RAIter, ID, Value, Value&> boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >; Value = long unsigned int; ID = vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:113:35: required from ‘void boost::kruskal_minimum_spanning_tree(const Graph&, OutputIterator) [with Graph = R_adjacency_list<directedS, double>; OutputIterator = std::back_insert_iterator<std::vector<detail::edge_desc_impl<directed_tag, long unsigned int> > >]’
113 | make_iterator_property_map(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^
114 | rank_map.begin(), get(vertex_index, g), rank_map[0]),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
minST.cpp:20:38: required from here
20 | kruskal_minimum_spanning_tree(g, std::back_inserter(spanning_tree));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
20 | ~usage_requirements() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::EqualityComparable<TT>::~EqualityComparable() [with TT = __gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >]’
37 | ~model()
| ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:233:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
233 | BOOST_CONCEPT_USAGE(EqualityComparable) {
| ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::InputIterator<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::InputIterator<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > > >]’
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:512:7: required from ‘struct boost::InputIterator<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > >’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:540:3: required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > >’
540 | BOOST_concept(ForwardIterator,(TT))
| ^~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > >’
568 | BOOST_concept(BidirectionalIterator,(TT))
| ^~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > >’
597 | BOOST_concept(RandomAccessIterator,(TT))
| ^~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied<boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > > >::value’
44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied<boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > > >’
45 | typedef boost::integral_constant<bool, value> type;
| ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_<void (*)(boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > >)>’
72 | struct requirement_<void(*)(Model)>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map<RAIter, ID, Value, Value&> boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >; Value = long unsigned int; ID = vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:113:35: required from ‘void boost::kruskal_minimum_spanning_tree(const Graph&, OutputIterator) [with Graph = R_adjacency_list<directedS, double>; OutputIterator = std::back_insert_iterator<std::vector<detail::edge_desc_impl<directed_tag, long unsigned int> > >]’
113 | make_iterator_property_map(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^
114 | rank_map.begin(), get(vertex_index, g), rank_map[0]),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
minST.cpp:20:38: required from here
20 | kruskal_minimum_spanning_tree(g, std::back_inserter(spanning_tree));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
20 | ~usage_requirements() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::InputIterator<TT>::~InputIterator() [with TT = __gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >]’
37 | ~model()
| ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:512:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
512 | BOOST_CONCEPT_USAGE(InputIterator)
| ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::ForwardIterator<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::ForwardIterator<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > > >]’
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:543:7: required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > >’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > >’
568 | BOOST_concept(BidirectionalIterator,(TT))
| ^~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > >’
597 | BOOST_concept(RandomAccessIterator,(TT))
| ^~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied<boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > > >::value’
44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied<boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > > >’
45 | typedef boost::integral_constant<bool, value> type;
| ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_<void (*)(boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > >)>’
72 | struct requirement_<void(*)(Model)>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map<RAIter, ID, Value, Value&> boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >; Value = long unsigned int; ID = vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:113:35: required from ‘void boost::kruskal_minimum_spanning_tree(const Graph&, OutputIterator) [with Graph = R_adjacency_list<directedS, double>; OutputIterator = std::back_insert_iterator<std::vector<detail::edge_desc_impl<directed_tag, long unsigned int> > >]’
113 | make_iterator_property_map(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^
114 | rank_map.begin(), get(vertex_index, g), rank_map[0]),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
minST.cpp:20:38: required from here
20 | kruskal_minimum_spanning_tree(g, std::back_inserter(spanning_tree));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
20 | ~usage_requirements() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::ForwardIterator<TT>::~ForwardIterator() [with TT = __gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >]’
37 | ~model()
| ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:543:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
543 | BOOST_CONCEPT_USAGE(ForwardIterator)
| ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::BidirectionalIterator<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::BidirectionalIterator<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > > >]’
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:571:7: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > >’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > >’
597 | BOOST_concept(RandomAccessIterator,(TT))
| ^~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > >’
597 | BOOST_concept(RandomAccessIterator,(TT))
| ^~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > >]’
32 | inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
| ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied<boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > > >::value’
44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied<boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > > >’
45 | typedef boost::integral_constant<bool, value> type;
| ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_<void (*)(boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > >)>’
72 | struct requirement_<void(*)(Model)>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map<RAIter, ID, Value, Value&> boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >; Value = long unsigned int; ID = vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:113:35: required from ‘void boost::kruskal_minimum_spanning_tree(const Graph&, OutputIterator) [with Graph = R_adjacency_list<directedS, double>; OutputIterator = std::back_insert_iterator<std::vector<detail::edge_desc_impl<directed_tag, long unsigned int> > >]’
113 | make_iterator_property_map(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^
114 | rank_map.begin(), get(vertex_index, g), rank_map[0]),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
minST.cpp:20:38: required from here
20 | kruskal_minimum_spanning_tree(g, std::back_inserter(spanning_tree));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
20 | ~usage_requirements() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::BidirectionalIterator<TT>::~BidirectionalIterator() [with TT = __gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >]’
37 | ~model()
| ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:571:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
571 | BOOST_CONCEPT_USAGE(BidirectionalIterator)
| ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Comparable<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Comparable<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > > >]’
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:253:5: required from ‘struct boost::Comparable<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > >’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > >’
597 | BOOST_concept(RandomAccessIterator,(TT))
| ^~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > >’
597 | BOOST_concept(RandomAccessIterator,(TT))
| ^~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > >]’
32 | inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
| ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied<boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > > >::value’
44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied<boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > > >’
45 | typedef boost::integral_constant<bool, value> type;
| ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_<void (*)(boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > >)>’
72 | struct requirement_<void(*)(Model)>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map<RAIter, ID, Value, Value&> boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >; Value = long unsigned int; ID = vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:113:35: required from ‘void boost::kruskal_minimum_spanning_tree(const Graph&, OutputIterator) [with Graph = R_adjacency_list<directedS, double>; OutputIterator = std::back_insert_iterator<std::vector<detail::edge_desc_impl<directed_tag, long unsigned int> > >]’
113 | make_iterator_property_map(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^
114 | rank_map.begin(), get(vertex_index, g), rank_map[0]),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
minST.cpp:20:38: required from here
20 | kruskal_minimum_spanning_tree(g, std::back_inserter(spanning_tree));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
20 | ~usage_requirements() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Comparable<TT>::~Comparable() [with TT = __gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >]’
37 | ~model()
| ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:253:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
253 | BOOST_CONCEPT_USAGE(Comparable) {
| ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::RandomAccessIterator<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::RandomAccessIterator<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > > >]’
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:601:7: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > >’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > >’
597 | BOOST_concept(RandomAccessIterator,(TT))
| ^~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > >]’
32 | inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
| ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied<boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > > >::value’
44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied<boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > > >’
45 | typedef boost::integral_constant<bool, value> type;
| ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_<void (*)(boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > >)>’
72 | struct requirement_<void(*)(Model)>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map<RAIter, ID, Value, Value&> boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >; Value = long unsigned int; ID = vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:113:35: required from ‘void boost::kruskal_minimum_spanning_tree(const Graph&, OutputIterator) [with Graph = R_adjacency_list<directedS, double>; OutputIterator = std::back_insert_iterator<std::vector<detail::edge_desc_impl<directed_tag, long unsigned int> > >]’
113 | make_iterator_property_map(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^
114 | rank_map.begin(), get(vertex_index, g), rank_map[0]),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
minST.cpp:20:38: required from here
20 | kruskal_minimum_spanning_tree(g, std::back_inserter(spanning_tree));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
20 | ~usage_requirements() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::RandomAccessIterator<TT>::~RandomAccessIterator() [with TT = __gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >]’
37 | ~model()
| ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:601:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
601 | BOOST_CONCEPT_USAGE(RandomAccessIterator)
| ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::concepts::Graph<R_adjacency_list<boost::directedS, double> >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/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<R_adjacency_list<boost::directedS, double> > >]’
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:66:5: required from ‘struct boost::concepts::Graph<R_adjacency_list<boost::directedS, double> >’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:176:1: required from ‘struct boost::concepts::VertexListGraph<R_adjacency_list<boost::directedS, double> >’
176 | BOOST_concept(VertexListGraph, (G)) : Graph< G >
| ^~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:176:1: required from ‘struct boost::concepts::VertexListGraphConcept<R_adjacency_list<boost::directedS, double> >’
176 | BOOST_concept(VertexListGraph, (G)) : Graph< G >
| ^~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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<R_adjacency_list<boost::directedS, double> >]’
32 | inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
| ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied<boost::concepts::VertexListGraphConcept<R_adjacency_list<boost::directedS, double> > >::value’
44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied<boost::concepts::VertexListGraphConcept<R_adjacency_list<boost::directedS, double> > >’
45 | typedef boost::integral_constant<bool, value> type;
| ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_<void (*)(boost::concepts::VertexListGraphConcept<R_adjacency_list<boost::directedS, double> >)>’
72 | struct requirement_<void(*)(Model)>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:55:9: required from ‘void boost::detail::kruskal_mst_impl(const Graph&, OutputIterator, Rank, Parent, Weight) [with Graph = R_adjacency_list<boost::directedS, double>; OutputIterator = std::back_insert_iterator<std::vector<edge_desc_impl<boost::directed_tag, long unsigned int> > >; Rank = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; Parent = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; Weight = boost::adj_list_edge_property_map<boost::directed_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:112:29: required from ‘void boost::kruskal_minimum_spanning_tree(const Graph&, OutputIterator) [with Graph = R_adjacency_list<directedS, double>; OutputIterator = std::back_insert_iterator<std::vector<detail::edge_desc_impl<directed_tag, long unsigned int> > >]’
112 | detail::kruskal_mst_impl(g, spanning_tree_edges,
| ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
113 | make_iterator_property_map(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~
114 | rank_map.begin(), get(vertex_index, g), rank_map[0]),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
115 | make_iterator_property_map(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~
116 | pred_map.begin(), get(vertex_index, g), pred_map[0]),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
117 | get(edge_weight, g));
| ~~~~~~~~~~~~~~~~~~~~
minST.cpp:20:38: required from here
20 | kruskal_minimum_spanning_tree(g, std::back_inserter(spanning_tree));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
20 | ~usage_requirements() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::concepts::Graph<G>::~Graph() [with G = R_adjacency_list<boost::directedS, double>]’
37 | ~model()
| ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:66:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
66 | BOOST_CONCEPT_USAGE(Graph)
| ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::concepts::VertexListGraph<R_adjacency_list<boost::directedS, double> >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/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<R_adjacency_list<boost::directedS, double> > >]’
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:182:5: required from ‘struct boost::concepts::VertexListGraph<R_adjacency_list<boost::directedS, double> >’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:176:1: required from ‘struct boost::concepts::VertexListGraphConcept<R_adjacency_list<boost::directedS, double> >’
176 | BOOST_concept(VertexListGraph, (G)) : Graph< G >
| ^~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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<R_adjacency_list<boost::directedS, double> >]’
32 | inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
| ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied<boost::concepts::VertexListGraphConcept<R_adjacency_list<boost::directedS, double> > >::value’
44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied<boost::concepts::VertexListGraphConcept<R_adjacency_list<boost::directedS, double> > >’
45 | typedef boost::integral_constant<bool, value> type;
| ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_<void (*)(boost::concepts::VertexListGraphConcept<R_adjacency_list<boost::directedS, double> >)>’
72 | struct requirement_<void(*)(Model)>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:55:9: required from ‘void boost::detail::kruskal_mst_impl(const Graph&, OutputIterator, Rank, Parent, Weight) [with Graph = R_adjacency_list<boost::directedS, double>; OutputIterator = std::back_insert_iterator<std::vector<edge_desc_impl<boost::directed_tag, long unsigned int> > >; Rank = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; Parent = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; Weight = boost::adj_list_edge_property_map<boost::directed_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:112:29: required from ‘void boost::kruskal_minimum_spanning_tree(const Graph&, OutputIterator) [with Graph = R_adjacency_list<directedS, double>; OutputIterator = std::back_insert_iterator<std::vector<detail::edge_desc_impl<directed_tag, long unsigned int> > >]’
112 | detail::kruskal_mst_impl(g, spanning_tree_edges,
| ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
113 | make_iterator_property_map(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~
114 | rank_map.begin(), get(vertex_index, g), rank_map[0]),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
115 | make_iterator_property_map(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~
116 | pred_map.begin(), get(vertex_index, g), pred_map[0]),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
117 | get(edge_weight, g));
| ~~~~~~~~~~~~~~~~~~~~
minST.cpp:20:38: required from here
20 | kruskal_minimum_spanning_tree(g, std::back_inserter(spanning_tree));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
20 | ~usage_requirements() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::concepts::VertexListGraph<G>::~VertexListGraph() [with G = R_adjacency_list<boost::directedS, double>]’
37 | ~model()
| ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:182:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
182 | BOOST_CONCEPT_USAGE(VertexListGraph)
| ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::concepts::EdgeListGraph<R_adjacency_list<boost::directedS, double> >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/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<R_adjacency_list<boost::directedS, double> > >]’
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:233:5: required from ‘struct boost::concepts::EdgeListGraph<R_adjacency_list<boost::directedS, double> >’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:226:1: required from ‘struct boost::concepts::EdgeListGraphConcept<R_adjacency_list<boost::directedS, double> >’
226 | BOOST_concept(EdgeListGraph, (G)) : Graph< G >
| ^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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<R_adjacency_list<boost::directedS, double> >]’
32 | inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
| ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied<boost::concepts::EdgeListGraphConcept<R_adjacency_list<boost::directedS, double> > >::value’
44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied<boost::concepts::EdgeListGraphConcept<R_adjacency_list<boost::directedS, double> > >’
45 | typedef boost::integral_constant<bool, value> type;
| ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_<void (*)(boost::concepts::EdgeListGraphConcept<R_adjacency_list<boost::directedS, double> >)>’
72 | struct requirement_<void(*)(Model)>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:56:9: required from ‘void boost::detail::kruskal_mst_impl(const Graph&, OutputIterator, Rank, Parent, Weight) [with Graph = R_adjacency_list<boost::directedS, double>; OutputIterator = std::back_insert_iterator<std::vector<edge_desc_impl<boost::directed_tag, long unsigned int> > >; Rank = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; Parent = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; Weight = boost::adj_list_edge_property_map<boost::directed_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:112:29: required from ‘void boost::kruskal_minimum_spanning_tree(const Graph&, OutputIterator) [with Graph = R_adjacency_list<directedS, double>; OutputIterator = std::back_insert_iterator<std::vector<detail::edge_desc_impl<directed_tag, long unsigned int> > >]’
112 | detail::kruskal_mst_impl(g, spanning_tree_edges,
| ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
113 | make_iterator_property_map(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~
114 | rank_map.begin(), get(vertex_index, g), rank_map[0]),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
115 | make_iterator_property_map(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~
116 | pred_map.begin(), get(vertex_index, g), pred_map[0]),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
117 | get(edge_weight, g));
| ~~~~~~~~~~~~~~~~~~~~
minST.cpp:20:38: required from here
20 | kruskal_minimum_spanning_tree(g, std::back_inserter(spanning_tree));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
20 | ~usage_requirements() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::concepts::EdgeListGraph<G>::~EdgeListGraph() [with G = R_adjacency_list<boost::directedS, double>]’
37 | ~model()
| ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:233:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
233 | BOOST_CONCEPT_USAGE(EdgeListGraph)
| ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Assignable<std::back_insert_iterator<std::vector<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Assignable<std::back_insert_iterator<std::vector<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >]’
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:145:5: required from ‘struct boost::Assignable<std::back_insert_iterator<std::vector<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:526:3: required from ‘struct boost::OutputIterator<std::back_insert_iterator<std::vector<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > >, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> >’
526 | BOOST_concept(OutputIterator,(TT)(ValueT))
| ^~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:526:3: required from ‘struct boost::OutputIteratorConcept<std::back_insert_iterator<std::vector<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > >, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> >’
526 | BOOST_concept(OutputIterator,(TT)(ValueT))
| ^~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::OutputIteratorConcept<std::back_insert_iterator<std::vector<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > >, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> >]’
32 | inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
| ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied<boost::OutputIteratorConcept<std::back_insert_iterator<std::vector<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > >, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > >::value’
44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied<boost::OutputIteratorConcept<std::back_insert_iterator<std::vector<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > >, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > >’
45 | typedef boost::integral_constant<bool, value> type;
| ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_<void (*)(boost::OutputIteratorConcept<std::back_insert_iterator<std::vector<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > >, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> >)>’
72 | struct requirement_<void(*)(Model)>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:57:9: required from ‘void boost::detail::kruskal_mst_impl(const Graph&, OutputIterator, Rank, Parent, Weight) [with Graph = R_adjacency_list<boost::directedS, double>; OutputIterator = std::back_insert_iterator<std::vector<edge_desc_impl<boost::directed_tag, long unsigned int> > >; Rank = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; Parent = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; Weight = boost::adj_list_edge_property_map<boost::directed_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:112:29: required from ‘void boost::kruskal_minimum_spanning_tree(const Graph&, OutputIterator) [with Graph = R_adjacency_list<directedS, double>; OutputIterator = std::back_insert_iterator<std::vector<detail::edge_desc_impl<directed_tag, long unsigned int> > >]’
112 | detail::kruskal_mst_impl(g, spanning_tree_edges,
| ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
113 | make_iterator_property_map(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~
114 | rank_map.begin(), get(vertex_index, g), rank_map[0]),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
115 | make_iterator_property_map(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~
116 | pred_map.begin(), get(vertex_index, g), pred_map[0]),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
117 | get(edge_weight, g));
| ~~~~~~~~~~~~~~~~~~~~
minST.cpp:20:38: required from here
20 | kruskal_minimum_spanning_tree(g, std::back_inserter(spanning_tree));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
20 | ~usage_requirements() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Assignable<TT>::~Assignable() [with TT = std::back_insert_iterator<std::vector<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > >]’
37 | ~model()
| ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:145:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
145 | BOOST_CONCEPT_USAGE(Assignable) {
| ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::OutputIterator<std::back_insert_iterator<std::vector<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > >, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::OutputIterator<std::back_insert_iterator<std::vector<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > >, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > >]’
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:529:5: required from ‘struct boost::OutputIterator<std::back_insert_iterator<std::vector<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > >, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> >’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:526:3: required from ‘struct boost::OutputIteratorConcept<std::back_insert_iterator<std::vector<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > >, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> >’
526 | BOOST_concept(OutputIterator,(TT)(ValueT))
| ^~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::OutputIteratorConcept<std::back_insert_iterator<std::vector<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > >, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> >]’
32 | inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
| ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied<boost::OutputIteratorConcept<std::back_insert_iterator<std::vector<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > >, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > >::value’
44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied<boost::OutputIteratorConcept<std::back_insert_iterator<std::vector<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > >, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > >’
45 | typedef boost::integral_constant<bool, value> type;
| ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_<void (*)(boost::OutputIteratorConcept<std::back_insert_iterator<std::vector<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > >, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> >)>’
72 | struct requirement_<void(*)(Model)>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:57:9: required from ‘void boost::detail::kruskal_mst_impl(const Graph&, OutputIterator, Rank, Parent, Weight) [with Graph = R_adjacency_list<boost::directedS, double>; OutputIterator = std::back_insert_iterator<std::vector<edge_desc_impl<boost::directed_tag, long unsigned int> > >; Rank = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; Parent = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; Weight = boost::adj_list_edge_property_map<boost::directed_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:112:29: required from ‘void boost::kruskal_minimum_spanning_tree(const Graph&, OutputIterator) [with Graph = R_adjacency_list<directedS, double>; OutputIterator = std::back_insert_iterator<std::vector<detail::edge_desc_impl<directed_tag, long unsigned int> > >]’
112 | detail::kruskal_mst_impl(g, spanning_tree_edges,
| ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
113 | make_iterator_property_map(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~
114 | rank_map.begin(), get(vertex_index, g), rank_map[0]),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
115 | make_iterator_property_map(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~
116 | pred_map.begin(), get(vertex_index, g), pred_map[0]),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
117 | get(edge_weight, g));
| ~~~~~~~~~~~~~~~~~~~~
minST.cpp:20:38: required from here
20 | kruskal_minimum_spanning_tree(g, std::back_inserter(spanning_tree));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
20 | ~usage_requirements() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::OutputIterator<TT, ValueT>::~OutputIterator() [with TT = std::back_insert_iterator<std::vector<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > >; ValueT = boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>]’
37 | ~model()
| ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:529:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
529 | BOOST_CONCEPT_USAGE(OutputIterator) {
| ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::constraint<Model>::failed() [with Model = boost::ReadablePropertyMapConcept<boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>, long unsigned int>]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:206:7: required from ‘void boost::ReadWritePropertyMapConcept<PMap, Key>::constraints() [with PMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; Key = long unsigned int]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::ReadWritePropertyMapConcept<boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>, long unsigned int>]’
32 | inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
| ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied<boost::ReadWritePropertyMapConcept<boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>, long unsigned int> >::value’
44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied<boost::ReadWritePropertyMapConcept<boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>, long unsigned int> >’
45 | typedef boost::integral_constant<bool, value> type;
| ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_<void (*)(boost::ReadWritePropertyMapConcept<boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>, long unsigned int>)>’
72 | struct requirement_<void(*)(Model)>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:58:9: required from ‘void boost::detail::kruskal_mst_impl(const Graph&, OutputIterator, Rank, Parent, Weight) [with Graph = R_adjacency_list<boost::directedS, double>; OutputIterator = std::back_insert_iterator<std::vector<edge_desc_impl<boost::directed_tag, long unsigned int> > >; Rank = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; Parent = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; Weight = boost::adj_list_edge_property_map<boost::directed_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:112:29: required from ‘void boost::kruskal_minimum_spanning_tree(const Graph&, OutputIterator) [with Graph = R_adjacency_list<directedS, double>; OutputIterator = std::back_insert_iterator<std::vector<detail::edge_desc_impl<directed_tag, long unsigned int> > >]’
112 | detail::kruskal_mst_impl(g, spanning_tree_edges,
| ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
113 | make_iterator_property_map(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~
114 | rank_map.begin(), get(vertex_index, g), rank_map[0]),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
115 | make_iterator_property_map(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~
116 | pred_map.begin(), get(vertex_index, g), pred_map[0]),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
117 | get(edge_weight, g));
| ~~~~~~~~~~~~~~~~~~~~
minST.cpp:20:38: required from here
20 | kruskal_minimum_spanning_tree(g, std::back_inserter(spanning_tree));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:65:52: warning: ‘this’ pointer is null [-Wnonnull]
65 | static void failed() { ((Model*)0)->constraints(); }
| ~~~~~~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:147:10: note: in a call to non-static member function ‘void boost::ReadablePropertyMapConcept<PMap, Key>::constraints() [with PMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; Key = long unsigned int]’
147 | void constraints() {
| ^~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::constraint<Model>::failed() [with Model = boost::WritablePropertyMapConcept<boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>, long unsigned int>]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:207:7: required from ‘void boost::ReadWritePropertyMapConcept<PMap, Key>::constraints() [with PMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; Key = long unsigned int]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::ReadWritePropertyMapConcept<boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>, long unsigned int>]’
32 | inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
| ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied<boost::ReadWritePropertyMapConcept<boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>, long unsigned int> >::value’
44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied<boost::ReadWritePropertyMapConcept<boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>, long unsigned int> >’
45 | typedef boost::integral_constant<bool, value> type;
| ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_<void (*)(boost::ReadWritePropertyMapConcept<boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>, long unsigned int>)>’
72 | struct requirement_<void(*)(Model)>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:58:9: required from ‘void boost::detail::kruskal_mst_impl(const Graph&, OutputIterator, Rank, Parent, Weight) [with Graph = R_adjacency_list<boost::directedS, double>; OutputIterator = std::back_insert_iterator<std::vector<edge_desc_impl<boost::directed_tag, long unsigned int> > >; Rank = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; Parent = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; Weight = boost::adj_list_edge_property_map<boost::directed_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:112:29: required from ‘void boost::kruskal_minimum_spanning_tree(const Graph&, OutputIterator) [with Graph = R_adjacency_list<directedS, double>; OutputIterator = std::back_insert_iterator<std::vector<detail::edge_desc_impl<directed_tag, long unsigned int> > >]’
112 | detail::kruskal_mst_impl(g, spanning_tree_edges,
| ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
113 | make_iterator_property_map(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~
114 | rank_map.begin(), get(vertex_index, g), rank_map[0]),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
115 | make_iterator_property_map(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~
116 | pred_map.begin(), get(vertex_index, g), pred_map[0]),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
117 | get(edge_weight, g));
| ~~~~~~~~~~~~~~~~~~~~
minST.cpp:20:38: required from here
20 | kruskal_minimum_spanning_tree(g, std::back_inserter(spanning_tree));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:65:52: warning: ‘this’ pointer is null [-Wnonnull]
65 | static void failed() { ((Model*)0)->constraints(); }
| ~~~~~~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:179:10: note: in a call to non-static member function ‘void boost::WritablePropertyMapConcept<PMap, Key>::constraints() [with PMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; Key = long unsigned int]’
179 | void constraints() {
| ^~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Convertible<boost::lvalue_property_map_tag, boost::read_write_property_map_tag> >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/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> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/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))
| ^~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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);
| ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/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) );
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/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;
| ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied<boost::ReadWritePropertyMapConcept<boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>, long unsigned int> >::value’
44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied<boost::ReadWritePropertyMapConcept<boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>, long unsigned int> >’
45 | typedef boost::integral_constant<bool, value> type;
| ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_<void (*)(boost::ReadWritePropertyMapConcept<boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>, long unsigned int>)>’
72 | struct requirement_<void(*)(Model)>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:58:9: required from ‘void boost::detail::kruskal_mst_impl(const Graph&, OutputIterator, Rank, Parent, Weight) [with Graph = R_adjacency_list<boost::directedS, double>; OutputIterator = std::back_insert_iterator<std::vector<edge_desc_impl<boost::directed_tag, long unsigned int> > >; Rank = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; Parent = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; Weight = boost::adj_list_edge_property_map<boost::directed_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:112:29: required from ‘void boost::kruskal_minimum_spanning_tree(const Graph&, OutputIterator) [with Graph = R_adjacency_list<directedS, double>; OutputIterator = std::back_insert_iterator<std::vector<detail::edge_desc_impl<directed_tag, long unsigned int> > >]’
112 | detail::kruskal_mst_impl(g, spanning_tree_edges,
| ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
113 | make_iterator_property_map(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~
114 | rank_map.begin(), get(vertex_index, g), rank_map[0]),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
115 | make_iterator_property_map(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~
116 | pred_map.begin(), get(vertex_index, g), pred_map[0]),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
117 | get(edge_weight, g));
| ~~~~~~~~~~~~~~~~~~~~
minST.cpp:20:38: required from here
20 | kruskal_minimum_spanning_tree(g, std::back_inserter(spanning_tree));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Convertible<boost::lvalue_property_map_tag, boost::read_write_property_map_tag>]’
20 | ~usage_requirements() { ((Model*)0)->~Model(); }
| ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::ConvertibleConcept<boost::lvalue_property_map_tag, boost::read_write_property_map_tag>]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:208:7: required from ‘void boost::ReadWritePropertyMapConcept<PMap, Key>::constraints() [with PMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; Key = long unsigned int]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::ReadWritePropertyMapConcept<boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>, long unsigned int>]’
32 | inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
| ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied<boost::ReadWritePropertyMapConcept<boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>, long unsigned int> >::value’
44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied<boost::ReadWritePropertyMapConcept<boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>, long unsigned int> >’
45 | typedef boost::integral_constant<bool, value> type;
| ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_<void (*)(boost::ReadWritePropertyMapConcept<boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>, long unsigned int>)>’
72 | struct requirement_<void(*)(Model)>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:58:9: required from ‘void boost::detail::kruskal_mst_impl(const Graph&, OutputIterator, Rank, Parent, Weight) [with Graph = R_adjacency_list<boost::directedS, double>; OutputIterator = std::back_insert_iterator<std::vector<edge_desc_impl<boost::directed_tag, long unsigned int> > >; Rank = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; Parent = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; Weight = boost::adj_list_edge_property_map<boost::directed_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:112:29: required from ‘void boost::kruskal_minimum_spanning_tree(const Graph&, OutputIterator) [with Graph = R_adjacency_list<directedS, double>; OutputIterator = std::back_insert_iterator<std::vector<detail::edge_desc_impl<directed_tag, long unsigned int> > >]’
112 | detail::kruskal_mst_impl(g, spanning_tree_edges,
| ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
113 | make_iterator_property_map(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~
114 | rank_map.begin(), get(vertex_index, g), rank_map[0]),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
115 | make_iterator_property_map(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~
116 | pred_map.begin(), get(vertex_index, g), pred_map[0]),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
117 | get(edge_weight, g));
| ~~~~~~~~~~~~~~~~~~~~
minST.cpp:20:38: required from here
20 | kruskal_minimum_spanning_tree(g, std::back_inserter(spanning_tree));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:206:17: note: in a call to non-static member function ‘boost::ConvertibleConcept<boost::lvalue_property_map_tag, boost::read_write_property_map_tag>::~ConvertibleConcept()’
206 | BOOST_concept(Convertible,(X)(Y))
| ^~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/preprocessor/cat.hpp:29:34: note: in definition of macro ‘BOOST_PP_CAT_I’
29 | # define BOOST_PP_CAT_I(a, b) a ## b
| ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/concept_def.hpp:23:12: note: in expansion of macro ‘BOOST_PP_CAT’
23 | struct BOOST_PP_CAT(name,Concept) \
| ^~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:206:3: note: in expansion of macro ‘BOOST_concept’
206 | BOOST_concept(Convertible,(X)(Y))
| ^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Convertible<boost::lvalue_property_map_tag, boost::readable_property_map_tag> >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/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> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/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))
| ^~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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);
| ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/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) );
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/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;
| ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied<boost::ReadablePropertyMapConcept<boost::adj_list_edge_property_map<boost::directed_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > >::value’
44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied<boost::ReadablePropertyMapConcept<boost::adj_list_edge_property_map<boost::directed_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > >’
45 | typedef boost::integral_constant<bool, value> type;
| ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_<void (*)(boost::ReadablePropertyMapConcept<boost::adj_list_edge_property_map<boost::directed_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> >)>’
72 | struct requirement_<void(*)(Model)>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:60:9: required from ‘void boost::detail::kruskal_mst_impl(const Graph&, OutputIterator, Rank, Parent, Weight) [with Graph = R_adjacency_list<boost::directedS, double>; OutputIterator = std::back_insert_iterator<std::vector<edge_desc_impl<boost::directed_tag, long unsigned int> > >; Rank = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; Parent = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; Weight = boost::adj_list_edge_property_map<boost::directed_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:112:29: required from ‘void boost::kruskal_minimum_spanning_tree(const Graph&, OutputIterator) [with Graph = R_adjacency_list<directedS, double>; OutputIterator = std::back_insert_iterator<std::vector<detail::edge_desc_impl<directed_tag, long unsigned int> > >]’
112 | detail::kruskal_mst_impl(g, spanning_tree_edges,
| ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
113 | make_iterator_property_map(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~
114 | rank_map.begin(), get(vertex_index, g), rank_map[0]),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
115 | make_iterator_property_map(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~
116 | pred_map.begin(), get(vertex_index, g), pred_map[0]),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
117 | get(edge_weight, g));
| ~~~~~~~~~~~~~~~~~~~~
minST.cpp:20:38: required from here
20 | kruskal_minimum_spanning_tree(g, std::back_inserter(spanning_tree));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Convertible<boost::lvalue_property_map_tag, boost::readable_property_map_tag>]’
20 | ~usage_requirements() { ((Model*)0)->~Model(); }
| ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::ConvertibleConcept<boost::lvalue_property_map_tag, boost::readable_property_map_tag>]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:148:7: required from ‘void boost::ReadablePropertyMapConcept<PMap, Key>::constraints() [with PMap = boost::adj_list_edge_property_map<boost::directed_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>; Key = boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::ReadablePropertyMapConcept<boost::adj_list_edge_property_map<boost::directed_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> >]’
32 | inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
| ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied<boost::ReadablePropertyMapConcept<boost::adj_list_edge_property_map<boost::directed_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > >::value’
44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied<boost::ReadablePropertyMapConcept<boost::adj_list_edge_property_map<boost::directed_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > >’
45 | typedef boost::integral_constant<bool, value> type;
| ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_<void (*)(boost::ReadablePropertyMapConcept<boost::adj_list_edge_property_map<boost::directed_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> >)>’
72 | struct requirement_<void(*)(Model)>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:60:9: required from ‘void boost::detail::kruskal_mst_impl(const Graph&, OutputIterator, Rank, Parent, Weight) [with Graph = R_adjacency_list<boost::directedS, double>; OutputIterator = std::back_insert_iterator<std::vector<edge_desc_impl<boost::directed_tag, long unsigned int> > >; Rank = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; Parent = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; Weight = boost::adj_list_edge_property_map<boost::directed_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:112:29: required from ‘void boost::kruskal_minimum_spanning_tree(const Graph&, OutputIterator) [with Graph = R_adjacency_list<directedS, double>; OutputIterator = std::back_insert_iterator<std::vector<detail::edge_desc_impl<directed_tag, long unsigned int> > >]’
112 | detail::kruskal_mst_impl(g, spanning_tree_edges,
| ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
113 | make_iterator_property_map(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~
114 | rank_map.begin(), get(vertex_index, g), rank_map[0]),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
115 | make_iterator_property_map(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~
116 | pred_map.begin(), get(vertex_index, g), pred_map[0]),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
117 | get(edge_weight, g));
| ~~~~~~~~~~~~~~~~~~~~
minST.cpp:20:38: required from here
20 | kruskal_minimum_spanning_tree(g, std::back_inserter(spanning_tree));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:206:17: note: in a call to non-static member function ‘boost::ConvertibleConcept<boost::lvalue_property_map_tag, boost::readable_property_map_tag>::~ConvertibleConcept()’
206 | BOOST_concept(Convertible,(X)(Y))
| ^~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/preprocessor/cat.hpp:29:34: note: in definition of macro ‘BOOST_PP_CAT_I’
29 | # define BOOST_PP_CAT_I(a, b) a ## b
| ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/concept_def.hpp:23:12: note: in expansion of macro ‘BOOST_PP_CAT’
23 | struct BOOST_PP_CAT(name,Concept) \
| ^~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:206:3: note: in expansion of macro ‘BOOST_concept’
206 | BOOST_concept(Convertible,(X)(Y))
| ^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Comparable<double>]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Comparable<double> >]’
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:253:5: required from ‘struct boost::Comparable<double>’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:251:3: required from ‘struct boost::ComparableConcept<double>’
251 | BOOST_concept(Comparable,(TT))
| ^~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::ComparableConcept<double>]’
32 | inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
| ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied<boost::ComparableConcept<double> >::value’
44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied<boost::ComparableConcept<double> >’
45 | typedef boost::integral_constant<bool, value> type;
| ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_<void (*)(boost::ComparableConcept<double>)>’
72 | struct requirement_<void(*)(Model)>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:64:9: required from ‘void boost::detail::kruskal_mst_impl(const Graph&, OutputIterator, Rank, Parent, Weight) [with Graph = R_adjacency_list<boost::directedS, double>; OutputIterator = std::back_insert_iterator<std::vector<edge_desc_impl<boost::directed_tag, long unsigned int> > >; Rank = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; Parent = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; Weight = boost::adj_list_edge_property_map<boost::directed_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:112:29: required from ‘void boost::kruskal_minimum_spanning_tree(const Graph&, OutputIterator) [with Graph = R_adjacency_list<directedS, double>; OutputIterator = std::back_insert_iterator<std::vector<detail::edge_desc_impl<directed_tag, long unsigned int> > >]’
112 | detail::kruskal_mst_impl(g, spanning_tree_edges,
| ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
113 | make_iterator_property_map(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~
114 | rank_map.begin(), get(vertex_index, g), rank_map[0]),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
115 | make_iterator_property_map(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~
116 | pred_map.begin(), get(vertex_index, g), pred_map[0]),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
117 | get(edge_weight, g));
| ~~~~~~~~~~~~~~~~~~~~
minST.cpp:20:38: required from here
20 | kruskal_minimum_spanning_tree(g, std::back_inserter(spanning_tree));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
20 | ~usage_requirements() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Comparable<TT>::~Comparable() [with TT = double]’
37 | ~model()
| ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:253:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
253 | BOOST_CONCEPT_USAGE(Comparable) {
| ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Convertible<long unsigned int, long unsigned int>]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Convertible<long unsigned int, long unsigned int> >]’
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible<long unsigned int, long unsigned int>’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:206:3: required from ‘struct boost::ConvertibleConcept<long unsigned int, long unsigned int>’
206 | BOOST_concept(Convertible,(X)(Y))
| ^~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::ConvertibleConcept<long unsigned int, long unsigned int>]’
32 | inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
| ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied<boost::ConvertibleConcept<long unsigned int, long unsigned int> >::value’
44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied<boost::ConvertibleConcept<long unsigned int, long unsigned int> >’
45 | typedef boost::integral_constant<bool, value> type;
| ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_<void (*)(boost::ConvertibleConcept<long unsigned int, long unsigned int>)>’
72 | struct requirement_<void(*)(Model)>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:65:9: required from ‘void boost::detail::kruskal_mst_impl(const Graph&, OutputIterator, Rank, Parent, Weight) [with Graph = R_adjacency_list<boost::directedS, double>; OutputIterator = std::back_insert_iterator<std::vector<edge_desc_impl<boost::directed_tag, long unsigned int> > >; Rank = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; Parent = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; Weight = boost::adj_list_edge_property_map<boost::directed_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:112:29: required from ‘void boost::kruskal_minimum_spanning_tree(const Graph&, OutputIterator) [with Graph = R_adjacency_list<directedS, double>; OutputIterator = std::back_insert_iterator<std::vector<detail::edge_desc_impl<directed_tag, long unsigned int> > >]’
112 | detail::kruskal_mst_impl(g, spanning_tree_edges,
| ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
113 | make_iterator_property_map(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~
114 | rank_map.begin(), get(vertex_index, g), rank_map[0]),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
115 | make_iterator_property_map(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~
116 | pred_map.begin(), get(vertex_index, g), pred_map[0]),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
117 | get(edge_weight, g));
| ~~~~~~~~~~~~~~~~~~~~
minST.cpp:20:38: required from here
20 | kruskal_minimum_spanning_tree(g, std::back_inserter(spanning_tree));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
20 | ~usage_requirements() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible<X, Y>::~Convertible() [with X = long unsigned int; Y = long unsigned int]’
37 | ~model()
| ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
208 | BOOST_CONCEPT_USAGE(Convertible) {
| ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::concepts::Graph<R_adjacency_list<boost::undirectedS, double> >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/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<R_adjacency_list<boost::undirectedS, double> > >]’
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:66:5: required from ‘struct boost::concepts::Graph<R_adjacency_list<boost::undirectedS, double> >’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:176:1: required from ‘struct boost::concepts::VertexListGraph<R_adjacency_list<boost::undirectedS, double> >’
176 | BOOST_concept(VertexListGraph, (G)) : Graph< G >
| ^~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:176:1: required from ‘struct boost::concepts::VertexListGraphConcept<R_adjacency_list<boost::undirectedS, double> >’
176 | BOOST_concept(VertexListGraph, (G)) : Graph< G >
| ^~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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<R_adjacency_list<boost::undirectedS, double> >]’
32 | inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
| ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied<boost::concepts::VertexListGraphConcept<R_adjacency_list<boost::undirectedS, double> > >::value’
44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied<boost::concepts::VertexListGraphConcept<R_adjacency_list<boost::undirectedS, double> > >’
45 | typedef boost::integral_constant<bool, value> type;
| ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_<void (*)(boost::concepts::VertexListGraphConcept<R_adjacency_list<boost::undirectedS, double> >)>’
72 | struct requirement_<void(*)(Model)>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:55:9: required from ‘void boost::detail::kruskal_mst_impl(const Graph&, OutputIterator, Rank, Parent, Weight) [with Graph = R_adjacency_list<boost::undirectedS, double>; OutputIterator = std::back_insert_iterator<std::vector<edge_desc_impl<boost::undirected_tag, long unsigned int> > >; Rank = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; Parent = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; Weight = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:112:29: required from ‘void boost::kruskal_minimum_spanning_tree(const Graph&, OutputIterator) [with Graph = R_adjacency_list<undirectedS, double>; OutputIterator = std::back_insert_iterator<std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int> > >]’
112 | detail::kruskal_mst_impl(g, spanning_tree_edges,
| ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
113 | make_iterator_property_map(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~
114 | rank_map.begin(), get(vertex_index, g), rank_map[0]),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
115 | make_iterator_property_map(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~
116 | pred_map.begin(), get(vertex_index, g), pred_map[0]),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
117 | get(edge_weight, g));
| ~~~~~~~~~~~~~~~~~~~~
minST.cpp:54:38: required from here
54 | kruskal_minimum_spanning_tree(g, std::back_inserter(spanning_tree));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
20 | ~usage_requirements() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::concepts::Graph<G>::~Graph() [with G = R_adjacency_list<boost::undirectedS, double>]’
37 | ~model()
| ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:66:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
66 | BOOST_CONCEPT_USAGE(Graph)
| ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::concepts::VertexListGraph<R_adjacency_list<boost::undirectedS, double> >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/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<R_adjacency_list<boost::undirectedS, double> > >]’
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:182:5: required from ‘struct boost::concepts::VertexListGraph<R_adjacency_list<boost::undirectedS, double> >’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:176:1: required from ‘struct boost::concepts::VertexListGraphConcept<R_adjacency_list<boost::undirectedS, double> >’
176 | BOOST_concept(VertexListGraph, (G)) : Graph< G >
| ^~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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<R_adjacency_list<boost::undirectedS, double> >]’
32 | inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
| ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied<boost::concepts::VertexListGraphConcept<R_adjacency_list<boost::undirectedS, double> > >::value’
44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied<boost::concepts::VertexListGraphConcept<R_adjacency_list<boost::undirectedS, double> > >’
45 | typedef boost::integral_constant<bool, value> type;
| ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_<void (*)(boost::concepts::VertexListGraphConcept<R_adjacency_list<boost::undirectedS, double> >)>’
72 | struct requirement_<void(*)(Model)>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:55:9: required from ‘void boost::detail::kruskal_mst_impl(const Graph&, OutputIterator, Rank, Parent, Weight) [with Graph = R_adjacency_list<boost::undirectedS, double>; OutputIterator = std::back_insert_iterator<std::vector<edge_desc_impl<boost::undirected_tag, long unsigned int> > >; Rank = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; Parent = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; Weight = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:112:29: required from ‘void boost::kruskal_minimum_spanning_tree(const Graph&, OutputIterator) [with Graph = R_adjacency_list<undirectedS, double>; OutputIterator = std::back_insert_iterator<std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int> > >]’
112 | detail::kruskal_mst_impl(g, spanning_tree_edges,
| ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
113 | make_iterator_property_map(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~
114 | rank_map.begin(), get(vertex_index, g), rank_map[0]),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
115 | make_iterator_property_map(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~
116 | pred_map.begin(), get(vertex_index, g), pred_map[0]),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
117 | get(edge_weight, g));
| ~~~~~~~~~~~~~~~~~~~~
minST.cpp:54:38: required from here
54 | kruskal_minimum_spanning_tree(g, std::back_inserter(spanning_tree));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
20 | ~usage_requirements() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::concepts::VertexListGraph<G>::~VertexListGraph() [with G = R_adjacency_list<boost::undirectedS, double>]’
37 | ~model()
| ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:182:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
182 | BOOST_CONCEPT_USAGE(VertexListGraph)
| ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::concepts::EdgeListGraph<R_adjacency_list<boost::undirectedS, double> >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/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<R_adjacency_list<boost::undirectedS, double> > >]’
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:233:5: required from ‘struct boost::concepts::EdgeListGraph<R_adjacency_list<boost::undirectedS, double> >’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:226:1: required from ‘struct boost::concepts::EdgeListGraphConcept<R_adjacency_list<boost::undirectedS, double> >’
226 | BOOST_concept(EdgeListGraph, (G)) : Graph< G >
| ^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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<R_adjacency_list<boost::undirectedS, double> >]’
32 | inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
| ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied<boost::concepts::EdgeListGraphConcept<R_adjacency_list<boost::undirectedS, double> > >::value’
44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied<boost::concepts::EdgeListGraphConcept<R_adjacency_list<boost::undirectedS, double> > >’
45 | typedef boost::integral_constant<bool, value> type;
| ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_<void (*)(boost::concepts::EdgeListGraphConcept<R_adjacency_list<boost::undirectedS, double> >)>’
72 | struct requirement_<void(*)(Model)>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:56:9: required from ‘void boost::detail::kruskal_mst_impl(const Graph&, OutputIterator, Rank, Parent, Weight) [with Graph = R_adjacency_list<boost::undirectedS, double>; OutputIterator = std::back_insert_iterator<std::vector<edge_desc_impl<boost::undirected_tag, long unsigned int> > >; Rank = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; Parent = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; Weight = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:112:29: required from ‘void boost::kruskal_minimum_spanning_tree(const Graph&, OutputIterator) [with Graph = R_adjacency_list<undirectedS, double>; OutputIterator = std::back_insert_iterator<std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int> > >]’
112 | detail::kruskal_mst_impl(g, spanning_tree_edges,
| ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
113 | make_iterator_property_map(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~
114 | rank_map.begin(), get(vertex_index, g), rank_map[0]),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
115 | make_iterator_property_map(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~
116 | pred_map.begin(), get(vertex_index, g), pred_map[0]),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
117 | get(edge_weight, g));
| ~~~~~~~~~~~~~~~~~~~~
minST.cpp:54:38: required from here
54 | kruskal_minimum_spanning_tree(g, std::back_inserter(spanning_tree));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
20 | ~usage_requirements() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::concepts::EdgeListGraph<G>::~EdgeListGraph() [with G = R_adjacency_list<boost::undirectedS, double>]’
37 | ~model()
| ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:233:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
233 | BOOST_CONCEPT_USAGE(EdgeListGraph)
| ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Assignable<std::back_insert_iterator<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Assignable<std::back_insert_iterator<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > > > >]’
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:145:5: required from ‘struct boost::Assignable<std::back_insert_iterator<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > > >’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:526:3: required from ‘struct boost::OutputIterator<std::back_insert_iterator<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> >’
526 | BOOST_concept(OutputIterator,(TT)(ValueT))
| ^~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:526:3: required from ‘struct boost::OutputIteratorConcept<std::back_insert_iterator<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> >’
526 | BOOST_concept(OutputIterator,(TT)(ValueT))
| ^~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::OutputIteratorConcept<std::back_insert_iterator<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> >]’
32 | inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
| ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied<boost::OutputIteratorConcept<std::back_insert_iterator<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >::value’
44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied<boost::OutputIteratorConcept<std::back_insert_iterator<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >’
45 | typedef boost::integral_constant<bool, value> type;
| ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_<void (*)(boost::OutputIteratorConcept<std::back_insert_iterator<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> >)>’
72 | struct requirement_<void(*)(Model)>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:57:9: required from ‘void boost::detail::kruskal_mst_impl(const Graph&, OutputIterator, Rank, Parent, Weight) [with Graph = R_adjacency_list<boost::undirectedS, double>; OutputIterator = std::back_insert_iterator<std::vector<edge_desc_impl<boost::undirected_tag, long unsigned int> > >; Rank = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; Parent = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; Weight = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:112:29: required from ‘void boost::kruskal_minimum_spanning_tree(const Graph&, OutputIterator) [with Graph = R_adjacency_list<undirectedS, double>; OutputIterator = std::back_insert_iterator<std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int> > >]’
112 | detail::kruskal_mst_impl(g, spanning_tree_edges,
| ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
113 | make_iterator_property_map(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~
114 | rank_map.begin(), get(vertex_index, g), rank_map[0]),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
115 | make_iterator_property_map(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~
116 | pred_map.begin(), get(vertex_index, g), pred_map[0]),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
117 | get(edge_weight, g));
| ~~~~~~~~~~~~~~~~~~~~
minST.cpp:54:38: required from here
54 | kruskal_minimum_spanning_tree(g, std::back_inserter(spanning_tree));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
20 | ~usage_requirements() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Assignable<TT>::~Assignable() [with TT = std::back_insert_iterator<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >]’
37 | ~model()
| ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:145:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
145 | BOOST_CONCEPT_USAGE(Assignable) {
| ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::OutputIterator<std::back_insert_iterator<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::OutputIterator<std::back_insert_iterator<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >]’
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:529:5: required from ‘struct boost::OutputIterator<std::back_insert_iterator<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> >’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:526:3: required from ‘struct boost::OutputIteratorConcept<std::back_insert_iterator<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> >’
526 | BOOST_concept(OutputIterator,(TT)(ValueT))
| ^~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::OutputIteratorConcept<std::back_insert_iterator<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> >]’
32 | inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
| ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied<boost::OutputIteratorConcept<std::back_insert_iterator<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >::value’
44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied<boost::OutputIteratorConcept<std::back_insert_iterator<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >’
45 | typedef boost::integral_constant<bool, value> type;
| ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_<void (*)(boost::OutputIteratorConcept<std::back_insert_iterator<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> >)>’
72 | struct requirement_<void(*)(Model)>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:57:9: required from ‘void boost::detail::kruskal_mst_impl(const Graph&, OutputIterator, Rank, Parent, Weight) [with Graph = R_adjacency_list<boost::undirectedS, double>; OutputIterator = std::back_insert_iterator<std::vector<edge_desc_impl<boost::undirected_tag, long unsigned int> > >; Rank = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; Parent = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; Weight = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:112:29: required from ‘void boost::kruskal_minimum_spanning_tree(const Graph&, OutputIterator) [with Graph = R_adjacency_list<undirectedS, double>; OutputIterator = std::back_insert_iterator<std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int> > >]’
112 | detail::kruskal_mst_impl(g, spanning_tree_edges,
| ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
113 | make_iterator_property_map(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~
114 | rank_map.begin(), get(vertex_index, g), rank_map[0]),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
115 | make_iterator_property_map(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~
116 | pred_map.begin(), get(vertex_index, g), pred_map[0]),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
117 | get(edge_weight, g));
| ~~~~~~~~~~~~~~~~~~~~
minST.cpp:54:38: required from here
54 | kruskal_minimum_spanning_tree(g, std::back_inserter(spanning_tree));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
20 | ~usage_requirements() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::OutputIterator<TT, ValueT>::~OutputIterator() [with TT = std::back_insert_iterator<std::vector<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >; ValueT = boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>]’
37 | ~model()
| ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:529:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
529 | BOOST_CONCEPT_USAGE(OutputIterator) {
| ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Convertible<std::random_access_iterator_tag, std::random_access_iterator_tag> >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/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> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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);
| ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/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) );
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/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;
| ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/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)>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:603:11: required from ‘boost::RandomAccessIterator<TT>::~RandomAccessIterator() [with TT = __gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3: required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > >]’
597 | BOOST_concept(RandomAccessIterator,(TT))
| ^~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map<RAIter, ID, Value, Value&> boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >; Value = long unsigned int; ID = vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:113:35: required from ‘void boost::kruskal_minimum_spanning_tree(const Graph&, OutputIterator) [with Graph = R_adjacency_list<directedS, double>; OutputIterator = std::back_insert_iterator<std::vector<detail::edge_desc_impl<directed_tag, long unsigned int> > >]’
113 | make_iterator_property_map(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^
114 | rank_map.begin(), get(vertex_index, g), rank_map[0]),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
minST.cpp:20:38: required from here
20 | kruskal_minimum_spanning_tree(g, std::back_inserter(spanning_tree));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Convertible<std::random_access_iterator_tag, std::random_access_iterator_tag>]’
20 | ~usage_requirements() { ((Model*)0)->~Model(); }
| ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::Convertible<std::random_access_iterator_tag, std::random_access_iterator_tag>]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:603:11: required from ‘boost::RandomAccessIterator<TT>::~RandomAccessIterator() [with TT = __gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3: required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > >]’
597 | BOOST_concept(RandomAccessIterator,(TT))
| ^~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map<RAIter, ID, Value, Value&> boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >; Value = long unsigned int; ID = vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:113:35: required from ‘void boost::kruskal_minimum_spanning_tree(const Graph&, OutputIterator) [with Graph = R_adjacency_list<directedS, double>; OutputIterator = std::back_insert_iterator<std::vector<detail::edge_desc_impl<directed_tag, long unsigned int> > >]’
113 | make_iterator_property_map(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^
114 | rank_map.begin(), get(vertex_index, g), rank_map[0]),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
minST.cpp:20:38: required from here
20 | kruskal_minimum_spanning_tree(g, std::back_inserter(spanning_tree));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible<X, Y>::~Convertible() [with X = std::random_access_iterator_tag; Y = std::random_access_iterator_tag]’
37 | ~model()
| ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
208 | BOOST_CONCEPT_USAGE(Convertible) {
| ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::concepts::MultiPassInputIterator<boost::range_detail::integer_iterator<long unsigned int> > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:52:50: required from ‘struct boost::concepts::MultiPassInputIterator<boost::range_detail::integer_iterator<long unsigned int> >’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::concepts::MultiPassInputIterator<boost::range_detail::integer_iterator<long unsigned int> >]’
32 | inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
| ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied<boost::concepts::MultiPassInputIterator<boost::range_detail::integer_iterator<long unsigned int> > >::value’
44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied<boost::concepts::MultiPassInputIterator<boost::range_detail::integer_iterator<long unsigned int> > >’
45 | typedef boost::integral_constant<bool, value> type;
| ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_<void (*)(boost::concepts::MultiPassInputIterator<boost::range_detail::integer_iterator<long unsigned int> >)>’
72 | struct requirement_<void(*)(Model)>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:184:9: required from ‘boost::concepts::VertexListGraph<G>::~VertexListGraph() [with G = R_adjacency_list<boost::directedS, double>]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/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<R_adjacency_list<boost::directedS, double> >]’
176 | BOOST_concept(VertexListGraph, (G)) : Graph< G >
| ^~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:55:9: required from ‘void boost::detail::kruskal_mst_impl(const Graph&, OutputIterator, Rank, Parent, Weight) [with Graph = R_adjacency_list<boost::directedS, double>; OutputIterator = std::back_insert_iterator<std::vector<edge_desc_impl<boost::directed_tag, long unsigned int> > >; Rank = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; Parent = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; Weight = boost::adj_list_edge_property_map<boost::directed_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:112:29: required from ‘void boost::kruskal_minimum_spanning_tree(const Graph&, OutputIterator) [with Graph = R_adjacency_list<directedS, double>; OutputIterator = std::back_insert_iterator<std::vector<detail::edge_desc_impl<directed_tag, long unsigned int> > >]’
112 | detail::kruskal_mst_impl(g, spanning_tree_edges,
| ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
113 | make_iterator_property_map(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~
114 | rank_map.begin(), get(vertex_index, g), rank_map[0]),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
115 | make_iterator_property_map(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~
116 | pred_map.begin(), get(vertex_index, g), pred_map[0]),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
117 | get(edge_weight, g));
| ~~~~~~~~~~~~~~~~~~~~
minST.cpp:20:38: required from here
20 | kruskal_minimum_spanning_tree(g, std::back_inserter(spanning_tree));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::concepts::MultiPassInputIterator<boost::range_detail::integer_iterator<long unsigned int> >]’
20 | ~usage_requirements() { ((Model*)0)->~Model(); }
| ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::MultiPassInputIterator<boost::range_detail::integer_iterator<long unsigned int> >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:184:9: required from ‘boost::concepts::VertexListGraph<G>::~VertexListGraph() [with G = R_adjacency_list<boost::directedS, double>]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/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<R_adjacency_list<boost::directedS, double> >]’
176 | BOOST_concept(VertexListGraph, (G)) : Graph< G >
| ^~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:55:9: required from ‘void boost::detail::kruskal_mst_impl(const Graph&, OutputIterator, Rank, Parent, Weight) [with Graph = R_adjacency_list<boost::directedS, double>; OutputIterator = std::back_insert_iterator<std::vector<edge_desc_impl<boost::directed_tag, long unsigned int> > >; Rank = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; Parent = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; Weight = boost::adj_list_edge_property_map<boost::directed_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:112:29: required from ‘void boost::kruskal_minimum_spanning_tree(const Graph&, OutputIterator) [with Graph = R_adjacency_list<directedS, double>; OutputIterator = std::back_insert_iterator<std::vector<detail::edge_desc_impl<directed_tag, long unsigned int> > >]’
112 | detail::kruskal_mst_impl(g, spanning_tree_edges,
| ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
113 | make_iterator_property_map(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~
114 | rank_map.begin(), get(vertex_index, g), rank_map[0]),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
115 | make_iterator_property_map(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~
116 | pred_map.begin(), get(vertex_index, g), pred_map[0]),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
117 | get(edge_weight, g));
| ~~~~~~~~~~~~~~~~~~~~
minST.cpp:20:38: required from here
20 | kruskal_minimum_spanning_tree(g, std::back_inserter(spanning_tree));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::concepts::MultiPassInputIterator<T>::~MultiPassInputIterator() [with T = boost::range_detail::integer_iterator<long unsigned int>]’
37 | ~model()
| ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:52:50: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
52 | BOOST_concept(MultiPassInputIterator, (T)) { BOOST_CONCEPT_USAGE(
| ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/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> >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/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> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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);
| ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/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) );
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/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;
| ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/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)>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:185:9: required from ‘boost::concepts::VertexListGraph<G>::~VertexListGraph() [with G = R_adjacency_list<boost::directedS, double>]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/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<R_adjacency_list<boost::directedS, double> >]’
176 | BOOST_concept(VertexListGraph, (G)) : Graph< G >
| ^~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:55:9: required from ‘void boost::detail::kruskal_mst_impl(const Graph&, OutputIterator, Rank, Parent, Weight) [with Graph = R_adjacency_list<boost::directedS, double>; OutputIterator = std::back_insert_iterator<std::vector<edge_desc_impl<boost::directed_tag, long unsigned int> > >; Rank = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; Parent = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; Weight = boost::adj_list_edge_property_map<boost::directed_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:112:29: required from ‘void boost::kruskal_minimum_spanning_tree(const Graph&, OutputIterator) [with Graph = R_adjacency_list<directedS, double>; OutputIterator = std::back_insert_iterator<std::vector<detail::edge_desc_impl<directed_tag, long unsigned int> > >]’
112 | detail::kruskal_mst_impl(g, spanning_tree_edges,
| ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
113 | make_iterator_property_map(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~
114 | rank_map.begin(), get(vertex_index, g), rank_map[0]),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
115 | make_iterator_property_map(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~
116 | pred_map.begin(), get(vertex_index, g), pred_map[0]),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
117 | get(edge_weight, g));
| ~~~~~~~~~~~~~~~~~~~~
minST.cpp:20:38: required from here
20 | kruskal_minimum_spanning_tree(g, std::back_inserter(spanning_tree));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/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(); }
| ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/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>]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:185:9: required from ‘boost::concepts::VertexListGraph<G>::~VertexListGraph() [with G = R_adjacency_list<boost::directedS, double>]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/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<R_adjacency_list<boost::directedS, double> >]’
176 | BOOST_concept(VertexListGraph, (G)) : Graph< G >
| ^~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:55:9: required from ‘void boost::detail::kruskal_mst_impl(const Graph&, OutputIterator, Rank, Parent, Weight) [with Graph = R_adjacency_list<boost::directedS, double>; OutputIterator = std::back_insert_iterator<std::vector<edge_desc_impl<boost::directed_tag, long unsigned int> > >; Rank = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; Parent = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; Weight = boost::adj_list_edge_property_map<boost::directed_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:112:29: required from ‘void boost::kruskal_minimum_spanning_tree(const Graph&, OutputIterator) [with Graph = R_adjacency_list<directedS, double>; OutputIterator = std::back_insert_iterator<std::vector<detail::edge_desc_impl<directed_tag, long unsigned int> > >]’
112 | detail::kruskal_mst_impl(g, spanning_tree_edges,
| ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
113 | make_iterator_property_map(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~
114 | rank_map.begin(), get(vertex_index, g), rank_map[0]),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
115 | make_iterator_property_map(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~
116 | pred_map.begin(), get(vertex_index, g), pred_map[0]),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
117 | get(edge_weight, g));
| ~~~~~~~~~~~~~~~~~~~~
minST.cpp:20:38: required from here
20 | kruskal_minimum_spanning_tree(g, std::back_inserter(spanning_tree));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/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()
| ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
208 | BOOST_CONCEPT_USAGE(Convertible) {
| ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/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<boost::range_detail::integer_iterator<long unsigned int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int>, boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_color_t, boost::default_color_type>, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::no_property, boost::listS> > > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:52:50: required from ‘struct boost::concepts::MultiPassInputIterator<boost::detail::adj_list_edge_iterator<boost::range_detail::integer_iterator<long unsigned int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int>, boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_color_t, boost::default_color_type>, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::no_property, boost::listS> > >’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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<boost::range_detail::integer_iterator<long unsigned int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int>, boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_color_t, boost::default_color_type>, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::no_property, boost::listS> > >]’
32 | inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
| ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/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<boost::range_detail::integer_iterator<long unsigned int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int>, boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_color_t, boost::default_color_type>, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::no_property, boost::listS> > > >::value’
44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/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<boost::range_detail::integer_iterator<long unsigned int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int>, boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_color_t, boost::default_color_type>, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::no_property, boost::listS> > > >’
45 | typedef boost::integral_constant<bool, value> type;
| ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/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<boost::range_detail::integer_iterator<long unsigned int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int>, boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_color_t, boost::default_color_type>, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::no_property, boost::listS> > >)>’
72 | struct requirement_<void(*)(Model)>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:235:9: required from ‘boost::concepts::EdgeListGraph<G>::~EdgeListGraph() [with G = R_adjacency_list<boost::directedS, double>]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/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<R_adjacency_list<boost::directedS, double> >]’
226 | BOOST_concept(EdgeListGraph, (G)) : Graph< G >
| ^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:56:9: required from ‘void boost::detail::kruskal_mst_impl(const Graph&, OutputIterator, Rank, Parent, Weight) [with Graph = R_adjacency_list<boost::directedS, double>; OutputIterator = std::back_insert_iterator<std::vector<edge_desc_impl<boost::directed_tag, long unsigned int> > >; Rank = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; Parent = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; Weight = boost::adj_list_edge_property_map<boost::directed_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:112:29: required from ‘void boost::kruskal_minimum_spanning_tree(const Graph&, OutputIterator) [with Graph = R_adjacency_list<directedS, double>; OutputIterator = std::back_insert_iterator<std::vector<detail::edge_desc_impl<directed_tag, long unsigned int> > >]’
112 | detail::kruskal_mst_impl(g, spanning_tree_edges,
| ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
113 | make_iterator_property_map(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~
114 | rank_map.begin(), get(vertex_index, g), rank_map[0]),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
115 | make_iterator_property_map(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~
116 | pred_map.begin(), get(vertex_index, g), pred_map[0]),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
117 | get(edge_weight, g));
| ~~~~~~~~~~~~~~~~~~~~
minST.cpp:20:38: required from here
20 | kruskal_minimum_spanning_tree(g, std::back_inserter(spanning_tree));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/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<boost::range_detail::integer_iterator<long unsigned int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int>, boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_color_t, boost::default_color_type>, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::no_property, boost::listS> > >]’
20 | ~usage_requirements() { ((Model*)0)->~Model(); }
| ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/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<boost::range_detail::integer_iterator<long unsigned int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int>, boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_color_t, boost::default_color_type>, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::no_property, boost::listS> > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:235:9: required from ‘boost::concepts::EdgeListGraph<G>::~EdgeListGraph() [with G = R_adjacency_list<boost::directedS, double>]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/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<R_adjacency_list<boost::directedS, double> >]’
226 | BOOST_concept(EdgeListGraph, (G)) : Graph< G >
| ^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:56:9: required from ‘void boost::detail::kruskal_mst_impl(const Graph&, OutputIterator, Rank, Parent, Weight) [with Graph = R_adjacency_list<boost::directedS, double>; OutputIterator = std::back_insert_iterator<std::vector<edge_desc_impl<boost::directed_tag, long unsigned int> > >; Rank = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; Parent = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; Weight = boost::adj_list_edge_property_map<boost::directed_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:112:29: required from ‘void boost::kruskal_minimum_spanning_tree(const Graph&, OutputIterator) [with Graph = R_adjacency_list<directedS, double>; OutputIterator = std::back_insert_iterator<std::vector<detail::edge_desc_impl<directed_tag, long unsigned int> > >]’
112 | detail::kruskal_mst_impl(g, spanning_tree_edges,
| ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
113 | make_iterator_property_map(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~
114 | rank_map.begin(), get(vertex_index, g), rank_map[0]),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
115 | make_iterator_property_map(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~
116 | pred_map.begin(), get(vertex_index, g), pred_map[0]),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
117 | get(edge_weight, g));
| ~~~~~~~~~~~~~~~~~~~~
minST.cpp:20:38: required from here
20 | kruskal_minimum_spanning_tree(g, std::back_inserter(spanning_tree));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/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<boost::range_detail::integer_iterator<long unsigned int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int>, boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_color_t, boost::default_color_type>, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::no_property, boost::listS> >]’
37 | ~model()
| ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:52:50: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
52 | BOOST_concept(MultiPassInputIterator, (T)) { BOOST_CONCEPT_USAGE(
| ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::DefaultConstructible<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:137:5: required from ‘struct boost::DefaultConstructible<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> >’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::DefaultConstructible<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> >]’
32 | inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
| ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied<boost::DefaultConstructible<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > >::value’
44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied<boost::DefaultConstructible<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > >’
45 | typedef boost::integral_constant<bool, value> type;
| ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_<void (*)(boost::DefaultConstructible<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> >)>’
72 | struct requirement_<void(*)(Model)>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:90:9: required from ‘boost::concepts::EdgeListGraph<G>::~EdgeListGraph() [with G = R_adjacency_list<boost::directedS, double>]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/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<R_adjacency_list<boost::directedS, double> >]’
226 | BOOST_concept(EdgeListGraph, (G)) : Graph< G >
| ^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:56:9: required from ‘void boost::detail::kruskal_mst_impl(const Graph&, OutputIterator, Rank, Parent, Weight) [with Graph = R_adjacency_list<boost::directedS, double>; OutputIterator = std::back_insert_iterator<std::vector<edge_desc_impl<boost::directed_tag, long unsigned int> > >; Rank = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; Parent = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; Weight = boost::adj_list_edge_property_map<boost::directed_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:112:29: required from ‘void boost::kruskal_minimum_spanning_tree(const Graph&, OutputIterator) [with Graph = R_adjacency_list<directedS, double>; OutputIterator = std::back_insert_iterator<std::vector<detail::edge_desc_impl<directed_tag, long unsigned int> > >]’
112 | detail::kruskal_mst_impl(g, spanning_tree_edges,
| ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
113 | make_iterator_property_map(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~
114 | rank_map.begin(), get(vertex_index, g), rank_map[0]),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
115 | make_iterator_property_map(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~
116 | pred_map.begin(), get(vertex_index, g), pred_map[0]),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
117 | get(edge_weight, g));
| ~~~~~~~~~~~~~~~~~~~~
minST.cpp:20:38: required from here
20 | kruskal_minimum_spanning_tree(g, std::back_inserter(spanning_tree));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::DefaultConstructible<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> >]’
20 | ~usage_requirements() { ((Model*)0)->~Model(); }
| ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::DefaultConstructible<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:90:9: required from ‘boost::concepts::EdgeListGraph<G>::~EdgeListGraph() [with G = R_adjacency_list<boost::directedS, double>]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/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<R_adjacency_list<boost::directedS, double> >]’
226 | BOOST_concept(EdgeListGraph, (G)) : Graph< G >
| ^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:56:9: required from ‘void boost::detail::kruskal_mst_impl(const Graph&, OutputIterator, Rank, Parent, Weight) [with Graph = R_adjacency_list<boost::directedS, double>; OutputIterator = std::back_insert_iterator<std::vector<edge_desc_impl<boost::directed_tag, long unsigned int> > >; Rank = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; Parent = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; Weight = boost::adj_list_edge_property_map<boost::directed_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:112:29: required from ‘void boost::kruskal_minimum_spanning_tree(const Graph&, OutputIterator) [with Graph = R_adjacency_list<directedS, double>; OutputIterator = std::back_insert_iterator<std::vector<detail::edge_desc_impl<directed_tag, long unsigned int> > >]’
112 | detail::kruskal_mst_impl(g, spanning_tree_edges,
| ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
113 | make_iterator_property_map(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~
114 | rank_map.begin(), get(vertex_index, g), rank_map[0]),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
115 | make_iterator_property_map(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~
116 | pred_map.begin(), get(vertex_index, g), pred_map[0]),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
117 | get(edge_weight, g));
| ~~~~~~~~~~~~~~~~~~~~
minST.cpp:20:38: required from here
20 | kruskal_minimum_spanning_tree(g, std::back_inserter(spanning_tree));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::DefaultConstructible<TT>::~DefaultConstructible() [with TT = boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>]’
37 | ~model()
| ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:137:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
137 | BOOST_CONCEPT_USAGE(DefaultConstructible) {
| ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::EqualityComparable<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> >’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::EqualityComparable<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> >]’
32 | inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
| ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied<boost::EqualityComparable<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > >::value’
44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied<boost::EqualityComparable<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > >’
45 | typedef boost::integral_constant<bool, value> type;
| ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_<void (*)(boost::EqualityComparable<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> >)>’
72 | struct requirement_<void(*)(Model)>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:91:9: required from ‘boost::concepts::EdgeListGraph<G>::~EdgeListGraph() [with G = R_adjacency_list<boost::directedS, double>]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/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<R_adjacency_list<boost::directedS, double> >]’
226 | BOOST_concept(EdgeListGraph, (G)) : Graph< G >
| ^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:56:9: required from ‘void boost::detail::kruskal_mst_impl(const Graph&, OutputIterator, Rank, Parent, Weight) [with Graph = R_adjacency_list<boost::directedS, double>; OutputIterator = std::back_insert_iterator<std::vector<edge_desc_impl<boost::directed_tag, long unsigned int> > >; Rank = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; Parent = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; Weight = boost::adj_list_edge_property_map<boost::directed_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:112:29: required from ‘void boost::kruskal_minimum_spanning_tree(const Graph&, OutputIterator) [with Graph = R_adjacency_list<directedS, double>; OutputIterator = std::back_insert_iterator<std::vector<detail::edge_desc_impl<directed_tag, long unsigned int> > >]’
112 | detail::kruskal_mst_impl(g, spanning_tree_edges,
| ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
113 | make_iterator_property_map(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~
114 | rank_map.begin(), get(vertex_index, g), rank_map[0]),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
115 | make_iterator_property_map(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~
116 | pred_map.begin(), get(vertex_index, g), pred_map[0]),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
117 | get(edge_weight, g));
| ~~~~~~~~~~~~~~~~~~~~
minST.cpp:20:38: required from here
20 | kruskal_minimum_spanning_tree(g, std::back_inserter(spanning_tree));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::EqualityComparable<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> >]’
20 | ~usage_requirements() { ((Model*)0)->~Model(); }
| ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::EqualityComparable<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:91:9: required from ‘boost::concepts::EdgeListGraph<G>::~EdgeListGraph() [with G = R_adjacency_list<boost::directedS, double>]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/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<R_adjacency_list<boost::directedS, double> >]’
226 | BOOST_concept(EdgeListGraph, (G)) : Graph< G >
| ^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:56:9: required from ‘void boost::detail::kruskal_mst_impl(const Graph&, OutputIterator, Rank, Parent, Weight) [with Graph = R_adjacency_list<boost::directedS, double>; OutputIterator = std::back_insert_iterator<std::vector<edge_desc_impl<boost::directed_tag, long unsigned int> > >; Rank = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; Parent = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; Weight = boost::adj_list_edge_property_map<boost::directed_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:112:29: required from ‘void boost::kruskal_minimum_spanning_tree(const Graph&, OutputIterator) [with Graph = R_adjacency_list<directedS, double>; OutputIterator = std::back_insert_iterator<std::vector<detail::edge_desc_impl<directed_tag, long unsigned int> > >]’
112 | detail::kruskal_mst_impl(g, spanning_tree_edges,
| ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
113 | make_iterator_property_map(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~
114 | rank_map.begin(), get(vertex_index, g), rank_map[0]),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
115 | make_iterator_property_map(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~
116 | pred_map.begin(), get(vertex_index, g), pred_map[0]),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
117 | get(edge_weight, g));
| ~~~~~~~~~~~~~~~~~~~~
minST.cpp:20:38: required from here
20 | kruskal_minimum_spanning_tree(g, std::back_inserter(spanning_tree));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::EqualityComparable<TT>::~EqualityComparable() [with TT = boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>]’
37 | ~model()
| ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:233:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
233 | BOOST_CONCEPT_USAGE(EqualityComparable) {
| ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Assignable<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:145:5: required from ‘struct boost::Assignable<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> >’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::Assignable<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> >]’
32 | inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
| ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied<boost::Assignable<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > >::value’
44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied<boost::Assignable<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > >’
45 | typedef boost::integral_constant<bool, value> type;
| ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_<void (*)(boost::Assignable<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> >)>’
72 | struct requirement_<void(*)(Model)>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:92:9: required from ‘boost::concepts::EdgeListGraph<G>::~EdgeListGraph() [with G = R_adjacency_list<boost::directedS, double>]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/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<R_adjacency_list<boost::directedS, double> >]’
226 | BOOST_concept(EdgeListGraph, (G)) : Graph< G >
| ^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:56:9: required from ‘void boost::detail::kruskal_mst_impl(const Graph&, OutputIterator, Rank, Parent, Weight) [with Graph = R_adjacency_list<boost::directedS, double>; OutputIterator = std::back_insert_iterator<std::vector<edge_desc_impl<boost::directed_tag, long unsigned int> > >; Rank = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; Parent = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; Weight = boost::adj_list_edge_property_map<boost::directed_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:112:29: required from ‘void boost::kruskal_minimum_spanning_tree(const Graph&, OutputIterator) [with Graph = R_adjacency_list<directedS, double>; OutputIterator = std::back_insert_iterator<std::vector<detail::edge_desc_impl<directed_tag, long unsigned int> > >]’
112 | detail::kruskal_mst_impl(g, spanning_tree_edges,
| ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
113 | make_iterator_property_map(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~
114 | rank_map.begin(), get(vertex_index, g), rank_map[0]),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
115 | make_iterator_property_map(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~
116 | pred_map.begin(), get(vertex_index, g), pred_map[0]),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
117 | get(edge_weight, g));
| ~~~~~~~~~~~~~~~~~~~~
minST.cpp:20:38: required from here
20 | kruskal_minimum_spanning_tree(g, std::back_inserter(spanning_tree));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Assignable<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> >]’
20 | ~usage_requirements() { ((Model*)0)->~Model(); }
| ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::Assignable<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:92:9: required from ‘boost::concepts::EdgeListGraph<G>::~EdgeListGraph() [with G = R_adjacency_list<boost::directedS, double>]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/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<R_adjacency_list<boost::directedS, double> >]’
226 | BOOST_concept(EdgeListGraph, (G)) : Graph< G >
| ^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:56:9: required from ‘void boost::detail::kruskal_mst_impl(const Graph&, OutputIterator, Rank, Parent, Weight) [with Graph = R_adjacency_list<boost::directedS, double>; OutputIterator = std::back_insert_iterator<std::vector<edge_desc_impl<boost::directed_tag, long unsigned int> > >; Rank = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; Parent = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; Weight = boost::adj_list_edge_property_map<boost::directed_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:112:29: required from ‘void boost::kruskal_minimum_spanning_tree(const Graph&, OutputIterator) [with Graph = R_adjacency_list<directedS, double>; OutputIterator = std::back_insert_iterator<std::vector<detail::edge_desc_impl<directed_tag, long unsigned int> > >]’
112 | detail::kruskal_mst_impl(g, spanning_tree_edges,
| ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
113 | make_iterator_property_map(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~
114 | rank_map.begin(), get(vertex_index, g), rank_map[0]),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
115 | make_iterator_property_map(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~
116 | pred_map.begin(), get(vertex_index, g), pred_map[0]),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
117 | get(edge_weight, g));
| ~~~~~~~~~~~~~~~~~~~~
minST.cpp:20:38: required from here
20 | kruskal_minimum_spanning_tree(g, std::back_inserter(spanning_tree));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Assignable<TT>::~Assignable() [with TT = boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>]’
37 | ~model()
| ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:145:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
145 | BOOST_CONCEPT_USAGE(Assignable) {
| ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/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> >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/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> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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);
| ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/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) );
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/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;
| ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/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)>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:239:9: required from ‘boost::concepts::EdgeListGraph<G>::~EdgeListGraph() [with G = R_adjacency_list<boost::directedS, double>]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/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<R_adjacency_list<boost::directedS, double> >]’
226 | BOOST_concept(EdgeListGraph, (G)) : Graph< G >
| ^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:56:9: required from ‘void boost::detail::kruskal_mst_impl(const Graph&, OutputIterator, Rank, Parent, Weight) [with Graph = R_adjacency_list<boost::directedS, double>; OutputIterator = std::back_insert_iterator<std::vector<edge_desc_impl<boost::directed_tag, long unsigned int> > >; Rank = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; Parent = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; Weight = boost::adj_list_edge_property_map<boost::directed_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:112:29: required from ‘void boost::kruskal_minimum_spanning_tree(const Graph&, OutputIterator) [with Graph = R_adjacency_list<directedS, double>; OutputIterator = std::back_insert_iterator<std::vector<detail::edge_desc_impl<directed_tag, long unsigned int> > >]’
112 | detail::kruskal_mst_impl(g, spanning_tree_edges,
| ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
113 | make_iterator_property_map(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~
114 | rank_map.begin(), get(vertex_index, g), rank_map[0]),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
115 | make_iterator_property_map(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~
116 | pred_map.begin(), get(vertex_index, g), pred_map[0]),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
117 | get(edge_weight, g));
| ~~~~~~~~~~~~~~~~~~~~
minST.cpp:20:38: required from here
20 | kruskal_minimum_spanning_tree(g, std::back_inserter(spanning_tree));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/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(); }
| ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/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>]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:239:9: required from ‘boost::concepts::EdgeListGraph<G>::~EdgeListGraph() [with G = R_adjacency_list<boost::directedS, double>]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/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<R_adjacency_list<boost::directedS, double> >]’
226 | BOOST_concept(EdgeListGraph, (G)) : Graph< G >
| ^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:56:9: required from ‘void boost::detail::kruskal_mst_impl(const Graph&, OutputIterator, Rank, Parent, Weight) [with Graph = R_adjacency_list<boost::directedS, double>; OutputIterator = std::back_insert_iterator<std::vector<edge_desc_impl<boost::directed_tag, long unsigned int> > >; Rank = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; Parent = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; Weight = boost::adj_list_edge_property_map<boost::directed_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:112:29: required from ‘void boost::kruskal_minimum_spanning_tree(const Graph&, OutputIterator) [with Graph = R_adjacency_list<directedS, double>; OutputIterator = std::back_insert_iterator<std::vector<detail::edge_desc_impl<directed_tag, long unsigned int> > >]’
112 | detail::kruskal_mst_impl(g, spanning_tree_edges,
| ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
113 | make_iterator_property_map(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~
114 | rank_map.begin(), get(vertex_index, g), rank_map[0]),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
115 | make_iterator_property_map(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~
116 | pred_map.begin(), get(vertex_index, g), pred_map[0]),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
117 | get(edge_weight, g));
| ~~~~~~~~~~~~~~~~~~~~
minST.cpp:20:38: required from here
20 | kruskal_minimum_spanning_tree(g, std::back_inserter(spanning_tree));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/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()
| ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
208 | BOOST_CONCEPT_USAGE(Convertible) {
| ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Convertible<boost::lvalue_property_map_tag, boost::writable_property_map_tag> >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/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> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/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))
| ^~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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);
| ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/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) );
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/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;
| ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 8 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied<boost::ReadWritePropertyMapConcept<boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>, long unsigned int> >::value’
44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied<boost::ReadWritePropertyMapConcept<boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>, long unsigned int> >’
45 | typedef boost::integral_constant<bool, value> type;
| ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_<void (*)(boost::ReadWritePropertyMapConcept<boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>, long unsigned int>)>’
72 | struct requirement_<void(*)(Model)>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:58:9: required from ‘void boost::detail::kruskal_mst_impl(const Graph&, OutputIterator, Rank, Parent, Weight) [with Graph = R_adjacency_list<boost::directedS, double>; OutputIterator = std::back_insert_iterator<std::vector<edge_desc_impl<boost::directed_tag, long unsigned int> > >; Rank = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; Parent = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; Weight = boost::adj_list_edge_property_map<boost::directed_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:112:29: required from ‘void boost::kruskal_minimum_spanning_tree(const Graph&, OutputIterator) [with Graph = R_adjacency_list<directedS, double>; OutputIterator = std::back_insert_iterator<std::vector<detail::edge_desc_impl<directed_tag, long unsigned int> > >]’
112 | detail::kruskal_mst_impl(g, spanning_tree_edges,
| ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
113 | make_iterator_property_map(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~
114 | rank_map.begin(), get(vertex_index, g), rank_map[0]),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
115 | make_iterator_property_map(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~
116 | pred_map.begin(), get(vertex_index, g), pred_map[0]),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
117 | get(edge_weight, g));
| ~~~~~~~~~~~~~~~~~~~~
minST.cpp:20:38: required from here
20 | kruskal_minimum_spanning_tree(g, std::back_inserter(spanning_tree));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Convertible<boost::lvalue_property_map_tag, boost::writable_property_map_tag>]’
20 | ~usage_requirements() { ((Model*)0)->~Model(); }
| ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::ConvertibleConcept<boost::lvalue_property_map_tag, boost::writable_property_map_tag>]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:180:7: required from ‘void boost::WritablePropertyMapConcept<PMap, Key>::constraints() [with PMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; Key = long unsigned int]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>, long unsigned int>]’
32 | inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
| ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied<boost::WritablePropertyMapConcept<boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>, long unsigned int> >::value’
44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied<boost::WritablePropertyMapConcept<boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>, long unsigned int> >’
45 | typedef boost::integral_constant<bool, value> type;
| ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_<void (*)(boost::WritablePropertyMapConcept<boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>, long unsigned int>)>’
72 | struct requirement_<void(*)(Model)>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:207:7: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied<boost::ReadWritePropertyMapConcept<boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>, long unsigned int> >::value’
44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied<boost::ReadWritePropertyMapConcept<boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>, long unsigned int> >’
45 | typedef boost::integral_constant<bool, value> type;
| ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_<void (*)(boost::ReadWritePropertyMapConcept<boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>, long unsigned int>)>’
72 | struct requirement_<void(*)(Model)>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:58:9: required from ‘void boost::detail::kruskal_mst_impl(const Graph&, OutputIterator, Rank, Parent, Weight) [with Graph = R_adjacency_list<boost::directedS, double>; OutputIterator = std::back_insert_iterator<std::vector<edge_desc_impl<boost::directed_tag, long unsigned int> > >; Rank = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; Parent = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; Weight = boost::adj_list_edge_property_map<boost::directed_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:112:29: required from ‘void boost::kruskal_minimum_spanning_tree(const Graph&, OutputIterator) [with Graph = R_adjacency_list<directedS, double>; OutputIterator = std::back_insert_iterator<std::vector<detail::edge_desc_impl<directed_tag, long unsigned int> > >]’
112 | detail::kruskal_mst_impl(g, spanning_tree_edges,
| ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
113 | make_iterator_property_map(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~
114 | rank_map.begin(), get(vertex_index, g), rank_map[0]),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
115 | make_iterator_property_map(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~
116 | pred_map.begin(), get(vertex_index, g), pred_map[0]),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
117 | get(edge_weight, g));
| ~~~~~~~~~~~~~~~~~~~~
minST.cpp:20:38: required from here
20 | kruskal_minimum_spanning_tree(g, std::back_inserter(spanning_tree));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:206:17: note: in a call to non-static member function ‘boost::ConvertibleConcept<boost::lvalue_property_map_tag, boost::writable_property_map_tag>::~ConvertibleConcept()’
206 | BOOST_concept(Convertible,(X)(Y))
| ^~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/preprocessor/cat.hpp:29:34: note: in definition of macro ‘BOOST_PP_CAT_I’
29 | # define BOOST_PP_CAT_I(a, b) a ## b
| ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/concept_def.hpp:23:12: note: in expansion of macro ‘BOOST_PP_CAT’
23 | struct BOOST_PP_CAT(name,Concept) \
| ^~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:206:3: note: in expansion of macro ‘BOOST_concept’
206 | BOOST_concept(Convertible,(X)(Y))
| ^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Convertible<boost::lvalue_property_map_tag, boost::read_write_property_map_tag>]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/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(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/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> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/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))
| ^~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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);
| ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/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) );
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied<boost::ReadWritePropertyMapConcept<boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>, long unsigned int> >::value’
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied<boost::ReadWritePropertyMapConcept<boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>, long unsigned int> >’
45 | typedef boost::integral_constant<bool, value> type;
| ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_<void (*)(boost::ReadWritePropertyMapConcept<boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>, long unsigned int>)>’
72 | struct requirement_<void(*)(Model)>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:58:9: required from ‘void boost::detail::kruskal_mst_impl(const Graph&, OutputIterator, Rank, Parent, Weight) [with Graph = R_adjacency_list<boost::directedS, double>; OutputIterator = std::back_insert_iterator<std::vector<edge_desc_impl<boost::directed_tag, long unsigned int> > >; Rank = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; Parent = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; Weight = boost::adj_list_edge_property_map<boost::directed_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:112:29: required from ‘void boost::kruskal_minimum_spanning_tree(const Graph&, OutputIterator) [with Graph = R_adjacency_list<directedS, double>; OutputIterator = std::back_insert_iterator<std::vector<detail::edge_desc_impl<directed_tag, long unsigned int> > >]’
112 | detail::kruskal_mst_impl(g, spanning_tree_edges,
| ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
113 | make_iterator_property_map(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~
114 | rank_map.begin(), get(vertex_index, g), rank_map[0]),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
115 | make_iterator_property_map(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~
116 | pred_map.begin(), get(vertex_index, g), pred_map[0]),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
117 | get(edge_weight, g));
| ~~~~~~~~~~~~~~~~~~~~
minST.cpp:20:38: required from here
20 | kruskal_minimum_spanning_tree(g, std::back_inserter(spanning_tree));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
20 | ~usage_requirements() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible<X, Y>::~Convertible() [with X = boost::lvalue_property_map_tag; Y = boost::read_write_property_map_tag]’
37 | ~model()
| ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
208 | BOOST_CONCEPT_USAGE(Convertible) {
| ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Convertible<boost::lvalue_property_map_tag, boost::readable_property_map_tag>]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/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(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/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> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/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))
| ^~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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);
| ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/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) );
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied<boost::ReadablePropertyMapConcept<boost::adj_list_edge_property_map<boost::directed_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > >::value’
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied<boost::ReadablePropertyMapConcept<boost::adj_list_edge_property_map<boost::directed_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > >’
45 | typedef boost::integral_constant<bool, value> type;
| ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_<void (*)(boost::ReadablePropertyMapConcept<boost::adj_list_edge_property_map<boost::directed_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> >)>’
72 | struct requirement_<void(*)(Model)>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:60:9: required from ‘void boost::detail::kruskal_mst_impl(const Graph&, OutputIterator, Rank, Parent, Weight) [with Graph = R_adjacency_list<boost::directedS, double>; OutputIterator = std::back_insert_iterator<std::vector<edge_desc_impl<boost::directed_tag, long unsigned int> > >; Rank = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; Parent = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; Weight = boost::adj_list_edge_property_map<boost::directed_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:112:29: required from ‘void boost::kruskal_minimum_spanning_tree(const Graph&, OutputIterator) [with Graph = R_adjacency_list<directedS, double>; OutputIterator = std::back_insert_iterator<std::vector<detail::edge_desc_impl<directed_tag, long unsigned int> > >]’
112 | detail::kruskal_mst_impl(g, spanning_tree_edges,
| ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
113 | make_iterator_property_map(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~
114 | rank_map.begin(), get(vertex_index, g), rank_map[0]),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
115 | make_iterator_property_map(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~
116 | pred_map.begin(), get(vertex_index, g), pred_map[0]),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
117 | get(edge_weight, g));
| ~~~~~~~~~~~~~~~~~~~~
minST.cpp:20:38: required from here
20 | kruskal_minimum_spanning_tree(g, std::back_inserter(spanning_tree));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
20 | ~usage_requirements() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible<X, Y>::~Convertible() [with X = boost::lvalue_property_map_tag; Y = boost::readable_property_map_tag]’
37 | ~model()
| ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
208 | BOOST_CONCEPT_USAGE(Convertible) {
| ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Convertible<boost::undir_adj_list_traversal_tag, boost::vertex_list_graph_tag> >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible<boost::undir_adj_list_traversal_tag, boost::vertex_list_graph_tag>’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::Convertible<boost::undir_adj_list_traversal_tag, boost::vertex_list_graph_tag>]’
32 | inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
| ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied<boost::Convertible<boost::undir_adj_list_traversal_tag, boost::vertex_list_graph_tag> >::value’
44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied<boost::Convertible<boost::undir_adj_list_traversal_tag, boost::vertex_list_graph_tag> >’
45 | typedef boost::integral_constant<bool, value> type;
| ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_<void (*)(boost::Convertible<boost::undir_adj_list_traversal_tag, boost::vertex_list_graph_tag>)>’
72 | struct requirement_<void(*)(Model)>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:185:9: required from ‘boost::concepts::VertexListGraph<G>::~VertexListGraph() [with G = R_adjacency_list<boost::undirectedS, double>]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/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<R_adjacency_list<boost::undirectedS, double> >]’
176 | BOOST_concept(VertexListGraph, (G)) : Graph< G >
| ^~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:55:9: required from ‘void boost::detail::kruskal_mst_impl(const Graph&, OutputIterator, Rank, Parent, Weight) [with Graph = R_adjacency_list<boost::undirectedS, double>; OutputIterator = std::back_insert_iterator<std::vector<edge_desc_impl<boost::undirected_tag, long unsigned int> > >; Rank = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; Parent = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; Weight = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:112:29: required from ‘void boost::kruskal_minimum_spanning_tree(const Graph&, OutputIterator) [with Graph = R_adjacency_list<undirectedS, double>; OutputIterator = std::back_insert_iterator<std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int> > >]’
112 | detail::kruskal_mst_impl(g, spanning_tree_edges,
| ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
113 | make_iterator_property_map(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~
114 | rank_map.begin(), get(vertex_index, g), rank_map[0]),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
115 | make_iterator_property_map(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~
116 | pred_map.begin(), get(vertex_index, g), pred_map[0]),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
117 | get(edge_weight, g));
| ~~~~~~~~~~~~~~~~~~~~
minST.cpp:54:38: required from here
54 | kruskal_minimum_spanning_tree(g, std::back_inserter(spanning_tree));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Convertible<boost::undir_adj_list_traversal_tag, boost::vertex_list_graph_tag>]’
20 | ~usage_requirements() { ((Model*)0)->~Model(); }
| ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::Convertible<boost::undir_adj_list_traversal_tag, boost::vertex_list_graph_tag>]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:185:9: required from ‘boost::concepts::VertexListGraph<G>::~VertexListGraph() [with G = R_adjacency_list<boost::undirectedS, double>]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/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<R_adjacency_list<boost::undirectedS, double> >]’
176 | BOOST_concept(VertexListGraph, (G)) : Graph< G >
| ^~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:55:9: required from ‘void boost::detail::kruskal_mst_impl(const Graph&, OutputIterator, Rank, Parent, Weight) [with Graph = R_adjacency_list<boost::undirectedS, double>; OutputIterator = std::back_insert_iterator<std::vector<edge_desc_impl<boost::undirected_tag, long unsigned int> > >; Rank = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; Parent = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; Weight = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:112:29: required from ‘void boost::kruskal_minimum_spanning_tree(const Graph&, OutputIterator) [with Graph = R_adjacency_list<undirectedS, double>; OutputIterator = std::back_insert_iterator<std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int> > >]’
112 | detail::kruskal_mst_impl(g, spanning_tree_edges,
| ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
113 | make_iterator_property_map(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~
114 | rank_map.begin(), get(vertex_index, g), rank_map[0]),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
115 | make_iterator_property_map(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~
116 | pred_map.begin(), get(vertex_index, g), pred_map[0]),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
117 | get(edge_weight, g));
| ~~~~~~~~~~~~~~~~~~~~
minST.cpp:54:38: required from here
54 | kruskal_minimum_spanning_tree(g, std::back_inserter(spanning_tree));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible<X, Y>::~Convertible() [with X = boost::undir_adj_list_traversal_tag; Y = boost::vertex_list_graph_tag]’
37 | ~model()
| ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
208 | BOOST_CONCEPT_USAGE(Convertible) {
| ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::concepts::MultiPassInputIterator<boost::detail::undirected_edge_iter<std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > >, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:52:50: required from ‘struct boost::concepts::MultiPassInputIterator<boost::detail::undirected_edge_iter<std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > >, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> >’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::concepts::MultiPassInputIterator<boost::detail::undirected_edge_iter<std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > >, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> >]’
32 | inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
| ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied<boost::concepts::MultiPassInputIterator<boost::detail::undirected_edge_iter<std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > >, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> > >::value’
44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied<boost::concepts::MultiPassInputIterator<boost::detail::undirected_edge_iter<std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > >, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> > >’
45 | typedef boost::integral_constant<bool, value> type;
| ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_<void (*)(boost::concepts::MultiPassInputIterator<boost::detail::undirected_edge_iter<std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > >, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> >)>’
72 | struct requirement_<void(*)(Model)>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:235:9: required from ‘boost::concepts::EdgeListGraph<G>::~EdgeListGraph() [with G = R_adjacency_list<boost::undirectedS, double>]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/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<R_adjacency_list<boost::undirectedS, double> >]’
226 | BOOST_concept(EdgeListGraph, (G)) : Graph< G >
| ^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:56:9: required from ‘void boost::detail::kruskal_mst_impl(const Graph&, OutputIterator, Rank, Parent, Weight) [with Graph = R_adjacency_list<boost::undirectedS, double>; OutputIterator = std::back_insert_iterator<std::vector<edge_desc_impl<boost::undirected_tag, long unsigned int> > >; Rank = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; Parent = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; Weight = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:112:29: required from ‘void boost::kruskal_minimum_spanning_tree(const Graph&, OutputIterator) [with Graph = R_adjacency_list<undirectedS, double>; OutputIterator = std::back_insert_iterator<std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int> > >]’
112 | detail::kruskal_mst_impl(g, spanning_tree_edges,
| ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
113 | make_iterator_property_map(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~
114 | rank_map.begin(), get(vertex_index, g), rank_map[0]),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
115 | make_iterator_property_map(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~
116 | pred_map.begin(), get(vertex_index, g), pred_map[0]),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
117 | get(edge_weight, g));
| ~~~~~~~~~~~~~~~~~~~~
minST.cpp:54:38: required from here
54 | kruskal_minimum_spanning_tree(g, std::back_inserter(spanning_tree));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::concepts::MultiPassInputIterator<boost::detail::undirected_edge_iter<std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > >, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> >]’
20 | ~usage_requirements() { ((Model*)0)->~Model(); }
| ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::MultiPassInputIterator<boost::detail::undirected_edge_iter<std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > >, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:235:9: required from ‘boost::concepts::EdgeListGraph<G>::~EdgeListGraph() [with G = R_adjacency_list<boost::undirectedS, double>]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/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<R_adjacency_list<boost::undirectedS, double> >]’
226 | BOOST_concept(EdgeListGraph, (G)) : Graph< G >
| ^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:56:9: required from ‘void boost::detail::kruskal_mst_impl(const Graph&, OutputIterator, Rank, Parent, Weight) [with Graph = R_adjacency_list<boost::undirectedS, double>; OutputIterator = std::back_insert_iterator<std::vector<edge_desc_impl<boost::undirected_tag, long unsigned int> > >; Rank = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; Parent = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; Weight = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:112:29: required from ‘void boost::kruskal_minimum_spanning_tree(const Graph&, OutputIterator) [with Graph = R_adjacency_list<undirectedS, double>; OutputIterator = std::back_insert_iterator<std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int> > >]’
112 | detail::kruskal_mst_impl(g, spanning_tree_edges,
| ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
113 | make_iterator_property_map(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~
114 | rank_map.begin(), get(vertex_index, g), rank_map[0]),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
115 | make_iterator_property_map(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~
116 | pred_map.begin(), get(vertex_index, g), pred_map[0]),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
117 | get(edge_weight, g));
| ~~~~~~~~~~~~~~~~~~~~
minST.cpp:54:38: required from here
54 | kruskal_minimum_spanning_tree(g, std::back_inserter(spanning_tree));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::concepts::MultiPassInputIterator<T>::~MultiPassInputIterator() [with T = boost::detail::undirected_edge_iter<std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > >, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int>]’
37 | ~model()
| ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:52:50: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
52 | BOOST_concept(MultiPassInputIterator, (T)) { BOOST_CONCEPT_USAGE(
| ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::DefaultConstructible<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:137:5: required from ‘struct boost::DefaultConstructible<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> >’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::DefaultConstructible<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> >]’
32 | inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
| ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied<boost::DefaultConstructible<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >::value’
44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied<boost::DefaultConstructible<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >’
45 | typedef boost::integral_constant<bool, value> type;
| ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_<void (*)(boost::DefaultConstructible<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> >)>’
72 | struct requirement_<void(*)(Model)>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:90:9: required from ‘boost::concepts::EdgeListGraph<G>::~EdgeListGraph() [with G = R_adjacency_list<boost::undirectedS, double>]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/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<R_adjacency_list<boost::undirectedS, double> >]’
226 | BOOST_concept(EdgeListGraph, (G)) : Graph< G >
| ^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:56:9: required from ‘void boost::detail::kruskal_mst_impl(const Graph&, OutputIterator, Rank, Parent, Weight) [with Graph = R_adjacency_list<boost::undirectedS, double>; OutputIterator = std::back_insert_iterator<std::vector<edge_desc_impl<boost::undirected_tag, long unsigned int> > >; Rank = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; Parent = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; Weight = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:112:29: required from ‘void boost::kruskal_minimum_spanning_tree(const Graph&, OutputIterator) [with Graph = R_adjacency_list<undirectedS, double>; OutputIterator = std::back_insert_iterator<std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int> > >]’
112 | detail::kruskal_mst_impl(g, spanning_tree_edges,
| ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
113 | make_iterator_property_map(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~
114 | rank_map.begin(), get(vertex_index, g), rank_map[0]),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
115 | make_iterator_property_map(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~
116 | pred_map.begin(), get(vertex_index, g), pred_map[0]),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
117 | get(edge_weight, g));
| ~~~~~~~~~~~~~~~~~~~~
minST.cpp:54:38: required from here
54 | kruskal_minimum_spanning_tree(g, std::back_inserter(spanning_tree));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::DefaultConstructible<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> >]’
20 | ~usage_requirements() { ((Model*)0)->~Model(); }
| ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::DefaultConstructible<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:90:9: required from ‘boost::concepts::EdgeListGraph<G>::~EdgeListGraph() [with G = R_adjacency_list<boost::undirectedS, double>]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/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<R_adjacency_list<boost::undirectedS, double> >]’
226 | BOOST_concept(EdgeListGraph, (G)) : Graph< G >
| ^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:56:9: required from ‘void boost::detail::kruskal_mst_impl(const Graph&, OutputIterator, Rank, Parent, Weight) [with Graph = R_adjacency_list<boost::undirectedS, double>; OutputIterator = std::back_insert_iterator<std::vector<edge_desc_impl<boost::undirected_tag, long unsigned int> > >; Rank = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; Parent = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; Weight = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:112:29: required from ‘void boost::kruskal_minimum_spanning_tree(const Graph&, OutputIterator) [with Graph = R_adjacency_list<undirectedS, double>; OutputIterator = std::back_insert_iterator<std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int> > >]’
112 | detail::kruskal_mst_impl(g, spanning_tree_edges,
| ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
113 | make_iterator_property_map(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~
114 | rank_map.begin(), get(vertex_index, g), rank_map[0]),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
115 | make_iterator_property_map(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~
116 | pred_map.begin(), get(vertex_index, g), pred_map[0]),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
117 | get(edge_weight, g));
| ~~~~~~~~~~~~~~~~~~~~
minST.cpp:54:38: required from here
54 | kruskal_minimum_spanning_tree(g, std::back_inserter(spanning_tree));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::DefaultConstructible<TT>::~DefaultConstructible() [with TT = boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>]’
37 | ~model()
| ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:137:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
137 | BOOST_CONCEPT_USAGE(DefaultConstructible) {
| ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::EqualityComparable<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> >’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::EqualityComparable<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> >]’
32 | inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
| ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied<boost::EqualityComparable<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >::value’
44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied<boost::EqualityComparable<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >’
45 | typedef boost::integral_constant<bool, value> type;
| ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_<void (*)(boost::EqualityComparable<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> >)>’
72 | struct requirement_<void(*)(Model)>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:91:9: required from ‘boost::concepts::EdgeListGraph<G>::~EdgeListGraph() [with G = R_adjacency_list<boost::undirectedS, double>]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/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<R_adjacency_list<boost::undirectedS, double> >]’
226 | BOOST_concept(EdgeListGraph, (G)) : Graph< G >
| ^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:56:9: required from ‘void boost::detail::kruskal_mst_impl(const Graph&, OutputIterator, Rank, Parent, Weight) [with Graph = R_adjacency_list<boost::undirectedS, double>; OutputIterator = std::back_insert_iterator<std::vector<edge_desc_impl<boost::undirected_tag, long unsigned int> > >; Rank = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; Parent = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; Weight = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:112:29: required from ‘void boost::kruskal_minimum_spanning_tree(const Graph&, OutputIterator) [with Graph = R_adjacency_list<undirectedS, double>; OutputIterator = std::back_insert_iterator<std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int> > >]’
112 | detail::kruskal_mst_impl(g, spanning_tree_edges,
| ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
113 | make_iterator_property_map(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~
114 | rank_map.begin(), get(vertex_index, g), rank_map[0]),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
115 | make_iterator_property_map(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~
116 | pred_map.begin(), get(vertex_index, g), pred_map[0]),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
117 | get(edge_weight, g));
| ~~~~~~~~~~~~~~~~~~~~
minST.cpp:54:38: required from here
54 | kruskal_minimum_spanning_tree(g, std::back_inserter(spanning_tree));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::EqualityComparable<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> >]’
20 | ~usage_requirements() { ((Model*)0)->~Model(); }
| ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::EqualityComparable<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:91:9: required from ‘boost::concepts::EdgeListGraph<G>::~EdgeListGraph() [with G = R_adjacency_list<boost::undirectedS, double>]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/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<R_adjacency_list<boost::undirectedS, double> >]’
226 | BOOST_concept(EdgeListGraph, (G)) : Graph< G >
| ^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:56:9: required from ‘void boost::detail::kruskal_mst_impl(const Graph&, OutputIterator, Rank, Parent, Weight) [with Graph = R_adjacency_list<boost::undirectedS, double>; OutputIterator = std::back_insert_iterator<std::vector<edge_desc_impl<boost::undirected_tag, long unsigned int> > >; Rank = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; Parent = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; Weight = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:112:29: required from ‘void boost::kruskal_minimum_spanning_tree(const Graph&, OutputIterator) [with Graph = R_adjacency_list<undirectedS, double>; OutputIterator = std::back_insert_iterator<std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int> > >]’
112 | detail::kruskal_mst_impl(g, spanning_tree_edges,
| ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
113 | make_iterator_property_map(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~
114 | rank_map.begin(), get(vertex_index, g), rank_map[0]),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
115 | make_iterator_property_map(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~
116 | pred_map.begin(), get(vertex_index, g), pred_map[0]),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
117 | get(edge_weight, g));
| ~~~~~~~~~~~~~~~~~~~~
minST.cpp:54:38: required from here
54 | kruskal_minimum_spanning_tree(g, std::back_inserter(spanning_tree));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::EqualityComparable<TT>::~EqualityComparable() [with TT = boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>]’
37 | ~model()
| ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:233:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
233 | BOOST_CONCEPT_USAGE(EqualityComparable) {
| ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Assignable<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:145:5: required from ‘struct boost::Assignable<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> >’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::Assignable<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> >]’
32 | inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
| ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied<boost::Assignable<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >::value’
44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied<boost::Assignable<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >’
45 | typedef boost::integral_constant<bool, value> type;
| ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_<void (*)(boost::Assignable<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> >)>’
72 | struct requirement_<void(*)(Model)>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:92:9: required from ‘boost::concepts::EdgeListGraph<G>::~EdgeListGraph() [with G = R_adjacency_list<boost::undirectedS, double>]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/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<R_adjacency_list<boost::undirectedS, double> >]’
226 | BOOST_concept(EdgeListGraph, (G)) : Graph< G >
| ^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:56:9: required from ‘void boost::detail::kruskal_mst_impl(const Graph&, OutputIterator, Rank, Parent, Weight) [with Graph = R_adjacency_list<boost::undirectedS, double>; OutputIterator = std::back_insert_iterator<std::vector<edge_desc_impl<boost::undirected_tag, long unsigned int> > >; Rank = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; Parent = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; Weight = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:112:29: required from ‘void boost::kruskal_minimum_spanning_tree(const Graph&, OutputIterator) [with Graph = R_adjacency_list<undirectedS, double>; OutputIterator = std::back_insert_iterator<std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int> > >]’
112 | detail::kruskal_mst_impl(g, spanning_tree_edges,
| ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
113 | make_iterator_property_map(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~
114 | rank_map.begin(), get(vertex_index, g), rank_map[0]),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
115 | make_iterator_property_map(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~
116 | pred_map.begin(), get(vertex_index, g), pred_map[0]),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
117 | get(edge_weight, g));
| ~~~~~~~~~~~~~~~~~~~~
minST.cpp:54:38: required from here
54 | kruskal_minimum_spanning_tree(g, std::back_inserter(spanning_tree));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Assignable<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> >]’
20 | ~usage_requirements() { ((Model*)0)->~Model(); }
| ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::Assignable<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:92:9: required from ‘boost::concepts::EdgeListGraph<G>::~EdgeListGraph() [with G = R_adjacency_list<boost::undirectedS, double>]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/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<R_adjacency_list<boost::undirectedS, double> >]’
226 | BOOST_concept(EdgeListGraph, (G)) : Graph< G >
| ^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:56:9: required from ‘void boost::detail::kruskal_mst_impl(const Graph&, OutputIterator, Rank, Parent, Weight) [with Graph = R_adjacency_list<boost::undirectedS, double>; OutputIterator = std::back_insert_iterator<std::vector<edge_desc_impl<boost::undirected_tag, long unsigned int> > >; Rank = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; Parent = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; Weight = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:112:29: required from ‘void boost::kruskal_minimum_spanning_tree(const Graph&, OutputIterator) [with Graph = R_adjacency_list<undirectedS, double>; OutputIterator = std::back_insert_iterator<std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int> > >]’
112 | detail::kruskal_mst_impl(g, spanning_tree_edges,
| ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
113 | make_iterator_property_map(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~
114 | rank_map.begin(), get(vertex_index, g), rank_map[0]),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
115 | make_iterator_property_map(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~
116 | pred_map.begin(), get(vertex_index, g), pred_map[0]),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
117 | get(edge_weight, g));
| ~~~~~~~~~~~~~~~~~~~~
minST.cpp:54:38: required from here
54 | kruskal_minimum_spanning_tree(g, std::back_inserter(spanning_tree));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Assignable<TT>::~Assignable() [with TT = boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>]’
37 | ~model()
| ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:145:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
145 | BOOST_CONCEPT_USAGE(Assignable) {
| ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Convertible<boost::undir_adj_list_traversal_tag, boost::edge_list_graph_tag> >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible<boost::undir_adj_list_traversal_tag, boost::edge_list_graph_tag>’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::Convertible<boost::undir_adj_list_traversal_tag, boost::edge_list_graph_tag>]’
32 | inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
| ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied<boost::Convertible<boost::undir_adj_list_traversal_tag, boost::edge_list_graph_tag> >::value’
44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied<boost::Convertible<boost::undir_adj_list_traversal_tag, boost::edge_list_graph_tag> >’
45 | typedef boost::integral_constant<bool, value> type;
| ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_<void (*)(boost::Convertible<boost::undir_adj_list_traversal_tag, boost::edge_list_graph_tag>)>’
72 | struct requirement_<void(*)(Model)>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:239:9: required from ‘boost::concepts::EdgeListGraph<G>::~EdgeListGraph() [with G = R_adjacency_list<boost::undirectedS, double>]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/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<R_adjacency_list<boost::undirectedS, double> >]’
226 | BOOST_concept(EdgeListGraph, (G)) : Graph< G >
| ^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:56:9: required from ‘void boost::detail::kruskal_mst_impl(const Graph&, OutputIterator, Rank, Parent, Weight) [with Graph = R_adjacency_list<boost::undirectedS, double>; OutputIterator = std::back_insert_iterator<std::vector<edge_desc_impl<boost::undirected_tag, long unsigned int> > >; Rank = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; Parent = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; Weight = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:112:29: required from ‘void boost::kruskal_minimum_spanning_tree(const Graph&, OutputIterator) [with Graph = R_adjacency_list<undirectedS, double>; OutputIterator = std::back_insert_iterator<std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int> > >]’
112 | detail::kruskal_mst_impl(g, spanning_tree_edges,
| ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
113 | make_iterator_property_map(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~
114 | rank_map.begin(), get(vertex_index, g), rank_map[0]),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
115 | make_iterator_property_map(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~
116 | pred_map.begin(), get(vertex_index, g), pred_map[0]),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
117 | get(edge_weight, g));
| ~~~~~~~~~~~~~~~~~~~~
minST.cpp:54:38: required from here
54 | kruskal_minimum_spanning_tree(g, std::back_inserter(spanning_tree));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Convertible<boost::undir_adj_list_traversal_tag, boost::edge_list_graph_tag>]’
20 | ~usage_requirements() { ((Model*)0)->~Model(); }
| ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::Convertible<boost::undir_adj_list_traversal_tag, boost::edge_list_graph_tag>]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:239:9: required from ‘boost::concepts::EdgeListGraph<G>::~EdgeListGraph() [with G = R_adjacency_list<boost::undirectedS, double>]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/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<R_adjacency_list<boost::undirectedS, double> >]’
226 | BOOST_concept(EdgeListGraph, (G)) : Graph< G >
| ^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:56:9: required from ‘void boost::detail::kruskal_mst_impl(const Graph&, OutputIterator, Rank, Parent, Weight) [with Graph = R_adjacency_list<boost::undirectedS, double>; OutputIterator = std::back_insert_iterator<std::vector<edge_desc_impl<boost::undirected_tag, long unsigned int> > >; Rank = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; Parent = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; Weight = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:112:29: required from ‘void boost::kruskal_minimum_spanning_tree(const Graph&, OutputIterator) [with Graph = R_adjacency_list<undirectedS, double>; OutputIterator = std::back_insert_iterator<std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int> > >]’
112 | detail::kruskal_mst_impl(g, spanning_tree_edges,
| ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
113 | make_iterator_property_map(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~
114 | rank_map.begin(), get(vertex_index, g), rank_map[0]),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
115 | make_iterator_property_map(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~
116 | pred_map.begin(), get(vertex_index, g), pred_map[0]),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
117 | get(edge_weight, g));
| ~~~~~~~~~~~~~~~~~~~~
minST.cpp:54:38: required from here
54 | kruskal_minimum_spanning_tree(g, std::back_inserter(spanning_tree));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible<X, Y>::~Convertible() [with X = boost::undir_adj_list_traversal_tag; Y = boost::edge_list_graph_tag]’
37 | ~model()
| ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
208 | BOOST_CONCEPT_USAGE(Convertible) {
| ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::SignedInteger<long int>]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:514:9: required from ‘boost::InputIterator<TT>::~InputIterator() [with TT = __gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: required from ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::InputIterator<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > >]’
20 | ~usage_requirements() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::InputIterator<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > > >]’
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:512:7: required from ‘struct boost::InputIterator<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > >’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:540:3: required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > >’
540 | BOOST_concept(ForwardIterator,(TT))
| ^~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:568:3: [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied<boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > > >::value’
44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied<boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > > >’
45 | typedef boost::integral_constant<bool, value> type;
| ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_<void (*)(boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > >)>’
72 | struct requirement_<void(*)(Model)>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map<RAIter, ID, Value, Value&> boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >; Value = long unsigned int; ID = vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:113:35: required from ‘void boost::kruskal_minimum_spanning_tree(const Graph&, OutputIterator) [with Graph = R_adjacency_list<directedS, double>; OutputIterator = std::back_insert_iterator<std::vector<detail::edge_desc_impl<directed_tag, long unsigned int> > >]’
113 | make_iterator_property_map(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^
114 | rank_map.begin(), get(vertex_index, g), rank_map[0]),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
minST.cpp:20:38: required from here
20 | kruskal_minimum_spanning_tree(g, std::back_inserter(spanning_tree));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:107:22: note: in a call to non-static member function ‘boost::SignedInteger<long int>::~SignedInteger()’
107 | template <> struct SignedInteger<long> {};
| ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Convertible<std::random_access_iterator_tag, std::input_iterator_tag> >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/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> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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);
| ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/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) );
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/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;
| ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/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)>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:515:9: [ skipping 9 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied<boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > > >::value’
44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied<boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > > >’
45 | typedef boost::integral_constant<bool, value> type;
| ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_<void (*)(boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > >)>’
72 | struct requirement_<void(*)(Model)>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map<RAIter, ID, Value, Value&> boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >; Value = long unsigned int; ID = vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:113:35: required from ‘void boost::kruskal_minimum_spanning_tree(const Graph&, OutputIterator) [with Graph = R_adjacency_list<directedS, double>; OutputIterator = std::back_insert_iterator<std::vector<detail::edge_desc_impl<directed_tag, long unsigned int> > >]’
113 | make_iterator_property_map(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^
114 | rank_map.begin(), get(vertex_index, g), rank_map[0]),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
minST.cpp:20:38: required from here
20 | kruskal_minimum_spanning_tree(g, std::back_inserter(spanning_tree));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Convertible<std::random_access_iterator_tag, std::input_iterator_tag>]’
20 | ~usage_requirements() { ((Model*)0)->~Model(); }
| ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::Convertible<std::random_access_iterator_tag, std::input_iterator_tag>]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:515:9: required from ‘boost::InputIterator<TT>::~InputIterator() [with TT = __gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: required from ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::InputIterator<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > >]’
20 | ~usage_requirements() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::InputIterator<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > > >]’
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:512:7: required from ‘struct boost::InputIterator<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > >’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:540:3: required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > >’
540 | BOOST_concept(ForwardIterator,(TT))
| ^~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:568:3: [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied<boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > > >::value’
44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied<boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > > >’
45 | typedef boost::integral_constant<bool, value> type;
| ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_<void (*)(boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > >)>’
72 | struct requirement_<void(*)(Model)>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map<RAIter, ID, Value, Value&> boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >; Value = long unsigned int; ID = vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:113:35: required from ‘void boost::kruskal_minimum_spanning_tree(const Graph&, OutputIterator) [with Graph = R_adjacency_list<directedS, double>; OutputIterator = std::back_insert_iterator<std::vector<detail::edge_desc_impl<directed_tag, long unsigned int> > >]’
113 | make_iterator_property_map(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^
114 | rank_map.begin(), get(vertex_index, g), rank_map[0]),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
minST.cpp:20:38: required from here
20 | kruskal_minimum_spanning_tree(g, std::back_inserter(spanning_tree));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible<X, Y>::~Convertible() [with X = std::random_access_iterator_tag; Y = std::input_iterator_tag]’
37 | ~model()
| ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
208 | BOOST_CONCEPT_USAGE(Convertible) {
| ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Convertible<std::random_access_iterator_tag, std::forward_iterator_tag> >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/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> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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);
| ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/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) );
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/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;
| ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/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)>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:545:11: [ skipping 8 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied<boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > > >::value’
44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied<boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > > >’
45 | typedef boost::integral_constant<bool, value> type;
| ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_<void (*)(boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > >)>’
72 | struct requirement_<void(*)(Model)>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map<RAIter, ID, Value, Value&> boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >; Value = long unsigned int; ID = vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:113:35: required from ‘void boost::kruskal_minimum_spanning_tree(const Graph&, OutputIterator) [with Graph = R_adjacency_list<directedS, double>; OutputIterator = std::back_insert_iterator<std::vector<detail::edge_desc_impl<directed_tag, long unsigned int> > >]’
113 | make_iterator_property_map(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^
114 | rank_map.begin(), get(vertex_index, g), rank_map[0]),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
minST.cpp:20:38: required from here
20 | kruskal_minimum_spanning_tree(g, std::back_inserter(spanning_tree));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Convertible<std::random_access_iterator_tag, std::forward_iterator_tag>]’
20 | ~usage_requirements() { ((Model*)0)->~Model(); }
| ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::Convertible<std::random_access_iterator_tag, std::forward_iterator_tag>]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:545:11: required from ‘boost::ForwardIterator<TT>::~ForwardIterator() [with TT = __gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: required from ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::ForwardIterator<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > >]’
20 | ~usage_requirements() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::ForwardIterator<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > > >]’
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:543:7: required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > >’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > >’
568 | BOOST_concept(BidirectionalIterator,(TT))
| ^~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied<boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > > >::value’
44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied<boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > > >’
45 | typedef boost::integral_constant<bool, value> type;
| ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_<void (*)(boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > >)>’
72 | struct requirement_<void(*)(Model)>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map<RAIter, ID, Value, Value&> boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >; Value = long unsigned int; ID = vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:113:35: required from ‘void boost::kruskal_minimum_spanning_tree(const Graph&, OutputIterator) [with Graph = R_adjacency_list<directedS, double>; OutputIterator = std::back_insert_iterator<std::vector<detail::edge_desc_impl<directed_tag, long unsigned int> > >]’
113 | make_iterator_property_map(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^
114 | rank_map.begin(), get(vertex_index, g), rank_map[0]),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
minST.cpp:20:38: required from here
20 | kruskal_minimum_spanning_tree(g, std::back_inserter(spanning_tree));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible<X, Y>::~Convertible() [with X = std::random_access_iterator_tag; Y = std::forward_iterator_tag]’
37 | ~model()
| ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
208 | BOOST_CONCEPT_USAGE(Convertible) {
| ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Convertible<std::random_access_iterator_tag, std::bidirectional_iterator_tag> >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/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> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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);
| ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/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) );
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/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;
| ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/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)>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:573:11: [ skipping 7 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied<boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > > >::value’
44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied<boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > > >’
45 | typedef boost::integral_constant<bool, value> type;
| ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_<void (*)(boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > >)>’
72 | struct requirement_<void(*)(Model)>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map<RAIter, ID, Value, Value&> boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >; Value = long unsigned int; ID = vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:113:35: required from ‘void boost::kruskal_minimum_spanning_tree(const Graph&, OutputIterator) [with Graph = R_adjacency_list<directedS, double>; OutputIterator = std::back_insert_iterator<std::vector<detail::edge_desc_impl<directed_tag, long unsigned int> > >]’
113 | make_iterator_property_map(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^
114 | rank_map.begin(), get(vertex_index, g), rank_map[0]),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
minST.cpp:20:38: required from here
20 | kruskal_minimum_spanning_tree(g, std::back_inserter(spanning_tree));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Convertible<std::random_access_iterator_tag, std::bidirectional_iterator_tag>]’
20 | ~usage_requirements() { ((Model*)0)->~Model(); }
| ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::Convertible<std::random_access_iterator_tag, std::bidirectional_iterator_tag>]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:573:11: required from ‘boost::BidirectionalIterator<TT>::~BidirectionalIterator() [with TT = __gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: required from ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::BidirectionalIterator<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > >]’
20 | ~usage_requirements() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::BidirectionalIterator<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > > >]’
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:571:7: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > >’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > >’
597 | BOOST_concept(RandomAccessIterator,(TT))
| ^~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied<boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > > >::value’
44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied<boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > > >’
45 | typedef boost::integral_constant<bool, value> type;
| ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_<void (*)(boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > >)>’
72 | struct requirement_<void(*)(Model)>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map<RAIter, ID, Value, Value&> boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >; Value = long unsigned int; ID = vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:113:35: required from ‘void boost::kruskal_minimum_spanning_tree(const Graph&, OutputIterator) [with Graph = R_adjacency_list<directedS, double>; OutputIterator = std::back_insert_iterator<std::vector<detail::edge_desc_impl<directed_tag, long unsigned int> > >]’
113 | make_iterator_property_map(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^
114 | rank_map.begin(), get(vertex_index, g), rank_map[0]),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
minST.cpp:20:38: required from here
20 | kruskal_minimum_spanning_tree(g, std::back_inserter(spanning_tree));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible<X, Y>::~Convertible() [with X = std::random_access_iterator_tag; Y = std::bidirectional_iterator_tag]’
37 | ~model()
| ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
208 | BOOST_CONCEPT_USAGE(Convertible) {
| ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Convertible<std::random_access_iterator_tag, std::random_access_iterator_tag>]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/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(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/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> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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);
| ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/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) );
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/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;
| ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/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)>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:603:11: required from ‘boost::RandomAccessIterator<TT>::~RandomAccessIterator() [with TT = __gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3: required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > >]’
597 | BOOST_concept(RandomAccessIterator,(TT))
| ^~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map<RAIter, ID, Value, Value&> boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >; Value = long unsigned int; ID = vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:113:35: required from ‘void boost::kruskal_minimum_spanning_tree(const Graph&, OutputIterator) [with Graph = R_adjacency_list<directedS, double>; OutputIterator = std::back_insert_iterator<std::vector<detail::edge_desc_impl<directed_tag, long unsigned int> > >]’
113 | make_iterator_property_map(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^
114 | rank_map.begin(), get(vertex_index, g), rank_map[0]),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
minST.cpp:20:38: required from here
20 | kruskal_minimum_spanning_tree(g, std::back_inserter(spanning_tree));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
20 | ~usage_requirements() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible<X, Y>::~Convertible() [with X = std::random_access_iterator_tag; Y = std::random_access_iterator_tag]’
37 | ~model()
| ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
208 | BOOST_CONCEPT_USAGE(Convertible) {
| ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::DefaultConstructible<long unsigned int> >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:137:5: required from ‘struct boost::DefaultConstructible<long unsigned int>’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::DefaultConstructible<long unsigned int>]’
32 | inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
| ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied<boost::DefaultConstructible<long unsigned int> >::value’
44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied<boost::DefaultConstructible<long unsigned int> >’
45 | typedef boost::integral_constant<bool, value> type;
| ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_<void (*)(boost::DefaultConstructible<long unsigned int>)>’
72 | struct requirement_<void(*)(Model)>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:68:9: [ skipping 7 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied<boost::concepts::VertexListGraphConcept<R_adjacency_list<boost::directedS, double> > >::value’
44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied<boost::concepts::VertexListGraphConcept<R_adjacency_list<boost::directedS, double> > >’
45 | typedef boost::integral_constant<bool, value> type;
| ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_<void (*)(boost::concepts::VertexListGraphConcept<R_adjacency_list<boost::directedS, double> >)>’
72 | struct requirement_<void(*)(Model)>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:55:9: required from ‘void boost::detail::kruskal_mst_impl(const Graph&, OutputIterator, Rank, Parent, Weight) [with Graph = R_adjacency_list<boost::directedS, double>; OutputIterator = std::back_insert_iterator<std::vector<edge_desc_impl<boost::directed_tag, long unsigned int> > >; Rank = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; Parent = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; Weight = boost::adj_list_edge_property_map<boost::directed_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:112:29: required from ‘void boost::kruskal_minimum_spanning_tree(const Graph&, OutputIterator) [with Graph = R_adjacency_list<directedS, double>; OutputIterator = std::back_insert_iterator<std::vector<detail::edge_desc_impl<directed_tag, long unsigned int> > >]’
112 | detail::kruskal_mst_impl(g, spanning_tree_edges,
| ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
113 | make_iterator_property_map(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~
114 | rank_map.begin(), get(vertex_index, g), rank_map[0]),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
115 | make_iterator_property_map(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~
116 | pred_map.begin(), get(vertex_index, g), pred_map[0]),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
117 | get(edge_weight, g));
| ~~~~~~~~~~~~~~~~~~~~
minST.cpp:20:38: required from here
20 | kruskal_minimum_spanning_tree(g, std::back_inserter(spanning_tree));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::DefaultConstructible<long unsigned int>]’
20 | ~usage_requirements() { ((Model*)0)->~Model(); }
| ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::DefaultConstructible<long unsigned int>]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:68:9: required from ‘boost::concepts::Graph<G>::~Graph() [with G = R_adjacency_list<boost::directedS, double>]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: required from ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::concepts::Graph<R_adjacency_list<boost::directedS, double> >]’
20 | ~usage_requirements() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/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<R_adjacency_list<boost::directedS, double> > >]’
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:66:5: required from ‘struct boost::concepts::Graph<R_adjacency_list<boost::directedS, double> >’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:176:1: required from ‘struct boost::concepts::VertexListGraph<R_adjacency_list<boost::directedS, double> >’
176 | BOOST_concept(VertexListGraph, (G)) : Graph< G >
| ^~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:176:1: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied<boost::concepts::VertexListGraphConcept<R_adjacency_list<boost::directedS, double> > >::value’
44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied<boost::concepts::VertexListGraphConcept<R_adjacency_list<boost::directedS, double> > >’
45 | typedef boost::integral_constant<bool, value> type;
| ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_<void (*)(boost::concepts::VertexListGraphConcept<R_adjacency_list<boost::directedS, double> >)>’
72 | struct requirement_<void(*)(Model)>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:55:9: required from ‘void boost::detail::kruskal_mst_impl(const Graph&, OutputIterator, Rank, Parent, Weight) [with Graph = R_adjacency_list<boost::directedS, double>; OutputIterator = std::back_insert_iterator<std::vector<edge_desc_impl<boost::directed_tag, long unsigned int> > >; Rank = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; Parent = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; Weight = boost::adj_list_edge_property_map<boost::directed_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:112:29: required from ‘void boost::kruskal_minimum_spanning_tree(const Graph&, OutputIterator) [with Graph = R_adjacency_list<directedS, double>; OutputIterator = std::back_insert_iterator<std::vector<detail::edge_desc_impl<directed_tag, long unsigned int> > >]’
112 | detail::kruskal_mst_impl(g, spanning_tree_edges,
| ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
113 | make_iterator_property_map(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~
114 | rank_map.begin(), get(vertex_index, g), rank_map[0]),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
115 | make_iterator_property_map(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~
116 | pred_map.begin(), get(vertex_index, g), pred_map[0]),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
117 | get(edge_weight, g));
| ~~~~~~~~~~~~~~~~~~~~
minST.cpp:20:38: required from here
20 | kruskal_minimum_spanning_tree(g, std::back_inserter(spanning_tree));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::DefaultConstructible<TT>::~DefaultConstructible() [with TT = long unsigned int]’
37 | ~model()
| ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:137:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
137 | BOOST_CONCEPT_USAGE(DefaultConstructible) {
| ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::EqualityComparable<long unsigned int> >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable<long unsigned int>’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::EqualityComparable<long unsigned int>]’
32 | inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
| ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied<boost::EqualityComparable<long unsigned int> >::value’
44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied<boost::EqualityComparable<long unsigned int> >’
45 | typedef boost::integral_constant<bool, value> type;
| ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_<void (*)(boost::EqualityComparable<long unsigned int>)>’
72 | struct requirement_<void(*)(Model)>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:69:9: [ skipping 7 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied<boost::concepts::VertexListGraphConcept<R_adjacency_list<boost::directedS, double> > >::value’
44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied<boost::concepts::VertexListGraphConcept<R_adjacency_list<boost::directedS, double> > >’
45 | typedef boost::integral_constant<bool, value> type;
| ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_<void (*)(boost::concepts::VertexListGraphConcept<R_adjacency_list<boost::directedS, double> >)>’
72 | struct requirement_<void(*)(Model)>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:55:9: required from ‘void boost::detail::kruskal_mst_impl(const Graph&, OutputIterator, Rank, Parent, Weight) [with Graph = R_adjacency_list<boost::directedS, double>; OutputIterator = std::back_insert_iterator<std::vector<edge_desc_impl<boost::directed_tag, long unsigned int> > >; Rank = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; Parent = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; Weight = boost::adj_list_edge_property_map<boost::directed_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:112:29: required from ‘void boost::kruskal_minimum_spanning_tree(const Graph&, OutputIterator) [with Graph = R_adjacency_list<directedS, double>; OutputIterator = std::back_insert_iterator<std::vector<detail::edge_desc_impl<directed_tag, long unsigned int> > >]’
112 | detail::kruskal_mst_impl(g, spanning_tree_edges,
| ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
113 | make_iterator_property_map(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~
114 | rank_map.begin(), get(vertex_index, g), rank_map[0]),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
115 | make_iterator_property_map(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~
116 | pred_map.begin(), get(vertex_index, g), pred_map[0]),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
117 | get(edge_weight, g));
| ~~~~~~~~~~~~~~~~~~~~
minST.cpp:20:38: required from here
20 | kruskal_minimum_spanning_tree(g, std::back_inserter(spanning_tree));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::EqualityComparable<long unsigned int>]’
20 | ~usage_requirements() { ((Model*)0)->~Model(); }
| ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::EqualityComparable<long unsigned int>]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:69:9: required from ‘boost::concepts::Graph<G>::~Graph() [with G = R_adjacency_list<boost::directedS, double>]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: required from ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::concepts::Graph<R_adjacency_list<boost::directedS, double> >]’
20 | ~usage_requirements() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/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<R_adjacency_list<boost::directedS, double> > >]’
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:66:5: required from ‘struct boost::concepts::Graph<R_adjacency_list<boost::directedS, double> >’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:176:1: required from ‘struct boost::concepts::VertexListGraph<R_adjacency_list<boost::directedS, double> >’
176 | BOOST_concept(VertexListGraph, (G)) : Graph< G >
| ^~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:176:1: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied<boost::concepts::VertexListGraphConcept<R_adjacency_list<boost::directedS, double> > >::value’
44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied<boost::concepts::VertexListGraphConcept<R_adjacency_list<boost::directedS, double> > >’
45 | typedef boost::integral_constant<bool, value> type;
| ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_<void (*)(boost::concepts::VertexListGraphConcept<R_adjacency_list<boost::directedS, double> >)>’
72 | struct requirement_<void(*)(Model)>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:55:9: required from ‘void boost::detail::kruskal_mst_impl(const Graph&, OutputIterator, Rank, Parent, Weight) [with Graph = R_adjacency_list<boost::directedS, double>; OutputIterator = std::back_insert_iterator<std::vector<edge_desc_impl<boost::directed_tag, long unsigned int> > >; Rank = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; Parent = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; Weight = boost::adj_list_edge_property_map<boost::directed_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:112:29: required from ‘void boost::kruskal_minimum_spanning_tree(const Graph&, OutputIterator) [with Graph = R_adjacency_list<directedS, double>; OutputIterator = std::back_insert_iterator<std::vector<detail::edge_desc_impl<directed_tag, long unsigned int> > >]’
112 | detail::kruskal_mst_impl(g, spanning_tree_edges,
| ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
113 | make_iterator_property_map(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~
114 | rank_map.begin(), get(vertex_index, g), rank_map[0]),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
115 | make_iterator_property_map(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~
116 | pred_map.begin(), get(vertex_index, g), pred_map[0]),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
117 | get(edge_weight, g));
| ~~~~~~~~~~~~~~~~~~~~
minST.cpp:20:38: required from here
20 | kruskal_minimum_spanning_tree(g, std::back_inserter(spanning_tree));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::EqualityComparable<TT>::~EqualityComparable() [with TT = long unsigned int]’
37 | ~model()
| ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:233:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
233 | BOOST_CONCEPT_USAGE(EqualityComparable) {
| ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Assignable<long unsigned int> >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:145:5: required from ‘struct boost::Assignable<long unsigned int>’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::Assignable<long unsigned int>]’
32 | inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
| ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied<boost::Assignable<long unsigned int> >::value’
44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied<boost::Assignable<long unsigned int> >’
45 | typedef boost::integral_constant<bool, value> type;
| ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_<void (*)(boost::Assignable<long unsigned int>)>’
72 | struct requirement_<void(*)(Model)>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:70:9: [ skipping 7 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied<boost::concepts::VertexListGraphConcept<R_adjacency_list<boost::directedS, double> > >::value’
44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied<boost::concepts::VertexListGraphConcept<R_adjacency_list<boost::directedS, double> > >’
45 | typedef boost::integral_constant<bool, value> type;
| ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_<void (*)(boost::concepts::VertexListGraphConcept<R_adjacency_list<boost::directedS, double> >)>’
72 | struct requirement_<void(*)(Model)>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:55:9: required from ‘void boost::detail::kruskal_mst_impl(const Graph&, OutputIterator, Rank, Parent, Weight) [with Graph = R_adjacency_list<boost::directedS, double>; OutputIterator = std::back_insert_iterator<std::vector<edge_desc_impl<boost::directed_tag, long unsigned int> > >; Rank = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; Parent = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; Weight = boost::adj_list_edge_property_map<boost::directed_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:112:29: required from ‘void boost::kruskal_minimum_spanning_tree(const Graph&, OutputIterator) [with Graph = R_adjacency_list<directedS, double>; OutputIterator = std::back_insert_iterator<std::vector<detail::edge_desc_impl<directed_tag, long unsigned int> > >]’
112 | detail::kruskal_mst_impl(g, spanning_tree_edges,
| ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
113 | make_iterator_property_map(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~
114 | rank_map.begin(), get(vertex_index, g), rank_map[0]),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
115 | make_iterator_property_map(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~
116 | pred_map.begin(), get(vertex_index, g), pred_map[0]),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
117 | get(edge_weight, g));
| ~~~~~~~~~~~~~~~~~~~~
minST.cpp:20:38: required from here
20 | kruskal_minimum_spanning_tree(g, std::back_inserter(spanning_tree));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Assignable<long unsigned int>]’
20 | ~usage_requirements() { ((Model*)0)->~Model(); }
| ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::Assignable<long unsigned int>]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:70:9: required from ‘boost::concepts::Graph<G>::~Graph() [with G = R_adjacency_list<boost::directedS, double>]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: required from ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::concepts::Graph<R_adjacency_list<boost::directedS, double> >]’
20 | ~usage_requirements() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/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<R_adjacency_list<boost::directedS, double> > >]’
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:66:5: required from ‘struct boost::concepts::Graph<R_adjacency_list<boost::directedS, double> >’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:176:1: required from ‘struct boost::concepts::VertexListGraph<R_adjacency_list<boost::directedS, double> >’
176 | BOOST_concept(VertexListGraph, (G)) : Graph< G >
| ^~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:176:1: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied<boost::concepts::VertexListGraphConcept<R_adjacency_list<boost::directedS, double> > >::value’
44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied<boost::concepts::VertexListGraphConcept<R_adjacency_list<boost::directedS, double> > >’
45 | typedef boost::integral_constant<bool, value> type;
| ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_<void (*)(boost::concepts::VertexListGraphConcept<R_adjacency_list<boost::directedS, double> >)>’
72 | struct requirement_<void(*)(Model)>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:55:9: required from ‘void boost::detail::kruskal_mst_impl(const Graph&, OutputIterator, Rank, Parent, Weight) [with Graph = R_adjacency_list<boost::directedS, double>; OutputIterator = std::back_insert_iterator<std::vector<edge_desc_impl<boost::directed_tag, long unsigned int> > >; Rank = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; Parent = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; Weight = boost::adj_list_edge_property_map<boost::directed_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:112:29: required from ‘void boost::kruskal_minimum_spanning_tree(const Graph&, OutputIterator) [with Graph = R_adjacency_list<directedS, double>; OutputIterator = std::back_insert_iterator<std::vector<detail::edge_desc_impl<directed_tag, long unsigned int> > >]’
112 | detail::kruskal_mst_impl(g, spanning_tree_edges,
| ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
113 | make_iterator_property_map(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~
114 | rank_map.begin(), get(vertex_index, g), rank_map[0]),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
115 | make_iterator_property_map(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~
116 | pred_map.begin(), get(vertex_index, g), pred_map[0]),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
117 | get(edge_weight, g));
| ~~~~~~~~~~~~~~~~~~~~
minST.cpp:20:38: required from here
20 | kruskal_minimum_spanning_tree(g, std::back_inserter(spanning_tree));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Assignable<TT>::~Assignable() [with TT = long unsigned int]’
37 | ~model()
| ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:145:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
145 | BOOST_CONCEPT_USAGE(Assignable) {
| ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::concepts::MultiPassInputIterator<boost::range_detail::integer_iterator<long unsigned int> >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::concepts::MultiPassInputIterator<boost::range_detail::integer_iterator<long unsigned int> > >]’
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:52:50: required from ‘struct boost::concepts::MultiPassInputIterator<boost::range_detail::integer_iterator<long unsigned int> >’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::concepts::MultiPassInputIterator<boost::range_detail::integer_iterator<long unsigned int> >]’
32 | inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
| ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied<boost::concepts::MultiPassInputIterator<boost::range_detail::integer_iterator<long unsigned int> > >::value’
44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied<boost::concepts::MultiPassInputIterator<boost::range_detail::integer_iterator<long unsigned int> > >’
45 | typedef boost::integral_constant<bool, value> type;
| ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_<void (*)(boost::concepts::MultiPassInputIterator<boost::range_detail::integer_iterator<long unsigned int> >)>’
72 | struct requirement_<void(*)(Model)>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:184:9: required from ‘boost::concepts::VertexListGraph<G>::~VertexListGraph() [with G = R_adjacency_list<boost::directedS, double>]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/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<R_adjacency_list<boost::directedS, double> >]’
176 | BOOST_concept(VertexListGraph, (G)) : Graph< G >
| ^~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:55:9: required from ‘void boost::detail::kruskal_mst_impl(const Graph&, OutputIterator, Rank, Parent, Weight) [with Graph = R_adjacency_list<boost::directedS, double>; OutputIterator = std::back_insert_iterator<std::vector<edge_desc_impl<boost::directed_tag, long unsigned int> > >; Rank = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; Parent = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; Weight = boost::adj_list_edge_property_map<boost::directed_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:112:29: required from ‘void boost::kruskal_minimum_spanning_tree(const Graph&, OutputIterator) [with Graph = R_adjacency_list<directedS, double>; OutputIterator = std::back_insert_iterator<std::vector<detail::edge_desc_impl<directed_tag, long unsigned int> > >]’
112 | detail::kruskal_mst_impl(g, spanning_tree_edges,
| ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
113 | make_iterator_property_map(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~
114 | rank_map.begin(), get(vertex_index, g), rank_map[0]),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
115 | make_iterator_property_map(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~
116 | pred_map.begin(), get(vertex_index, g), pred_map[0]),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
117 | get(edge_weight, g));
| ~~~~~~~~~~~~~~~~~~~~
minST.cpp:20:38: required from here
20 | kruskal_minimum_spanning_tree(g, std::back_inserter(spanning_tree));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
20 | ~usage_requirements() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::concepts::MultiPassInputIterator<T>::~MultiPassInputIterator() [with T = boost::range_detail::integer_iterator<long unsigned int>]’
37 | ~model()
| ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:52:50: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
52 | BOOST_concept(MultiPassInputIterator, (T)) { BOOST_CONCEPT_USAGE(
| ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/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>]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/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(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/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> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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);
| ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/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) );
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/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;
| ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/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)>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:185:9: required from ‘boost::concepts::VertexListGraph<G>::~VertexListGraph() [with G = R_adjacency_list<boost::directedS, double>]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/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<R_adjacency_list<boost::directedS, double> >]’
176 | BOOST_concept(VertexListGraph, (G)) : Graph< G >
| ^~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:55:9: required from ‘void boost::detail::kruskal_mst_impl(const Graph&, OutputIterator, Rank, Parent, Weight) [with Graph = R_adjacency_list<boost::directedS, double>; OutputIterator = std::back_insert_iterator<std::vector<edge_desc_impl<boost::directed_tag, long unsigned int> > >; Rank = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; Parent = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; Weight = boost::adj_list_edge_property_map<boost::directed_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:112:29: required from ‘void boost::kruskal_minimum_spanning_tree(const Graph&, OutputIterator) [with Graph = R_adjacency_list<directedS, double>; OutputIterator = std::back_insert_iterator<std::vector<detail::edge_desc_impl<directed_tag, long unsigned int> > >]’
112 | detail::kruskal_mst_impl(g, spanning_tree_edges,
| ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
113 | make_iterator_property_map(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~
114 | rank_map.begin(), get(vertex_index, g), rank_map[0]),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
115 | make_iterator_property_map(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~
116 | pred_map.begin(), get(vertex_index, g), pred_map[0]),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
117 | get(edge_weight, g));
| ~~~~~~~~~~~~~~~~~~~~
minST.cpp:20:38: required from here
20 | kruskal_minimum_spanning_tree(g, std::back_inserter(spanning_tree));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
20 | ~usage_requirements() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/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()
| ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
208 | BOOST_CONCEPT_USAGE(Convertible) {
| ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/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<boost::range_detail::integer_iterator<long unsigned int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int>, boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_color_t, boost::default_color_type>, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::no_property, boost::listS> > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/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<boost::range_detail::integer_iterator<long unsigned int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int>, boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_color_t, boost::default_color_type>, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::no_property, boost::listS> > > >]’
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:52:50: required from ‘struct boost::concepts::MultiPassInputIterator<boost::detail::adj_list_edge_iterator<boost::range_detail::integer_iterator<long unsigned int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int>, boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_color_t, boost::default_color_type>, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::no_property, boost::listS> > >’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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<boost::range_detail::integer_iterator<long unsigned int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int>, boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_color_t, boost::default_color_type>, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::no_property, boost::listS> > >]’
32 | inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
| ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/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<boost::range_detail::integer_iterator<long unsigned int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int>, boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_color_t, boost::default_color_type>, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::no_property, boost::listS> > > >::value’
44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/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<boost::range_detail::integer_iterator<long unsigned int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int>, boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_color_t, boost::default_color_type>, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::no_property, boost::listS> > > >’
45 | typedef boost::integral_constant<bool, value> type;
| ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/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<boost::range_detail::integer_iterator<long unsigned int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int>, boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_color_t, boost::default_color_type>, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::no_property, boost::listS> > >)>’
72 | struct requirement_<void(*)(Model)>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:235:9: required from ‘boost::concepts::EdgeListGraph<G>::~EdgeListGraph() [with G = R_adjacency_list<boost::directedS, double>]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/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<R_adjacency_list<boost::directedS, double> >]’
226 | BOOST_concept(EdgeListGraph, (G)) : Graph< G >
| ^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:56:9: required from ‘void boost::detail::kruskal_mst_impl(const Graph&, OutputIterator, Rank, Parent, Weight) [with Graph = R_adjacency_list<boost::directedS, double>; OutputIterator = std::back_insert_iterator<std::vector<edge_desc_impl<boost::directed_tag, long unsigned int> > >; Rank = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; Parent = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; Weight = boost::adj_list_edge_property_map<boost::directed_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:112:29: required from ‘void boost::kruskal_minimum_spanning_tree(const Graph&, OutputIterator) [with Graph = R_adjacency_list<directedS, double>; OutputIterator = std::back_insert_iterator<std::vector<detail::edge_desc_impl<directed_tag, long unsigned int> > >]’
112 | detail::kruskal_mst_impl(g, spanning_tree_edges,
| ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
113 | make_iterator_property_map(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~
114 | rank_map.begin(), get(vertex_index, g), rank_map[0]),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
115 | make_iterator_property_map(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~
116 | pred_map.begin(), get(vertex_index, g), pred_map[0]),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
117 | get(edge_weight, g));
| ~~~~~~~~~~~~~~~~~~~~
minST.cpp:20:38: required from here
20 | kruskal_minimum_spanning_tree(g, std::back_inserter(spanning_tree));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
20 | ~usage_requirements() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/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<boost::range_detail::integer_iterator<long unsigned int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int>, boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_color_t, boost::default_color_type>, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::no_property, boost::listS> >]’
37 | ~model()
| ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:52:50: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
52 | BOOST_concept(MultiPassInputIterator, (T)) { BOOST_CONCEPT_USAGE(
| ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::DefaultConstructible<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::DefaultConstructible<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > >]’
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:137:5: required from ‘struct boost::DefaultConstructible<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> >’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::DefaultConstructible<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> >]’
32 | inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
| ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied<boost::DefaultConstructible<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > >::value’
44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied<boost::DefaultConstructible<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > >’
45 | typedef boost::integral_constant<bool, value> type;
| ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_<void (*)(boost::DefaultConstructible<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> >)>’
72 | struct requirement_<void(*)(Model)>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:90:9: required from ‘boost::concepts::EdgeListGraph<G>::~EdgeListGraph() [with G = R_adjacency_list<boost::directedS, double>]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/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<R_adjacency_list<boost::directedS, double> >]’
226 | BOOST_concept(EdgeListGraph, (G)) : Graph< G >
| ^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:56:9: required from ‘void boost::detail::kruskal_mst_impl(const Graph&, OutputIterator, Rank, Parent, Weight) [with Graph = R_adjacency_list<boost::directedS, double>; OutputIterator = std::back_insert_iterator<std::vector<edge_desc_impl<boost::directed_tag, long unsigned int> > >; Rank = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; Parent = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; Weight = boost::adj_list_edge_property_map<boost::directed_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:112:29: required from ‘void boost::kruskal_minimum_spanning_tree(const Graph&, OutputIterator) [with Graph = R_adjacency_list<directedS, double>; OutputIterator = std::back_insert_iterator<std::vector<detail::edge_desc_impl<directed_tag, long unsigned int> > >]’
112 | detail::kruskal_mst_impl(g, spanning_tree_edges,
| ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
113 | make_iterator_property_map(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~
114 | rank_map.begin(), get(vertex_index, g), rank_map[0]),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
115 | make_iterator_property_map(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~
116 | pred_map.begin(), get(vertex_index, g), pred_map[0]),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
117 | get(edge_weight, g));
| ~~~~~~~~~~~~~~~~~~~~
minST.cpp:20:38: required from here
20 | kruskal_minimum_spanning_tree(g, std::back_inserter(spanning_tree));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
20 | ~usage_requirements() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::DefaultConstructible<TT>::~DefaultConstructible() [with TT = boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>]’
37 | ~model()
| ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:137:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
137 | BOOST_CONCEPT_USAGE(DefaultConstructible) {
| ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::EqualityComparable<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::EqualityComparable<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > >]’
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> >’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::EqualityComparable<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> >]’
32 | inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
| ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied<boost::EqualityComparable<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > >::value’
44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied<boost::EqualityComparable<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > >’
45 | typedef boost::integral_constant<bool, value> type;
| ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_<void (*)(boost::EqualityComparable<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> >)>’
72 | struct requirement_<void(*)(Model)>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:91:9: required from ‘boost::concepts::EdgeListGraph<G>::~EdgeListGraph() [with G = R_adjacency_list<boost::directedS, double>]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/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<R_adjacency_list<boost::directedS, double> >]’
226 | BOOST_concept(EdgeListGraph, (G)) : Graph< G >
| ^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:56:9: required from ‘void boost::detail::kruskal_mst_impl(const Graph&, OutputIterator, Rank, Parent, Weight) [with Graph = R_adjacency_list<boost::directedS, double>; OutputIterator = std::back_insert_iterator<std::vector<edge_desc_impl<boost::directed_tag, long unsigned int> > >; Rank = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; Parent = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; Weight = boost::adj_list_edge_property_map<boost::directed_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:112:29: required from ‘void boost::kruskal_minimum_spanning_tree(const Graph&, OutputIterator) [with Graph = R_adjacency_list<directedS, double>; OutputIterator = std::back_insert_iterator<std::vector<detail::edge_desc_impl<directed_tag, long unsigned int> > >]’
112 | detail::kruskal_mst_impl(g, spanning_tree_edges,
| ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
113 | make_iterator_property_map(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~
114 | rank_map.begin(), get(vertex_index, g), rank_map[0]),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
115 | make_iterator_property_map(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~
116 | pred_map.begin(), get(vertex_index, g), pred_map[0]),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
117 | get(edge_weight, g));
| ~~~~~~~~~~~~~~~~~~~~
minST.cpp:20:38: required from here
20 | kruskal_minimum_spanning_tree(g, std::back_inserter(spanning_tree));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
20 | ~usage_requirements() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::EqualityComparable<TT>::~EqualityComparable() [with TT = boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>]’
37 | ~model()
| ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:233:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
233 | BOOST_CONCEPT_USAGE(EqualityComparable) {
| ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Assignable<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Assignable<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > >]’
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:145:5: required from ‘struct boost::Assignable<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> >’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::Assignable<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> >]’
32 | inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
| ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied<boost::Assignable<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > >::value’
44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied<boost::Assignable<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > >’
45 | typedef boost::integral_constant<bool, value> type;
| ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_<void (*)(boost::Assignable<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> >)>’
72 | struct requirement_<void(*)(Model)>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:92:9: required from ‘boost::concepts::EdgeListGraph<G>::~EdgeListGraph() [with G = R_adjacency_list<boost::directedS, double>]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/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<R_adjacency_list<boost::directedS, double> >]’
226 | BOOST_concept(EdgeListGraph, (G)) : Graph< G >
| ^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:56:9: required from ‘void boost::detail::kruskal_mst_impl(const Graph&, OutputIterator, Rank, Parent, Weight) [with Graph = R_adjacency_list<boost::directedS, double>; OutputIterator = std::back_insert_iterator<std::vector<edge_desc_impl<boost::directed_tag, long unsigned int> > >; Rank = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; Parent = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; Weight = boost::adj_list_edge_property_map<boost::directed_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:112:29: required from ‘void boost::kruskal_minimum_spanning_tree(const Graph&, OutputIterator) [with Graph = R_adjacency_list<directedS, double>; OutputIterator = std::back_insert_iterator<std::vector<detail::edge_desc_impl<directed_tag, long unsigned int> > >]’
112 | detail::kruskal_mst_impl(g, spanning_tree_edges,
| ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
113 | make_iterator_property_map(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~
114 | rank_map.begin(), get(vertex_index, g), rank_map[0]),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
115 | make_iterator_property_map(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~
116 | pred_map.begin(), get(vertex_index, g), pred_map[0]),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
117 | get(edge_weight, g));
| ~~~~~~~~~~~~~~~~~~~~
minST.cpp:20:38: required from here
20 | kruskal_minimum_spanning_tree(g, std::back_inserter(spanning_tree));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
20 | ~usage_requirements() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Assignable<TT>::~Assignable() [with TT = boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>]’
37 | ~model()
| ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:145:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
145 | BOOST_CONCEPT_USAGE(Assignable) {
| ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/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>]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/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(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/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> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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);
| ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/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) );
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/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;
| ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/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)>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:239:9: required from ‘boost::concepts::EdgeListGraph<G>::~EdgeListGraph() [with G = R_adjacency_list<boost::directedS, double>]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/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<R_adjacency_list<boost::directedS, double> >]’
226 | BOOST_concept(EdgeListGraph, (G)) : Graph< G >
| ^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:56:9: required from ‘void boost::detail::kruskal_mst_impl(const Graph&, OutputIterator, Rank, Parent, Weight) [with Graph = R_adjacency_list<boost::directedS, double>; OutputIterator = std::back_insert_iterator<std::vector<edge_desc_impl<boost::directed_tag, long unsigned int> > >; Rank = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; Parent = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; Weight = boost::adj_list_edge_property_map<boost::directed_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:112:29: required from ‘void boost::kruskal_minimum_spanning_tree(const Graph&, OutputIterator) [with Graph = R_adjacency_list<directedS, double>; OutputIterator = std::back_insert_iterator<std::vector<detail::edge_desc_impl<directed_tag, long unsigned int> > >]’
112 | detail::kruskal_mst_impl(g, spanning_tree_edges,
| ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
113 | make_iterator_property_map(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~
114 | rank_map.begin(), get(vertex_index, g), rank_map[0]),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
115 | make_iterator_property_map(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~
116 | pred_map.begin(), get(vertex_index, g), pred_map[0]),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
117 | get(edge_weight, g));
| ~~~~~~~~~~~~~~~~~~~~
minST.cpp:20:38: required from here
20 | kruskal_minimum_spanning_tree(g, std::back_inserter(spanning_tree));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
20 | ~usage_requirements() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/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()
| ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
208 | BOOST_CONCEPT_USAGE(Convertible) {
| ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Convertible<boost::lvalue_property_map_tag, boost::writable_property_map_tag>]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/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(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/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> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/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))
| ^~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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);
| ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/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) );
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 9 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied<boost::ReadWritePropertyMapConcept<boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>, long unsigned int> >::value’
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied<boost::ReadWritePropertyMapConcept<boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>, long unsigned int> >’
45 | typedef boost::integral_constant<bool, value> type;
| ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_<void (*)(boost::ReadWritePropertyMapConcept<boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>, long unsigned int>)>’
72 | struct requirement_<void(*)(Model)>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:58:9: required from ‘void boost::detail::kruskal_mst_impl(const Graph&, OutputIterator, Rank, Parent, Weight) [with Graph = R_adjacency_list<boost::directedS, double>; OutputIterator = std::back_insert_iterator<std::vector<edge_desc_impl<boost::directed_tag, long unsigned int> > >; Rank = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; Parent = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; Weight = boost::adj_list_edge_property_map<boost::directed_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:112:29: required from ‘void boost::kruskal_minimum_spanning_tree(const Graph&, OutputIterator) [with Graph = R_adjacency_list<directedS, double>; OutputIterator = std::back_insert_iterator<std::vector<detail::edge_desc_impl<directed_tag, long unsigned int> > >]’
112 | detail::kruskal_mst_impl(g, spanning_tree_edges,
| ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
113 | make_iterator_property_map(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~
114 | rank_map.begin(), get(vertex_index, g), rank_map[0]),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
115 | make_iterator_property_map(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~
116 | pred_map.begin(), get(vertex_index, g), pred_map[0]),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
117 | get(edge_weight, g));
| ~~~~~~~~~~~~~~~~~~~~
minST.cpp:20:38: required from here
20 | kruskal_minimum_spanning_tree(g, std::back_inserter(spanning_tree));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
20 | ~usage_requirements() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible<X, Y>::~Convertible() [with X = boost::lvalue_property_map_tag; Y = boost::writable_property_map_tag]’
37 | ~model()
| ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
208 | BOOST_CONCEPT_USAGE(Convertible) {
| ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Convertible<boost::undir_adj_list_traversal_tag, boost::vertex_list_graph_tag>]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Convertible<boost::undir_adj_list_traversal_tag, boost::vertex_list_graph_tag> >]’
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible<boost::undir_adj_list_traversal_tag, boost::vertex_list_graph_tag>’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::Convertible<boost::undir_adj_list_traversal_tag, boost::vertex_list_graph_tag>]’
32 | inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
| ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied<boost::Convertible<boost::undir_adj_list_traversal_tag, boost::vertex_list_graph_tag> >::value’
44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied<boost::Convertible<boost::undir_adj_list_traversal_tag, boost::vertex_list_graph_tag> >’
45 | typedef boost::integral_constant<bool, value> type;
| ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_<void (*)(boost::Convertible<boost::undir_adj_list_traversal_tag, boost::vertex_list_graph_tag>)>’
72 | struct requirement_<void(*)(Model)>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:185:9: required from ‘boost::concepts::VertexListGraph<G>::~VertexListGraph() [with G = R_adjacency_list<boost::undirectedS, double>]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/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<R_adjacency_list<boost::undirectedS, double> >]’
176 | BOOST_concept(VertexListGraph, (G)) : Graph< G >
| ^~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:55:9: required from ‘void boost::detail::kruskal_mst_impl(const Graph&, OutputIterator, Rank, Parent, Weight) [with Graph = R_adjacency_list<boost::undirectedS, double>; OutputIterator = std::back_insert_iterator<std::vector<edge_desc_impl<boost::undirected_tag, long unsigned int> > >; Rank = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; Parent = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; Weight = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:112:29: required from ‘void boost::kruskal_minimum_spanning_tree(const Graph&, OutputIterator) [with Graph = R_adjacency_list<undirectedS, double>; OutputIterator = std::back_insert_iterator<std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int> > >]’
112 | detail::kruskal_mst_impl(g, spanning_tree_edges,
| ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
113 | make_iterator_property_map(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~
114 | rank_map.begin(), get(vertex_index, g), rank_map[0]),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
115 | make_iterator_property_map(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~
116 | pred_map.begin(), get(vertex_index, g), pred_map[0]),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
117 | get(edge_weight, g));
| ~~~~~~~~~~~~~~~~~~~~
minST.cpp:54:38: required from here
54 | kruskal_minimum_spanning_tree(g, std::back_inserter(spanning_tree));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
20 | ~usage_requirements() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible<X, Y>::~Convertible() [with X = boost::undir_adj_list_traversal_tag; Y = boost::vertex_list_graph_tag]’
37 | ~model()
| ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
208 | BOOST_CONCEPT_USAGE(Convertible) {
| ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::concepts::MultiPassInputIterator<boost::detail::undirected_edge_iter<std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > >, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::concepts::MultiPassInputIterator<boost::detail::undirected_edge_iter<std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > >, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> > >]’
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:52:50: required from ‘struct boost::concepts::MultiPassInputIterator<boost::detail::undirected_edge_iter<std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > >, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> >’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::concepts::MultiPassInputIterator<boost::detail::undirected_edge_iter<std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > >, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> >]’
32 | inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
| ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied<boost::concepts::MultiPassInputIterator<boost::detail::undirected_edge_iter<std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > >, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> > >::value’
44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied<boost::concepts::MultiPassInputIterator<boost::detail::undirected_edge_iter<std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > >, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> > >’
45 | typedef boost::integral_constant<bool, value> type;
| ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_<void (*)(boost::concepts::MultiPassInputIterator<boost::detail::undirected_edge_iter<std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > >, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> >)>’
72 | struct requirement_<void(*)(Model)>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:235:9: required from ‘boost::concepts::EdgeListGraph<G>::~EdgeListGraph() [with G = R_adjacency_list<boost::undirectedS, double>]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/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<R_adjacency_list<boost::undirectedS, double> >]’
226 | BOOST_concept(EdgeListGraph, (G)) : Graph< G >
| ^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:56:9: required from ‘void boost::detail::kruskal_mst_impl(const Graph&, OutputIterator, Rank, Parent, Weight) [with Graph = R_adjacency_list<boost::undirectedS, double>; OutputIterator = std::back_insert_iterator<std::vector<edge_desc_impl<boost::undirected_tag, long unsigned int> > >; Rank = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; Parent = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; Weight = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:112:29: required from ‘void boost::kruskal_minimum_spanning_tree(const Graph&, OutputIterator) [with Graph = R_adjacency_list<undirectedS, double>; OutputIterator = std::back_insert_iterator<std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int> > >]’
112 | detail::kruskal_mst_impl(g, spanning_tree_edges,
| ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
113 | make_iterator_property_map(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~
114 | rank_map.begin(), get(vertex_index, g), rank_map[0]),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
115 | make_iterator_property_map(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~
116 | pred_map.begin(), get(vertex_index, g), pred_map[0]),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
117 | get(edge_weight, g));
| ~~~~~~~~~~~~~~~~~~~~
minST.cpp:54:38: required from here
54 | kruskal_minimum_spanning_tree(g, std::back_inserter(spanning_tree));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
20 | ~usage_requirements() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::concepts::MultiPassInputIterator<T>::~MultiPassInputIterator() [with T = boost::detail::undirected_edge_iter<std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > >, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int>]’
37 | ~model()
| ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:52:50: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
52 | BOOST_concept(MultiPassInputIterator, (T)) { BOOST_CONCEPT_USAGE(
| ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::DefaultConstructible<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::DefaultConstructible<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >]’
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:137:5: required from ‘struct boost::DefaultConstructible<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> >’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::DefaultConstructible<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> >]’
32 | inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
| ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied<boost::DefaultConstructible<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >::value’
44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied<boost::DefaultConstructible<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >’
45 | typedef boost::integral_constant<bool, value> type;
| ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_<void (*)(boost::DefaultConstructible<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> >)>’
72 | struct requirement_<void(*)(Model)>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:90:9: required from ‘boost::concepts::EdgeListGraph<G>::~EdgeListGraph() [with G = R_adjacency_list<boost::undirectedS, double>]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/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<R_adjacency_list<boost::undirectedS, double> >]’
226 | BOOST_concept(EdgeListGraph, (G)) : Graph< G >
| ^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:56:9: required from ‘void boost::detail::kruskal_mst_impl(const Graph&, OutputIterator, Rank, Parent, Weight) [with Graph = R_adjacency_list<boost::undirectedS, double>; OutputIterator = std::back_insert_iterator<std::vector<edge_desc_impl<boost::undirected_tag, long unsigned int> > >; Rank = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; Parent = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; Weight = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:112:29: required from ‘void boost::kruskal_minimum_spanning_tree(const Graph&, OutputIterator) [with Graph = R_adjacency_list<undirectedS, double>; OutputIterator = std::back_insert_iterator<std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int> > >]’
112 | detail::kruskal_mst_impl(g, spanning_tree_edges,
| ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
113 | make_iterator_property_map(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~
114 | rank_map.begin(), get(vertex_index, g), rank_map[0]),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
115 | make_iterator_property_map(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~
116 | pred_map.begin(), get(vertex_index, g), pred_map[0]),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
117 | get(edge_weight, g));
| ~~~~~~~~~~~~~~~~~~~~
minST.cpp:54:38: required from here
54 | kruskal_minimum_spanning_tree(g, std::back_inserter(spanning_tree));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
20 | ~usage_requirements() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::DefaultConstructible<TT>::~DefaultConstructible() [with TT = boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>]’
37 | ~model()
| ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:137:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
137 | BOOST_CONCEPT_USAGE(DefaultConstructible) {
| ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::EqualityComparable<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::EqualityComparable<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >]’
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> >’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::EqualityComparable<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> >]’
32 | inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
| ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied<boost::EqualityComparable<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >::value’
44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied<boost::EqualityComparable<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >’
45 | typedef boost::integral_constant<bool, value> type;
| ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_<void (*)(boost::EqualityComparable<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> >)>’
72 | struct requirement_<void(*)(Model)>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:91:9: required from ‘boost::concepts::EdgeListGraph<G>::~EdgeListGraph() [with G = R_adjacency_list<boost::undirectedS, double>]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/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<R_adjacency_list<boost::undirectedS, double> >]’
226 | BOOST_concept(EdgeListGraph, (G)) : Graph< G >
| ^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:56:9: required from ‘void boost::detail::kruskal_mst_impl(const Graph&, OutputIterator, Rank, Parent, Weight) [with Graph = R_adjacency_list<boost::undirectedS, double>; OutputIterator = std::back_insert_iterator<std::vector<edge_desc_impl<boost::undirected_tag, long unsigned int> > >; Rank = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; Parent = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; Weight = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:112:29: required from ‘void boost::kruskal_minimum_spanning_tree(const Graph&, OutputIterator) [with Graph = R_adjacency_list<undirectedS, double>; OutputIterator = std::back_insert_iterator<std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int> > >]’
112 | detail::kruskal_mst_impl(g, spanning_tree_edges,
| ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
113 | make_iterator_property_map(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~
114 | rank_map.begin(), get(vertex_index, g), rank_map[0]),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
115 | make_iterator_property_map(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~
116 | pred_map.begin(), get(vertex_index, g), pred_map[0]),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
117 | get(edge_weight, g));
| ~~~~~~~~~~~~~~~~~~~~
minST.cpp:54:38: required from here
54 | kruskal_minimum_spanning_tree(g, std::back_inserter(spanning_tree));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
20 | ~usage_requirements() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::EqualityComparable<TT>::~EqualityComparable() [with TT = boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>]’
37 | ~model()
| ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:233:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
233 | BOOST_CONCEPT_USAGE(EqualityComparable) {
| ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Assignable<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Assignable<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >]’
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:145:5: required from ‘struct boost::Assignable<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> >’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::Assignable<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> >]’
32 | inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
| ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied<boost::Assignable<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >::value’
44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied<boost::Assignable<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> > >’
45 | typedef boost::integral_constant<bool, value> type;
| ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_<void (*)(boost::Assignable<boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int> >)>’
72 | struct requirement_<void(*)(Model)>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:92:9: required from ‘boost::concepts::EdgeListGraph<G>::~EdgeListGraph() [with G = R_adjacency_list<boost::undirectedS, double>]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/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<R_adjacency_list<boost::undirectedS, double> >]’
226 | BOOST_concept(EdgeListGraph, (G)) : Graph< G >
| ^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:56:9: required from ‘void boost::detail::kruskal_mst_impl(const Graph&, OutputIterator, Rank, Parent, Weight) [with Graph = R_adjacency_list<boost::undirectedS, double>; OutputIterator = std::back_insert_iterator<std::vector<edge_desc_impl<boost::undirected_tag, long unsigned int> > >; Rank = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; Parent = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; Weight = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:112:29: required from ‘void boost::kruskal_minimum_spanning_tree(const Graph&, OutputIterator) [with Graph = R_adjacency_list<undirectedS, double>; OutputIterator = std::back_insert_iterator<std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int> > >]’
112 | detail::kruskal_mst_impl(g, spanning_tree_edges,
| ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
113 | make_iterator_property_map(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~
114 | rank_map.begin(), get(vertex_index, g), rank_map[0]),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
115 | make_iterator_property_map(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~
116 | pred_map.begin(), get(vertex_index, g), pred_map[0]),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
117 | get(edge_weight, g));
| ~~~~~~~~~~~~~~~~~~~~
minST.cpp:54:38: required from here
54 | kruskal_minimum_spanning_tree(g, std::back_inserter(spanning_tree));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
20 | ~usage_requirements() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Assignable<TT>::~Assignable() [with TT = boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>]’
37 | ~model()
| ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:145:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
145 | BOOST_CONCEPT_USAGE(Assignable) {
| ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Convertible<boost::undir_adj_list_traversal_tag, boost::edge_list_graph_tag>]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Convertible<boost::undir_adj_list_traversal_tag, boost::edge_list_graph_tag> >]’
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible<boost::undir_adj_list_traversal_tag, boost::edge_list_graph_tag>’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::Convertible<boost::undir_adj_list_traversal_tag, boost::edge_list_graph_tag>]’
32 | inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
| ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied<boost::Convertible<boost::undir_adj_list_traversal_tag, boost::edge_list_graph_tag> >::value’
44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied<boost::Convertible<boost::undir_adj_list_traversal_tag, boost::edge_list_graph_tag> >’
45 | typedef boost::integral_constant<bool, value> type;
| ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_<void (*)(boost::Convertible<boost::undir_adj_list_traversal_tag, boost::edge_list_graph_tag>)>’
72 | struct requirement_<void(*)(Model)>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:239:9: required from ‘boost::concepts::EdgeListGraph<G>::~EdgeListGraph() [with G = R_adjacency_list<boost::undirectedS, double>]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/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<R_adjacency_list<boost::undirectedS, double> >]’
226 | BOOST_concept(EdgeListGraph, (G)) : Graph< G >
| ^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:56:9: required from ‘void boost::detail::kruskal_mst_impl(const Graph&, OutputIterator, Rank, Parent, Weight) [with Graph = R_adjacency_list<boost::undirectedS, double>; OutputIterator = std::back_insert_iterator<std::vector<edge_desc_impl<boost::undirected_tag, long unsigned int> > >; Rank = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; Parent = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; Weight = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:112:29: required from ‘void boost::kruskal_minimum_spanning_tree(const Graph&, OutputIterator) [with Graph = R_adjacency_list<undirectedS, double>; OutputIterator = std::back_insert_iterator<std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int> > >]’
112 | detail::kruskal_mst_impl(g, spanning_tree_edges,
| ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
113 | make_iterator_property_map(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~
114 | rank_map.begin(), get(vertex_index, g), rank_map[0]),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
115 | make_iterator_property_map(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~
116 | pred_map.begin(), get(vertex_index, g), pred_map[0]),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
117 | get(edge_weight, g));
| ~~~~~~~~~~~~~~~~~~~~
minST.cpp:54:38: required from here
54 | kruskal_minimum_spanning_tree(g, std::back_inserter(spanning_tree));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
20 | ~usage_requirements() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible<X, Y>::~Convertible() [with X = boost::undir_adj_list_traversal_tag; Y = boost::edge_list_graph_tag]’
37 | ~model()
| ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
208 | BOOST_CONCEPT_USAGE(Convertible) {
| ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Assignable<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > > > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:145:5: required from ‘struct boost::Assignable<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > > >’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > > >’
502 | BOOST_concept(InputIterator,(TT))
| ^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:540:3: required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > > >’
540 | BOOST_concept(ForwardIterator,(TT))
| ^~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > > >’
568 | BOOST_concept(BidirectionalIterator,(TT))
| ^~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > > >’
597 | BOOST_concept(RandomAccessIterator,(TT))
| ^~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3: [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map<RAIter, ID, Value, Value&> boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > >; Value = double; ID = vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dijkstra_shortest_paths.hpp:556:43: required from ‘void boost::detail::dijkstra_dispatch1(const VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list<boost::undirectedS, double>; DistanceMap = boost::param_not_found; WeightMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>; Params = boost::bgl_named_params<_project2nd<double, double>, boost::distance_combine_t, boost::bgl_named_params<std::less<double>, boost::distance_compare_t, boost::bgl_named_params<boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params<long unsigned int*, boost::vertex_predecessor_t, boost::no_property> > > >; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’
556 | make_iterator_property_map(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^
557 | distance_map.begin(), index_map, distance_map[0])),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dijkstra_shortest_paths.hpp:570:31: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with VertexListGraph = R_adjacency_list<undirectedS, double>; Param = detail::_project2nd<double, double>; Tag = distance_combine_t; Rest = bgl_named_params<std::less<double>, distance_compare_t, bgl_named_params<adj_list_edge_property_map<undirected_tag, double, const double&, long unsigned int, const property<edge_weight_t, double, no_property>, edge_weight_t>, edge_weight_t, bgl_named_params<long unsigned int*, vertex_predecessor_t, no_property> > >; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
570 | detail::dijkstra_dispatch1(g, s, get_param(params, vertex_distance),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
571 | choose_const_pmap(get_param(params, edge_weight), g, edge_weight),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
572 | choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
573 | params);
| ~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:43:32: required from ‘void boost::detail::prim_mst_impl(const Graph&, typename boost::graph_traits<Graph>::vertex_descriptor, const boost::bgl_named_params<T, Tag, Base>&, Weight) [with Graph = R_adjacency_list<boost::undirectedS, double>; P = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>; T = boost::edge_weight_t; R = boost::bgl_named_params<long unsigned int*, boost::vertex_predecessor_t, boost::no_property>; Weight = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’
43 | dijkstra_shortest_paths(
| ~~~~~~~~~~~~~~~~~~~~~~~^
44 | G, s, params.distance_compare(compare).distance_combine(combine));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:77:26: required from ‘void boost::prim_minimum_spanning_tree(const VertexListGraph&, PredecessorMap) [with VertexListGraph = R_adjacency_list<undirectedS, double>; PredecessorMap = long unsigned int*]’
77 | detail::prim_mst_impl(g, *vertices(g).first,
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
78 | predecessor_map(p_map).weight_map(get(edge_weight, g)),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
79 | get(edge_weight, g));
| ~~~~~~~~~~~~~~~~~~~~
minST.cpp:89:35: required from here
89 | prim_minimum_spanning_tree(g, &parent[0]);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Assignable<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > > >]’
20 | ~usage_requirements() { ((Model*)0)->~Model(); }
| ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::EqualityComparable<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > > > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > > >’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > > >’
502 | BOOST_concept(InputIterator,(TT))
| ^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:540:3: required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > > >’
540 | BOOST_concept(ForwardIterator,(TT))
| ^~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > > >’
568 | BOOST_concept(BidirectionalIterator,(TT))
| ^~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > > >’
597 | BOOST_concept(RandomAccessIterator,(TT))
| ^~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3: [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map<RAIter, ID, Value, Value&> boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > >; Value = double; ID = vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dijkstra_shortest_paths.hpp:556:43: required from ‘void boost::detail::dijkstra_dispatch1(const VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list<boost::undirectedS, double>; DistanceMap = boost::param_not_found; WeightMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>; Params = boost::bgl_named_params<_project2nd<double, double>, boost::distance_combine_t, boost::bgl_named_params<std::less<double>, boost::distance_compare_t, boost::bgl_named_params<boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params<long unsigned int*, boost::vertex_predecessor_t, boost::no_property> > > >; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’
556 | make_iterator_property_map(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^
557 | distance_map.begin(), index_map, distance_map[0])),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dijkstra_shortest_paths.hpp:570:31: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with VertexListGraph = R_adjacency_list<undirectedS, double>; Param = detail::_project2nd<double, double>; Tag = distance_combine_t; Rest = bgl_named_params<std::less<double>, distance_compare_t, bgl_named_params<adj_list_edge_property_map<undirected_tag, double, const double&, long unsigned int, const property<edge_weight_t, double, no_property>, edge_weight_t>, edge_weight_t, bgl_named_params<long unsigned int*, vertex_predecessor_t, no_property> > >; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
570 | detail::dijkstra_dispatch1(g, s, get_param(params, vertex_distance),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
571 | choose_const_pmap(get_param(params, edge_weight), g, edge_weight),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
572 | choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
573 | params);
| ~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:43:32: required from ‘void boost::detail::prim_mst_impl(const Graph&, typename boost::graph_traits<Graph>::vertex_descriptor, const boost::bgl_named_params<T, Tag, Base>&, Weight) [with Graph = R_adjacency_list<boost::undirectedS, double>; P = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>; T = boost::edge_weight_t; R = boost::bgl_named_params<long unsigned int*, boost::vertex_predecessor_t, boost::no_property>; Weight = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’
43 | dijkstra_shortest_paths(
| ~~~~~~~~~~~~~~~~~~~~~~~^
44 | G, s, params.distance_compare(compare).distance_combine(combine));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:77:26: required from ‘void boost::prim_minimum_spanning_tree(const VertexListGraph&, PredecessorMap) [with VertexListGraph = R_adjacency_list<undirectedS, double>; PredecessorMap = long unsigned int*]’
77 | detail::prim_mst_impl(g, *vertices(g).first,
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
78 | predecessor_map(p_map).weight_map(get(edge_weight, g)),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
79 | get(edge_weight, g));
| ~~~~~~~~~~~~~~~~~~~~
minST.cpp:89:35: required from here
89 | prim_minimum_spanning_tree(g, &parent[0]);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::EqualityComparable<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > > >]’
20 | ~usage_requirements() { ((Model*)0)->~Model(); }
| ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::InputIterator<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > > > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:512:7: required from ‘struct boost::InputIterator<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > > >’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:540:3: required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > > >’
540 | BOOST_concept(ForwardIterator,(TT))
| ^~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > > >’
568 | BOOST_concept(BidirectionalIterator,(TT))
| ^~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > > >’
597 | BOOST_concept(RandomAccessIterator,(TT))
| ^~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > > >’
597 | BOOST_concept(RandomAccessIterator,(TT))
| ^~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map<RAIter, ID, Value, Value&> boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > >; Value = double; ID = vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dijkstra_shortest_paths.hpp:556:43: required from ‘void boost::detail::dijkstra_dispatch1(const VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list<boost::undirectedS, double>; DistanceMap = boost::param_not_found; WeightMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>; Params = boost::bgl_named_params<_project2nd<double, double>, boost::distance_combine_t, boost::bgl_named_params<std::less<double>, boost::distance_compare_t, boost::bgl_named_params<boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params<long unsigned int*, boost::vertex_predecessor_t, boost::no_property> > > >; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’
556 | make_iterator_property_map(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^
557 | distance_map.begin(), index_map, distance_map[0])),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dijkstra_shortest_paths.hpp:570:31: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with VertexListGraph = R_adjacency_list<undirectedS, double>; Param = detail::_project2nd<double, double>; Tag = distance_combine_t; Rest = bgl_named_params<std::less<double>, distance_compare_t, bgl_named_params<adj_list_edge_property_map<undirected_tag, double, const double&, long unsigned int, const property<edge_weight_t, double, no_property>, edge_weight_t>, edge_weight_t, bgl_named_params<long unsigned int*, vertex_predecessor_t, no_property> > >; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
570 | detail::dijkstra_dispatch1(g, s, get_param(params, vertex_distance),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
571 | choose_const_pmap(get_param(params, edge_weight), g, edge_weight),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
572 | choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
573 | params);
| ~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:43:32: required from ‘void boost::detail::prim_mst_impl(const Graph&, typename boost::graph_traits<Graph>::vertex_descriptor, const boost::bgl_named_params<T, Tag, Base>&, Weight) [with Graph = R_adjacency_list<boost::undirectedS, double>; P = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>; T = boost::edge_weight_t; R = boost::bgl_named_params<long unsigned int*, boost::vertex_predecessor_t, boost::no_property>; Weight = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’
43 | dijkstra_shortest_paths(
| ~~~~~~~~~~~~~~~~~~~~~~~^
44 | G, s, params.distance_compare(compare).distance_combine(combine));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:77:26: required from ‘void boost::prim_minimum_spanning_tree(const VertexListGraph&, PredecessorMap) [with VertexListGraph = R_adjacency_list<undirectedS, double>; PredecessorMap = long unsigned int*]’
77 | detail::prim_mst_impl(g, *vertices(g).first,
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
78 | predecessor_map(p_map).weight_map(get(edge_weight, g)),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
79 | get(edge_weight, g));
| ~~~~~~~~~~~~~~~~~~~~
minST.cpp:89:35: required from here
89 | prim_minimum_spanning_tree(g, &parent[0]);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::InputIterator<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > > >]’
20 | ~usage_requirements() { ((Model*)0)->~Model(); }
| ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::ForwardIterator<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > > > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:543:7: required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > > >’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > > >’
568 | BOOST_concept(BidirectionalIterator,(TT))
| ^~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > > >’
597 | BOOST_concept(RandomAccessIterator,(TT))
| ^~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > > >’
597 | BOOST_concept(RandomAccessIterator,(TT))
| ^~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > > >]’
32 | inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
| ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map<RAIter, ID, Value, Value&> boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > >; Value = double; ID = vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dijkstra_shortest_paths.hpp:556:43: required from ‘void boost::detail::dijkstra_dispatch1(const VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list<boost::undirectedS, double>; DistanceMap = boost::param_not_found; WeightMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>; Params = boost::bgl_named_params<_project2nd<double, double>, boost::distance_combine_t, boost::bgl_named_params<std::less<double>, boost::distance_compare_t, boost::bgl_named_params<boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params<long unsigned int*, boost::vertex_predecessor_t, boost::no_property> > > >; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’
556 | make_iterator_property_map(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^
557 | distance_map.begin(), index_map, distance_map[0])),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dijkstra_shortest_paths.hpp:570:31: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with VertexListGraph = R_adjacency_list<undirectedS, double>; Param = detail::_project2nd<double, double>; Tag = distance_combine_t; Rest = bgl_named_params<std::less<double>, distance_compare_t, bgl_named_params<adj_list_edge_property_map<undirected_tag, double, const double&, long unsigned int, const property<edge_weight_t, double, no_property>, edge_weight_t>, edge_weight_t, bgl_named_params<long unsigned int*, vertex_predecessor_t, no_property> > >; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
570 | detail::dijkstra_dispatch1(g, s, get_param(params, vertex_distance),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
571 | choose_const_pmap(get_param(params, edge_weight), g, edge_weight),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
572 | choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
573 | params);
| ~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:43:32: required from ‘void boost::detail::prim_mst_impl(const Graph&, typename boost::graph_traits<Graph>::vertex_descriptor, const boost::bgl_named_params<T, Tag, Base>&, Weight) [with Graph = R_adjacency_list<boost::undirectedS, double>; P = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>; T = boost::edge_weight_t; R = boost::bgl_named_params<long unsigned int*, boost::vertex_predecessor_t, boost::no_property>; Weight = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’
43 | dijkstra_shortest_paths(
| ~~~~~~~~~~~~~~~~~~~~~~~^
44 | G, s, params.distance_compare(compare).distance_combine(combine));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:77:26: required from ‘void boost::prim_minimum_spanning_tree(const VertexListGraph&, PredecessorMap) [with VertexListGraph = R_adjacency_list<undirectedS, double>; PredecessorMap = long unsigned int*]’
77 | detail::prim_mst_impl(g, *vertices(g).first,
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
78 | predecessor_map(p_map).weight_map(get(edge_weight, g)),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
79 | get(edge_weight, g));
| ~~~~~~~~~~~~~~~~~~~~
minST.cpp:89:35: required from here
89 | prim_minimum_spanning_tree(g, &parent[0]);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::ForwardIterator<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > > >]’
20 | ~usage_requirements() { ((Model*)0)->~Model(); }
| ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::BidirectionalIterator<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > > > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:571:7: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > > >’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > > >’
597 | BOOST_concept(RandomAccessIterator,(TT))
| ^~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > > >’
597 | BOOST_concept(RandomAccessIterator,(TT))
| ^~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > > >]’
32 | inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
| ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied<boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > > > >::value’
44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map<RAIter, ID, Value, Value&> boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > >; Value = double; ID = vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dijkstra_shortest_paths.hpp:556:43: required from ‘void boost::detail::dijkstra_dispatch1(const VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list<boost::undirectedS, double>; DistanceMap = boost::param_not_found; WeightMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>; Params = boost::bgl_named_params<_project2nd<double, double>, boost::distance_combine_t, boost::bgl_named_params<std::less<double>, boost::distance_compare_t, boost::bgl_named_params<boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params<long unsigned int*, boost::vertex_predecessor_t, boost::no_property> > > >; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’
556 | make_iterator_property_map(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^
557 | distance_map.begin(), index_map, distance_map[0])),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dijkstra_shortest_paths.hpp:570:31: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with VertexListGraph = R_adjacency_list<undirectedS, double>; Param = detail::_project2nd<double, double>; Tag = distance_combine_t; Rest = bgl_named_params<std::less<double>, distance_compare_t, bgl_named_params<adj_list_edge_property_map<undirected_tag, double, const double&, long unsigned int, const property<edge_weight_t, double, no_property>, edge_weight_t>, edge_weight_t, bgl_named_params<long unsigned int*, vertex_predecessor_t, no_property> > >; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
570 | detail::dijkstra_dispatch1(g, s, get_param(params, vertex_distance),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
571 | choose_const_pmap(get_param(params, edge_weight), g, edge_weight),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
572 | choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
573 | params);
| ~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:43:32: required from ‘void boost::detail::prim_mst_impl(const Graph&, typename boost::graph_traits<Graph>::vertex_descriptor, const boost::bgl_named_params<T, Tag, Base>&, Weight) [with Graph = R_adjacency_list<boost::undirectedS, double>; P = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>; T = boost::edge_weight_t; R = boost::bgl_named_params<long unsigned int*, boost::vertex_predecessor_t, boost::no_property>; Weight = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’
43 | dijkstra_shortest_paths(
| ~~~~~~~~~~~~~~~~~~~~~~~^
44 | G, s, params.distance_compare(compare).distance_combine(combine));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:77:26: required from ‘void boost::prim_minimum_spanning_tree(const VertexListGraph&, PredecessorMap) [with VertexListGraph = R_adjacency_list<undirectedS, double>; PredecessorMap = long unsigned int*]’
77 | detail::prim_mst_impl(g, *vertices(g).first,
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
78 | predecessor_map(p_map).weight_map(get(edge_weight, g)),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
79 | get(edge_weight, g));
| ~~~~~~~~~~~~~~~~~~~~
minST.cpp:89:35: required from here
89 | prim_minimum_spanning_tree(g, &parent[0]);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::BidirectionalIterator<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > > >]’
20 | ~usage_requirements() { ((Model*)0)->~Model(); }
| ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Comparable<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > > > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:253:5: required from ‘struct boost::Comparable<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > > >’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > > >’
597 | BOOST_concept(RandomAccessIterator,(TT))
| ^~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > > >’
597 | BOOST_concept(RandomAccessIterator,(TT))
| ^~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > > >]’
32 | inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
| ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied<boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > > > >::value’
44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map<RAIter, ID, Value, Value&> boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > >; Value = double; ID = vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dijkstra_shortest_paths.hpp:556:43: required from ‘void boost::detail::dijkstra_dispatch1(const VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list<boost::undirectedS, double>; DistanceMap = boost::param_not_found; WeightMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>; Params = boost::bgl_named_params<_project2nd<double, double>, boost::distance_combine_t, boost::bgl_named_params<std::less<double>, boost::distance_compare_t, boost::bgl_named_params<boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params<long unsigned int*, boost::vertex_predecessor_t, boost::no_property> > > >; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’
556 | make_iterator_property_map(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^
557 | distance_map.begin(), index_map, distance_map[0])),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dijkstra_shortest_paths.hpp:570:31: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with VertexListGraph = R_adjacency_list<undirectedS, double>; Param = detail::_project2nd<double, double>; Tag = distance_combine_t; Rest = bgl_named_params<std::less<double>, distance_compare_t, bgl_named_params<adj_list_edge_property_map<undirected_tag, double, const double&, long unsigned int, const property<edge_weight_t, double, no_property>, edge_weight_t>, edge_weight_t, bgl_named_params<long unsigned int*, vertex_predecessor_t, no_property> > >; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
570 | detail::dijkstra_dispatch1(g, s, get_param(params, vertex_distance),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
571 | choose_const_pmap(get_param(params, edge_weight), g, edge_weight),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
572 | choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
573 | params);
| ~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:43:32: required from ‘void boost::detail::prim_mst_impl(const Graph&, typename boost::graph_traits<Graph>::vertex_descriptor, const boost::bgl_named_params<T, Tag, Base>&, Weight) [with Graph = R_adjacency_list<boost::undirectedS, double>; P = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>; T = boost::edge_weight_t; R = boost::bgl_named_params<long unsigned int*, boost::vertex_predecessor_t, boost::no_property>; Weight = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’
43 | dijkstra_shortest_paths(
| ~~~~~~~~~~~~~~~~~~~~~~~^
44 | G, s, params.distance_compare(compare).distance_combine(combine));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:77:26: required from ‘void boost::prim_minimum_spanning_tree(const VertexListGraph&, PredecessorMap) [with VertexListGraph = R_adjacency_list<undirectedS, double>; PredecessorMap = long unsigned int*]’
77 | detail::prim_mst_impl(g, *vertices(g).first,
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
78 | predecessor_map(p_map).weight_map(get(edge_weight, g)),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
79 | get(edge_weight, g));
| ~~~~~~~~~~~~~~~~~~~~
minST.cpp:89:35: required from here
89 | prim_minimum_spanning_tree(g, &parent[0]);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Comparable<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > > >]’
20 | ~usage_requirements() { ((Model*)0)->~Model(); }
| ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::RandomAccessIterator<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > > > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:601:7: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > > >’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > > >’
597 | BOOST_concept(RandomAccessIterator,(TT))
| ^~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > > >]’
32 | inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
| ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied<boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > > > >::value’
44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map<RAIter, ID, Value, Value&> boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > >; Value = double; ID = vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dijkstra_shortest_paths.hpp:556:43: required from ‘void boost::detail::dijkstra_dispatch1(const VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list<boost::undirectedS, double>; DistanceMap = boost::param_not_found; WeightMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>; Params = boost::bgl_named_params<_project2nd<double, double>, boost::distance_combine_t, boost::bgl_named_params<std::less<double>, boost::distance_compare_t, boost::bgl_named_params<boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params<long unsigned int*, boost::vertex_predecessor_t, boost::no_property> > > >; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’
556 | make_iterator_property_map(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^
557 | distance_map.begin(), index_map, distance_map[0])),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dijkstra_shortest_paths.hpp:570:31: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with VertexListGraph = R_adjacency_list<undirectedS, double>; Param = detail::_project2nd<double, double>; Tag = distance_combine_t; Rest = bgl_named_params<std::less<double>, distance_compare_t, bgl_named_params<adj_list_edge_property_map<undirected_tag, double, const double&, long unsigned int, const property<edge_weight_t, double, no_property>, edge_weight_t>, edge_weight_t, bgl_named_params<long unsigned int*, vertex_predecessor_t, no_property> > >; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
570 | detail::dijkstra_dispatch1(g, s, get_param(params, vertex_distance),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
571 | choose_const_pmap(get_param(params, edge_weight), g, edge_weight),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
572 | choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
573 | params);
| ~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:43:32: required from ‘void boost::detail::prim_mst_impl(const Graph&, typename boost::graph_traits<Graph>::vertex_descriptor, const boost::bgl_named_params<T, Tag, Base>&, Weight) [with Graph = R_adjacency_list<boost::undirectedS, double>; P = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>; T = boost::edge_weight_t; R = boost::bgl_named_params<long unsigned int*, boost::vertex_predecessor_t, boost::no_property>; Weight = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’
43 | dijkstra_shortest_paths(
| ~~~~~~~~~~~~~~~~~~~~~~~^
44 | G, s, params.distance_compare(compare).distance_combine(combine));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:77:26: required from ‘void boost::prim_minimum_spanning_tree(const VertexListGraph&, PredecessorMap) [with VertexListGraph = R_adjacency_list<undirectedS, double>; PredecessorMap = long unsigned int*]’
77 | detail::prim_mst_impl(g, *vertices(g).first,
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
78 | predecessor_map(p_map).weight_map(get(edge_weight, g)),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
79 | get(edge_weight, g));
| ~~~~~~~~~~~~~~~~~~~~
minST.cpp:89:35: required from here
89 | prim_minimum_spanning_tree(g, &parent[0]);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::RandomAccessIterator<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > > >]’
20 | ~usage_requirements() { ((Model*)0)->~Model(); }
| ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map<RAIter, ID, Value, Value&> boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > >; Value = double; ID = vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dijkstra_shortest_paths.hpp:556:43: required from ‘void boost::detail::dijkstra_dispatch1(const VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list<boost::undirectedS, double>; DistanceMap = boost::param_not_found; WeightMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>; Params = boost::bgl_named_params<_project2nd<double, double>, boost::distance_combine_t, boost::bgl_named_params<std::less<double>, boost::distance_compare_t, boost::bgl_named_params<boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params<long unsigned int*, boost::vertex_predecessor_t, boost::no_property> > > >; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’
556 | make_iterator_property_map(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^
557 | distance_map.begin(), index_map, distance_map[0])),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dijkstra_shortest_paths.hpp:570:31: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with VertexListGraph = R_adjacency_list<undirectedS, double>; Param = detail::_project2nd<double, double>; Tag = distance_combine_t; Rest = bgl_named_params<std::less<double>, distance_compare_t, bgl_named_params<adj_list_edge_property_map<undirected_tag, double, const double&, long unsigned int, const property<edge_weight_t, double, no_property>, edge_weight_t>, edge_weight_t, bgl_named_params<long unsigned int*, vertex_predecessor_t, no_property> > >; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
570 | detail::dijkstra_dispatch1(g, s, get_param(params, vertex_distance),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
571 | choose_const_pmap(get_param(params, edge_weight), g, edge_weight),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
572 | choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
573 | params);
| ~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:43:32: required from ‘void boost::detail::prim_mst_impl(const Graph&, typename boost::graph_traits<Graph>::vertex_descriptor, const boost::bgl_named_params<T, Tag, Base>&, Weight) [with Graph = R_adjacency_list<boost::undirectedS, double>; P = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>; T = boost::edge_weight_t; R = boost::bgl_named_params<long unsigned int*, boost::vertex_predecessor_t, boost::no_property>; Weight = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’
43 | dijkstra_shortest_paths(
| ~~~~~~~~~~~~~~~~~~~~~~~^
44 | G, s, params.distance_compare(compare).distance_combine(combine));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:77:26: required from ‘void boost::prim_minimum_spanning_tree(const VertexListGraph&, PredecessorMap) [with VertexListGraph = R_adjacency_list<undirectedS, double>; PredecessorMap = long unsigned int*]’
77 | detail::prim_mst_impl(g, *vertices(g).first,
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
78 | predecessor_map(p_map).weight_map(get(edge_weight, g)),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
79 | get(edge_weight, g));
| ~~~~~~~~~~~~~~~~~~~~
minST.cpp:89:35: required from here
89 | prim_minimum_spanning_tree(g, &parent[0]);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:17: note: in a call to non-static member function ‘boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > > >::~RandomAccessIteratorConcept()’
597 | BOOST_concept(RandomAccessIterator,(TT))
| ^~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/preprocessor/cat.hpp:29:34: note: in definition of macro ‘BOOST_PP_CAT_I’
29 | # define BOOST_PP_CAT_I(a, b) a ## b
| ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/concept_def.hpp:23:12: note: in expansion of macro ‘BOOST_PP_CAT’
23 | struct BOOST_PP_CAT(name,Concept) \
| ^~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3: note: in expansion of macro ‘BOOST_concept’
597 | BOOST_concept(RandomAccessIterator,(TT))
| ^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Convertible<std::random_access_iterator_tag, std::input_iterator_tag>]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/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(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/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> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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);
| ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/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) );
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/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;
| ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 10 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied<boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > > >::value’
44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied<boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > > >’
45 | typedef boost::integral_constant<bool, value> type;
| ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_<void (*)(boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > >)>’
72 | struct requirement_<void(*)(Model)>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map<RAIter, ID, Value, Value&> boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >; Value = long unsigned int; ID = vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:113:35: required from ‘void boost::kruskal_minimum_spanning_tree(const Graph&, OutputIterator) [with Graph = R_adjacency_list<directedS, double>; OutputIterator = std::back_insert_iterator<std::vector<detail::edge_desc_impl<directed_tag, long unsigned int> > >]’
113 | make_iterator_property_map(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^
114 | rank_map.begin(), get(vertex_index, g), rank_map[0]),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
minST.cpp:20:38: required from here
20 | kruskal_minimum_spanning_tree(g, std::back_inserter(spanning_tree));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
20 | ~usage_requirements() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible<X, Y>::~Convertible() [with X = std::random_access_iterator_tag; Y = std::input_iterator_tag]’
37 | ~model()
| ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
208 | BOOST_CONCEPT_USAGE(Convertible) {
| ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Convertible<std::random_access_iterator_tag, std::forward_iterator_tag>]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/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(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/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> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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);
| ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/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) );
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/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;
| ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 9 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied<boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > > >::value’
44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied<boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > > >’
45 | typedef boost::integral_constant<bool, value> type;
| ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_<void (*)(boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > >)>’
72 | struct requirement_<void(*)(Model)>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map<RAIter, ID, Value, Value&> boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >; Value = long unsigned int; ID = vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:113:35: required from ‘void boost::kruskal_minimum_spanning_tree(const Graph&, OutputIterator) [with Graph = R_adjacency_list<directedS, double>; OutputIterator = std::back_insert_iterator<std::vector<detail::edge_desc_impl<directed_tag, long unsigned int> > >]’
113 | make_iterator_property_map(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^
114 | rank_map.begin(), get(vertex_index, g), rank_map[0]),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
minST.cpp:20:38: required from here
20 | kruskal_minimum_spanning_tree(g, std::back_inserter(spanning_tree));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
20 | ~usage_requirements() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible<X, Y>::~Convertible() [with X = std::random_access_iterator_tag; Y = std::forward_iterator_tag]’
37 | ~model()
| ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
208 | BOOST_CONCEPT_USAGE(Convertible) {
| ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Convertible<std::random_access_iterator_tag, std::bidirectional_iterator_tag>]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/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(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/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> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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);
| ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/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) );
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/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;
| ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 8 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied<boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > > >::value’
44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied<boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > > >’
45 | typedef boost::integral_constant<bool, value> type;
| ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_<void (*)(boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> > >)>’
72 | struct requirement_<void(*)(Model)>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map<RAIter, ID, Value, Value&> boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >; Value = long unsigned int; ID = vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:113:35: required from ‘void boost::kruskal_minimum_spanning_tree(const Graph&, OutputIterator) [with Graph = R_adjacency_list<directedS, double>; OutputIterator = std::back_insert_iterator<std::vector<detail::edge_desc_impl<directed_tag, long unsigned int> > >]’
113 | make_iterator_property_map(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^
114 | rank_map.begin(), get(vertex_index, g), rank_map[0]),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
minST.cpp:20:38: required from here
20 | kruskal_minimum_spanning_tree(g, std::back_inserter(spanning_tree));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
20 | ~usage_requirements() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible<X, Y>::~Convertible() [with X = std::random_access_iterator_tag; Y = std::bidirectional_iterator_tag]’
37 | ~model()
| ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
208 | BOOST_CONCEPT_USAGE(Convertible) {
| ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::DefaultConstructible<long unsigned int>]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::DefaultConstructible<long unsigned int> >]’
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:137:5: required from ‘struct boost::DefaultConstructible<long unsigned int>’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::DefaultConstructible<long unsigned int>]’
32 | inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
| ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied<boost::DefaultConstructible<long unsigned int> >::value’
44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied<boost::DefaultConstructible<long unsigned int> >’
45 | typedef boost::integral_constant<bool, value> type;
| ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 8 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied<boost::concepts::VertexListGraphConcept<R_adjacency_list<boost::directedS, double> > >::value’
44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied<boost::concepts::VertexListGraphConcept<R_adjacency_list<boost::directedS, double> > >’
45 | typedef boost::integral_constant<bool, value> type;
| ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_<void (*)(boost::concepts::VertexListGraphConcept<R_adjacency_list<boost::directedS, double> >)>’
72 | struct requirement_<void(*)(Model)>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:55:9: required from ‘void boost::detail::kruskal_mst_impl(const Graph&, OutputIterator, Rank, Parent, Weight) [with Graph = R_adjacency_list<boost::directedS, double>; OutputIterator = std::back_insert_iterator<std::vector<edge_desc_impl<boost::directed_tag, long unsigned int> > >; Rank = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; Parent = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; Weight = boost::adj_list_edge_property_map<boost::directed_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:112:29: required from ‘void boost::kruskal_minimum_spanning_tree(const Graph&, OutputIterator) [with Graph = R_adjacency_list<directedS, double>; OutputIterator = std::back_insert_iterator<std::vector<detail::edge_desc_impl<directed_tag, long unsigned int> > >]’
112 | detail::kruskal_mst_impl(g, spanning_tree_edges,
| ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
113 | make_iterator_property_map(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~
114 | rank_map.begin(), get(vertex_index, g), rank_map[0]),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
115 | make_iterator_property_map(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~
116 | pred_map.begin(), get(vertex_index, g), pred_map[0]),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
117 | get(edge_weight, g));
| ~~~~~~~~~~~~~~~~~~~~
minST.cpp:20:38: required from here
20 | kruskal_minimum_spanning_tree(g, std::back_inserter(spanning_tree));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
20 | ~usage_requirements() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::DefaultConstructible<TT>::~DefaultConstructible() [with TT = long unsigned int]’
37 | ~model()
| ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:137:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
137 | BOOST_CONCEPT_USAGE(DefaultConstructible) {
| ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::EqualityComparable<long unsigned int>]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::EqualityComparable<long unsigned int> >]’
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable<long unsigned int>’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::EqualityComparable<long unsigned int>]’
32 | inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
| ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied<boost::EqualityComparable<long unsigned int> >::value’
44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied<boost::EqualityComparable<long unsigned int> >’
45 | typedef boost::integral_constant<bool, value> type;
| ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 8 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied<boost::concepts::VertexListGraphConcept<R_adjacency_list<boost::directedS, double> > >::value’
44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied<boost::concepts::VertexListGraphConcept<R_adjacency_list<boost::directedS, double> > >’
45 | typedef boost::integral_constant<bool, value> type;
| ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_<void (*)(boost::concepts::VertexListGraphConcept<R_adjacency_list<boost::directedS, double> >)>’
72 | struct requirement_<void(*)(Model)>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:55:9: required from ‘void boost::detail::kruskal_mst_impl(const Graph&, OutputIterator, Rank, Parent, Weight) [with Graph = R_adjacency_list<boost::directedS, double>; OutputIterator = std::back_insert_iterator<std::vector<edge_desc_impl<boost::directed_tag, long unsigned int> > >; Rank = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; Parent = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; Weight = boost::adj_list_edge_property_map<boost::directed_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:112:29: required from ‘void boost::kruskal_minimum_spanning_tree(const Graph&, OutputIterator) [with Graph = R_adjacency_list<directedS, double>; OutputIterator = std::back_insert_iterator<std::vector<detail::edge_desc_impl<directed_tag, long unsigned int> > >]’
112 | detail::kruskal_mst_impl(g, spanning_tree_edges,
| ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
113 | make_iterator_property_map(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~
114 | rank_map.begin(), get(vertex_index, g), rank_map[0]),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
115 | make_iterator_property_map(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~
116 | pred_map.begin(), get(vertex_index, g), pred_map[0]),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
117 | get(edge_weight, g));
| ~~~~~~~~~~~~~~~~~~~~
minST.cpp:20:38: required from here
20 | kruskal_minimum_spanning_tree(g, std::back_inserter(spanning_tree));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
20 | ~usage_requirements() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::EqualityComparable<TT>::~EqualityComparable() [with TT = long unsigned int]’
37 | ~model()
| ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:233:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
233 | BOOST_CONCEPT_USAGE(EqualityComparable) {
| ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Assignable<long unsigned int>]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Assignable<long unsigned int> >]’
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:145:5: required from ‘struct boost::Assignable<long unsigned int>’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::Assignable<long unsigned int>]’
32 | inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
| ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied<boost::Assignable<long unsigned int> >::value’
44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied<boost::Assignable<long unsigned int> >’
45 | typedef boost::integral_constant<bool, value> type;
| ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 8 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied<boost::concepts::VertexListGraphConcept<R_adjacency_list<boost::directedS, double> > >::value’
44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied<boost::concepts::VertexListGraphConcept<R_adjacency_list<boost::directedS, double> > >’
45 | typedef boost::integral_constant<bool, value> type;
| ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_<void (*)(boost::concepts::VertexListGraphConcept<R_adjacency_list<boost::directedS, double> >)>’
72 | struct requirement_<void(*)(Model)>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:55:9: required from ‘void boost::detail::kruskal_mst_impl(const Graph&, OutputIterator, Rank, Parent, Weight) [with Graph = R_adjacency_list<boost::directedS, double>; OutputIterator = std::back_insert_iterator<std::vector<edge_desc_impl<boost::directed_tag, long unsigned int> > >; Rank = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; Parent = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; Weight = boost::adj_list_edge_property_map<boost::directed_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:112:29: required from ‘void boost::kruskal_minimum_spanning_tree(const Graph&, OutputIterator) [with Graph = R_adjacency_list<directedS, double>; OutputIterator = std::back_insert_iterator<std::vector<detail::edge_desc_impl<directed_tag, long unsigned int> > >]’
112 | detail::kruskal_mst_impl(g, spanning_tree_edges,
| ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
113 | make_iterator_property_map(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~
114 | rank_map.begin(), get(vertex_index, g), rank_map[0]),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
115 | make_iterator_property_map(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~
116 | pred_map.begin(), get(vertex_index, g), pred_map[0]),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
117 | get(edge_weight, g));
| ~~~~~~~~~~~~~~~~~~~~
minST.cpp:20:38: required from here
20 | kruskal_minimum_spanning_tree(g, std::back_inserter(spanning_tree));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
20 | ~usage_requirements() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Assignable<TT>::~Assignable() [with TT = long unsigned int]’
37 | ~model()
| ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:145:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
145 | BOOST_CONCEPT_USAGE(Assignable) {
| ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Assignable<boost::range_detail::integer_iterator<long unsigned int> > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:145:5: required from ‘struct boost::Assignable<boost::range_detail::integer_iterator<long unsigned int> >’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator<boost::range_detail::integer_iterator<long unsigned int> >’
502 | BOOST_concept(InputIterator,(TT))
| ^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::InputIterator<boost::range_detail::integer_iterator<long unsigned int> >]’
32 | inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
| ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied<boost::InputIterator<boost::range_detail::integer_iterator<long unsigned int> > >::value’
44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied<boost::InputIterator<boost::range_detail::integer_iterator<long unsigned int> > >’
45 | typedef boost::integral_constant<bool, value> type;
| ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::MultiPassInputIterator<boost::range_detail::integer_iterator<long unsigned int> >]’
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:184:9: required from ‘boost::concepts::VertexListGraph<G>::~VertexListGraph() [with G = R_adjacency_list<boost::directedS, double>]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/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<R_adjacency_list<boost::directedS, double> >]’
176 | BOOST_concept(VertexListGraph, (G)) : Graph< G >
| ^~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:55:9: required from ‘void boost::detail::kruskal_mst_impl(const Graph&, OutputIterator, Rank, Parent, Weight) [with Graph = R_adjacency_list<boost::directedS, double>; OutputIterator = std::back_insert_iterator<std::vector<edge_desc_impl<boost::directed_tag, long unsigned int> > >; Rank = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; Parent = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; Weight = boost::adj_list_edge_property_map<boost::directed_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:112:29: required from ‘void boost::kruskal_minimum_spanning_tree(const Graph&, OutputIterator) [with Graph = R_adjacency_list<directedS, double>; OutputIterator = std::back_insert_iterator<std::vector<detail::edge_desc_impl<directed_tag, long unsigned int> > >]’
112 | detail::kruskal_mst_impl(g, spanning_tree_edges,
| ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
113 | make_iterator_property_map(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~
114 | rank_map.begin(), get(vertex_index, g), rank_map[0]),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
115 | make_iterator_property_map(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~
116 | pred_map.begin(), get(vertex_index, g), pred_map[0]),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
117 | get(edge_weight, g));
| ~~~~~~~~~~~~~~~~~~~~
minST.cpp:20:38: required from here
20 | kruskal_minimum_spanning_tree(g, std::back_inserter(spanning_tree));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Assignable<boost::range_detail::integer_iterator<long unsigned int> >]’
20 | ~usage_requirements() { ((Model*)0)->~Model(); }
| ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::EqualityComparable<boost::range_detail::integer_iterator<long unsigned int> > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable<boost::range_detail::integer_iterator<long unsigned int> >’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator<boost::range_detail::integer_iterator<long unsigned int> >’
502 | BOOST_concept(InputIterator,(TT))
| ^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::InputIterator<boost::range_detail::integer_iterator<long unsigned int> >]’
32 | inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
| ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied<boost::InputIterator<boost::range_detail::integer_iterator<long unsigned int> > >::value’
44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied<boost::InputIterator<boost::range_detail::integer_iterator<long unsigned int> > >’
45 | typedef boost::integral_constant<bool, value> type;
| ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::MultiPassInputIterator<boost::range_detail::integer_iterator<long unsigned int> >]’
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:184:9: required from ‘boost::concepts::VertexListGraph<G>::~VertexListGraph() [with G = R_adjacency_list<boost::directedS, double>]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/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<R_adjacency_list<boost::directedS, double> >]’
176 | BOOST_concept(VertexListGraph, (G)) : Graph< G >
| ^~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:55:9: required from ‘void boost::detail::kruskal_mst_impl(const Graph&, OutputIterator, Rank, Parent, Weight) [with Graph = R_adjacency_list<boost::directedS, double>; OutputIterator = std::back_insert_iterator<std::vector<edge_desc_impl<boost::directed_tag, long unsigned int> > >; Rank = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; Parent = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; Weight = boost::adj_list_edge_property_map<boost::directed_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:112:29: required from ‘void boost::kruskal_minimum_spanning_tree(const Graph&, OutputIterator) [with Graph = R_adjacency_list<directedS, double>; OutputIterator = std::back_insert_iterator<std::vector<detail::edge_desc_impl<directed_tag, long unsigned int> > >]’
112 | detail::kruskal_mst_impl(g, spanning_tree_edges,
| ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
113 | make_iterator_property_map(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~
114 | rank_map.begin(), get(vertex_index, g), rank_map[0]),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
115 | make_iterator_property_map(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~
116 | pred_map.begin(), get(vertex_index, g), pred_map[0]),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
117 | get(edge_weight, g));
| ~~~~~~~~~~~~~~~~~~~~
minST.cpp:20:38: required from here
20 | kruskal_minimum_spanning_tree(g, std::back_inserter(spanning_tree));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::EqualityComparable<boost::range_detail::integer_iterator<long unsigned int> >]’
20 | ~usage_requirements() { ((Model*)0)->~Model(); }
| ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::InputIterator<boost::range_detail::integer_iterator<long unsigned int> > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:512:7: required from ‘struct boost::InputIterator<boost::range_detail::integer_iterator<long unsigned int> >’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::InputIterator<boost::range_detail::integer_iterator<long unsigned int> >]’
32 | inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
| ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied<boost::InputIterator<boost::range_detail::integer_iterator<long unsigned int> > >::value’
44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied<boost::InputIterator<boost::range_detail::integer_iterator<long unsigned int> > >’
45 | typedef boost::integral_constant<bool, value> type;
| ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::MultiPassInputIterator<boost::range_detail::integer_iterator<long unsigned int> >]’
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:184:9: required from ‘boost::concepts::VertexListGraph<G>::~VertexListGraph() [with G = R_adjacency_list<boost::directedS, double>]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/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<R_adjacency_list<boost::directedS, double> >]’
176 | BOOST_concept(VertexListGraph, (G)) : Graph< G >
| ^~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:55:9: required from ‘void boost::detail::kruskal_mst_impl(const Graph&, OutputIterator, Rank, Parent, Weight) [with Graph = R_adjacency_list<boost::directedS, double>; OutputIterator = std::back_insert_iterator<std::vector<edge_desc_impl<boost::directed_tag, long unsigned int> > >; Rank = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; Parent = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; Weight = boost::adj_list_edge_property_map<boost::directed_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:112:29: required from ‘void boost::kruskal_minimum_spanning_tree(const Graph&, OutputIterator) [with Graph = R_adjacency_list<directedS, double>; OutputIterator = std::back_insert_iterator<std::vector<detail::edge_desc_impl<directed_tag, long unsigned int> > >]’
112 | detail::kruskal_mst_impl(g, spanning_tree_edges,
| ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
113 | make_iterator_property_map(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~
114 | rank_map.begin(), get(vertex_index, g), rank_map[0]),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
115 | make_iterator_property_map(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~
116 | pred_map.begin(), get(vertex_index, g), pred_map[0]),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
117 | get(edge_weight, g));
| ~~~~~~~~~~~~~~~~~~~~
minST.cpp:20:38: required from here
20 | kruskal_minimum_spanning_tree(g, std::back_inserter(spanning_tree));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::InputIterator<boost::range_detail::integer_iterator<long unsigned int> >]’
20 | ~usage_requirements() { ((Model*)0)->~Model(); }
| ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::InputIterator<boost::range_detail::integer_iterator<long unsigned int> >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:53:35: required from ‘boost::concepts::MultiPassInputIterator<T>::~MultiPassInputIterator() [with T = boost::range_detail::integer_iterator<long unsigned int>]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::MultiPassInputIterator<boost::range_detail::integer_iterator<long unsigned int> >]’
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:184:9: required from ‘boost::concepts::VertexListGraph<G>::~VertexListGraph() [with G = R_adjacency_list<boost::directedS, double>]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/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<R_adjacency_list<boost::directedS, double> >]’
176 | BOOST_concept(VertexListGraph, (G)) : Graph< G >
| ^~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:55:9: required from ‘void boost::detail::kruskal_mst_impl(const Graph&, OutputIterator, Rank, Parent, Weight) [with Graph = R_adjacency_list<boost::directedS, double>; OutputIterator = std::back_insert_iterator<std::vector<edge_desc_impl<boost::directed_tag, long unsigned int> > >; Rank = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; Parent = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; Weight = boost::adj_list_edge_property_map<boost::directed_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:112:29: required from ‘void boost::kruskal_minimum_spanning_tree(const Graph&, OutputIterator) [with Graph = R_adjacency_list<directedS, double>; OutputIterator = std::back_insert_iterator<std::vector<detail::edge_desc_impl<directed_tag, long unsigned int> > >]’
112 | detail::kruskal_mst_impl(g, spanning_tree_edges,
| ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
113 | make_iterator_property_map(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~
114 | rank_map.begin(), get(vertex_index, g), rank_map[0]),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
115 | make_iterator_property_map(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~
116 | pred_map.begin(), get(vertex_index, g), pred_map[0]),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
117 | get(edge_weight, g));
| ~~~~~~~~~~~~~~~~~~~~
minST.cpp:20:38: required from here
20 | kruskal_minimum_spanning_tree(g, std::back_inserter(spanning_tree));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::InputIterator<TT>::~InputIterator() [with TT = boost::range_detail::integer_iterator<long unsigned int>]’
37 | ~model()
| ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:512:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
512 | BOOST_CONCEPT_USAGE(InputIterator)
| ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/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<boost::range_detail::integer_iterator<long unsigned int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int>, boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_color_t, boost::default_color_type>, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::no_property, boost::listS> > > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:145:5: required from ‘struct boost::Assignable<boost::detail::adj_list_edge_iterator<boost::range_detail::integer_iterator<long unsigned int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int>, boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_color_t, boost::default_color_type>, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::no_property, boost::listS> > >’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator<boost::detail::adj_list_edge_iterator<boost::range_detail::integer_iterator<long unsigned int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int>, boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_color_t, boost::default_color_type>, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::no_property, boost::listS> > >’
502 | BOOST_concept(InputIterator,(TT))
| ^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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<boost::range_detail::integer_iterator<long unsigned int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int>, boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_color_t, boost::default_color_type>, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::no_property, boost::listS> > >]’
32 | inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
| ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/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<boost::range_detail::integer_iterator<long unsigned int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int>, boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_color_t, boost::default_color_type>, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::no_property, boost::listS> > > >::value’
44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/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<boost::range_detail::integer_iterator<long unsigned int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int>, boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_color_t, boost::default_color_type>, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::no_property, boost::listS> > > >’
45 | typedef boost::integral_constant<bool, value> type;
| ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/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<boost::range_detail::integer_iterator<long unsigned int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int>, boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_color_t, boost::default_color_type>, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::no_property, boost::listS> > >]’
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:235:9: required from ‘boost::concepts::EdgeListGraph<G>::~EdgeListGraph() [with G = R_adjacency_list<boost::directedS, double>]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/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<R_adjacency_list<boost::directedS, double> >]’
226 | BOOST_concept(EdgeListGraph, (G)) : Graph< G >
| ^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:56:9: required from ‘void boost::detail::kruskal_mst_impl(const Graph&, OutputIterator, Rank, Parent, Weight) [with Graph = R_adjacency_list<boost::directedS, double>; OutputIterator = std::back_insert_iterator<std::vector<edge_desc_impl<boost::directed_tag, long unsigned int> > >; Rank = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; Parent = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; Weight = boost::adj_list_edge_property_map<boost::directed_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:112:29: required from ‘void boost::kruskal_minimum_spanning_tree(const Graph&, OutputIterator) [with Graph = R_adjacency_list<directedS, double>; OutputIterator = std::back_insert_iterator<std::vector<detail::edge_desc_impl<directed_tag, long unsigned int> > >]’
112 | detail::kruskal_mst_impl(g, spanning_tree_edges,
| ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
113 | make_iterator_property_map(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~
114 | rank_map.begin(), get(vertex_index, g), rank_map[0]),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
115 | make_iterator_property_map(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~
116 | pred_map.begin(), get(vertex_index, g), pred_map[0]),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
117 | get(edge_weight, g));
| ~~~~~~~~~~~~~~~~~~~~
minST.cpp:20:38: required from here
20 | kruskal_minimum_spanning_tree(g, std::back_inserter(spanning_tree));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/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<boost::range_detail::integer_iterator<long unsigned int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int>, boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_color_t, boost::default_color_type>, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::no_property, boost::listS> > >]’
20 | ~usage_requirements() { ((Model*)0)->~Model(); }
| ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/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<boost::range_detail::integer_iterator<long unsigned int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int>, boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_color_t, boost::default_color_type>, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::no_property, boost::listS> > > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable<boost::detail::adj_list_edge_iterator<boost::range_detail::integer_iterator<long unsigned int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int>, boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_color_t, boost::default_color_type>, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::no_property, boost::listS> > >’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator<boost::detail::adj_list_edge_iterator<boost::range_detail::integer_iterator<long unsigned int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int>, boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_color_t, boost::default_color_type>, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::no_property, boost::listS> > >’
502 | BOOST_concept(InputIterator,(TT))
| ^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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<boost::range_detail::integer_iterator<long unsigned int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int>, boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_color_t, boost::default_color_type>, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::no_property, boost::listS> > >]’
32 | inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
| ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/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<boost::range_detail::integer_iterator<long unsigned int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int>, boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_color_t, boost::default_color_type>, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::no_property, boost::listS> > > >::value’
44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/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<boost::range_detail::integer_iterator<long unsigned int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int>, boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_color_t, boost::default_color_type>, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::no_property, boost::listS> > > >’
45 | typedef boost::integral_constant<bool, value> type;
| ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/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<boost::range_detail::integer_iterator<long unsigned int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int>, boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_color_t, boost::default_color_type>, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::no_property, boost::listS> > >]’
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:235:9: required from ‘boost::concepts::EdgeListGraph<G>::~EdgeListGraph() [with G = R_adjacency_list<boost::directedS, double>]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/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<R_adjacency_list<boost::directedS, double> >]’
226 | BOOST_concept(EdgeListGraph, (G)) : Graph< G >
| ^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:56:9: required from ‘void boost::detail::kruskal_mst_impl(const Graph&, OutputIterator, Rank, Parent, Weight) [with Graph = R_adjacency_list<boost::directedS, double>; OutputIterator = std::back_insert_iterator<std::vector<edge_desc_impl<boost::directed_tag, long unsigned int> > >; Rank = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; Parent = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; Weight = boost::adj_list_edge_property_map<boost::directed_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:112:29: required from ‘void boost::kruskal_minimum_spanning_tree(const Graph&, OutputIterator) [with Graph = R_adjacency_list<directedS, double>; OutputIterator = std::back_insert_iterator<std::vector<detail::edge_desc_impl<directed_tag, long unsigned int> > >]’
112 | detail::kruskal_mst_impl(g, spanning_tree_edges,
| ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
113 | make_iterator_property_map(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~
114 | rank_map.begin(), get(vertex_index, g), rank_map[0]),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
115 | make_iterator_property_map(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~
116 | pred_map.begin(), get(vertex_index, g), pred_map[0]),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
117 | get(edge_weight, g));
| ~~~~~~~~~~~~~~~~~~~~
minST.cpp:20:38: required from here
20 | kruskal_minimum_spanning_tree(g, std::back_inserter(spanning_tree));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/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<boost::range_detail::integer_iterator<long unsigned int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int>, boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_color_t, boost::default_color_type>, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::no_property, boost::listS> > >]’
20 | ~usage_requirements() { ((Model*)0)->~Model(); }
| ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/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<boost::range_detail::integer_iterator<long unsigned int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int>, boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_color_t, boost::default_color_type>, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::no_property, boost::listS> > > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:512:7: required from ‘struct boost::InputIterator<boost::detail::adj_list_edge_iterator<boost::range_detail::integer_iterator<long unsigned int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int>, boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_color_t, boost::default_color_type>, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::no_property, boost::listS> > >’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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<boost::range_detail::integer_iterator<long unsigned int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int>, boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_color_t, boost::default_color_type>, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::no_property, boost::listS> > >]’
32 | inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
| ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/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<boost::range_detail::integer_iterator<long unsigned int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int>, boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_color_t, boost::default_color_type>, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::no_property, boost::listS> > > >::value’
44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/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<boost::range_detail::integer_iterator<long unsigned int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int>, boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_color_t, boost::default_color_type>, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::no_property, boost::listS> > > >’
45 | typedef boost::integral_constant<bool, value> type;
| ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/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<boost::range_detail::integer_iterator<long unsigned int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int>, boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_color_t, boost::default_color_type>, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::no_property, boost::listS> > >]’
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:235:9: required from ‘boost::concepts::EdgeListGraph<G>::~EdgeListGraph() [with G = R_adjacency_list<boost::directedS, double>]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/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<R_adjacency_list<boost::directedS, double> >]’
226 | BOOST_concept(EdgeListGraph, (G)) : Graph< G >
| ^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:56:9: required from ‘void boost::detail::kruskal_mst_impl(const Graph&, OutputIterator, Rank, Parent, Weight) [with Graph = R_adjacency_list<boost::directedS, double>; OutputIterator = std::back_insert_iterator<std::vector<edge_desc_impl<boost::directed_tag, long unsigned int> > >; Rank = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; Parent = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; Weight = boost::adj_list_edge_property_map<boost::directed_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:112:29: required from ‘void boost::kruskal_minimum_spanning_tree(const Graph&, OutputIterator) [with Graph = R_adjacency_list<directedS, double>; OutputIterator = std::back_insert_iterator<std::vector<detail::edge_desc_impl<directed_tag, long unsigned int> > >]’
112 | detail::kruskal_mst_impl(g, spanning_tree_edges,
| ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
113 | make_iterator_property_map(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~
114 | rank_map.begin(), get(vertex_index, g), rank_map[0]),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
115 | make_iterator_property_map(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~
116 | pred_map.begin(), get(vertex_index, g), pred_map[0]),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
117 | get(edge_weight, g));
| ~~~~~~~~~~~~~~~~~~~~
minST.cpp:20:38: required from here
20 | kruskal_minimum_spanning_tree(g, std::back_inserter(spanning_tree));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/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<boost::range_detail::integer_iterator<long unsigned int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int>, boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_color_t, boost::default_color_type>, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::no_property, boost::listS> > >]’
20 | ~usage_requirements() { ((Model*)0)->~Model(); }
| ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/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<boost::range_detail::integer_iterator<long unsigned int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int>, boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_color_t, boost::default_color_type>, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::no_property, boost::listS> > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:53:35: required from ‘boost::concepts::MultiPassInputIterator<T>::~MultiPassInputIterator() [with T = boost::detail::adj_list_edge_iterator<boost::range_detail::integer_iterator<long unsigned int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int>, boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_color_t, boost::default_color_type>, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::no_property, boost::listS> >]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/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<boost::range_detail::integer_iterator<long unsigned int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int>, boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_color_t, boost::default_color_type>, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::no_property, boost::listS> > >]’
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:235:9: required from ‘boost::concepts::EdgeListGraph<G>::~EdgeListGraph() [with G = R_adjacency_list<boost::directedS, double>]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/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<R_adjacency_list<boost::directedS, double> >]’
226 | BOOST_concept(EdgeListGraph, (G)) : Graph< G >
| ^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:56:9: required from ‘void boost::detail::kruskal_mst_impl(const Graph&, OutputIterator, Rank, Parent, Weight) [with Graph = R_adjacency_list<boost::directedS, double>; OutputIterator = std::back_insert_iterator<std::vector<edge_desc_impl<boost::directed_tag, long unsigned int> > >; Rank = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; Parent = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; Weight = boost::adj_list_edge_property_map<boost::directed_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:112:29: required from ‘void boost::kruskal_minimum_spanning_tree(const Graph&, OutputIterator) [with Graph = R_adjacency_list<directedS, double>; OutputIterator = std::back_insert_iterator<std::vector<detail::edge_desc_impl<directed_tag, long unsigned int> > >]’
112 | detail::kruskal_mst_impl(g, spanning_tree_edges,
| ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
113 | make_iterator_property_map(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~
114 | rank_map.begin(), get(vertex_index, g), rank_map[0]),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
115 | make_iterator_property_map(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~
116 | pred_map.begin(), get(vertex_index, g), pred_map[0]),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
117 | get(edge_weight, g));
| ~~~~~~~~~~~~~~~~~~~~
minST.cpp:20:38: required from here
20 | kruskal_minimum_spanning_tree(g, std::back_inserter(spanning_tree));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/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<boost::range_detail::integer_iterator<long unsigned int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int>, boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_color_t, boost::default_color_type>, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::no_property, boost::listS> >]’
37 | ~model()
| ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:512:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
512 | BOOST_CONCEPT_USAGE(InputIterator)
| ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Assignable<boost::detail::undirected_edge_iter<std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > >, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:145:5: required from ‘struct boost::Assignable<boost::detail::undirected_edge_iter<std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > >, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> >’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator<boost::detail::undirected_edge_iter<std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > >, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> >’
502 | BOOST_concept(InputIterator,(TT))
| ^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::InputIterator<boost::detail::undirected_edge_iter<std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > >, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> >]’
32 | inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
| ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied<boost::InputIterator<boost::detail::undirected_edge_iter<std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > >, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> > >::value’
44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied<boost::InputIterator<boost::detail::undirected_edge_iter<std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > >, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> > >’
45 | typedef boost::integral_constant<bool, value> type;
| ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::MultiPassInputIterator<boost::detail::undirected_edge_iter<std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > >, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> >]’
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:235:9: required from ‘boost::concepts::EdgeListGraph<G>::~EdgeListGraph() [with G = R_adjacency_list<boost::undirectedS, double>]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/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<R_adjacency_list<boost::undirectedS, double> >]’
226 | BOOST_concept(EdgeListGraph, (G)) : Graph< G >
| ^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:56:9: required from ‘void boost::detail::kruskal_mst_impl(const Graph&, OutputIterator, Rank, Parent, Weight) [with Graph = R_adjacency_list<boost::undirectedS, double>; OutputIterator = std::back_insert_iterator<std::vector<edge_desc_impl<boost::undirected_tag, long unsigned int> > >; Rank = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; Parent = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; Weight = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:112:29: required from ‘void boost::kruskal_minimum_spanning_tree(const Graph&, OutputIterator) [with Graph = R_adjacency_list<undirectedS, double>; OutputIterator = std::back_insert_iterator<std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int> > >]’
112 | detail::kruskal_mst_impl(g, spanning_tree_edges,
| ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
113 | make_iterator_property_map(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~
114 | rank_map.begin(), get(vertex_index, g), rank_map[0]),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
115 | make_iterator_property_map(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~
116 | pred_map.begin(), get(vertex_index, g), pred_map[0]),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
117 | get(edge_weight, g));
| ~~~~~~~~~~~~~~~~~~~~
minST.cpp:54:38: required from here
54 | kruskal_minimum_spanning_tree(g, std::back_inserter(spanning_tree));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Assignable<boost::detail::undirected_edge_iter<std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > >, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> >]’
20 | ~usage_requirements() { ((Model*)0)->~Model(); }
| ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::EqualityComparable<boost::detail::undirected_edge_iter<std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > >, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable<boost::detail::undirected_edge_iter<std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > >, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> >’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator<boost::detail::undirected_edge_iter<std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > >, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> >’
502 | BOOST_concept(InputIterator,(TT))
| ^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::InputIterator<boost::detail::undirected_edge_iter<std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > >, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> >]’
32 | inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
| ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied<boost::InputIterator<boost::detail::undirected_edge_iter<std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > >, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> > >::value’
44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied<boost::InputIterator<boost::detail::undirected_edge_iter<std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > >, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> > >’
45 | typedef boost::integral_constant<bool, value> type;
| ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::MultiPassInputIterator<boost::detail::undirected_edge_iter<std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > >, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> >]’
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:235:9: required from ‘boost::concepts::EdgeListGraph<G>::~EdgeListGraph() [with G = R_adjacency_list<boost::undirectedS, double>]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/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<R_adjacency_list<boost::undirectedS, double> >]’
226 | BOOST_concept(EdgeListGraph, (G)) : Graph< G >
| ^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:56:9: required from ‘void boost::detail::kruskal_mst_impl(const Graph&, OutputIterator, Rank, Parent, Weight) [with Graph = R_adjacency_list<boost::undirectedS, double>; OutputIterator = std::back_insert_iterator<std::vector<edge_desc_impl<boost::undirected_tag, long unsigned int> > >; Rank = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; Parent = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; Weight = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:112:29: required from ‘void boost::kruskal_minimum_spanning_tree(const Graph&, OutputIterator) [with Graph = R_adjacency_list<undirectedS, double>; OutputIterator = std::back_insert_iterator<std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int> > >]’
112 | detail::kruskal_mst_impl(g, spanning_tree_edges,
| ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
113 | make_iterator_property_map(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~
114 | rank_map.begin(), get(vertex_index, g), rank_map[0]),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
115 | make_iterator_property_map(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~
116 | pred_map.begin(), get(vertex_index, g), pred_map[0]),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
117 | get(edge_weight, g));
| ~~~~~~~~~~~~~~~~~~~~
minST.cpp:54:38: required from here
54 | kruskal_minimum_spanning_tree(g, std::back_inserter(spanning_tree));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::EqualityComparable<boost::detail::undirected_edge_iter<std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > >, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> >]’
20 | ~usage_requirements() { ((Model*)0)->~Model(); }
| ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::InputIterator<boost::detail::undirected_edge_iter<std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > >, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:512:7: required from ‘struct boost::InputIterator<boost::detail::undirected_edge_iter<std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > >, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> >’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::InputIterator<boost::detail::undirected_edge_iter<std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > >, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> >]’
32 | inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
| ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied<boost::InputIterator<boost::detail::undirected_edge_iter<std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > >, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> > >::value’
44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied<boost::InputIterator<boost::detail::undirected_edge_iter<std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > >, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> > >’
45 | typedef boost::integral_constant<bool, value> type;
| ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::MultiPassInputIterator<boost::detail::undirected_edge_iter<std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > >, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> >]’
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:235:9: required from ‘boost::concepts::EdgeListGraph<G>::~EdgeListGraph() [with G = R_adjacency_list<boost::undirectedS, double>]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/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<R_adjacency_list<boost::undirectedS, double> >]’
226 | BOOST_concept(EdgeListGraph, (G)) : Graph< G >
| ^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:56:9: required from ‘void boost::detail::kruskal_mst_impl(const Graph&, OutputIterator, Rank, Parent, Weight) [with Graph = R_adjacency_list<boost::undirectedS, double>; OutputIterator = std::back_insert_iterator<std::vector<edge_desc_impl<boost::undirected_tag, long unsigned int> > >; Rank = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; Parent = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; Weight = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:112:29: required from ‘void boost::kruskal_minimum_spanning_tree(const Graph&, OutputIterator) [with Graph = R_adjacency_list<undirectedS, double>; OutputIterator = std::back_insert_iterator<std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int> > >]’
112 | detail::kruskal_mst_impl(g, spanning_tree_edges,
| ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
113 | make_iterator_property_map(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~
114 | rank_map.begin(), get(vertex_index, g), rank_map[0]),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
115 | make_iterator_property_map(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~
116 | pred_map.begin(), get(vertex_index, g), pred_map[0]),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
117 | get(edge_weight, g));
| ~~~~~~~~~~~~~~~~~~~~
minST.cpp:54:38: required from here
54 | kruskal_minimum_spanning_tree(g, std::back_inserter(spanning_tree));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::InputIterator<boost::detail::undirected_edge_iter<std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > >, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> >]’
20 | ~usage_requirements() { ((Model*)0)->~Model(); }
| ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::InputIterator<boost::detail::undirected_edge_iter<std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > >, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:53:35: required from ‘boost::concepts::MultiPassInputIterator<T>::~MultiPassInputIterator() [with T = boost::detail::undirected_edge_iter<std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > >, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int>]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::MultiPassInputIterator<boost::detail::undirected_edge_iter<std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > >, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> >]’
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:235:9: required from ‘boost::concepts::EdgeListGraph<G>::~EdgeListGraph() [with G = R_adjacency_list<boost::undirectedS, double>]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/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<R_adjacency_list<boost::undirectedS, double> >]’
226 | BOOST_concept(EdgeListGraph, (G)) : Graph< G >
| ^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:56:9: required from ‘void boost::detail::kruskal_mst_impl(const Graph&, OutputIterator, Rank, Parent, Weight) [with Graph = R_adjacency_list<boost::undirectedS, double>; OutputIterator = std::back_insert_iterator<std::vector<edge_desc_impl<boost::undirected_tag, long unsigned int> > >; Rank = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; Parent = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; Weight = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:112:29: required from ‘void boost::kruskal_minimum_spanning_tree(const Graph&, OutputIterator) [with Graph = R_adjacency_list<undirectedS, double>; OutputIterator = std::back_insert_iterator<std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int> > >]’
112 | detail::kruskal_mst_impl(g, spanning_tree_edges,
| ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
113 | make_iterator_property_map(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~
114 | rank_map.begin(), get(vertex_index, g), rank_map[0]),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
115 | make_iterator_property_map(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~
116 | pred_map.begin(), get(vertex_index, g), pred_map[0]),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
117 | get(edge_weight, g));
| ~~~~~~~~~~~~~~~~~~~~
minST.cpp:54:38: required from here
54 | kruskal_minimum_spanning_tree(g, std::back_inserter(spanning_tree));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::InputIterator<TT>::~InputIterator() [with TT = boost::detail::undirected_edge_iter<std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > >, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int>]’
37 | ~model()
| ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:512:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
512 | BOOST_CONCEPT_USAGE(InputIterator)
| ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Assignable<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Assignable<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > > > >]’
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:145:5: required from ‘struct boost::Assignable<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > > >’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > > >’
502 | BOOST_concept(InputIterator,(TT))
| ^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:540:3: required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > > >’
540 | BOOST_concept(ForwardIterator,(TT))
| ^~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > > >’
568 | BOOST_concept(BidirectionalIterator,(TT))
| ^~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3: [ skipping 6 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map<RAIter, ID, Value, Value&> boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > >; Value = double; ID = vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dijkstra_shortest_paths.hpp:556:43: required from ‘void boost::detail::dijkstra_dispatch1(const VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list<boost::undirectedS, double>; DistanceMap = boost::param_not_found; WeightMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>; Params = boost::bgl_named_params<_project2nd<double, double>, boost::distance_combine_t, boost::bgl_named_params<std::less<double>, boost::distance_compare_t, boost::bgl_named_params<boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params<long unsigned int*, boost::vertex_predecessor_t, boost::no_property> > > >; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’
556 | make_iterator_property_map(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^
557 | distance_map.begin(), index_map, distance_map[0])),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dijkstra_shortest_paths.hpp:570:31: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with VertexListGraph = R_adjacency_list<undirectedS, double>; Param = detail::_project2nd<double, double>; Tag = distance_combine_t; Rest = bgl_named_params<std::less<double>, distance_compare_t, bgl_named_params<adj_list_edge_property_map<undirected_tag, double, const double&, long unsigned int, const property<edge_weight_t, double, no_property>, edge_weight_t>, edge_weight_t, bgl_named_params<long unsigned int*, vertex_predecessor_t, no_property> > >; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
570 | detail::dijkstra_dispatch1(g, s, get_param(params, vertex_distance),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
571 | choose_const_pmap(get_param(params, edge_weight), g, edge_weight),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
572 | choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
573 | params);
| ~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:43:32: required from ‘void boost::detail::prim_mst_impl(const Graph&, typename boost::graph_traits<Graph>::vertex_descriptor, const boost::bgl_named_params<T, Tag, Base>&, Weight) [with Graph = R_adjacency_list<boost::undirectedS, double>; P = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>; T = boost::edge_weight_t; R = boost::bgl_named_params<long unsigned int*, boost::vertex_predecessor_t, boost::no_property>; Weight = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’
43 | dijkstra_shortest_paths(
| ~~~~~~~~~~~~~~~~~~~~~~~^
44 | G, s, params.distance_compare(compare).distance_combine(combine));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:77:26: required from ‘void boost::prim_minimum_spanning_tree(const VertexListGraph&, PredecessorMap) [with VertexListGraph = R_adjacency_list<undirectedS, double>; PredecessorMap = long unsigned int*]’
77 | detail::prim_mst_impl(g, *vertices(g).first,
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
78 | predecessor_map(p_map).weight_map(get(edge_weight, g)),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
79 | get(edge_weight, g));
| ~~~~~~~~~~~~~~~~~~~~
minST.cpp:89:35: required from here
89 | prim_minimum_spanning_tree(g, &parent[0]);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
20 | ~usage_requirements() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Assignable<TT>::~Assignable() [with TT = __gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > >]’
37 | ~model()
| ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:145:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
145 | BOOST_CONCEPT_USAGE(Assignable) {
| ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::EqualityComparable<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::EqualityComparable<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > > > >]’
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > > >’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > > >’
502 | BOOST_concept(InputIterator,(TT))
| ^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:540:3: required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > > >’
540 | BOOST_concept(ForwardIterator,(TT))
| ^~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > > >’
568 | BOOST_concept(BidirectionalIterator,(TT))
| ^~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3: [ skipping 6 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map<RAIter, ID, Value, Value&> boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > >; Value = double; ID = vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dijkstra_shortest_paths.hpp:556:43: required from ‘void boost::detail::dijkstra_dispatch1(const VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list<boost::undirectedS, double>; DistanceMap = boost::param_not_found; WeightMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>; Params = boost::bgl_named_params<_project2nd<double, double>, boost::distance_combine_t, boost::bgl_named_params<std::less<double>, boost::distance_compare_t, boost::bgl_named_params<boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params<long unsigned int*, boost::vertex_predecessor_t, boost::no_property> > > >; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’
556 | make_iterator_property_map(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^
557 | distance_map.begin(), index_map, distance_map[0])),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dijkstra_shortest_paths.hpp:570:31: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with VertexListGraph = R_adjacency_list<undirectedS, double>; Param = detail::_project2nd<double, double>; Tag = distance_combine_t; Rest = bgl_named_params<std::less<double>, distance_compare_t, bgl_named_params<adj_list_edge_property_map<undirected_tag, double, const double&, long unsigned int, const property<edge_weight_t, double, no_property>, edge_weight_t>, edge_weight_t, bgl_named_params<long unsigned int*, vertex_predecessor_t, no_property> > >; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
570 | detail::dijkstra_dispatch1(g, s, get_param(params, vertex_distance),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
571 | choose_const_pmap(get_param(params, edge_weight), g, edge_weight),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
572 | choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
573 | params);
| ~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:43:32: required from ‘void boost::detail::prim_mst_impl(const Graph&, typename boost::graph_traits<Graph>::vertex_descriptor, const boost::bgl_named_params<T, Tag, Base>&, Weight) [with Graph = R_adjacency_list<boost::undirectedS, double>; P = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>; T = boost::edge_weight_t; R = boost::bgl_named_params<long unsigned int*, boost::vertex_predecessor_t, boost::no_property>; Weight = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’
43 | dijkstra_shortest_paths(
| ~~~~~~~~~~~~~~~~~~~~~~~^
44 | G, s, params.distance_compare(compare).distance_combine(combine));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:77:26: required from ‘void boost::prim_minimum_spanning_tree(const VertexListGraph&, PredecessorMap) [with VertexListGraph = R_adjacency_list<undirectedS, double>; PredecessorMap = long unsigned int*]’
77 | detail::prim_mst_impl(g, *vertices(g).first,
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
78 | predecessor_map(p_map).weight_map(get(edge_weight, g)),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
79 | get(edge_weight, g));
| ~~~~~~~~~~~~~~~~~~~~
minST.cpp:89:35: required from here
89 | prim_minimum_spanning_tree(g, &parent[0]);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
20 | ~usage_requirements() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::EqualityComparable<TT>::~EqualityComparable() [with TT = __gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > >]’
37 | ~model()
| ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:233:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
233 | BOOST_CONCEPT_USAGE(EqualityComparable) {
| ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::InputIterator<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::InputIterator<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > > > >]’
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:512:7: required from ‘struct boost::InputIterator<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > > >’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:540:3: required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > > >’
540 | BOOST_concept(ForwardIterator,(TT))
| ^~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > > >’
568 | BOOST_concept(BidirectionalIterator,(TT))
| ^~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > > >’
597 | BOOST_concept(RandomAccessIterator,(TT))
| ^~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3: [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map<RAIter, ID, Value, Value&> boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > >; Value = double; ID = vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dijkstra_shortest_paths.hpp:556:43: required from ‘void boost::detail::dijkstra_dispatch1(const VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list<boost::undirectedS, double>; DistanceMap = boost::param_not_found; WeightMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>; Params = boost::bgl_named_params<_project2nd<double, double>, boost::distance_combine_t, boost::bgl_named_params<std::less<double>, boost::distance_compare_t, boost::bgl_named_params<boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params<long unsigned int*, boost::vertex_predecessor_t, boost::no_property> > > >; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’
556 | make_iterator_property_map(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^
557 | distance_map.begin(), index_map, distance_map[0])),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dijkstra_shortest_paths.hpp:570:31: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with VertexListGraph = R_adjacency_list<undirectedS, double>; Param = detail::_project2nd<double, double>; Tag = distance_combine_t; Rest = bgl_named_params<std::less<double>, distance_compare_t, bgl_named_params<adj_list_edge_property_map<undirected_tag, double, const double&, long unsigned int, const property<edge_weight_t, double, no_property>, edge_weight_t>, edge_weight_t, bgl_named_params<long unsigned int*, vertex_predecessor_t, no_property> > >; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
570 | detail::dijkstra_dispatch1(g, s, get_param(params, vertex_distance),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
571 | choose_const_pmap(get_param(params, edge_weight), g, edge_weight),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
572 | choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
573 | params);
| ~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:43:32: required from ‘void boost::detail::prim_mst_impl(const Graph&, typename boost::graph_traits<Graph>::vertex_descriptor, const boost::bgl_named_params<T, Tag, Base>&, Weight) [with Graph = R_adjacency_list<boost::undirectedS, double>; P = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>; T = boost::edge_weight_t; R = boost::bgl_named_params<long unsigned int*, boost::vertex_predecessor_t, boost::no_property>; Weight = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’
43 | dijkstra_shortest_paths(
| ~~~~~~~~~~~~~~~~~~~~~~~^
44 | G, s, params.distance_compare(compare).distance_combine(combine));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:77:26: required from ‘void boost::prim_minimum_spanning_tree(const VertexListGraph&, PredecessorMap) [with VertexListGraph = R_adjacency_list<undirectedS, double>; PredecessorMap = long unsigned int*]’
77 | detail::prim_mst_impl(g, *vertices(g).first,
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
78 | predecessor_map(p_map).weight_map(get(edge_weight, g)),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
79 | get(edge_weight, g));
| ~~~~~~~~~~~~~~~~~~~~
minST.cpp:89:35: required from here
89 | prim_minimum_spanning_tree(g, &parent[0]);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
20 | ~usage_requirements() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::InputIterator<TT>::~InputIterator() [with TT = __gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > >]’
37 | ~model()
| ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:512:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
512 | BOOST_CONCEPT_USAGE(InputIterator)
| ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::ForwardIterator<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::ForwardIterator<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > > > >]’
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:543:7: required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > > >’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > > >’
568 | BOOST_concept(BidirectionalIterator,(TT))
| ^~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > > >’
597 | BOOST_concept(RandomAccessIterator,(TT))
| ^~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > > >’
597 | BOOST_concept(RandomAccessIterator,(TT))
| ^~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map<RAIter, ID, Value, Value&> boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > >; Value = double; ID = vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dijkstra_shortest_paths.hpp:556:43: required from ‘void boost::detail::dijkstra_dispatch1(const VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list<boost::undirectedS, double>; DistanceMap = boost::param_not_found; WeightMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>; Params = boost::bgl_named_params<_project2nd<double, double>, boost::distance_combine_t, boost::bgl_named_params<std::less<double>, boost::distance_compare_t, boost::bgl_named_params<boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params<long unsigned int*, boost::vertex_predecessor_t, boost::no_property> > > >; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’
556 | make_iterator_property_map(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^
557 | distance_map.begin(), index_map, distance_map[0])),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dijkstra_shortest_paths.hpp:570:31: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with VertexListGraph = R_adjacency_list<undirectedS, double>; Param = detail::_project2nd<double, double>; Tag = distance_combine_t; Rest = bgl_named_params<std::less<double>, distance_compare_t, bgl_named_params<adj_list_edge_property_map<undirected_tag, double, const double&, long unsigned int, const property<edge_weight_t, double, no_property>, edge_weight_t>, edge_weight_t, bgl_named_params<long unsigned int*, vertex_predecessor_t, no_property> > >; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
570 | detail::dijkstra_dispatch1(g, s, get_param(params, vertex_distance),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
571 | choose_const_pmap(get_param(params, edge_weight), g, edge_weight),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
572 | choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
573 | params);
| ~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:43:32: required from ‘void boost::detail::prim_mst_impl(const Graph&, typename boost::graph_traits<Graph>::vertex_descriptor, const boost::bgl_named_params<T, Tag, Base>&, Weight) [with Graph = R_adjacency_list<boost::undirectedS, double>; P = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>; T = boost::edge_weight_t; R = boost::bgl_named_params<long unsigned int*, boost::vertex_predecessor_t, boost::no_property>; Weight = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’
43 | dijkstra_shortest_paths(
| ~~~~~~~~~~~~~~~~~~~~~~~^
44 | G, s, params.distance_compare(compare).distance_combine(combine));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:77:26: required from ‘void boost::prim_minimum_spanning_tree(const VertexListGraph&, PredecessorMap) [with VertexListGraph = R_adjacency_list<undirectedS, double>; PredecessorMap = long unsigned int*]’
77 | detail::prim_mst_impl(g, *vertices(g).first,
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
78 | predecessor_map(p_map).weight_map(get(edge_weight, g)),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
79 | get(edge_weight, g));
| ~~~~~~~~~~~~~~~~~~~~
minST.cpp:89:35: required from here
89 | prim_minimum_spanning_tree(g, &parent[0]);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
20 | ~usage_requirements() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::ForwardIterator<TT>::~ForwardIterator() [with TT = __gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > >]’
37 | ~model()
| ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:543:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
543 | BOOST_CONCEPT_USAGE(ForwardIterator)
| ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::BidirectionalIterator<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::BidirectionalIterator<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > > > >]’
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:571:7: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > > >’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > > >’
597 | BOOST_concept(RandomAccessIterator,(TT))
| ^~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > > >’
597 | BOOST_concept(RandomAccessIterator,(TT))
| ^~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > > >]’
32 | inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
| ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map<RAIter, ID, Value, Value&> boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > >; Value = double; ID = vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dijkstra_shortest_paths.hpp:556:43: required from ‘void boost::detail::dijkstra_dispatch1(const VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list<boost::undirectedS, double>; DistanceMap = boost::param_not_found; WeightMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>; Params = boost::bgl_named_params<_project2nd<double, double>, boost::distance_combine_t, boost::bgl_named_params<std::less<double>, boost::distance_compare_t, boost::bgl_named_params<boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params<long unsigned int*, boost::vertex_predecessor_t, boost::no_property> > > >; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’
556 | make_iterator_property_map(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^
557 | distance_map.begin(), index_map, distance_map[0])),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dijkstra_shortest_paths.hpp:570:31: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with VertexListGraph = R_adjacency_list<undirectedS, double>; Param = detail::_project2nd<double, double>; Tag = distance_combine_t; Rest = bgl_named_params<std::less<double>, distance_compare_t, bgl_named_params<adj_list_edge_property_map<undirected_tag, double, const double&, long unsigned int, const property<edge_weight_t, double, no_property>, edge_weight_t>, edge_weight_t, bgl_named_params<long unsigned int*, vertex_predecessor_t, no_property> > >; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
570 | detail::dijkstra_dispatch1(g, s, get_param(params, vertex_distance),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
571 | choose_const_pmap(get_param(params, edge_weight), g, edge_weight),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
572 | choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
573 | params);
| ~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:43:32: required from ‘void boost::detail::prim_mst_impl(const Graph&, typename boost::graph_traits<Graph>::vertex_descriptor, const boost::bgl_named_params<T, Tag, Base>&, Weight) [with Graph = R_adjacency_list<boost::undirectedS, double>; P = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>; T = boost::edge_weight_t; R = boost::bgl_named_params<long unsigned int*, boost::vertex_predecessor_t, boost::no_property>; Weight = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’
43 | dijkstra_shortest_paths(
| ~~~~~~~~~~~~~~~~~~~~~~~^
44 | G, s, params.distance_compare(compare).distance_combine(combine));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:77:26: required from ‘void boost::prim_minimum_spanning_tree(const VertexListGraph&, PredecessorMap) [with VertexListGraph = R_adjacency_list<undirectedS, double>; PredecessorMap = long unsigned int*]’
77 | detail::prim_mst_impl(g, *vertices(g).first,
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
78 | predecessor_map(p_map).weight_map(get(edge_weight, g)),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
79 | get(edge_weight, g));
| ~~~~~~~~~~~~~~~~~~~~
minST.cpp:89:35: required from here
89 | prim_minimum_spanning_tree(g, &parent[0]);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
20 | ~usage_requirements() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::BidirectionalIterator<TT>::~BidirectionalIterator() [with TT = __gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > >]’
37 | ~model()
| ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:571:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
571 | BOOST_CONCEPT_USAGE(BidirectionalIterator)
| ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Comparable<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Comparable<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > > > >]’
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:253:5: required from ‘struct boost::Comparable<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > > >’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > > >’
597 | BOOST_concept(RandomAccessIterator,(TT))
| ^~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > > >’
597 | BOOST_concept(RandomAccessIterator,(TT))
| ^~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > > >]’
32 | inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
| ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map<RAIter, ID, Value, Value&> boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > >; Value = double; ID = vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dijkstra_shortest_paths.hpp:556:43: required from ‘void boost::detail::dijkstra_dispatch1(const VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list<boost::undirectedS, double>; DistanceMap = boost::param_not_found; WeightMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>; Params = boost::bgl_named_params<_project2nd<double, double>, boost::distance_combine_t, boost::bgl_named_params<std::less<double>, boost::distance_compare_t, boost::bgl_named_params<boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params<long unsigned int*, boost::vertex_predecessor_t, boost::no_property> > > >; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’
556 | make_iterator_property_map(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^
557 | distance_map.begin(), index_map, distance_map[0])),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dijkstra_shortest_paths.hpp:570:31: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with VertexListGraph = R_adjacency_list<undirectedS, double>; Param = detail::_project2nd<double, double>; Tag = distance_combine_t; Rest = bgl_named_params<std::less<double>, distance_compare_t, bgl_named_params<adj_list_edge_property_map<undirected_tag, double, const double&, long unsigned int, const property<edge_weight_t, double, no_property>, edge_weight_t>, edge_weight_t, bgl_named_params<long unsigned int*, vertex_predecessor_t, no_property> > >; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
570 | detail::dijkstra_dispatch1(g, s, get_param(params, vertex_distance),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
571 | choose_const_pmap(get_param(params, edge_weight), g, edge_weight),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
572 | choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
573 | params);
| ~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:43:32: required from ‘void boost::detail::prim_mst_impl(const Graph&, typename boost::graph_traits<Graph>::vertex_descriptor, const boost::bgl_named_params<T, Tag, Base>&, Weight) [with Graph = R_adjacency_list<boost::undirectedS, double>; P = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>; T = boost::edge_weight_t; R = boost::bgl_named_params<long unsigned int*, boost::vertex_predecessor_t, boost::no_property>; Weight = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’
43 | dijkstra_shortest_paths(
| ~~~~~~~~~~~~~~~~~~~~~~~^
44 | G, s, params.distance_compare(compare).distance_combine(combine));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:77:26: required from ‘void boost::prim_minimum_spanning_tree(const VertexListGraph&, PredecessorMap) [with VertexListGraph = R_adjacency_list<undirectedS, double>; PredecessorMap = long unsigned int*]’
77 | detail::prim_mst_impl(g, *vertices(g).first,
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
78 | predecessor_map(p_map).weight_map(get(edge_weight, g)),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
79 | get(edge_weight, g));
| ~~~~~~~~~~~~~~~~~~~~
minST.cpp:89:35: required from here
89 | prim_minimum_spanning_tree(g, &parent[0]);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
20 | ~usage_requirements() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Comparable<TT>::~Comparable() [with TT = __gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > >]’
37 | ~model()
| ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:253:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
253 | BOOST_CONCEPT_USAGE(Comparable) {
| ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::RandomAccessIterator<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::RandomAccessIterator<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > > > >]’
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:601:7: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > > >’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > > >’
597 | BOOST_concept(RandomAccessIterator,(TT))
| ^~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > > >]’
32 | inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
| ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied<boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > > > >::value’
44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map<RAIter, ID, Value, Value&> boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > >; Value = double; ID = vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dijkstra_shortest_paths.hpp:556:43: required from ‘void boost::detail::dijkstra_dispatch1(const VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list<boost::undirectedS, double>; DistanceMap = boost::param_not_found; WeightMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>; Params = boost::bgl_named_params<_project2nd<double, double>, boost::distance_combine_t, boost::bgl_named_params<std::less<double>, boost::distance_compare_t, boost::bgl_named_params<boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params<long unsigned int*, boost::vertex_predecessor_t, boost::no_property> > > >; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’
556 | make_iterator_property_map(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^
557 | distance_map.begin(), index_map, distance_map[0])),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dijkstra_shortest_paths.hpp:570:31: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with VertexListGraph = R_adjacency_list<undirectedS, double>; Param = detail::_project2nd<double, double>; Tag = distance_combine_t; Rest = bgl_named_params<std::less<double>, distance_compare_t, bgl_named_params<adj_list_edge_property_map<undirected_tag, double, const double&, long unsigned int, const property<edge_weight_t, double, no_property>, edge_weight_t>, edge_weight_t, bgl_named_params<long unsigned int*, vertex_predecessor_t, no_property> > >; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
570 | detail::dijkstra_dispatch1(g, s, get_param(params, vertex_distance),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
571 | choose_const_pmap(get_param(params, edge_weight), g, edge_weight),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
572 | choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
573 | params);
| ~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:43:32: required from ‘void boost::detail::prim_mst_impl(const Graph&, typename boost::graph_traits<Graph>::vertex_descriptor, const boost::bgl_named_params<T, Tag, Base>&, Weight) [with Graph = R_adjacency_list<boost::undirectedS, double>; P = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>; T = boost::edge_weight_t; R = boost::bgl_named_params<long unsigned int*, boost::vertex_predecessor_t, boost::no_property>; Weight = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’
43 | dijkstra_shortest_paths(
| ~~~~~~~~~~~~~~~~~~~~~~~^
44 | G, s, params.distance_compare(compare).distance_combine(combine));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:77:26: required from ‘void boost::prim_minimum_spanning_tree(const VertexListGraph&, PredecessorMap) [with VertexListGraph = R_adjacency_list<undirectedS, double>; PredecessorMap = long unsigned int*]’
77 | detail::prim_mst_impl(g, *vertices(g).first,
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
78 | predecessor_map(p_map).weight_map(get(edge_weight, g)),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
79 | get(edge_weight, g));
| ~~~~~~~~~~~~~~~~~~~~
minST.cpp:89:35: required from here
89 | prim_minimum_spanning_tree(g, &parent[0]);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
20 | ~usage_requirements() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::RandomAccessIterator<TT>::~RandomAccessIterator() [with TT = __gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > >]’
37 | ~model()
| ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:601:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
601 | BOOST_CONCEPT_USAGE(RandomAccessIterator)
| ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Assignable<boost::range_detail::integer_iterator<long unsigned int> >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Assignable<boost::range_detail::integer_iterator<long unsigned int> > >]’
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:145:5: required from ‘struct boost::Assignable<boost::range_detail::integer_iterator<long unsigned int> >’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator<boost::range_detail::integer_iterator<long unsigned int> >’
502 | BOOST_concept(InputIterator,(TT))
| ^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::InputIterator<boost::range_detail::integer_iterator<long unsigned int> >]’
32 | inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
| ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied<boost::InputIterator<boost::range_detail::integer_iterator<long unsigned int> > >::value’
44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::MultiPassInputIterator<boost::range_detail::integer_iterator<long unsigned int> >]’
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:184:9: required from ‘boost::concepts::VertexListGraph<G>::~VertexListGraph() [with G = R_adjacency_list<boost::directedS, double>]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/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<R_adjacency_list<boost::directedS, double> >]’
176 | BOOST_concept(VertexListGraph, (G)) : Graph< G >
| ^~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:55:9: required from ‘void boost::detail::kruskal_mst_impl(const Graph&, OutputIterator, Rank, Parent, Weight) [with Graph = R_adjacency_list<boost::directedS, double>; OutputIterator = std::back_insert_iterator<std::vector<edge_desc_impl<boost::directed_tag, long unsigned int> > >; Rank = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; Parent = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; Weight = boost::adj_list_edge_property_map<boost::directed_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:112:29: required from ‘void boost::kruskal_minimum_spanning_tree(const Graph&, OutputIterator) [with Graph = R_adjacency_list<directedS, double>; OutputIterator = std::back_insert_iterator<std::vector<detail::edge_desc_impl<directed_tag, long unsigned int> > >]’
112 | detail::kruskal_mst_impl(g, spanning_tree_edges,
| ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
113 | make_iterator_property_map(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~
114 | rank_map.begin(), get(vertex_index, g), rank_map[0]),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
115 | make_iterator_property_map(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~
116 | pred_map.begin(), get(vertex_index, g), pred_map[0]),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
117 | get(edge_weight, g));
| ~~~~~~~~~~~~~~~~~~~~
minST.cpp:20:38: required from here
20 | kruskal_minimum_spanning_tree(g, std::back_inserter(spanning_tree));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
20 | ~usage_requirements() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Assignable<TT>::~Assignable() [with TT = boost::range_detail::integer_iterator<long unsigned int>]’
37 | ~model()
| ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:145:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
145 | BOOST_CONCEPT_USAGE(Assignable) {
| ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::EqualityComparable<boost::range_detail::integer_iterator<long unsigned int> >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::EqualityComparable<boost::range_detail::integer_iterator<long unsigned int> > >]’
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable<boost::range_detail::integer_iterator<long unsigned int> >’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator<boost::range_detail::integer_iterator<long unsigned int> >’
502 | BOOST_concept(InputIterator,(TT))
| ^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::InputIterator<boost::range_detail::integer_iterator<long unsigned int> >]’
32 | inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
| ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied<boost::InputIterator<boost::range_detail::integer_iterator<long unsigned int> > >::value’
44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::MultiPassInputIterator<boost::range_detail::integer_iterator<long unsigned int> >]’
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:184:9: required from ‘boost::concepts::VertexListGraph<G>::~VertexListGraph() [with G = R_adjacency_list<boost::directedS, double>]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/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<R_adjacency_list<boost::directedS, double> >]’
176 | BOOST_concept(VertexListGraph, (G)) : Graph< G >
| ^~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:55:9: required from ‘void boost::detail::kruskal_mst_impl(const Graph&, OutputIterator, Rank, Parent, Weight) [with Graph = R_adjacency_list<boost::directedS, double>; OutputIterator = std::back_insert_iterator<std::vector<edge_desc_impl<boost::directed_tag, long unsigned int> > >; Rank = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; Parent = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; Weight = boost::adj_list_edge_property_map<boost::directed_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:112:29: required from ‘void boost::kruskal_minimum_spanning_tree(const Graph&, OutputIterator) [with Graph = R_adjacency_list<directedS, double>; OutputIterator = std::back_insert_iterator<std::vector<detail::edge_desc_impl<directed_tag, long unsigned int> > >]’
112 | detail::kruskal_mst_impl(g, spanning_tree_edges,
| ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
113 | make_iterator_property_map(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~
114 | rank_map.begin(), get(vertex_index, g), rank_map[0]),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
115 | make_iterator_property_map(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~
116 | pred_map.begin(), get(vertex_index, g), pred_map[0]),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
117 | get(edge_weight, g));
| ~~~~~~~~~~~~~~~~~~~~
minST.cpp:20:38: required from here
20 | kruskal_minimum_spanning_tree(g, std::back_inserter(spanning_tree));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
20 | ~usage_requirements() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::EqualityComparable<TT>::~EqualityComparable() [with TT = boost::range_detail::integer_iterator<long unsigned int>]’
37 | ~model()
| ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:233:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
233 | BOOST_CONCEPT_USAGE(EqualityComparable) {
| ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::InputIterator<boost::range_detail::integer_iterator<long unsigned int> >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::InputIterator<boost::range_detail::integer_iterator<long unsigned int> > >]’
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:512:7: required from ‘struct boost::InputIterator<boost::range_detail::integer_iterator<long unsigned int> >’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::InputIterator<boost::range_detail::integer_iterator<long unsigned int> >]’
32 | inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
| ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied<boost::InputIterator<boost::range_detail::integer_iterator<long unsigned int> > >::value’
44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied<boost::InputIterator<boost::range_detail::integer_iterator<long unsigned int> > >’
45 | typedef boost::integral_constant<bool, value> type;
| ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::MultiPassInputIterator<boost::range_detail::integer_iterator<long unsigned int> >]’
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:184:9: required from ‘boost::concepts::VertexListGraph<G>::~VertexListGraph() [with G = R_adjacency_list<boost::directedS, double>]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/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<R_adjacency_list<boost::directedS, double> >]’
176 | BOOST_concept(VertexListGraph, (G)) : Graph< G >
| ^~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:55:9: required from ‘void boost::detail::kruskal_mst_impl(const Graph&, OutputIterator, Rank, Parent, Weight) [with Graph = R_adjacency_list<boost::directedS, double>; OutputIterator = std::back_insert_iterator<std::vector<edge_desc_impl<boost::directed_tag, long unsigned int> > >; Rank = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; Parent = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; Weight = boost::adj_list_edge_property_map<boost::directed_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:112:29: required from ‘void boost::kruskal_minimum_spanning_tree(const Graph&, OutputIterator) [with Graph = R_adjacency_list<directedS, double>; OutputIterator = std::back_insert_iterator<std::vector<detail::edge_desc_impl<directed_tag, long unsigned int> > >]’
112 | detail::kruskal_mst_impl(g, spanning_tree_edges,
| ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
113 | make_iterator_property_map(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~
114 | rank_map.begin(), get(vertex_index, g), rank_map[0]),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
115 | make_iterator_property_map(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~
116 | pred_map.begin(), get(vertex_index, g), pred_map[0]),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
117 | get(edge_weight, g));
| ~~~~~~~~~~~~~~~~~~~~
minST.cpp:20:38: required from here
20 | kruskal_minimum_spanning_tree(g, std::back_inserter(spanning_tree));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
20 | ~usage_requirements() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::InputIterator<TT>::~InputIterator() [with TT = boost::range_detail::integer_iterator<long unsigned int>]’
37 | ~model()
| ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:512:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
512 | BOOST_CONCEPT_USAGE(InputIterator)
| ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/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<boost::range_detail::integer_iterator<long unsigned int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int>, boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_color_t, boost::default_color_type>, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::no_property, boost::listS> > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/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<boost::range_detail::integer_iterator<long unsigned int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int>, boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_color_t, boost::default_color_type>, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::no_property, boost::listS> > > >]’
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:145:5: required from ‘struct boost::Assignable<boost::detail::adj_list_edge_iterator<boost::range_detail::integer_iterator<long unsigned int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int>, boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_color_t, boost::default_color_type>, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::no_property, boost::listS> > >’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator<boost::detail::adj_list_edge_iterator<boost::range_detail::integer_iterator<long unsigned int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int>, boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_color_t, boost::default_color_type>, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::no_property, boost::listS> > >’
502 | BOOST_concept(InputIterator,(TT))
| ^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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<boost::range_detail::integer_iterator<long unsigned int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int>, boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_color_t, boost::default_color_type>, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::no_property, boost::listS> > >]’
32 | inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
| ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/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<boost::range_detail::integer_iterator<long unsigned int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int>, boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_color_t, boost::default_color_type>, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::no_property, boost::listS> > > >::value’
44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/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<boost::range_detail::integer_iterator<long unsigned int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int>, boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_color_t, boost::default_color_type>, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::no_property, boost::listS> > >]’
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:235:9: required from ‘boost::concepts::EdgeListGraph<G>::~EdgeListGraph() [with G = R_adjacency_list<boost::directedS, double>]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/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<R_adjacency_list<boost::directedS, double> >]’
226 | BOOST_concept(EdgeListGraph, (G)) : Graph< G >
| ^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:56:9: required from ‘void boost::detail::kruskal_mst_impl(const Graph&, OutputIterator, Rank, Parent, Weight) [with Graph = R_adjacency_list<boost::directedS, double>; OutputIterator = std::back_insert_iterator<std::vector<edge_desc_impl<boost::directed_tag, long unsigned int> > >; Rank = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; Parent = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; Weight = boost::adj_list_edge_property_map<boost::directed_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:112:29: required from ‘void boost::kruskal_minimum_spanning_tree(const Graph&, OutputIterator) [with Graph = R_adjacency_list<directedS, double>; OutputIterator = std::back_insert_iterator<std::vector<detail::edge_desc_impl<directed_tag, long unsigned int> > >]’
112 | detail::kruskal_mst_impl(g, spanning_tree_edges,
| ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
113 | make_iterator_property_map(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~
114 | rank_map.begin(), get(vertex_index, g), rank_map[0]),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
115 | make_iterator_property_map(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~
116 | pred_map.begin(), get(vertex_index, g), pred_map[0]),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
117 | get(edge_weight, g));
| ~~~~~~~~~~~~~~~~~~~~
minST.cpp:20:38: required from here
20 | kruskal_minimum_spanning_tree(g, std::back_inserter(spanning_tree));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
20 | ~usage_requirements() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/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<boost::range_detail::integer_iterator<long unsigned int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int>, boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_color_t, boost::default_color_type>, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::no_property, boost::listS> >]’
37 | ~model()
| ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:145:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
145 | BOOST_CONCEPT_USAGE(Assignable) {
| ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/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<boost::range_detail::integer_iterator<long unsigned int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int>, boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_color_t, boost::default_color_type>, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::no_property, boost::listS> > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/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<boost::range_detail::integer_iterator<long unsigned int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int>, boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_color_t, boost::default_color_type>, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::no_property, boost::listS> > > >]’
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable<boost::detail::adj_list_edge_iterator<boost::range_detail::integer_iterator<long unsigned int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int>, boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_color_t, boost::default_color_type>, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::no_property, boost::listS> > >’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator<boost::detail::adj_list_edge_iterator<boost::range_detail::integer_iterator<long unsigned int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int>, boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_color_t, boost::default_color_type>, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::no_property, boost::listS> > >’
502 | BOOST_concept(InputIterator,(TT))
| ^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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<boost::range_detail::integer_iterator<long unsigned int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int>, boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_color_t, boost::default_color_type>, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::no_property, boost::listS> > >]’
32 | inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
| ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/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<boost::range_detail::integer_iterator<long unsigned int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int>, boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_color_t, boost::default_color_type>, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::no_property, boost::listS> > > >::value’
44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/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<boost::range_detail::integer_iterator<long unsigned int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int>, boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_color_t, boost::default_color_type>, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::no_property, boost::listS> > >]’
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:235:9: required from ‘boost::concepts::EdgeListGraph<G>::~EdgeListGraph() [with G = R_adjacency_list<boost::directedS, double>]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/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<R_adjacency_list<boost::directedS, double> >]’
226 | BOOST_concept(EdgeListGraph, (G)) : Graph< G >
| ^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:56:9: required from ‘void boost::detail::kruskal_mst_impl(const Graph&, OutputIterator, Rank, Parent, Weight) [with Graph = R_adjacency_list<boost::directedS, double>; OutputIterator = std::back_insert_iterator<std::vector<edge_desc_impl<boost::directed_tag, long unsigned int> > >; Rank = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; Parent = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; Weight = boost::adj_list_edge_property_map<boost::directed_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:112:29: required from ‘void boost::kruskal_minimum_spanning_tree(const Graph&, OutputIterator) [with Graph = R_adjacency_list<directedS, double>; OutputIterator = std::back_insert_iterator<std::vector<detail::edge_desc_impl<directed_tag, long unsigned int> > >]’
112 | detail::kruskal_mst_impl(g, spanning_tree_edges,
| ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
113 | make_iterator_property_map(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~
114 | rank_map.begin(), get(vertex_index, g), rank_map[0]),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
115 | make_iterator_property_map(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~
116 | pred_map.begin(), get(vertex_index, g), pred_map[0]),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
117 | get(edge_weight, g));
| ~~~~~~~~~~~~~~~~~~~~
minST.cpp:20:38: required from here
20 | kruskal_minimum_spanning_tree(g, std::back_inserter(spanning_tree));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
20 | ~usage_requirements() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/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<boost::range_detail::integer_iterator<long unsigned int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int>, boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_color_t, boost::default_color_type>, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::no_property, boost::listS> >]’
37 | ~model()
| ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:233:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
233 | BOOST_CONCEPT_USAGE(EqualityComparable) {
| ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/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<boost::range_detail::integer_iterator<long unsigned int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int>, boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_color_t, boost::default_color_type>, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::no_property, boost::listS> > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/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<boost::range_detail::integer_iterator<long unsigned int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int>, boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_color_t, boost::default_color_type>, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::no_property, boost::listS> > > >]’
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:512:7: required from ‘struct boost::InputIterator<boost::detail::adj_list_edge_iterator<boost::range_detail::integer_iterator<long unsigned int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int>, boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_color_t, boost::default_color_type>, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::no_property, boost::listS> > >’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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<boost::range_detail::integer_iterator<long unsigned int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int>, boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_color_t, boost::default_color_type>, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::no_property, boost::listS> > >]’
32 | inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
| ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/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<boost::range_detail::integer_iterator<long unsigned int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int>, boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_color_t, boost::default_color_type>, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::no_property, boost::listS> > > >::value’
44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/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<boost::range_detail::integer_iterator<long unsigned int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int>, boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_color_t, boost::default_color_type>, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::no_property, boost::listS> > > >’
45 | typedef boost::integral_constant<bool, value> type;
| ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/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<boost::range_detail::integer_iterator<long unsigned int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int>, boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_color_t, boost::default_color_type>, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::no_property, boost::listS> > >]’
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:235:9: required from ‘boost::concepts::EdgeListGraph<G>::~EdgeListGraph() [with G = R_adjacency_list<boost::directedS, double>]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/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<R_adjacency_list<boost::directedS, double> >]’
226 | BOOST_concept(EdgeListGraph, (G)) : Graph< G >
| ^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:56:9: required from ‘void boost::detail::kruskal_mst_impl(const Graph&, OutputIterator, Rank, Parent, Weight) [with Graph = R_adjacency_list<boost::directedS, double>; OutputIterator = std::back_insert_iterator<std::vector<edge_desc_impl<boost::directed_tag, long unsigned int> > >; Rank = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; Parent = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; Weight = boost::adj_list_edge_property_map<boost::directed_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:112:29: required from ‘void boost::kruskal_minimum_spanning_tree(const Graph&, OutputIterator) [with Graph = R_adjacency_list<directedS, double>; OutputIterator = std::back_insert_iterator<std::vector<detail::edge_desc_impl<directed_tag, long unsigned int> > >]’
112 | detail::kruskal_mst_impl(g, spanning_tree_edges,
| ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
113 | make_iterator_property_map(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~
114 | rank_map.begin(), get(vertex_index, g), rank_map[0]),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
115 | make_iterator_property_map(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~
116 | pred_map.begin(), get(vertex_index, g), pred_map[0]),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
117 | get(edge_weight, g));
| ~~~~~~~~~~~~~~~~~~~~
minST.cpp:20:38: required from here
20 | kruskal_minimum_spanning_tree(g, std::back_inserter(spanning_tree));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
20 | ~usage_requirements() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/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<boost::range_detail::integer_iterator<long unsigned int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int>, boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_color_t, boost::default_color_type>, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::no_property, boost::listS> >]’
37 | ~model()
| ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:512:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
512 | BOOST_CONCEPT_USAGE(InputIterator)
| ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Assignable<boost::detail::undirected_edge_iter<std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > >, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Assignable<boost::detail::undirected_edge_iter<std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > >, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> > >]’
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:145:5: required from ‘struct boost::Assignable<boost::detail::undirected_edge_iter<std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > >, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> >’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator<boost::detail::undirected_edge_iter<std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > >, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> >’
502 | BOOST_concept(InputIterator,(TT))
| ^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::InputIterator<boost::detail::undirected_edge_iter<std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > >, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> >]’
32 | inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
| ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied<boost::InputIterator<boost::detail::undirected_edge_iter<std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > >, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> > >::value’
44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::MultiPassInputIterator<boost::detail::undirected_edge_iter<std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > >, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> >]’
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:235:9: required from ‘boost::concepts::EdgeListGraph<G>::~EdgeListGraph() [with G = R_adjacency_list<boost::undirectedS, double>]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/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<R_adjacency_list<boost::undirectedS, double> >]’
226 | BOOST_concept(EdgeListGraph, (G)) : Graph< G >
| ^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:56:9: required from ‘void boost::detail::kruskal_mst_impl(const Graph&, OutputIterator, Rank, Parent, Weight) [with Graph = R_adjacency_list<boost::undirectedS, double>; OutputIterator = std::back_insert_iterator<std::vector<edge_desc_impl<boost::undirected_tag, long unsigned int> > >; Rank = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; Parent = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; Weight = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:112:29: required from ‘void boost::kruskal_minimum_spanning_tree(const Graph&, OutputIterator) [with Graph = R_adjacency_list<undirectedS, double>; OutputIterator = std::back_insert_iterator<std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int> > >]’
112 | detail::kruskal_mst_impl(g, spanning_tree_edges,
| ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
113 | make_iterator_property_map(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~
114 | rank_map.begin(), get(vertex_index, g), rank_map[0]),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
115 | make_iterator_property_map(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~
116 | pred_map.begin(), get(vertex_index, g), pred_map[0]),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
117 | get(edge_weight, g));
| ~~~~~~~~~~~~~~~~~~~~
minST.cpp:54:38: required from here
54 | kruskal_minimum_spanning_tree(g, std::back_inserter(spanning_tree));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
20 | ~usage_requirements() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Assignable<TT>::~Assignable() [with TT = boost::detail::undirected_edge_iter<std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > >, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int>]’
37 | ~model()
| ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:145:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
145 | BOOST_CONCEPT_USAGE(Assignable) {
| ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::EqualityComparable<boost::detail::undirected_edge_iter<std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > >, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::EqualityComparable<boost::detail::undirected_edge_iter<std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > >, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> > >]’
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable<boost::detail::undirected_edge_iter<std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > >, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> >’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator<boost::detail::undirected_edge_iter<std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > >, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> >’
502 | BOOST_concept(InputIterator,(TT))
| ^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::InputIterator<boost::detail::undirected_edge_iter<std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > >, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> >]’
32 | inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
| ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied<boost::InputIterator<boost::detail::undirected_edge_iter<std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > >, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> > >::value’
44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::MultiPassInputIterator<boost::detail::undirected_edge_iter<std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > >, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> >]’
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:235:9: required from ‘boost::concepts::EdgeListGraph<G>::~EdgeListGraph() [with G = R_adjacency_list<boost::undirectedS, double>]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/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<R_adjacency_list<boost::undirectedS, double> >]’
226 | BOOST_concept(EdgeListGraph, (G)) : Graph< G >
| ^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:56:9: required from ‘void boost::detail::kruskal_mst_impl(const Graph&, OutputIterator, Rank, Parent, Weight) [with Graph = R_adjacency_list<boost::undirectedS, double>; OutputIterator = std::back_insert_iterator<std::vector<edge_desc_impl<boost::undirected_tag, long unsigned int> > >; Rank = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; Parent = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; Weight = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:112:29: required from ‘void boost::kruskal_minimum_spanning_tree(const Graph&, OutputIterator) [with Graph = R_adjacency_list<undirectedS, double>; OutputIterator = std::back_insert_iterator<std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int> > >]’
112 | detail::kruskal_mst_impl(g, spanning_tree_edges,
| ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
113 | make_iterator_property_map(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~
114 | rank_map.begin(), get(vertex_index, g), rank_map[0]),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
115 | make_iterator_property_map(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~
116 | pred_map.begin(), get(vertex_index, g), pred_map[0]),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
117 | get(edge_weight, g));
| ~~~~~~~~~~~~~~~~~~~~
minST.cpp:54:38: required from here
54 | kruskal_minimum_spanning_tree(g, std::back_inserter(spanning_tree));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
20 | ~usage_requirements() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::EqualityComparable<TT>::~EqualityComparable() [with TT = boost::detail::undirected_edge_iter<std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > >, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int>]’
37 | ~model()
| ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:233:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
233 | BOOST_CONCEPT_USAGE(EqualityComparable) {
| ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::InputIterator<boost::detail::undirected_edge_iter<std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > >, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::InputIterator<boost::detail::undirected_edge_iter<std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > >, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> > >]’
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:512:7: required from ‘struct boost::InputIterator<boost::detail::undirected_edge_iter<std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > >, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> >’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::InputIterator<boost::detail::undirected_edge_iter<std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > >, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> >]’
32 | inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
| ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied<boost::InputIterator<boost::detail::undirected_edge_iter<std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > >, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> > >::value’
44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied<boost::InputIterator<boost::detail::undirected_edge_iter<std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > >, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> > >’
45 | typedef boost::integral_constant<bool, value> type;
| ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::MultiPassInputIterator<boost::detail::undirected_edge_iter<std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > >, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> >]’
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:235:9: required from ‘boost::concepts::EdgeListGraph<G>::~EdgeListGraph() [with G = R_adjacency_list<boost::undirectedS, double>]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/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<R_adjacency_list<boost::undirectedS, double> >]’
226 | BOOST_concept(EdgeListGraph, (G)) : Graph< G >
| ^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:56:9: required from ‘void boost::detail::kruskal_mst_impl(const Graph&, OutputIterator, Rank, Parent, Weight) [with Graph = R_adjacency_list<boost::undirectedS, double>; OutputIterator = std::back_insert_iterator<std::vector<edge_desc_impl<boost::undirected_tag, long unsigned int> > >; Rank = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; Parent = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; Weight = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:112:29: required from ‘void boost::kruskal_minimum_spanning_tree(const Graph&, OutputIterator) [with Graph = R_adjacency_list<undirectedS, double>; OutputIterator = std::back_insert_iterator<std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int> > >]’
112 | detail::kruskal_mst_impl(g, spanning_tree_edges,
| ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
113 | make_iterator_property_map(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~
114 | rank_map.begin(), get(vertex_index, g), rank_map[0]),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
115 | make_iterator_property_map(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~
116 | pred_map.begin(), get(vertex_index, g), pred_map[0]),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
117 | get(edge_weight, g));
| ~~~~~~~~~~~~~~~~~~~~
minST.cpp:54:38: required from here
54 | kruskal_minimum_spanning_tree(g, std::back_inserter(spanning_tree));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
20 | ~usage_requirements() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::InputIterator<TT>::~InputIterator() [with TT = boost::detail::undirected_edge_iter<std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > >, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int>]’
37 | ~model()
| ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:512:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
512 | BOOST_CONCEPT_USAGE(InputIterator)
| ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/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> >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/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> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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);
| ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/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) );
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/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;
| ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/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)>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:515:9: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/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<boost::range_detail::integer_iterator<long unsigned int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int>, boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_color_t, boost::default_color_type>, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::no_property, boost::listS> > >]’
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:235:9: required from ‘boost::concepts::EdgeListGraph<G>::~EdgeListGraph() [with G = R_adjacency_list<boost::directedS, double>]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/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<R_adjacency_list<boost::directedS, double> >]’
226 | BOOST_concept(EdgeListGraph, (G)) : Graph< G >
| ^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:56:9: required from ‘void boost::detail::kruskal_mst_impl(const Graph&, OutputIterator, Rank, Parent, Weight) [with Graph = R_adjacency_list<boost::directedS, double>; OutputIterator = std::back_insert_iterator<std::vector<edge_desc_impl<boost::directed_tag, long unsigned int> > >; Rank = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; Parent = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; Weight = boost::adj_list_edge_property_map<boost::directed_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:112:29: required from ‘void boost::kruskal_minimum_spanning_tree(const Graph&, OutputIterator) [with Graph = R_adjacency_list<directedS, double>; OutputIterator = std::back_insert_iterator<std::vector<detail::edge_desc_impl<directed_tag, long unsigned int> > >]’
112 | detail::kruskal_mst_impl(g, spanning_tree_edges,
| ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
113 | make_iterator_property_map(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~
114 | rank_map.begin(), get(vertex_index, g), rank_map[0]),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
115 | make_iterator_property_map(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~
116 | pred_map.begin(), get(vertex_index, g), pred_map[0]),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
117 | get(edge_weight, g));
| ~~~~~~~~~~~~~~~~~~~~
minST.cpp:20:38: required from here
20 | kruskal_minimum_spanning_tree(g, std::back_inserter(spanning_tree));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/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(); }
| ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/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>]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:515:9: required from ‘boost::InputIterator<TT>::~InputIterator() [with TT = boost::detail::adj_list_edge_iterator<boost::range_detail::integer_iterator<long unsigned int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int>, boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_color_t, boost::default_color_type>, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::no_property, boost::listS> >]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/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<boost::range_detail::integer_iterator<long unsigned int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int>, boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_color_t, boost::default_color_type>, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::no_property, boost::listS> > >]’
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:53:35: required from ‘boost::concepts::MultiPassInputIterator<T>::~MultiPassInputIterator() [with T = boost::detail::adj_list_edge_iterator<boost::range_detail::integer_iterator<long unsigned int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int>, boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_color_t, boost::default_color_type>, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::no_property, boost::listS> >]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/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<boost::range_detail::integer_iterator<long unsigned int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int>, boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_color_t, boost::default_color_type>, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::no_property, boost::listS> > >]’
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:235:9: required from ‘boost::concepts::EdgeListGraph<G>::~EdgeListGraph() [with G = R_adjacency_list<boost::directedS, double>]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/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<R_adjacency_list<boost::directedS, double> >]’
226 | BOOST_concept(EdgeListGraph, (G)) : Graph< G >
| ^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:56:9: required from ‘void boost::detail::kruskal_mst_impl(const Graph&, OutputIterator, Rank, Parent, Weight) [with Graph = R_adjacency_list<boost::directedS, double>; OutputIterator = std::back_insert_iterator<std::vector<edge_desc_impl<boost::directed_tag, long unsigned int> > >; Rank = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; Parent = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; Weight = boost::adj_list_edge_property_map<boost::directed_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:112:29: required from ‘void boost::kruskal_minimum_spanning_tree(const Graph&, OutputIterator) [with Graph = R_adjacency_list<directedS, double>; OutputIterator = std::back_insert_iterator<std::vector<detail::edge_desc_impl<directed_tag, long unsigned int> > >]’
112 | detail::kruskal_mst_impl(g, spanning_tree_edges,
| ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
113 | make_iterator_property_map(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~
114 | rank_map.begin(), get(vertex_index, g), rank_map[0]),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
115 | make_iterator_property_map(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~
116 | pred_map.begin(), get(vertex_index, g), pred_map[0]),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
117 | get(edge_weight, g));
| ~~~~~~~~~~~~~~~~~~~~
minST.cpp:20:38: required from here
20 | kruskal_minimum_spanning_tree(g, std::back_inserter(spanning_tree));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/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()
| ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
208 | BOOST_CONCEPT_USAGE(Convertible) {
| ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Convertible<boost::iterators::detail::iterator_category_with_traversal<std::input_iterator_tag, boost::iterators::bidirectional_traversal_tag>, std::input_iterator_tag> >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible<boost::iterators::detail::iterator_category_with_traversal<std::input_iterator_tag, boost::iterators::bidirectional_traversal_tag>, std::input_iterator_tag>’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::Convertible<boost::iterators::detail::iterator_category_with_traversal<std::input_iterator_tag, boost::iterators::bidirectional_traversal_tag>, std::input_iterator_tag>]’
32 | inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
| ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied<boost::Convertible<boost::iterators::detail::iterator_category_with_traversal<std::input_iterator_tag, boost::iterators::bidirectional_traversal_tag>, std::input_iterator_tag> >::value’
44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied<boost::Convertible<boost::iterators::detail::iterator_category_with_traversal<std::input_iterator_tag, boost::iterators::bidirectional_traversal_tag>, std::input_iterator_tag> >’
45 | typedef boost::integral_constant<bool, value> type;
| ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_<void (*)(boost::Convertible<boost::iterators::detail::iterator_category_with_traversal<std::input_iterator_tag, boost::iterators::bidirectional_traversal_tag>, std::input_iterator_tag>)>’
72 | struct requirement_<void(*)(Model)>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:515:9: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::MultiPassInputIterator<boost::detail::undirected_edge_iter<std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > >, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> >]’
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:235:9: required from ‘boost::concepts::EdgeListGraph<G>::~EdgeListGraph() [with G = R_adjacency_list<boost::undirectedS, double>]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/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<R_adjacency_list<boost::undirectedS, double> >]’
226 | BOOST_concept(EdgeListGraph, (G)) : Graph< G >
| ^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:56:9: required from ‘void boost::detail::kruskal_mst_impl(const Graph&, OutputIterator, Rank, Parent, Weight) [with Graph = R_adjacency_list<boost::undirectedS, double>; OutputIterator = std::back_insert_iterator<std::vector<edge_desc_impl<boost::undirected_tag, long unsigned int> > >; Rank = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; Parent = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; Weight = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:112:29: required from ‘void boost::kruskal_minimum_spanning_tree(const Graph&, OutputIterator) [with Graph = R_adjacency_list<undirectedS, double>; OutputIterator = std::back_insert_iterator<std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int> > >]’
112 | detail::kruskal_mst_impl(g, spanning_tree_edges,
| ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
113 | make_iterator_property_map(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~
114 | rank_map.begin(), get(vertex_index, g), rank_map[0]),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
115 | make_iterator_property_map(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~
116 | pred_map.begin(), get(vertex_index, g), pred_map[0]),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
117 | get(edge_weight, g));
| ~~~~~~~~~~~~~~~~~~~~
minST.cpp:54:38: required from here
54 | kruskal_minimum_spanning_tree(g, std::back_inserter(spanning_tree));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Convertible<boost::iterators::detail::iterator_category_with_traversal<std::input_iterator_tag, boost::iterators::bidirectional_traversal_tag>, std::input_iterator_tag>]’
20 | ~usage_requirements() { ((Model*)0)->~Model(); }
| ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::Convertible<boost::iterators::detail::iterator_category_with_traversal<std::input_iterator_tag, boost::iterators::bidirectional_traversal_tag>, std::input_iterator_tag>]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:515:9: required from ‘boost::InputIterator<TT>::~InputIterator() [with TT = boost::detail::undirected_edge_iter<std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > >, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int>]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::InputIterator<boost::detail::undirected_edge_iter<std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > >, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> >]’
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:53:35: required from ‘boost::concepts::MultiPassInputIterator<T>::~MultiPassInputIterator() [with T = boost::detail::undirected_edge_iter<std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > >, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int>]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::MultiPassInputIterator<boost::detail::undirected_edge_iter<std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > >, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> >]’
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:235:9: required from ‘boost::concepts::EdgeListGraph<G>::~EdgeListGraph() [with G = R_adjacency_list<boost::undirectedS, double>]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/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<R_adjacency_list<boost::undirectedS, double> >]’
226 | BOOST_concept(EdgeListGraph, (G)) : Graph< G >
| ^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:56:9: required from ‘void boost::detail::kruskal_mst_impl(const Graph&, OutputIterator, Rank, Parent, Weight) [with Graph = R_adjacency_list<boost::undirectedS, double>; OutputIterator = std::back_insert_iterator<std::vector<edge_desc_impl<boost::undirected_tag, long unsigned int> > >; Rank = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; Parent = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; Weight = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:112:29: required from ‘void boost::kruskal_minimum_spanning_tree(const Graph&, OutputIterator) [with Graph = R_adjacency_list<undirectedS, double>; OutputIterator = std::back_insert_iterator<std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int> > >]’
112 | detail::kruskal_mst_impl(g, spanning_tree_edges,
| ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
113 | make_iterator_property_map(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~
114 | rank_map.begin(), get(vertex_index, g), rank_map[0]),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
115 | make_iterator_property_map(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~
116 | pred_map.begin(), get(vertex_index, g), pred_map[0]),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
117 | get(edge_weight, g));
| ~~~~~~~~~~~~~~~~~~~~
minST.cpp:54:38: required from here
54 | kruskal_minimum_spanning_tree(g, std::back_inserter(spanning_tree));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible<X, Y>::~Convertible() [with X = boost::iterators::detail::iterator_category_with_traversal<std::input_iterator_tag, boost::iterators::bidirectional_traversal_tag>; Y = std::input_iterator_tag]’
37 | ~model()
| ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
208 | BOOST_CONCEPT_USAGE(Convertible) {
| ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/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>]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/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(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/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> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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);
| ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/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) );
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/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;
| ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/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<boost::range_detail::integer_iterator<long unsigned int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int>, boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_color_t, boost::default_color_type>, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::no_property, boost::listS> > >]’
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:235:9: required from ‘boost::concepts::EdgeListGraph<G>::~EdgeListGraph() [with G = R_adjacency_list<boost::directedS, double>]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/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<R_adjacency_list<boost::directedS, double> >]’
226 | BOOST_concept(EdgeListGraph, (G)) : Graph< G >
| ^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:56:9: required from ‘void boost::detail::kruskal_mst_impl(const Graph&, OutputIterator, Rank, Parent, Weight) [with Graph = R_adjacency_list<boost::directedS, double>; OutputIterator = std::back_insert_iterator<std::vector<edge_desc_impl<boost::directed_tag, long unsigned int> > >; Rank = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; Parent = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; Weight = boost::adj_list_edge_property_map<boost::directed_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:112:29: required from ‘void boost::kruskal_minimum_spanning_tree(const Graph&, OutputIterator) [with Graph = R_adjacency_list<directedS, double>; OutputIterator = std::back_insert_iterator<std::vector<detail::edge_desc_impl<directed_tag, long unsigned int> > >]’
112 | detail::kruskal_mst_impl(g, spanning_tree_edges,
| ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
113 | make_iterator_property_map(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~
114 | rank_map.begin(), get(vertex_index, g), rank_map[0]),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
115 | make_iterator_property_map(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~
116 | pred_map.begin(), get(vertex_index, g), pred_map[0]),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
117 | get(edge_weight, g));
| ~~~~~~~~~~~~~~~~~~~~
minST.cpp:20:38: required from here
20 | kruskal_minimum_spanning_tree(g, std::back_inserter(spanning_tree));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
20 | ~usage_requirements() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/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()
| ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
208 | BOOST_CONCEPT_USAGE(Convertible) {
| ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Convertible<boost::iterators::detail::iterator_category_with_traversal<std::input_iterator_tag, boost::iterators::bidirectional_traversal_tag>, std::input_iterator_tag>]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Convertible<boost::iterators::detail::iterator_category_with_traversal<std::input_iterator_tag, boost::iterators::bidirectional_traversal_tag>, std::input_iterator_tag> >]’
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible<boost::iterators::detail::iterator_category_with_traversal<std::input_iterator_tag, boost::iterators::bidirectional_traversal_tag>, std::input_iterator_tag>’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::Convertible<boost::iterators::detail::iterator_category_with_traversal<std::input_iterator_tag, boost::iterators::bidirectional_traversal_tag>, std::input_iterator_tag>]’
32 | inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
| ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied<boost::Convertible<boost::iterators::detail::iterator_category_with_traversal<std::input_iterator_tag, boost::iterators::bidirectional_traversal_tag>, std::input_iterator_tag> >::value’
44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied<boost::Convertible<boost::iterators::detail::iterator_category_with_traversal<std::input_iterator_tag, boost::iterators::bidirectional_traversal_tag>, std::input_iterator_tag> >’
45 | typedef boost::integral_constant<bool, value> type;
| ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::MultiPassInputIterator<boost::detail::undirected_edge_iter<std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > >, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> >]’
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:235:9: required from ‘boost::concepts::EdgeListGraph<G>::~EdgeListGraph() [with G = R_adjacency_list<boost::undirectedS, double>]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/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<R_adjacency_list<boost::undirectedS, double> >]’
226 | BOOST_concept(EdgeListGraph, (G)) : Graph< G >
| ^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:56:9: required from ‘void boost::detail::kruskal_mst_impl(const Graph&, OutputIterator, Rank, Parent, Weight) [with Graph = R_adjacency_list<boost::undirectedS, double>; OutputIterator = std::back_insert_iterator<std::vector<edge_desc_impl<boost::undirected_tag, long unsigned int> > >; Rank = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; Parent = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; Weight = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:112:29: required from ‘void boost::kruskal_minimum_spanning_tree(const Graph&, OutputIterator) [with Graph = R_adjacency_list<undirectedS, double>; OutputIterator = std::back_insert_iterator<std::vector<detail::edge_desc_impl<undirected_tag, long unsigned int> > >]’
112 | detail::kruskal_mst_impl(g, spanning_tree_edges,
| ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
113 | make_iterator_property_map(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~
114 | rank_map.begin(), get(vertex_index, g), rank_map[0]),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
115 | make_iterator_property_map(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~
116 | pred_map.begin(), get(vertex_index, g), pred_map[0]),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
117 | get(edge_weight, g));
| ~~~~~~~~~~~~~~~~~~~~
minST.cpp:54:38: required from here
54 | kruskal_minimum_spanning_tree(g, std::back_inserter(spanning_tree));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
20 | ~usage_requirements() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible<X, Y>::~Convertible() [with X = boost::iterators::detail::iterator_category_with_traversal<std::input_iterator_tag, boost::iterators::bidirectional_traversal_tag>; Y = std::input_iterator_tag]’
37 | ~model()
| ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
208 | BOOST_CONCEPT_USAGE(Convertible) {
| ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/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<R_adjacency_list<boost::undirectedS, double> > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:87:5: required from ‘struct boost::concepts::IncidenceGraph<R_adjacency_list<boost::undirectedS, double> >’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:75:1: required from ‘struct boost::concepts::IncidenceGraphConcept<R_adjacency_list<boost::undirectedS, double> >’
75 | BOOST_concept(IncidenceGraph, (G)) : Graph< G >
| ^~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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<R_adjacency_list<boost::undirectedS, double> >]’
32 | inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
| ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied<boost::concepts::IncidenceGraphConcept<R_adjacency_list<boost::undirectedS, double> > >::value’
44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied<boost::concepts::IncidenceGraphConcept<R_adjacency_list<boost::undirectedS, double> > >’
45 | typedef boost::integral_constant<bool, value> type;
| ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 7 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dijkstra_shortest_paths.hpp:528:32: required from ‘void boost::detail::dijkstra_dispatch2(const VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list<boost::undirectedS, double>; DistanceMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, double, double&>; WeightMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>; Params = boost::bgl_named_params<_project2nd<double, double>, boost::distance_combine_t, boost::bgl_named_params<std::less<double>, boost::distance_compare_t, boost::bgl_named_params<boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params<long unsigned int*, boost::vertex_predecessor_t, boost::no_property> > > >; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’
528 | dijkstra_shortest_paths(g, s,
| ~~~~~~~~~~~~~~~~~~~~~~~^~~~~~
529 | choose_param(get_param(params, vertex_predecessor), p_map),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
530 | distance, weight, index_map,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~
531 | choose_param(
| ~~~~~~~~~~~~~
532 | get_param(params, distance_compare_t()), std::less< D >()),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
533 | choose_param(
| ~~~~~~~~~~~~~
534 | get_param(params, distance_combine_t()), std::plus< D >()),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
535 | inf, choose_param(get_param(params, distance_zero_t()), D()),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
536 | choose_param(get_param(params, graph_visitor),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
537 | make_dijkstra_visitor(null_visitor())),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
538 | params);
| ~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dijkstra_shortest_paths.hpp:554:35: required from ‘void boost::detail::dijkstra_dispatch1(const VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list<boost::undirectedS, double>; DistanceMap = boost::param_not_found; WeightMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>; Params = boost::bgl_named_params<_project2nd<double, double>, boost::distance_combine_t, boost::bgl_named_params<std::less<double>, boost::distance_compare_t, boost::bgl_named_params<boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params<long unsigned int*, boost::vertex_predecessor_t, boost::no_property> > > >; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’
554 | detail::dijkstra_dispatch2(g, s,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~
555 | choose_param(distance,
| ~~~~~~~~~~~~~~~~~~~~~~
556 | make_iterator_property_map(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~
557 | distance_map.begin(), index_map, distance_map[0])),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
558 | weight, index_map, params);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dijkstra_shortest_paths.hpp:570:31: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with VertexListGraph = R_adjacency_list<undirectedS, double>; Param = detail::_project2nd<double, double>; Tag = distance_combine_t; Rest = bgl_named_params<std::less<double>, distance_compare_t, bgl_named_params<adj_list_edge_property_map<undirected_tag, double, const double&, long unsigned int, const property<edge_weight_t, double, no_property>, edge_weight_t>, edge_weight_t, bgl_named_params<long unsigned int*, vertex_predecessor_t, no_property> > >; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
570 | detail::dijkstra_dispatch1(g, s, get_param(params, vertex_distance),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
571 | choose_const_pmap(get_param(params, edge_weight), g, edge_weight),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
572 | choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
573 | params);
| ~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:43:32: required from ‘void boost::detail::prim_mst_impl(const Graph&, typename boost::graph_traits<Graph>::vertex_descriptor, const boost::bgl_named_params<T, Tag, Base>&, Weight) [with Graph = R_adjacency_list<boost::undirectedS, double>; P = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>; T = boost::edge_weight_t; R = boost::bgl_named_params<long unsigned int*, boost::vertex_predecessor_t, boost::no_property>; Weight = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’
43 | dijkstra_shortest_paths(
| ~~~~~~~~~~~~~~~~~~~~~~~^
44 | G, s, params.distance_compare(compare).distance_combine(combine));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:77:26: required from ‘void boost::prim_minimum_spanning_tree(const VertexListGraph&, PredecessorMap) [with VertexListGraph = R_adjacency_list<undirectedS, double>; PredecessorMap = long unsigned int*]’
77 | detail::prim_mst_impl(g, *vertices(g).first,
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
78 | predecessor_map(p_map).weight_map(get(edge_weight, g)),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
79 | get(edge_weight, g));
| ~~~~~~~~~~~~~~~~~~~~
minST.cpp:89:35: required from here
89 | prim_minimum_spanning_tree(g, &parent[0]);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/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<R_adjacency_list<boost::undirectedS, double> >]’
20 | ~usage_requirements() { ((Model*)0)->~Model(); }
| ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/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<R_adjacency_list<boost::undirectedS, double> >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:62:5: required from ‘void boost::breadth_first_visit(const IncidenceGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with IncidenceGraph = R_adjacency_list<undirectedS, double>; Buffer = d_ary_heap_indirect<long unsigned int, 4, iterator_property_map<long unsigned int*, vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>, iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > >, vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>, double, double&>, std::less<double>, std::vector<long unsigned int> >; BFSVisitor = detail::dijkstra_bfs_visitor<dijkstra_visitor<>, d_ary_heap_indirect<long unsigned int, 4, iterator_property_map<long unsigned int*, vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>, iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > >, vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>, double, double&>, std::less<double>, std::vector<long unsigned int> >, adj_list_edge_property_map<undirected_tag, double, const double&, long unsigned int, const property<edge_weight_t, double, no_property>, edge_weight_t>, long unsigned int*, iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > >, vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>, double, double&>, detail::_project2nd<double, double>, std::less<double> >; ColorMap = two_bit_color_map<vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int> >; SourceIterator = long unsigned int*]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dijkstra_shortest_paths.hpp:387:24: required from ‘void boost::dijkstra_shortest_paths_no_init(const Graph&, SourceInputIter, SourceInputIter, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistZero, DijkstraVisitor, ColorMap) [with Graph = R_adjacency_list<undirectedS, double>; SourceInputIter = long unsigned int*; DijkstraVisitor = dijkstra_visitor<>; PredecessorMap = long unsigned int*; DistanceMap = iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > >, vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>, double, double&>; WeightMap = adj_list_edge_property_map<undirected_tag, double, const double&, long unsigned int, const property<edge_weight_t, double, no_property>, edge_weight_t>; IndexMap = vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>; Compare = std::less<double>; Combine = detail::_project2nd<double, double>; DistZero = double; ColorMap = two_bit_color_map<vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int> >]’
387 | breadth_first_visit(g, s_begin, s_end, Q, bfs_vis, color);
| ~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dijkstra_shortest_paths.hpp:464:36: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, SourceInputIter, SourceInputIter, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistInf, DistZero, DijkstraVisitor, ColorMap) [with VertexListGraph = R_adjacency_list<undirectedS, double>; SourceInputIter = long unsigned int*; DijkstraVisitor = dijkstra_visitor<>; PredecessorMap = long unsigned int*; DistanceMap = iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > >, vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>, double, double&>; WeightMap = adj_list_edge_property_map<undirected_tag, double, const double&, long unsigned int, const property<edge_weight_t, double, no_property>, edge_weight_t>; IndexMap = vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>; Compare = std::less<double>; Combine = detail::_project2nd<double, double>; DistInf = double; DistZero = double; ColorMap = two_bit_color_map<vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int> >]’
464 | dijkstra_shortest_paths_no_init(g, s_begin, s_end, predecessor, distance,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
465 | weight, index_map, compare, combine, zero, vis, color);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dijkstra_shortest_paths.hpp:417:28: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, SourceInputIter, SourceInputIter, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistInf, DistZero, DijkstraVisitor, const bgl_named_params<T, Tag, Base>&, typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type) [with VertexListGraph = R_adjacency_list<undirectedS, double>; SourceInputIter = long unsigned int*; DijkstraVisitor = dijkstra_visitor<>; PredecessorMap = long unsigned int*; DistanceMap = iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > >, vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>, double, double&>; WeightMap = adj_list_edge_property_map<undirected_tag, double, const double&, long unsigned int, const property<edge_weight_t, double, no_property>, edge_weight_t>; IndexMap = vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>; Compare = std::less<double>; Combine = detail::_project2nd<double, double>; DistInf = double; DistZero = double; T = char; Tag = detail::unused_tag_type; Base = no_property; typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits<Graph>::traversal_category = undir_adj_list_traversal_tag]’
417 | dijkstra_shortest_paths(g, s_begin, s_end, predecessor, distance, weight,
| ~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
418 | index_map, compare, combine, inf, zero, vis, color);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dijkstra_shortest_paths.hpp:491:28: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dijkstra_shortest_paths.hpp:528:32: required from ‘void boost::detail::dijkstra_dispatch2(const VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list<boost::undirectedS, double>; DistanceMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, double, double&>; WeightMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>; Params = boost::bgl_named_params<_project2nd<double, double>, boost::distance_combine_t, boost::bgl_named_params<std::less<double>, boost::distance_compare_t, boost::bgl_named_params<boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params<long unsigned int*, boost::vertex_predecessor_t, boost::no_property> > > >; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’
528 | dijkstra_shortest_paths(g, s,
| ~~~~~~~~~~~~~~~~~~~~~~~^~~~~~
529 | choose_param(get_param(params, vertex_predecessor), p_map),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
530 | distance, weight, index_map,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~
531 | choose_param(
| ~~~~~~~~~~~~~
532 | get_param(params, distance_compare_t()), std::less< D >()),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
533 | choose_param(
| ~~~~~~~~~~~~~
534 | get_param(params, distance_combine_t()), std::plus< D >()),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
535 | inf, choose_param(get_param(params, distance_zero_t()), D()),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
536 | choose_param(get_param(params, graph_visitor),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
537 | make_dijkstra_visitor(null_visitor())),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
538 | params);
| ~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dijkstra_shortest_paths.hpp:554:35: required from ‘void boost::detail::dijkstra_dispatch1(const VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list<boost::undirectedS, double>; DistanceMap = boost::param_not_found; WeightMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>; Params = boost::bgl_named_params<_project2nd<double, double>, boost::distance_combine_t, boost::bgl_named_params<std::less<double>, boost::distance_compare_t, boost::bgl_named_params<boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params<long unsigned int*, boost::vertex_predecessor_t, boost::no_property> > > >; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’
554 | detail::dijkstra_dispatch2(g, s,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~
555 | choose_param(distance,
| ~~~~~~~~~~~~~~~~~~~~~~
556 | make_iterator_property_map(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~
557 | distance_map.begin(), index_map, distance_map[0])),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
558 | weight, index_map, params);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dijkstra_shortest_paths.hpp:570:31: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with VertexListGraph = R_adjacency_list<undirectedS, double>; Param = detail::_project2nd<double, double>; Tag = distance_combine_t; Rest = bgl_named_params<std::less<double>, distance_compare_t, bgl_named_params<adj_list_edge_property_map<undirected_tag, double, const double&, long unsigned int, const property<edge_weight_t, double, no_property>, edge_weight_t>, edge_weight_t, bgl_named_params<long unsigned int*, vertex_predecessor_t, no_property> > >; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
570 | detail::dijkstra_dispatch1(g, s, get_param(params, vertex_distance),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
571 | choose_const_pmap(get_param(params, edge_weight), g, edge_weight),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
572 | choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
573 | params);
| ~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:43:32: required from ‘void boost::detail::prim_mst_impl(const Graph&, typename boost::graph_traits<Graph>::vertex_descriptor, const boost::bgl_named_params<T, Tag, Base>&, Weight) [with Graph = R_adjacency_list<boost::undirectedS, double>; P = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>; T = boost::edge_weight_t; R = boost::bgl_named_params<long unsigned int*, boost::vertex_predecessor_t, boost::no_property>; Weight = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’
43 | dijkstra_shortest_paths(
| ~~~~~~~~~~~~~~~~~~~~~~~^
44 | G, s, params.distance_compare(compare).distance_combine(combine));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:77:26: required from ‘void boost::prim_minimum_spanning_tree(const VertexListGraph&, PredecessorMap) [with VertexListGraph = R_adjacency_list<undirectedS, double>; PredecessorMap = long unsigned int*]’
77 | detail::prim_mst_impl(g, *vertices(g).first,
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
78 | predecessor_map(p_map).weight_map(get(edge_weight, g)),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
79 | get(edge_weight, g));
| ~~~~~~~~~~~~~~~~~~~~
minST.cpp:89:35: required from here
89 | prim_minimum_spanning_tree(g, &parent[0]);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:75:15: note: in a call to non-static member function ‘boost::concepts::IncidenceGraphConcept<R_adjacency_list<boost::undirectedS, double> >::~IncidenceGraphConcept()’
75 | BOOST_concept(IncidenceGraph, (G)) : Graph< G >
| ^~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/preprocessor/cat.hpp:29:34: note: in definition of macro ‘BOOST_PP_CAT_I’
29 | # define BOOST_PP_CAT_I(a, b) a ## b
| ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/concept_def.hpp:23:12: note: in expansion of macro ‘BOOST_PP_CAT’
23 | struct BOOST_PP_CAT(name,Concept) \
| ^~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:75:1: note: in expansion of macro ‘BOOST_concept’
75 | BOOST_concept(IncidenceGraph, (G)) : Graph< G >
| ^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::constraint<Model>::failed() [with Model = boost::BFSVisitorConcept<boost::detail::dijkstra_bfs_visitor<boost::dijkstra_visitor<>, boost::d_ary_heap_indirect<long unsigned int, 4, boost::iterator_property_map<long unsigned int*, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, double, double&>, std::less<double>, std::vector<long unsigned int> >, boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>, long unsigned int*, boost::iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, double, double&>, boost::detail::_project2nd<double, double>, std::less<double> >, R_adjacency_list<boost::undirectedS, double> >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:65:5: required from ‘void boost::breadth_first_visit(const IncidenceGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with IncidenceGraph = R_adjacency_list<undirectedS, double>; Buffer = d_ary_heap_indirect<long unsigned int, 4, iterator_property_map<long unsigned int*, vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>, iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > >, vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>, double, double&>, std::less<double>, std::vector<long unsigned int> >; BFSVisitor = detail::dijkstra_bfs_visitor<dijkstra_visitor<>, d_ary_heap_indirect<long unsigned int, 4, iterator_property_map<long unsigned int*, vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>, iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > >, vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>, double, double&>, std::less<double>, std::vector<long unsigned int> >, adj_list_edge_property_map<undirected_tag, double, const double&, long unsigned int, const property<edge_weight_t, double, no_property>, edge_weight_t>, long unsigned int*, iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > >, vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>, double, double&>, detail::_project2nd<double, double>, std::less<double> >; ColorMap = two_bit_color_map<vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int> >; SourceIterator = long unsigned int*]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dijkstra_shortest_paths.hpp:387:24: required from ‘void boost::dijkstra_shortest_paths_no_init(const Graph&, SourceInputIter, SourceInputIter, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistZero, DijkstraVisitor, ColorMap) [with Graph = R_adjacency_list<undirectedS, double>; SourceInputIter = long unsigned int*; DijkstraVisitor = dijkstra_visitor<>; PredecessorMap = long unsigned int*; DistanceMap = iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > >, vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>, double, double&>; WeightMap = adj_list_edge_property_map<undirected_tag, double, const double&, long unsigned int, const property<edge_weight_t, double, no_property>, edge_weight_t>; IndexMap = vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>; Compare = std::less<double>; Combine = detail::_project2nd<double, double>; DistZero = double; ColorMap = two_bit_color_map<vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int> >]’
387 | breadth_first_visit(g, s_begin, s_end, Q, bfs_vis, color);
| ~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dijkstra_shortest_paths.hpp:464:36: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, SourceInputIter, SourceInputIter, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistInf, DistZero, DijkstraVisitor, ColorMap) [with VertexListGraph = R_adjacency_list<undirectedS, double>; SourceInputIter = long unsigned int*; DijkstraVisitor = dijkstra_visitor<>; PredecessorMap = long unsigned int*; DistanceMap = iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > >, vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>, double, double&>; WeightMap = adj_list_edge_property_map<undirected_tag, double, const double&, long unsigned int, const property<edge_weight_t, double, no_property>, edge_weight_t>; IndexMap = vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>; Compare = std::less<double>; Combine = detail::_project2nd<double, double>; DistInf = double; DistZero = double; ColorMap = two_bit_color_map<vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int> >]’
464 | dijkstra_shortest_paths_no_init(g, s_begin, s_end, predecessor, distance,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
465 | weight, index_map, compare, combine, zero, vis, color);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dijkstra_shortest_paths.hpp:417:28: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, SourceInputIter, SourceInputIter, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistInf, DistZero, DijkstraVisitor, const bgl_named_params<T, Tag, Base>&, typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type) [with VertexListGraph = R_adjacency_list<undirectedS, double>; SourceInputIter = long unsigned int*; DijkstraVisitor = dijkstra_visitor<>; PredecessorMap = long unsigned int*; DistanceMap = iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > >, vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>, double, double&>; WeightMap = adj_list_edge_property_map<undirected_tag, double, const double&, long unsigned int, const property<edge_weight_t, double, no_property>, edge_weight_t>; IndexMap = vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>; Compare = std::less<double>; Combine = detail::_project2nd<double, double>; DistInf = double; DistZero = double; T = char; Tag = detail::unused_tag_type; Base = no_property; typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits<Graph>::traversal_category = undir_adj_list_traversal_tag]’
417 | dijkstra_shortest_paths(g, s_begin, s_end, predecessor, distance, weight,
| ~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
418 | index_map, compare, combine, inf, zero, vis, color);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dijkstra_shortest_paths.hpp:491:28: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dijkstra_shortest_paths.hpp:528:32: required from ‘void boost::detail::dijkstra_dispatch2(const VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list<boost::undirectedS, double>; DistanceMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, double, double&>; WeightMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>; Params = boost::bgl_named_params<_project2nd<double, double>, boost::distance_combine_t, boost::bgl_named_params<std::less<double>, boost::distance_compare_t, boost::bgl_named_params<boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params<long unsigned int*, boost::vertex_predecessor_t, boost::no_property> > > >; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’
528 | dijkstra_shortest_paths(g, s,
| ~~~~~~~~~~~~~~~~~~~~~~~^~~~~~
529 | choose_param(get_param(params, vertex_predecessor), p_map),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
530 | distance, weight, index_map,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~
531 | choose_param(
| ~~~~~~~~~~~~~
532 | get_param(params, distance_compare_t()), std::less< D >()),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
533 | choose_param(
| ~~~~~~~~~~~~~
534 | get_param(params, distance_combine_t()), std::plus< D >()),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
535 | inf, choose_param(get_param(params, distance_zero_t()), D()),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
536 | choose_param(get_param(params, graph_visitor),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
537 | make_dijkstra_visitor(null_visitor())),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
538 | params);
| ~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dijkstra_shortest_paths.hpp:554:35: required from ‘void boost::detail::dijkstra_dispatch1(const VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list<boost::undirectedS, double>; DistanceMap = boost::param_not_found; WeightMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>; Params = boost::bgl_named_params<_project2nd<double, double>, boost::distance_combine_t, boost::bgl_named_params<std::less<double>, boost::distance_compare_t, boost::bgl_named_params<boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params<long unsigned int*, boost::vertex_predecessor_t, boost::no_property> > > >; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’
554 | detail::dijkstra_dispatch2(g, s,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~
555 | choose_param(distance,
| ~~~~~~~~~~~~~~~~~~~~~~
556 | make_iterator_property_map(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~
557 | distance_map.begin(), index_map, distance_map[0])),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
558 | weight, index_map, params);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dijkstra_shortest_paths.hpp:570:31: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with VertexListGraph = R_adjacency_list<undirectedS, double>; Param = detail::_project2nd<double, double>; Tag = distance_combine_t; Rest = bgl_named_params<std::less<double>, distance_compare_t, bgl_named_params<adj_list_edge_property_map<undirected_tag, double, const double&, long unsigned int, const property<edge_weight_t, double, no_property>, edge_weight_t>, edge_weight_t, bgl_named_params<long unsigned int*, vertex_predecessor_t, no_property> > >; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
570 | detail::dijkstra_dispatch1(g, s, get_param(params, vertex_distance),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
571 | choose_const_pmap(get_param(params, edge_weight), g, edge_weight),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
572 | choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
573 | params);
| ~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:43:32: required from ‘void boost::detail::prim_mst_impl(const Graph&, typename boost::graph_traits<Graph>::vertex_descriptor, const boost::bgl_named_params<T, Tag, Base>&, Weight) [with Graph = R_adjacency_list<boost::undirectedS, double>; P = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>; T = boost::edge_weight_t; R = boost::bgl_named_params<long unsigned int*, boost::vertex_predecessor_t, boost::no_property>; Weight = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’
43 | dijkstra_shortest_paths(
| ~~~~~~~~~~~~~~~~~~~~~~~^
44 | G, s, params.distance_compare(compare).distance_combine(combine));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:77:26: required from ‘void boost::prim_minimum_spanning_tree(const VertexListGraph&, PredecessorMap) [with VertexListGraph = R_adjacency_list<undirectedS, double>; PredecessorMap = long unsigned int*]’
77 | detail::prim_mst_impl(g, *vertices(g).first,
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
78 | predecessor_map(p_map).weight_map(get(edge_weight, g)),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
79 | get(edge_weight, g));
| ~~~~~~~~~~~~~~~~~~~~
minST.cpp:89:35: required from here
89 | prim_minimum_spanning_tree(g, &parent[0]);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:65:52: warning: ‘this’ pointer is null [-Wnonnull]
65 | static void failed() { ((Model*)0)->constraints(); }
| ~~~~~~~~~~~~~~~~~~~~~~~~^~
In file included from /home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dijkstra_shortest_paths.hpp:21,
from /home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:15,
from minST.cpp:3:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:37:10: note: in a call to non-static member function ‘void boost::BFSVisitorConcept<Visitor, Graph>::constraints() [with Visitor = boost::detail::dijkstra_bfs_visitor<boost::dijkstra_visitor<>, boost::d_ary_heap_indirect<long unsigned int, 4, boost::iterator_property_map<long unsigned int*, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, double, double&>, std::less<double>, std::vector<long unsigned int> >, boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>, long unsigned int*, boost::iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, double, double&>, boost::detail::_project2nd<double, double>, std::less<double> >; Graph = R_adjacency_list<boost::undirectedS, double>]’
37 | void constraints()
| ^~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::constraint<Model>::failed() [with Model = boost::ReadWritePropertyMapConcept<boost::two_bit_color_map<boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int> >, long unsigned int>]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:59:9: required from ‘void boost::breadth_first_visit(const IncidenceGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with IncidenceGraph = R_adjacency_list<undirectedS, double>; Buffer = d_ary_heap_indirect<long unsigned int, 4, iterator_property_map<long unsigned int*, vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>, iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > >, vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>, double, double&>, std::less<double>, std::vector<long unsigned int> >; BFSVisitor = detail::dijkstra_bfs_visitor<dijkstra_visitor<>, d_ary_heap_indirect<long unsigned int, 4, iterator_property_map<long unsigned int*, vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>, iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > >, vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>, double, double&>, std::less<double>, std::vector<long unsigned int> >, adj_list_edge_property_map<undirected_tag, double, const double&, long unsigned int, const property<edge_weight_t, double, no_property>, edge_weight_t>, long unsigned int*, iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > >, vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>, double, double&>, detail::_project2nd<double, double>, std::less<double> >; ColorMap = two_bit_color_map<vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int> >; SourceIterator = long unsigned int*]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dijkstra_shortest_paths.hpp:387:24: required from ‘void boost::dijkstra_shortest_paths_no_init(const Graph&, SourceInputIter, SourceInputIter, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistZero, DijkstraVisitor, ColorMap) [with Graph = R_adjacency_list<undirectedS, double>; SourceInputIter = long unsigned int*; DijkstraVisitor = dijkstra_visitor<>; PredecessorMap = long unsigned int*; DistanceMap = iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > >, vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>, double, double&>; WeightMap = adj_list_edge_property_map<undirected_tag, double, const double&, long unsigned int, const property<edge_weight_t, double, no_property>, edge_weight_t>; IndexMap = vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>; Compare = std::less<double>; Combine = detail::_project2nd<double, double>; DistZero = double; ColorMap = two_bit_color_map<vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int> >]’
387 | breadth_first_visit(g, s_begin, s_end, Q, bfs_vis, color);
| ~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dijkstra_shortest_paths.hpp:464:36: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, SourceInputIter, SourceInputIter, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistInf, DistZero, DijkstraVisitor, ColorMap) [with VertexListGraph = R_adjacency_list<undirectedS, double>; SourceInputIter = long unsigned int*; DijkstraVisitor = dijkstra_visitor<>; PredecessorMap = long unsigned int*; DistanceMap = iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > >, vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>, double, double&>; WeightMap = adj_list_edge_property_map<undirected_tag, double, const double&, long unsigned int, const property<edge_weight_t, double, no_property>, edge_weight_t>; IndexMap = vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>; Compare = std::less<double>; Combine = detail::_project2nd<double, double>; DistInf = double; DistZero = double; ColorMap = two_bit_color_map<vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int> >]’
464 | dijkstra_shortest_paths_no_init(g, s_begin, s_end, predecessor, distance,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
465 | weight, index_map, compare, combine, zero, vis, color);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dijkstra_shortest_paths.hpp:417:28: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, SourceInputIter, SourceInputIter, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistInf, DistZero, DijkstraVisitor, const bgl_named_params<T, Tag, Base>&, typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type) [with VertexListGraph = R_adjacency_list<undirectedS, double>; SourceInputIter = long unsigned int*; DijkstraVisitor = dijkstra_visitor<>; PredecessorMap = long unsigned int*; DistanceMap = iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > >, vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>, double, double&>; WeightMap = adj_list_edge_property_map<undirected_tag, double, const double&, long unsigned int, const property<edge_weight_t, double, no_property>, edge_weight_t>; IndexMap = vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>; Compare = std::less<double>; Combine = detail::_project2nd<double, double>; DistInf = double; DistZero = double; T = char; Tag = detail::unused_tag_type; Base = no_property; typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<Graph>::traversal_category>::value, graph::detail::no_parameter>::type = graph::detail::no_parameter; typename graph_traits<Graph>::traversal_category = undir_adj_list_traversal_tag]’
417 | dijkstra_shortest_paths(g, s_begin, s_end, predecessor, distance, weight,
| ~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
418 | index_map, compare, combine, inf, zero, vis, color);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dijkstra_shortest_paths.hpp:491:28: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dijkstra_shortest_paths.hpp:528:32: required from ‘void boost::detail::dijkstra_dispatch2(const VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list<boost::undirectedS, double>; DistanceMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, double, double&>; WeightMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>; Params = boost::bgl_named_params<_project2nd<double, double>, boost::distance_combine_t, boost::bgl_named_params<std::less<double>, boost::distance_compare_t, boost::bgl_named_params<boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params<long unsigned int*, boost::vertex_predecessor_t, boost::no_property> > > >; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’
528 | dijkstra_shortest_paths(g, s,
| ~~~~~~~~~~~~~~~~~~~~~~~^~~~~~
529 | choose_param(get_param(params, vertex_predecessor), p_map),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
530 | distance, weight, index_map,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~
531 | choose_param(
| ~~~~~~~~~~~~~
532 | get_param(params, distance_compare_t()), std::less< D >()),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
533 | choose_param(
| ~~~~~~~~~~~~~
534 | get_param(params, distance_combine_t()), std::plus< D >()),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
535 | inf, choose_param(get_param(params, distance_zero_t()), D()),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
536 | choose_param(get_param(params, graph_visitor),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
537 | make_dijkstra_visitor(null_visitor())),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
538 | params);
| ~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dijkstra_shortest_paths.hpp:554:35: required from ‘void boost::detail::dijkstra_dispatch1(const VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list<boost::undirectedS, double>; DistanceMap = boost::param_not_found; WeightMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>; Params = boost::bgl_named_params<_project2nd<double, double>, boost::distance_combine_t, boost::bgl_named_params<std::less<double>, boost::distance_compare_t, boost::bgl_named_params<boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params<long unsigned int*, boost::vertex_predecessor_t, boost::no_property> > > >; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’
554 | detail::dijkstra_dispatch2(g, s,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~
555 | choose_param(distance,
| ~~~~~~~~~~~~~~~~~~~~~~
556 | make_iterator_property_map(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~
557 | distance_map.begin(), index_map, distance_map[0])),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
558 | weight, index_map, params);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dijkstra_shortest_paths.hpp:570:31: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with VertexListGraph = R_adjacency_list<undirectedS, double>; Param = detail::_project2nd<double, double>; Tag = distance_combine_t; Rest = bgl_named_params<std::less<double>, distance_compare_t, bgl_named_params<adj_list_edge_property_map<undirected_tag, double, const double&, long unsigned int, const property<edge_weight_t, double, no_property>, edge_weight_t>, edge_weight_t, bgl_named_params<long unsigned int*, vertex_predecessor_t, no_property> > >; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
570 | detail::dijkstra_dispatch1(g, s, get_param(params, vertex_distance),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
571 | choose_const_pmap(get_param(params, edge_weight), g, edge_weight),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
572 | choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
573 | params);
| ~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:43:32: required from ‘void boost::detail::prim_mst_impl(const Graph&, typename boost::graph_traits<Graph>::vertex_descriptor, const boost::bgl_named_params<T, Tag, Base>&, Weight) [with Graph = R_adjacency_list<boost::undirectedS, double>; P = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>; T = boost::edge_weight_t; R = boost::bgl_named_params<long unsigned int*, boost::vertex_predecessor_t, boost::no_property>; Weight = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’
43 | dijkstra_shortest_paths(
| ~~~~~~~~~~~~~~~~~~~~~~~^
44 | G, s, params.distance_compare(compare).distance_combine(combine));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:77:26: required from ‘void boost::prim_minimum_spanning_tree(const VertexListGraph&, PredecessorMap) [with VertexListGraph = R_adjacency_list<undirectedS, double>; PredecessorMap = long unsigned int*]’
77 | detail::prim_mst_impl(g, *vertices(g).first,
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
78 | predecessor_map(p_map).weight_map(get(edge_weight, g)),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
79 | get(edge_weight, g));
| ~~~~~~~~~~~~~~~~~~~~
minST.cpp:89:35: required from here
89 | prim_minimum_spanning_tree(g, &parent[0]);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:65:52: warning: ‘this’ pointer is null [-Wnonnull]
65 | static void failed() { ((Model*)0)->constraints(); }
| ~~~~~~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:205:10: note: in a call to non-static member function ‘void boost::ReadWritePropertyMapConcept<PMap, Key>::constraints() [with PMap = boost::two_bit_color_map<boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int> >; Key = long unsigned int]’
205 | void constraints() {
| ^~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::concepts::IncidenceGraph<R_adjacency_list<boost::undirectedS, double> >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/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<R_adjacency_list<boost::undirectedS, double> > >]’
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:87:5: required from ‘struct boost::concepts::IncidenceGraph<R_adjacency_list<boost::undirectedS, double> >’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:75:1: required from ‘struct boost::concepts::IncidenceGraphConcept<R_adjacency_list<boost::undirectedS, double> >’
75 | BOOST_concept(IncidenceGraph, (G)) : Graph< G >
| ^~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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<R_adjacency_list<boost::undirectedS, double> >]’
32 | inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
| ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied<boost::concepts::IncidenceGraphConcept<R_adjacency_list<boost::undirectedS, double> > >::value’
44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 8 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dijkstra_shortest_paths.hpp:528:32: required from ‘void boost::detail::dijkstra_dispatch2(const VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list<boost::undirectedS, double>; DistanceMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, double, double&>; WeightMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>; Params = boost::bgl_named_params<_project2nd<double, double>, boost::distance_combine_t, boost::bgl_named_params<std::less<double>, boost::distance_compare_t, boost::bgl_named_params<boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params<long unsigned int*, boost::vertex_predecessor_t, boost::no_property> > > >; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’
528 | dijkstra_shortest_paths(g, s,
| ~~~~~~~~~~~~~~~~~~~~~~~^~~~~~
529 | choose_param(get_param(params, vertex_predecessor), p_map),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
530 | distance, weight, index_map,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~
531 | choose_param(
| ~~~~~~~~~~~~~
532 | get_param(params, distance_compare_t()), std::less< D >()),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
533 | choose_param(
| ~~~~~~~~~~~~~
534 | get_param(params, distance_combine_t()), std::plus< D >()),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
535 | inf, choose_param(get_param(params, distance_zero_t()), D()),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
536 | choose_param(get_param(params, graph_visitor),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
537 | make_dijkstra_visitor(null_visitor())),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
538 | params);
| ~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dijkstra_shortest_paths.hpp:554:35: required from ‘void boost::detail::dijkstra_dispatch1(const VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list<boost::undirectedS, double>; DistanceMap = boost::param_not_found; WeightMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>; Params = boost::bgl_named_params<_project2nd<double, double>, boost::distance_combine_t, boost::bgl_named_params<std::less<double>, boost::distance_compare_t, boost::bgl_named_params<boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params<long unsigned int*, boost::vertex_predecessor_t, boost::no_property> > > >; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’
554 | detail::dijkstra_dispatch2(g, s,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~
555 | choose_param(distance,
| ~~~~~~~~~~~~~~~~~~~~~~
556 | make_iterator_property_map(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~
557 | distance_map.begin(), index_map, distance_map[0])),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
558 | weight, index_map, params);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dijkstra_shortest_paths.hpp:570:31: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with VertexListGraph = R_adjacency_list<undirectedS, double>; Param = detail::_project2nd<double, double>; Tag = distance_combine_t; Rest = bgl_named_params<std::less<double>, distance_compare_t, bgl_named_params<adj_list_edge_property_map<undirected_tag, double, const double&, long unsigned int, const property<edge_weight_t, double, no_property>, edge_weight_t>, edge_weight_t, bgl_named_params<long unsigned int*, vertex_predecessor_t, no_property> > >; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
570 | detail::dijkstra_dispatch1(g, s, get_param(params, vertex_distance),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
571 | choose_const_pmap(get_param(params, edge_weight), g, edge_weight),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
572 | choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
573 | params);
| ~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:43:32: required from ‘void boost::detail::prim_mst_impl(const Graph&, typename boost::graph_traits<Graph>::vertex_descriptor, const boost::bgl_named_params<T, Tag, Base>&, Weight) [with Graph = R_adjacency_list<boost::undirectedS, double>; P = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>; T = boost::edge_weight_t; R = boost::bgl_named_params<long unsigned int*, boost::vertex_predecessor_t, boost::no_property>; Weight = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’
43 | dijkstra_shortest_paths(
| ~~~~~~~~~~~~~~~~~~~~~~~^
44 | G, s, params.distance_compare(compare).distance_combine(combine));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:77:26: required from ‘void boost::prim_minimum_spanning_tree(const VertexListGraph&, PredecessorMap) [with VertexListGraph = R_adjacency_list<undirectedS, double>; PredecessorMap = long unsigned int*]’
77 | detail::prim_mst_impl(g, *vertices(g).first,
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
78 | predecessor_map(p_map).weight_map(get(edge_weight, g)),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
79 | get(edge_weight, g));
| ~~~~~~~~~~~~~~~~~~~~
minST.cpp:89:35: required from here
89 | prim_minimum_spanning_tree(g, &parent[0]);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
20 | ~usage_requirements() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::concepts::IncidenceGraph<G>::~IncidenceGraph() [with G = R_adjacency_list<boost::undirectedS, double>]’
37 | ~model()
| ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:87:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
87 | BOOST_CONCEPT_USAGE(IncidenceGraph)
| ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::CopyConstructible<boost::detail::dijkstra_bfs_visitor<boost::dijkstra_visitor<>, boost::d_ary_heap_indirect<long unsigned int, 4, boost::iterator_property_map<long unsigned int*, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, double, double&>, std::less<double>, std::vector<long unsigned int> >, boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>, long unsigned int*, boost::iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, double, double&>, boost::detail::_project2nd<double, double>, std::less<double> > > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:167:5: required from ‘struct boost::CopyConstructible<boost::detail::dijkstra_bfs_visitor<boost::dijkstra_visitor<>, boost::d_ary_heap_indirect<long unsigned int, 4, boost::iterator_property_map<long unsigned int*, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, double, double&>, std::less<double>, std::vector<long unsigned int> >, boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>, long unsigned int*, boost::iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, double, double&>, boost::detail::_project2nd<double, double>, std::less<double> > >’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:165:3: required from ‘struct boost::CopyConstructibleConcept<boost::detail::dijkstra_bfs_visitor<boost::dijkstra_visitor<>, boost::d_ary_heap_indirect<long unsigned int, 4, boost::iterator_property_map<long unsigned int*, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, double, double&>, std::less<double>, std::vector<long unsigned int> >, boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>, long unsigned int*, boost::iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, double, double&>, boost::detail::_project2nd<double, double>, std::less<double> > >’
165 | BOOST_concept(CopyConstructible,(TT))
| ^~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::CopyConstructibleConcept<boost::detail::dijkstra_bfs_visitor<boost::dijkstra_visitor<>, boost::d_ary_heap_indirect<long unsigned int, 4, boost::iterator_property_map<long unsigned int*, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, double, double&>, std::less<double>, std::vector<long unsigned int> >, boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>, long unsigned int*, boost::iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, double, double&>, boost::detail::_project2nd<double, double>, std::less<double> > >]’
32 | inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
| ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied<boost::CopyConstructibleConcept<boost::detail::dijkstra_bfs_visitor<boost::dijkstra_visitor<>, boost::d_ary_heap_indirect<long unsigned int, 4, boost::iterator_property_map<long unsigned int*, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, double, double&>, std::less<double>, std::vector<long unsigned int> >, boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>, long unsigned int*, boost::iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, double, double&>, boost::detail::_project2nd<double, double>, std::less<double> > > >::value’
44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied<boost::CopyConstructibleConcept<boost::detail::dijkstra_bfs_visitor<boost::dijkstra_visitor<>, boost::d_ary_heap_indirect<long unsigned int, 4, boost::iterator_property_map<long unsigned int*, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, double, double&>, std::less<double>, std::vector<long unsigned int> >, boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>, long unsigned int*, boost::iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, double, double&>, boost::detail::_project2nd<double, double>, std::less<double> > > >’
45 | typedef boost::integral_constant<bool, value> type;
| ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 12 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dijkstra_shortest_paths.hpp:528:32: required from ‘void boost::detail::dijkstra_dispatch2(const VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list<boost::undirectedS, double>; DistanceMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, double, double&>; WeightMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>; Params = boost::bgl_named_params<_project2nd<double, double>, boost::distance_combine_t, boost::bgl_named_params<std::less<double>, boost::distance_compare_t, boost::bgl_named_params<boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params<long unsigned int*, boost::vertex_predecessor_t, boost::no_property> > > >; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’
528 | dijkstra_shortest_paths(g, s,
| ~~~~~~~~~~~~~~~~~~~~~~~^~~~~~
529 | choose_param(get_param(params, vertex_predecessor), p_map),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
530 | distance, weight, index_map,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~
531 | choose_param(
| ~~~~~~~~~~~~~
532 | get_param(params, distance_compare_t()), std::less< D >()),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
533 | choose_param(
| ~~~~~~~~~~~~~
534 | get_param(params, distance_combine_t()), std::plus< D >()),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
535 | inf, choose_param(get_param(params, distance_zero_t()), D()),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
536 | choose_param(get_param(params, graph_visitor),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
537 | make_dijkstra_visitor(null_visitor())),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
538 | params);
| ~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dijkstra_shortest_paths.hpp:554:35: required from ‘void boost::detail::dijkstra_dispatch1(const VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list<boost::undirectedS, double>; DistanceMap = boost::param_not_found; WeightMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>; Params = boost::bgl_named_params<_project2nd<double, double>, boost::distance_combine_t, boost::bgl_named_params<std::less<double>, boost::distance_compare_t, boost::bgl_named_params<boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params<long unsigned int*, boost::vertex_predecessor_t, boost::no_property> > > >; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’
554 | detail::dijkstra_dispatch2(g, s,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~
555 | choose_param(distance,
| ~~~~~~~~~~~~~~~~~~~~~~
556 | make_iterator_property_map(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~
557 | distance_map.begin(), index_map, distance_map[0])),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
558 | weight, index_map, params);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dijkstra_shortest_paths.hpp:570:31: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with VertexListGraph = R_adjacency_list<undirectedS, double>; Param = detail::_project2nd<double, double>; Tag = distance_combine_t; Rest = bgl_named_params<std::less<double>, distance_compare_t, bgl_named_params<adj_list_edge_property_map<undirected_tag, double, const double&, long unsigned int, const property<edge_weight_t, double, no_property>, edge_weight_t>, edge_weight_t, bgl_named_params<long unsigned int*, vertex_predecessor_t, no_property> > >; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
570 | detail::dijkstra_dispatch1(g, s, get_param(params, vertex_distance),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
571 | choose_const_pmap(get_param(params, edge_weight), g, edge_weight),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
572 | choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
573 | params);
| ~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:43:32: required from ‘void boost::detail::prim_mst_impl(const Graph&, typename boost::graph_traits<Graph>::vertex_descriptor, const boost::bgl_named_params<T, Tag, Base>&, Weight) [with Graph = R_adjacency_list<boost::undirectedS, double>; P = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>; T = boost::edge_weight_t; R = boost::bgl_named_params<long unsigned int*, boost::vertex_predecessor_t, boost::no_property>; Weight = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’
43 | dijkstra_shortest_paths(
| ~~~~~~~~~~~~~~~~~~~~~~~^
44 | G, s, params.distance_compare(compare).distance_combine(combine));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:77:26: required from ‘void boost::prim_minimum_spanning_tree(const VertexListGraph&, PredecessorMap) [with VertexListGraph = R_adjacency_list<undirectedS, double>; PredecessorMap = long unsigned int*]’
77 | detail::prim_mst_impl(g, *vertices(g).first,
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
78 | predecessor_map(p_map).weight_map(get(edge_weight, g)),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
79 | get(edge_weight, g));
| ~~~~~~~~~~~~~~~~~~~~
minST.cpp:89:35: required from here
89 | prim_minimum_spanning_tree(g, &parent[0]);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::CopyConstructible<boost::detail::dijkstra_bfs_visitor<boost::dijkstra_visitor<>, boost::d_ary_heap_indirect<long unsigned int, 4, boost::iterator_property_map<long unsigned int*, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, double, double&>, std::less<double>, std::vector<long unsigned int> >, boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>, long unsigned int*, boost::iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, double, double&>, boost::detail::_project2nd<double, double>, std::less<double> > >]’
20 | ~usage_requirements() { ((Model*)0)->~Model(); }
| ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::CopyConstructibleConcept<boost::detail::dijkstra_bfs_visitor<boost::dijkstra_visitor<>, boost::d_ary_heap_indirect<long unsigned int, 4, boost::iterator_property_map<long unsigned int*, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, double, double&>, std::less<double>, std::vector<long unsigned int> >, boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>, long unsigned int*, boost::iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, double, double&>, boost::detail::_project2nd<double, double>, std::less<double> > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:39:9: required from ‘void boost::BFSVisitorConcept<Visitor, Graph>::constraints() [with Visitor = boost::detail::dijkstra_bfs_visitor<boost::dijkstra_visitor<>, boost::d_ary_heap_indirect<long unsigned int, 4, boost::iterator_property_map<long unsigned int*, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, double, double&>, std::less<double>, std::vector<long unsigned int> >, boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>, long unsigned int*, boost::iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, double, double&>, boost::detail::_project2nd<double, double>, std::less<double> >; Graph = R_adjacency_list<boost::undirectedS, double>]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::BFSVisitorConcept<boost::detail::dijkstra_bfs_visitor<boost::dijkstra_visitor<>, boost::d_ary_heap_indirect<long unsigned int, 4, boost::iterator_property_map<long unsigned int*, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, double, double&>, std::less<double>, std::vector<long unsigned int> >, boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>, long unsigned int*, boost::iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, double, double&>, boost::detail::_project2nd<double, double>, std::less<double> >, R_adjacency_list<boost::undirectedS, double> >]’
32 | inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
| ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied<boost::BFSVisitorConcept<boost::detail::dijkstra_bfs_visitor<boost::dijkstra_visitor<>, boost::d_ary_heap_indirect<long unsigned int, 4, boost::iterator_property_map<long unsigned int*, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, double, double&>, std::less<double>, std::vector<long unsigned int> >, boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>, long unsigned int*, boost::iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, double, double&>, boost::detail::_project2nd<double, double>, std::less<double> >, R_adjacency_list<boost::undirectedS, double> > >::value’
44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied<boost::BFSVisitorConcept<boost::detail::dijkstra_bfs_visitor<boost::dijkstra_visitor<>, boost::d_ary_heap_indirect<long unsigned int, 4, boost::iterator_property_map<long unsigned int*, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, double, double&>, std::less<double>, std::vector<long unsigned int> >, boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>, long unsigned int*, boost::iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, double, double&>, boost::detail::_project2nd<double, double>, std::less<double> >, R_adjacency_list<boost::undirectedS, double> > >’
45 | typedef boost::integral_constant<bool, value> type;
| ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_<void (*)(boost::BFSVisitorConcept<boost::detail::dijkstra_bfs_visitor<boost::dijkstra_visitor<>, boost::d_ary_heap_indirect<long unsigned int, 4, boost::iterator_property_map<long unsigned int*, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, double, double&>, std::less<double>, std::vector<long unsigned int> >, boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>, long unsigned int*, boost::iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, double, double&>, boost::detail::_project2nd<double, double>, std::less<double> >, R_adjacency_list<boost::undirectedS, double> >)>’
72 | struct requirement_<void(*)(Model)>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:65:5: [ skipping 6 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dijkstra_shortest_paths.hpp:528:32: required from ‘void boost::detail::dijkstra_dispatch2(const VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list<boost::undirectedS, double>; DistanceMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, double, double&>; WeightMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>; Params = boost::bgl_named_params<_project2nd<double, double>, boost::distance_combine_t, boost::bgl_named_params<std::less<double>, boost::distance_compare_t, boost::bgl_named_params<boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params<long unsigned int*, boost::vertex_predecessor_t, boost::no_property> > > >; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’
528 | dijkstra_shortest_paths(g, s,
| ~~~~~~~~~~~~~~~~~~~~~~~^~~~~~
529 | choose_param(get_param(params, vertex_predecessor), p_map),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
530 | distance, weight, index_map,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~
531 | choose_param(
| ~~~~~~~~~~~~~
532 | get_param(params, distance_compare_t()), std::less< D >()),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
533 | choose_param(
| ~~~~~~~~~~~~~
534 | get_param(params, distance_combine_t()), std::plus< D >()),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
535 | inf, choose_param(get_param(params, distance_zero_t()), D()),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
536 | choose_param(get_param(params, graph_visitor),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
537 | make_dijkstra_visitor(null_visitor())),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
538 | params);
| ~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dijkstra_shortest_paths.hpp:554:35: required from ‘void boost::detail::dijkstra_dispatch1(const VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list<boost::undirectedS, double>; DistanceMap = boost::param_not_found; WeightMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>; Params = boost::bgl_named_params<_project2nd<double, double>, boost::distance_combine_t, boost::bgl_named_params<std::less<double>, boost::distance_compare_t, boost::bgl_named_params<boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params<long unsigned int*, boost::vertex_predecessor_t, boost::no_property> > > >; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’
554 | detail::dijkstra_dispatch2(g, s,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~
555 | choose_param(distance,
| ~~~~~~~~~~~~~~~~~~~~~~
556 | make_iterator_property_map(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~
557 | distance_map.begin(), index_map, distance_map[0])),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
558 | weight, index_map, params);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dijkstra_shortest_paths.hpp:570:31: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with VertexListGraph = R_adjacency_list<undirectedS, double>; Param = detail::_project2nd<double, double>; Tag = distance_combine_t; Rest = bgl_named_params<std::less<double>, distance_compare_t, bgl_named_params<adj_list_edge_property_map<undirected_tag, double, const double&, long unsigned int, const property<edge_weight_t, double, no_property>, edge_weight_t>, edge_weight_t, bgl_named_params<long unsigned int*, vertex_predecessor_t, no_property> > >; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
570 | detail::dijkstra_dispatch1(g, s, get_param(params, vertex_distance),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
571 | choose_const_pmap(get_param(params, edge_weight), g, edge_weight),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
572 | choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
573 | params);
| ~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:43:32: required from ‘void boost::detail::prim_mst_impl(const Graph&, typename boost::graph_traits<Graph>::vertex_descriptor, const boost::bgl_named_params<T, Tag, Base>&, Weight) [with Graph = R_adjacency_list<boost::undirectedS, double>; P = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>; T = boost::edge_weight_t; R = boost::bgl_named_params<long unsigned int*, boost::vertex_predecessor_t, boost::no_property>; Weight = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’
43 | dijkstra_shortest_paths(
| ~~~~~~~~~~~~~~~~~~~~~~~^
44 | G, s, params.distance_compare(compare).distance_combine(combine));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:77:26: required from ‘void boost::prim_minimum_spanning_tree(const VertexListGraph&, PredecessorMap) [with VertexListGraph = R_adjacency_list<undirectedS, double>; PredecessorMap = long unsigned int*]’
77 | detail::prim_mst_impl(g, *vertices(g).first,
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
78 | predecessor_map(p_map).weight_map(get(edge_weight, g)),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
79 | get(edge_weight, g));
| ~~~~~~~~~~~~~~~~~~~~
minST.cpp:89:35: required from here
89 | prim_minimum_spanning_tree(g, &parent[0]);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:165:17: note: in a call to non-static member function ‘boost::CopyConstructibleConcept<boost::detail::dijkstra_bfs_visitor<boost::dijkstra_visitor<>, boost::d_ary_heap_indirect<long unsigned int, 4, boost::iterator_property_map<long unsigned int*, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, double, double&>, std::less<double>, std::vector<long unsigned int> >, boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>, long unsigned int*, boost::iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, double, double&>, boost::detail::_project2nd<double, double>, std::less<double> > >::~CopyConstructibleConcept()’
165 | BOOST_concept(CopyConstructible,(TT))
| ^~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/preprocessor/cat.hpp:29:34: note: in definition of macro ‘BOOST_PP_CAT_I’
29 | # define BOOST_PP_CAT_I(a, b) a ## b
| ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/concept_def.hpp:23:12: note: in expansion of macro ‘BOOST_PP_CAT’
23 | struct BOOST_PP_CAT(name,Concept) \
| ^~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:165:3: note: in expansion of macro ‘BOOST_concept’
165 | BOOST_concept(CopyConstructible,(TT))
| ^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::constraint<Model>::failed() [with Model = boost::ReadablePropertyMapConcept<boost::two_bit_color_map<boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int> >, long unsigned int>]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:206:7: required from ‘void boost::ReadWritePropertyMapConcept<PMap, Key>::constraints() [with PMap = boost::two_bit_color_map<boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int> >; Key = long unsigned int]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::ReadWritePropertyMapConcept<boost::two_bit_color_map<boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int> >, long unsigned int>]’
32 | inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
| ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied<boost::ReadWritePropertyMapConcept<boost::two_bit_color_map<boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int> >, long unsigned int> >::value’
44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied<boost::ReadWritePropertyMapConcept<boost::two_bit_color_map<boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int> >, long unsigned int> >’
45 | typedef boost::integral_constant<bool, value> type;
| ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_<void (*)(boost::ReadWritePropertyMapConcept<boost::two_bit_color_map<boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int> >, long unsigned int>)>’
72 | struct requirement_<void(*)(Model)>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:59:9: [ skipping 6 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dijkstra_shortest_paths.hpp:528:32: required from ‘void boost::detail::dijkstra_dispatch2(const VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list<boost::undirectedS, double>; DistanceMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, double, double&>; WeightMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>; Params = boost::bgl_named_params<_project2nd<double, double>, boost::distance_combine_t, boost::bgl_named_params<std::less<double>, boost::distance_compare_t, boost::bgl_named_params<boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params<long unsigned int*, boost::vertex_predecessor_t, boost::no_property> > > >; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’
528 | dijkstra_shortest_paths(g, s,
| ~~~~~~~~~~~~~~~~~~~~~~~^~~~~~
529 | choose_param(get_param(params, vertex_predecessor), p_map),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
530 | distance, weight, index_map,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~
531 | choose_param(
| ~~~~~~~~~~~~~
532 | get_param(params, distance_compare_t()), std::less< D >()),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
533 | choose_param(
| ~~~~~~~~~~~~~
534 | get_param(params, distance_combine_t()), std::plus< D >()),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
535 | inf, choose_param(get_param(params, distance_zero_t()), D()),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
536 | choose_param(get_param(params, graph_visitor),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
537 | make_dijkstra_visitor(null_visitor())),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
538 | params);
| ~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dijkstra_shortest_paths.hpp:554:35: required from ‘void boost::detail::dijkstra_dispatch1(const VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list<boost::undirectedS, double>; DistanceMap = boost::param_not_found; WeightMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>; Params = boost::bgl_named_params<_project2nd<double, double>, boost::distance_combine_t, boost::bgl_named_params<std::less<double>, boost::distance_compare_t, boost::bgl_named_params<boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params<long unsigned int*, boost::vertex_predecessor_t, boost::no_property> > > >; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’
554 | detail::dijkstra_dispatch2(g, s,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~
555 | choose_param(distance,
| ~~~~~~~~~~~~~~~~~~~~~~
556 | make_iterator_property_map(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~
557 | distance_map.begin(), index_map, distance_map[0])),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
558 | weight, index_map, params);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dijkstra_shortest_paths.hpp:570:31: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with VertexListGraph = R_adjacency_list<undirectedS, double>; Param = detail::_project2nd<double, double>; Tag = distance_combine_t; Rest = bgl_named_params<std::less<double>, distance_compare_t, bgl_named_params<adj_list_edge_property_map<undirected_tag, double, const double&, long unsigned int, const property<edge_weight_t, double, no_property>, edge_weight_t>, edge_weight_t, bgl_named_params<long unsigned int*, vertex_predecessor_t, no_property> > >; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
570 | detail::dijkstra_dispatch1(g, s, get_param(params, vertex_distance),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
571 | choose_const_pmap(get_param(params, edge_weight), g, edge_weight),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
572 | choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
573 | params);
| ~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:43:32: required from ‘void boost::detail::prim_mst_impl(const Graph&, typename boost::graph_traits<Graph>::vertex_descriptor, const boost::bgl_named_params<T, Tag, Base>&, Weight) [with Graph = R_adjacency_list<boost::undirectedS, double>; P = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>; T = boost::edge_weight_t; R = boost::bgl_named_params<long unsigned int*, boost::vertex_predecessor_t, boost::no_property>; Weight = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’
43 | dijkstra_shortest_paths(
| ~~~~~~~~~~~~~~~~~~~~~~~^
44 | G, s, params.distance_compare(compare).distance_combine(combine));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:77:26: required from ‘void boost::prim_minimum_spanning_tree(const VertexListGraph&, PredecessorMap) [with VertexListGraph = R_adjacency_list<undirectedS, double>; PredecessorMap = long unsigned int*]’
77 | detail::prim_mst_impl(g, *vertices(g).first,
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
78 | predecessor_map(p_map).weight_map(get(edge_weight, g)),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
79 | get(edge_weight, g));
| ~~~~~~~~~~~~~~~~~~~~
minST.cpp:89:35: required from here
89 | prim_minimum_spanning_tree(g, &parent[0]);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:65:52: warning: ‘this’ pointer is null [-Wnonnull]
65 | static void failed() { ((Model*)0)->constraints(); }
| ~~~~~~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:147:10: note: in a call to non-static member function ‘void boost::ReadablePropertyMapConcept<PMap, Key>::constraints() [with PMap = boost::two_bit_color_map<boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int> >; Key = long unsigned int]’
147 | void constraints() {
| ^~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::constraint<Model>::failed() [with Model = boost::WritablePropertyMapConcept<boost::two_bit_color_map<boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int> >, long unsigned int>]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:207:7: required from ‘void boost::ReadWritePropertyMapConcept<PMap, Key>::constraints() [with PMap = boost::two_bit_color_map<boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int> >; Key = long unsigned int]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::ReadWritePropertyMapConcept<boost::two_bit_color_map<boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int> >, long unsigned int>]’
32 | inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
| ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied<boost::ReadWritePropertyMapConcept<boost::two_bit_color_map<boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int> >, long unsigned int> >::value’
44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied<boost::ReadWritePropertyMapConcept<boost::two_bit_color_map<boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int> >, long unsigned int> >’
45 | typedef boost::integral_constant<bool, value> type;
| ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_<void (*)(boost::ReadWritePropertyMapConcept<boost::two_bit_color_map<boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int> >, long unsigned int>)>’
72 | struct requirement_<void(*)(Model)>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:59:9: [ skipping 6 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dijkstra_shortest_paths.hpp:528:32: required from ‘void boost::detail::dijkstra_dispatch2(const VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list<boost::undirectedS, double>; DistanceMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, double, double&>; WeightMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>; Params = boost::bgl_named_params<_project2nd<double, double>, boost::distance_combine_t, boost::bgl_named_params<std::less<double>, boost::distance_compare_t, boost::bgl_named_params<boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params<long unsigned int*, boost::vertex_predecessor_t, boost::no_property> > > >; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’
528 | dijkstra_shortest_paths(g, s,
| ~~~~~~~~~~~~~~~~~~~~~~~^~~~~~
529 | choose_param(get_param(params, vertex_predecessor), p_map),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
530 | distance, weight, index_map,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~
531 | choose_param(
| ~~~~~~~~~~~~~
532 | get_param(params, distance_compare_t()), std::less< D >()),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
533 | choose_param(
| ~~~~~~~~~~~~~
534 | get_param(params, distance_combine_t()), std::plus< D >()),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
535 | inf, choose_param(get_param(params, distance_zero_t()), D()),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
536 | choose_param(get_param(params, graph_visitor),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
537 | make_dijkstra_visitor(null_visitor())),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
538 | params);
| ~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dijkstra_shortest_paths.hpp:554:35: required from ‘void boost::detail::dijkstra_dispatch1(const VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list<boost::undirectedS, double>; DistanceMap = boost::param_not_found; WeightMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>; Params = boost::bgl_named_params<_project2nd<double, double>, boost::distance_combine_t, boost::bgl_named_params<std::less<double>, boost::distance_compare_t, boost::bgl_named_params<boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params<long unsigned int*, boost::vertex_predecessor_t, boost::no_property> > > >; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’
554 | detail::dijkstra_dispatch2(g, s,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~
555 | choose_param(distance,
| ~~~~~~~~~~~~~~~~~~~~~~
556 | make_iterator_property_map(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~
557 | distance_map.begin(), index_map, distance_map[0])),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
558 | weight, index_map, params);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dijkstra_shortest_paths.hpp:570:31: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with VertexListGraph = R_adjacency_list<undirectedS, double>; Param = detail::_project2nd<double, double>; Tag = distance_combine_t; Rest = bgl_named_params<std::less<double>, distance_compare_t, bgl_named_params<adj_list_edge_property_map<undirected_tag, double, const double&, long unsigned int, const property<edge_weight_t, double, no_property>, edge_weight_t>, edge_weight_t, bgl_named_params<long unsigned int*, vertex_predecessor_t, no_property> > >; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
570 | detail::dijkstra_dispatch1(g, s, get_param(params, vertex_distance),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
571 | choose_const_pmap(get_param(params, edge_weight), g, edge_weight),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
572 | choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
573 | params);
| ~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:43:32: required from ‘void boost::detail::prim_mst_impl(const Graph&, typename boost::graph_traits<Graph>::vertex_descriptor, const boost::bgl_named_params<T, Tag, Base>&, Weight) [with Graph = R_adjacency_list<boost::undirectedS, double>; P = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>; T = boost::edge_weight_t; R = boost::bgl_named_params<long unsigned int*, boost::vertex_predecessor_t, boost::no_property>; Weight = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’
43 | dijkstra_shortest_paths(
| ~~~~~~~~~~~~~~~~~~~~~~~^
44 | G, s, params.distance_compare(compare).distance_combine(combine));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:77:26: required from ‘void boost::prim_minimum_spanning_tree(const VertexListGraph&, PredecessorMap) [with VertexListGraph = R_adjacency_list<undirectedS, double>; PredecessorMap = long unsigned int*]’
77 | detail::prim_mst_impl(g, *vertices(g).first,
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
78 | predecessor_map(p_map).weight_map(get(edge_weight, g)),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
79 | get(edge_weight, g));
| ~~~~~~~~~~~~~~~~~~~~
minST.cpp:89:35: required from here
89 | prim_minimum_spanning_tree(g, &parent[0]);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:65:52: warning: ‘this’ pointer is null [-Wnonnull]
65 | static void failed() { ((Model*)0)->constraints(); }
| ~~~~~~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:179:10: note: in a call to non-static member function ‘void boost::WritablePropertyMapConcept<PMap, Key>::constraints() [with PMap = boost::two_bit_color_map<boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int> >; Key = long unsigned int]’
179 | void constraints() {
| ^~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Convertible<boost::read_write_property_map_tag, boost::read_write_property_map_tag> >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible<boost::read_write_property_map_tag, boost::read_write_property_map_tag>’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:206:3: required from ‘struct boost::ConvertibleConcept<boost::read_write_property_map_tag, boost::read_write_property_map_tag>’
206 | BOOST_concept(Convertible,(X)(Y))
| ^~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::ConvertibleConcept<boost::read_write_property_map_tag, boost::read_write_property_map_tag>]’
32 | inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
| ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied<boost::ConvertibleConcept<boost::read_write_property_map_tag, boost::read_write_property_map_tag> >::value’
44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied<boost::ConvertibleConcept<boost::read_write_property_map_tag, boost::read_write_property_map_tag> >’
45 | typedef boost::integral_constant<bool, value> type;
| ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 12 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dijkstra_shortest_paths.hpp:528:32: required from ‘void boost::detail::dijkstra_dispatch2(const VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list<boost::undirectedS, double>; DistanceMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, double, double&>; WeightMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>; Params = boost::bgl_named_params<_project2nd<double, double>, boost::distance_combine_t, boost::bgl_named_params<std::less<double>, boost::distance_compare_t, boost::bgl_named_params<boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params<long unsigned int*, boost::vertex_predecessor_t, boost::no_property> > > >; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’
528 | dijkstra_shortest_paths(g, s,
| ~~~~~~~~~~~~~~~~~~~~~~~^~~~~~
529 | choose_param(get_param(params, vertex_predecessor), p_map),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
530 | distance, weight, index_map,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~
531 | choose_param(
| ~~~~~~~~~~~~~
532 | get_param(params, distance_compare_t()), std::less< D >()),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
533 | choose_param(
| ~~~~~~~~~~~~~
534 | get_param(params, distance_combine_t()), std::plus< D >()),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
535 | inf, choose_param(get_param(params, distance_zero_t()), D()),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
536 | choose_param(get_param(params, graph_visitor),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
537 | make_dijkstra_visitor(null_visitor())),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
538 | params);
| ~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dijkstra_shortest_paths.hpp:554:35: required from ‘void boost::detail::dijkstra_dispatch1(const VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list<boost::undirectedS, double>; DistanceMap = boost::param_not_found; WeightMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>; Params = boost::bgl_named_params<_project2nd<double, double>, boost::distance_combine_t, boost::bgl_named_params<std::less<double>, boost::distance_compare_t, boost::bgl_named_params<boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params<long unsigned int*, boost::vertex_predecessor_t, boost::no_property> > > >; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’
554 | detail::dijkstra_dispatch2(g, s,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~
555 | choose_param(distance,
| ~~~~~~~~~~~~~~~~~~~~~~
556 | make_iterator_property_map(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~
557 | distance_map.begin(), index_map, distance_map[0])),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
558 | weight, index_map, params);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dijkstra_shortest_paths.hpp:570:31: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with VertexListGraph = R_adjacency_list<undirectedS, double>; Param = detail::_project2nd<double, double>; Tag = distance_combine_t; Rest = bgl_named_params<std::less<double>, distance_compare_t, bgl_named_params<adj_list_edge_property_map<undirected_tag, double, const double&, long unsigned int, const property<edge_weight_t, double, no_property>, edge_weight_t>, edge_weight_t, bgl_named_params<long unsigned int*, vertex_predecessor_t, no_property> > >; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
570 | detail::dijkstra_dispatch1(g, s, get_param(params, vertex_distance),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
571 | choose_const_pmap(get_param(params, edge_weight), g, edge_weight),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
572 | choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
573 | params);
| ~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:43:32: required from ‘void boost::detail::prim_mst_impl(const Graph&, typename boost::graph_traits<Graph>::vertex_descriptor, const boost::bgl_named_params<T, Tag, Base>&, Weight) [with Graph = R_adjacency_list<boost::undirectedS, double>; P = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>; T = boost::edge_weight_t; R = boost::bgl_named_params<long unsigned int*, boost::vertex_predecessor_t, boost::no_property>; Weight = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’
43 | dijkstra_shortest_paths(
| ~~~~~~~~~~~~~~~~~~~~~~~^
44 | G, s, params.distance_compare(compare).distance_combine(combine));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:77:26: required from ‘void boost::prim_minimum_spanning_tree(const VertexListGraph&, PredecessorMap) [with VertexListGraph = R_adjacency_list<undirectedS, double>; PredecessorMap = long unsigned int*]’
77 | detail::prim_mst_impl(g, *vertices(g).first,
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
78 | predecessor_map(p_map).weight_map(get(edge_weight, g)),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
79 | get(edge_weight, g));
| ~~~~~~~~~~~~~~~~~~~~
minST.cpp:89:35: required from here
89 | prim_minimum_spanning_tree(g, &parent[0]);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Convertible<boost::read_write_property_map_tag, boost::read_write_property_map_tag>]’
20 | ~usage_requirements() { ((Model*)0)->~Model(); }
| ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::ConvertibleConcept<boost::read_write_property_map_tag, boost::read_write_property_map_tag>]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:208:7: required from ‘void boost::ReadWritePropertyMapConcept<PMap, Key>::constraints() [with PMap = boost::two_bit_color_map<boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int> >; Key = long unsigned int]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::ReadWritePropertyMapConcept<boost::two_bit_color_map<boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int> >, long unsigned int>]’
32 | inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
| ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied<boost::ReadWritePropertyMapConcept<boost::two_bit_color_map<boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int> >, long unsigned int> >::value’
44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied<boost::ReadWritePropertyMapConcept<boost::two_bit_color_map<boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int> >, long unsigned int> >’
45 | typedef boost::integral_constant<bool, value> type;
| ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_<void (*)(boost::ReadWritePropertyMapConcept<boost::two_bit_color_map<boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int> >, long unsigned int>)>’
72 | struct requirement_<void(*)(Model)>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:59:9: [ skipping 6 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dijkstra_shortest_paths.hpp:528:32: required from ‘void boost::detail::dijkstra_dispatch2(const VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list<boost::undirectedS, double>; DistanceMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, double, double&>; WeightMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>; Params = boost::bgl_named_params<_project2nd<double, double>, boost::distance_combine_t, boost::bgl_named_params<std::less<double>, boost::distance_compare_t, boost::bgl_named_params<boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params<long unsigned int*, boost::vertex_predecessor_t, boost::no_property> > > >; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’
528 | dijkstra_shortest_paths(g, s,
| ~~~~~~~~~~~~~~~~~~~~~~~^~~~~~
529 | choose_param(get_param(params, vertex_predecessor), p_map),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
530 | distance, weight, index_map,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~
531 | choose_param(
| ~~~~~~~~~~~~~
532 | get_param(params, distance_compare_t()), std::less< D >()),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
533 | choose_param(
| ~~~~~~~~~~~~~
534 | get_param(params, distance_combine_t()), std::plus< D >()),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
535 | inf, choose_param(get_param(params, distance_zero_t()), D()),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
536 | choose_param(get_param(params, graph_visitor),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
537 | make_dijkstra_visitor(null_visitor())),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
538 | params);
| ~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dijkstra_shortest_paths.hpp:554:35: required from ‘void boost::detail::dijkstra_dispatch1(const VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list<boost::undirectedS, double>; DistanceMap = boost::param_not_found; WeightMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>; Params = boost::bgl_named_params<_project2nd<double, double>, boost::distance_combine_t, boost::bgl_named_params<std::less<double>, boost::distance_compare_t, boost::bgl_named_params<boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params<long unsigned int*, boost::vertex_predecessor_t, boost::no_property> > > >; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’
554 | detail::dijkstra_dispatch2(g, s,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~
555 | choose_param(distance,
| ~~~~~~~~~~~~~~~~~~~~~~
556 | make_iterator_property_map(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~
557 | distance_map.begin(), index_map, distance_map[0])),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
558 | weight, index_map, params);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dijkstra_shortest_paths.hpp:570:31: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with VertexListGraph = R_adjacency_list<undirectedS, double>; Param = detail::_project2nd<double, double>; Tag = distance_combine_t; Rest = bgl_named_params<std::less<double>, distance_compare_t, bgl_named_params<adj_list_edge_property_map<undirected_tag, double, const double&, long unsigned int, const property<edge_weight_t, double, no_property>, edge_weight_t>, edge_weight_t, bgl_named_params<long unsigned int*, vertex_predecessor_t, no_property> > >; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
570 | detail::dijkstra_dispatch1(g, s, get_param(params, vertex_distance),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
571 | choose_const_pmap(get_param(params, edge_weight), g, edge_weight),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
572 | choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
573 | params);
| ~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:43:32: required from ‘void boost::detail::prim_mst_impl(const Graph&, typename boost::graph_traits<Graph>::vertex_descriptor, const boost::bgl_named_params<T, Tag, Base>&, Weight) [with Graph = R_adjacency_list<boost::undirectedS, double>; P = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>; T = boost::edge_weight_t; R = boost::bgl_named_params<long unsigned int*, boost::vertex_predecessor_t, boost::no_property>; Weight = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’
43 | dijkstra_shortest_paths(
| ~~~~~~~~~~~~~~~~~~~~~~~^
44 | G, s, params.distance_compare(compare).distance_combine(combine));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:77:26: required from ‘void boost::prim_minimum_spanning_tree(const VertexListGraph&, PredecessorMap) [with VertexListGraph = R_adjacency_list<undirectedS, double>; PredecessorMap = long unsigned int*]’
77 | detail::prim_mst_impl(g, *vertices(g).first,
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
78 | predecessor_map(p_map).weight_map(get(edge_weight, g)),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
79 | get(edge_weight, g));
| ~~~~~~~~~~~~~~~~~~~~
minST.cpp:89:35: required from here
89 | prim_minimum_spanning_tree(g, &parent[0]);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:206:17: note: in a call to non-static member function ‘boost::ConvertibleConcept<boost::read_write_property_map_tag, boost::read_write_property_map_tag>::~ConvertibleConcept()’
206 | BOOST_concept(Convertible,(X)(Y))
| ^~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/preprocessor/cat.hpp:29:34: note: in definition of macro ‘BOOST_PP_CAT_I’
29 | # define BOOST_PP_CAT_I(a, b) a ## b
| ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/concept_def.hpp:23:12: note: in expansion of macro ‘BOOST_PP_CAT’
23 | struct BOOST_PP_CAT(name,Concept) \
| ^~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:206:3: note: in expansion of macro ‘BOOST_concept’
206 | BOOST_concept(Convertible,(X)(Y))
| ^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Assignable<long unsigned int*> >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:145:5: required from ‘struct boost::Assignable<long unsigned int*>’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator<long unsigned int*>’
502 | BOOST_concept(InputIterator,(TT))
| ^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:540:3: required from ‘struct boost::ForwardIterator<long unsigned int*>’
540 | BOOST_concept(ForwardIterator,(TT))
| ^~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator<long unsigned int*>’
568 | BOOST_concept(BidirectionalIterator,(TT))
| ^~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<long unsigned int*>’
597 | BOOST_concept(RandomAccessIterator,(TT))
| ^~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3: [ skipping 13 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dijkstra_shortest_paths.hpp:528:32: required from ‘void boost::detail::dijkstra_dispatch2(const VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list<boost::undirectedS, double>; DistanceMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, double, double&>; WeightMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>; Params = boost::bgl_named_params<_project2nd<double, double>, boost::distance_combine_t, boost::bgl_named_params<std::less<double>, boost::distance_compare_t, boost::bgl_named_params<boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params<long unsigned int*, boost::vertex_predecessor_t, boost::no_property> > > >; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’
528 | dijkstra_shortest_paths(g, s,
| ~~~~~~~~~~~~~~~~~~~~~~~^~~~~~
529 | choose_param(get_param(params, vertex_predecessor), p_map),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
530 | distance, weight, index_map,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~
531 | choose_param(
| ~~~~~~~~~~~~~
532 | get_param(params, distance_compare_t()), std::less< D >()),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
533 | choose_param(
| ~~~~~~~~~~~~~
534 | get_param(params, distance_combine_t()), std::plus< D >()),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
535 | inf, choose_param(get_param(params, distance_zero_t()), D()),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
536 | choose_param(get_param(params, graph_visitor),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
537 | make_dijkstra_visitor(null_visitor())),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
538 | params);
| ~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dijkstra_shortest_paths.hpp:554:35: required from ‘void boost::detail::dijkstra_dispatch1(const VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list<boost::undirectedS, double>; DistanceMap = boost::param_not_found; WeightMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>; Params = boost::bgl_named_params<_project2nd<double, double>, boost::distance_combine_t, boost::bgl_named_params<std::less<double>, boost::distance_compare_t, boost::bgl_named_params<boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params<long unsigned int*, boost::vertex_predecessor_t, boost::no_property> > > >; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’
554 | detail::dijkstra_dispatch2(g, s,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~
555 | choose_param(distance,
| ~~~~~~~~~~~~~~~~~~~~~~
556 | make_iterator_property_map(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~
557 | distance_map.begin(), index_map, distance_map[0])),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
558 | weight, index_map, params);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dijkstra_shortest_paths.hpp:570:31: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with VertexListGraph = R_adjacency_list<undirectedS, double>; Param = detail::_project2nd<double, double>; Tag = distance_combine_t; Rest = bgl_named_params<std::less<double>, distance_compare_t, bgl_named_params<adj_list_edge_property_map<undirected_tag, double, const double&, long unsigned int, const property<edge_weight_t, double, no_property>, edge_weight_t>, edge_weight_t, bgl_named_params<long unsigned int*, vertex_predecessor_t, no_property> > >; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
570 | detail::dijkstra_dispatch1(g, s, get_param(params, vertex_distance),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
571 | choose_const_pmap(get_param(params, edge_weight), g, edge_weight),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
572 | choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
573 | params);
| ~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:43:32: required from ‘void boost::detail::prim_mst_impl(const Graph&, typename boost::graph_traits<Graph>::vertex_descriptor, const boost::bgl_named_params<T, Tag, Base>&, Weight) [with Graph = R_adjacency_list<boost::undirectedS, double>; P = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>; T = boost::edge_weight_t; R = boost::bgl_named_params<long unsigned int*, boost::vertex_predecessor_t, boost::no_property>; Weight = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’
43 | dijkstra_shortest_paths(
| ~~~~~~~~~~~~~~~~~~~~~~~^
44 | G, s, params.distance_compare(compare).distance_combine(combine));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:77:26: required from ‘void boost::prim_minimum_spanning_tree(const VertexListGraph&, PredecessorMap) [with VertexListGraph = R_adjacency_list<undirectedS, double>; PredecessorMap = long unsigned int*]’
77 | detail::prim_mst_impl(g, *vertices(g).first,
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
78 | predecessor_map(p_map).weight_map(get(edge_weight, g)),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
79 | get(edge_weight, g));
| ~~~~~~~~~~~~~~~~~~~~
minST.cpp:89:35: required from here
89 | prim_minimum_spanning_tree(g, &parent[0]);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Assignable<long unsigned int*>]’
20 | ~usage_requirements() { ((Model*)0)->~Model(); }
| ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::EqualityComparable<long unsigned int*> >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable<long unsigned int*>’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator<long unsigned int*>’
502 | BOOST_concept(InputIterator,(TT))
| ^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:540:3: required from ‘struct boost::ForwardIterator<long unsigned int*>’
540 | BOOST_concept(ForwardIterator,(TT))
| ^~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator<long unsigned int*>’
568 | BOOST_concept(BidirectionalIterator,(TT))
| ^~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<long unsigned int*>’
597 | BOOST_concept(RandomAccessIterator,(TT))
| ^~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3: [ skipping 13 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dijkstra_shortest_paths.hpp:528:32: required from ‘void boost::detail::dijkstra_dispatch2(const VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list<boost::undirectedS, double>; DistanceMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, double, double&>; WeightMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>; Params = boost::bgl_named_params<_project2nd<double, double>, boost::distance_combine_t, boost::bgl_named_params<std::less<double>, boost::distance_compare_t, boost::bgl_named_params<boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params<long unsigned int*, boost::vertex_predecessor_t, boost::no_property> > > >; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’
528 | dijkstra_shortest_paths(g, s,
| ~~~~~~~~~~~~~~~~~~~~~~~^~~~~~
529 | choose_param(get_param(params, vertex_predecessor), p_map),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
530 | distance, weight, index_map,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~
531 | choose_param(
| ~~~~~~~~~~~~~
532 | get_param(params, distance_compare_t()), std::less< D >()),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
533 | choose_param(
| ~~~~~~~~~~~~~
534 | get_param(params, distance_combine_t()), std::plus< D >()),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
535 | inf, choose_param(get_param(params, distance_zero_t()), D()),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
536 | choose_param(get_param(params, graph_visitor),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
537 | make_dijkstra_visitor(null_visitor())),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
538 | params);
| ~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dijkstra_shortest_paths.hpp:554:35: required from ‘void boost::detail::dijkstra_dispatch1(const VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list<boost::undirectedS, double>; DistanceMap = boost::param_not_found; WeightMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>; Params = boost::bgl_named_params<_project2nd<double, double>, boost::distance_combine_t, boost::bgl_named_params<std::less<double>, boost::distance_compare_t, boost::bgl_named_params<boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params<long unsigned int*, boost::vertex_predecessor_t, boost::no_property> > > >; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’
554 | detail::dijkstra_dispatch2(g, s,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~
555 | choose_param(distance,
| ~~~~~~~~~~~~~~~~~~~~~~
556 | make_iterator_property_map(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~
557 | distance_map.begin(), index_map, distance_map[0])),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
558 | weight, index_map, params);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dijkstra_shortest_paths.hpp:570:31: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with VertexListGraph = R_adjacency_list<undirectedS, double>; Param = detail::_project2nd<double, double>; Tag = distance_combine_t; Rest = bgl_named_params<std::less<double>, distance_compare_t, bgl_named_params<adj_list_edge_property_map<undirected_tag, double, const double&, long unsigned int, const property<edge_weight_t, double, no_property>, edge_weight_t>, edge_weight_t, bgl_named_params<long unsigned int*, vertex_predecessor_t, no_property> > >; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
570 | detail::dijkstra_dispatch1(g, s, get_param(params, vertex_distance),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
571 | choose_const_pmap(get_param(params, edge_weight), g, edge_weight),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
572 | choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
573 | params);
| ~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:43:32: required from ‘void boost::detail::prim_mst_impl(const Graph&, typename boost::graph_traits<Graph>::vertex_descriptor, const boost::bgl_named_params<T, Tag, Base>&, Weight) [with Graph = R_adjacency_list<boost::undirectedS, double>; P = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>; T = boost::edge_weight_t; R = boost::bgl_named_params<long unsigned int*, boost::vertex_predecessor_t, boost::no_property>; Weight = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’
43 | dijkstra_shortest_paths(
| ~~~~~~~~~~~~~~~~~~~~~~~^
44 | G, s, params.distance_compare(compare).distance_combine(combine));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:77:26: required from ‘void boost::prim_minimum_spanning_tree(const VertexListGraph&, PredecessorMap) [with VertexListGraph = R_adjacency_list<undirectedS, double>; PredecessorMap = long unsigned int*]’
77 | detail::prim_mst_impl(g, *vertices(g).first,
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
78 | predecessor_map(p_map).weight_map(get(edge_weight, g)),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
79 | get(edge_weight, g));
| ~~~~~~~~~~~~~~~~~~~~
minST.cpp:89:35: required from here
89 | prim_minimum_spanning_tree(g, &parent[0]);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::EqualityComparable<long unsigned int*>]’
20 | ~usage_requirements() { ((Model*)0)->~Model(); }
| ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::InputIterator<long unsigned int*> >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:512:7: required from ‘struct boost::InputIterator<long unsigned int*>’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:540:3: required from ‘struct boost::ForwardIterator<long unsigned int*>’
540 | BOOST_concept(ForwardIterator,(TT))
| ^~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator<long unsigned int*>’
568 | BOOST_concept(BidirectionalIterator,(TT))
| ^~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<long unsigned int*>’
597 | BOOST_concept(RandomAccessIterator,(TT))
| ^~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<long unsigned int*>’
597 | BOOST_concept(RandomAccessIterator,(TT))
| ^~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: [ skipping 12 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dijkstra_shortest_paths.hpp:528:32: required from ‘void boost::detail::dijkstra_dispatch2(const VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list<boost::undirectedS, double>; DistanceMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, double, double&>; WeightMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>; Params = boost::bgl_named_params<_project2nd<double, double>, boost::distance_combine_t, boost::bgl_named_params<std::less<double>, boost::distance_compare_t, boost::bgl_named_params<boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params<long unsigned int*, boost::vertex_predecessor_t, boost::no_property> > > >; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’
528 | dijkstra_shortest_paths(g, s,
| ~~~~~~~~~~~~~~~~~~~~~~~^~~~~~
529 | choose_param(get_param(params, vertex_predecessor), p_map),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
530 | distance, weight, index_map,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~
531 | choose_param(
| ~~~~~~~~~~~~~
532 | get_param(params, distance_compare_t()), std::less< D >()),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
533 | choose_param(
| ~~~~~~~~~~~~~
534 | get_param(params, distance_combine_t()), std::plus< D >()),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
535 | inf, choose_param(get_param(params, distance_zero_t()), D()),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
536 | choose_param(get_param(params, graph_visitor),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
537 | make_dijkstra_visitor(null_visitor())),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
538 | params);
| ~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dijkstra_shortest_paths.hpp:554:35: required from ‘void boost::detail::dijkstra_dispatch1(const VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list<boost::undirectedS, double>; DistanceMap = boost::param_not_found; WeightMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>; Params = boost::bgl_named_params<_project2nd<double, double>, boost::distance_combine_t, boost::bgl_named_params<std::less<double>, boost::distance_compare_t, boost::bgl_named_params<boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params<long unsigned int*, boost::vertex_predecessor_t, boost::no_property> > > >; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’
554 | detail::dijkstra_dispatch2(g, s,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~
555 | choose_param(distance,
| ~~~~~~~~~~~~~~~~~~~~~~
556 | make_iterator_property_map(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~
557 | distance_map.begin(), index_map, distance_map[0])),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
558 | weight, index_map, params);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dijkstra_shortest_paths.hpp:570:31: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with VertexListGraph = R_adjacency_list<undirectedS, double>; Param = detail::_project2nd<double, double>; Tag = distance_combine_t; Rest = bgl_named_params<std::less<double>, distance_compare_t, bgl_named_params<adj_list_edge_property_map<undirected_tag, double, const double&, long unsigned int, const property<edge_weight_t, double, no_property>, edge_weight_t>, edge_weight_t, bgl_named_params<long unsigned int*, vertex_predecessor_t, no_property> > >; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
570 | detail::dijkstra_dispatch1(g, s, get_param(params, vertex_distance),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
571 | choose_const_pmap(get_param(params, edge_weight), g, edge_weight),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
572 | choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
573 | params);
| ~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:43:32: required from ‘void boost::detail::prim_mst_impl(const Graph&, typename boost::graph_traits<Graph>::vertex_descriptor, const boost::bgl_named_params<T, Tag, Base>&, Weight) [with Graph = R_adjacency_list<boost::undirectedS, double>; P = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>; T = boost::edge_weight_t; R = boost::bgl_named_params<long unsigned int*, boost::vertex_predecessor_t, boost::no_property>; Weight = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’
43 | dijkstra_shortest_paths(
| ~~~~~~~~~~~~~~~~~~~~~~~^
44 | G, s, params.distance_compare(compare).distance_combine(combine));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:77:26: required from ‘void boost::prim_minimum_spanning_tree(const VertexListGraph&, PredecessorMap) [with VertexListGraph = R_adjacency_list<undirectedS, double>; PredecessorMap = long unsigned int*]’
77 | detail::prim_mst_impl(g, *vertices(g).first,
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
78 | predecessor_map(p_map).weight_map(get(edge_weight, g)),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
79 | get(edge_weight, g));
| ~~~~~~~~~~~~~~~~~~~~
minST.cpp:89:35: required from here
89 | prim_minimum_spanning_tree(g, &parent[0]);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::InputIterator<long unsigned int*>]’
20 | ~usage_requirements() { ((Model*)0)->~Model(); }
| ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::ForwardIterator<long unsigned int*> >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:543:7: required from ‘struct boost::ForwardIterator<long unsigned int*>’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator<long unsigned int*>’
568 | BOOST_concept(BidirectionalIterator,(TT))
| ^~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<long unsigned int*>’
597 | BOOST_concept(RandomAccessIterator,(TT))
| ^~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<long unsigned int*>’
597 | BOOST_concept(RandomAccessIterator,(TT))
| ^~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::RandomAccessIteratorConcept<long unsigned int*>]’
32 | inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
| ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5: [ skipping 11 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dijkstra_shortest_paths.hpp:528:32: required from ‘void boost::detail::dijkstra_dispatch2(const VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list<boost::undirectedS, double>; DistanceMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, double, double&>; WeightMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>; Params = boost::bgl_named_params<_project2nd<double, double>, boost::distance_combine_t, boost::bgl_named_params<std::less<double>, boost::distance_compare_t, boost::bgl_named_params<boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params<long unsigned int*, boost::vertex_predecessor_t, boost::no_property> > > >; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’
528 | dijkstra_shortest_paths(g, s,
| ~~~~~~~~~~~~~~~~~~~~~~~^~~~~~
529 | choose_param(get_param(params, vertex_predecessor), p_map),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
530 | distance, weight, index_map,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~
531 | choose_param(
| ~~~~~~~~~~~~~
532 | get_param(params, distance_compare_t()), std::less< D >()),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
533 | choose_param(
| ~~~~~~~~~~~~~
534 | get_param(params, distance_combine_t()), std::plus< D >()),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
535 | inf, choose_param(get_param(params, distance_zero_t()), D()),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
536 | choose_param(get_param(params, graph_visitor),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
537 | make_dijkstra_visitor(null_visitor())),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
538 | params);
| ~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dijkstra_shortest_paths.hpp:554:35: required from ‘void boost::detail::dijkstra_dispatch1(const VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list<boost::undirectedS, double>; DistanceMap = boost::param_not_found; WeightMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>; Params = boost::bgl_named_params<_project2nd<double, double>, boost::distance_combine_t, boost::bgl_named_params<std::less<double>, boost::distance_compare_t, boost::bgl_named_params<boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params<long unsigned int*, boost::vertex_predecessor_t, boost::no_property> > > >; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’
554 | detail::dijkstra_dispatch2(g, s,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~
555 | choose_param(distance,
| ~~~~~~~~~~~~~~~~~~~~~~
556 | make_iterator_property_map(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~
557 | distance_map.begin(), index_map, distance_map[0])),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
558 | weight, index_map, params);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dijkstra_shortest_paths.hpp:570:31: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with VertexListGraph = R_adjacency_list<undirectedS, double>; Param = detail::_project2nd<double, double>; Tag = distance_combine_t; Rest = bgl_named_params<std::less<double>, distance_compare_t, bgl_named_params<adj_list_edge_property_map<undirected_tag, double, const double&, long unsigned int, const property<edge_weight_t, double, no_property>, edge_weight_t>, edge_weight_t, bgl_named_params<long unsigned int*, vertex_predecessor_t, no_property> > >; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
570 | detail::dijkstra_dispatch1(g, s, get_param(params, vertex_distance),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
571 | choose_const_pmap(get_param(params, edge_weight), g, edge_weight),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
572 | choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
573 | params);
| ~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:43:32: required from ‘void boost::detail::prim_mst_impl(const Graph&, typename boost::graph_traits<Graph>::vertex_descriptor, const boost::bgl_named_params<T, Tag, Base>&, Weight) [with Graph = R_adjacency_list<boost::undirectedS, double>; P = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>; T = boost::edge_weight_t; R = boost::bgl_named_params<long unsigned int*, boost::vertex_predecessor_t, boost::no_property>; Weight = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’
43 | dijkstra_shortest_paths(
| ~~~~~~~~~~~~~~~~~~~~~~~^
44 | G, s, params.distance_compare(compare).distance_combine(combine));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:77:26: required from ‘void boost::prim_minimum_spanning_tree(const VertexListGraph&, PredecessorMap) [with VertexListGraph = R_adjacency_list<undirectedS, double>; PredecessorMap = long unsigned int*]’
77 | detail::prim_mst_impl(g, *vertices(g).first,
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
78 | predecessor_map(p_map).weight_map(get(edge_weight, g)),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
79 | get(edge_weight, g));
| ~~~~~~~~~~~~~~~~~~~~
minST.cpp:89:35: required from here
89 | prim_minimum_spanning_tree(g, &parent[0]);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::ForwardIterator<long unsigned int*>]’
20 | ~usage_requirements() { ((Model*)0)->~Model(); }
| ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::BidirectionalIterator<long unsigned int*> >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:571:7: required from ‘struct boost::BidirectionalIterator<long unsigned int*>’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<long unsigned int*>’
597 | BOOST_concept(RandomAccessIterator,(TT))
| ^~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<long unsigned int*>’
597 | BOOST_concept(RandomAccessIterator,(TT))
| ^~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::RandomAccessIteratorConcept<long unsigned int*>]’
32 | inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
| ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied<boost::RandomAccessIteratorConcept<long unsigned int*> >::value’
44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 10 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dijkstra_shortest_paths.hpp:528:32: required from ‘void boost::detail::dijkstra_dispatch2(const VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list<boost::undirectedS, double>; DistanceMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, double, double&>; WeightMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>; Params = boost::bgl_named_params<_project2nd<double, double>, boost::distance_combine_t, boost::bgl_named_params<std::less<double>, boost::distance_compare_t, boost::bgl_named_params<boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params<long unsigned int*, boost::vertex_predecessor_t, boost::no_property> > > >; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’
528 | dijkstra_shortest_paths(g, s,
| ~~~~~~~~~~~~~~~~~~~~~~~^~~~~~
529 | choose_param(get_param(params, vertex_predecessor), p_map),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
530 | distance, weight, index_map,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~
531 | choose_param(
| ~~~~~~~~~~~~~
532 | get_param(params, distance_compare_t()), std::less< D >()),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
533 | choose_param(
| ~~~~~~~~~~~~~
534 | get_param(params, distance_combine_t()), std::plus< D >()),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
535 | inf, choose_param(get_param(params, distance_zero_t()), D()),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
536 | choose_param(get_param(params, graph_visitor),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
537 | make_dijkstra_visitor(null_visitor())),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
538 | params);
| ~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dijkstra_shortest_paths.hpp:554:35: required from ‘void boost::detail::dijkstra_dispatch1(const VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list<boost::undirectedS, double>; DistanceMap = boost::param_not_found; WeightMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>; Params = boost::bgl_named_params<_project2nd<double, double>, boost::distance_combine_t, boost::bgl_named_params<std::less<double>, boost::distance_compare_t, boost::bgl_named_params<boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params<long unsigned int*, boost::vertex_predecessor_t, boost::no_property> > > >; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’
554 | detail::dijkstra_dispatch2(g, s,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~
555 | choose_param(distance,
| ~~~~~~~~~~~~~~~~~~~~~~
556 | make_iterator_property_map(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~
557 | distance_map.begin(), index_map, distance_map[0])),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
558 | weight, index_map, params);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dijkstra_shortest_paths.hpp:570:31: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with VertexListGraph = R_adjacency_list<undirectedS, double>; Param = detail::_project2nd<double, double>; Tag = distance_combine_t; Rest = bgl_named_params<std::less<double>, distance_compare_t, bgl_named_params<adj_list_edge_property_map<undirected_tag, double, const double&, long unsigned int, const property<edge_weight_t, double, no_property>, edge_weight_t>, edge_weight_t, bgl_named_params<long unsigned int*, vertex_predecessor_t, no_property> > >; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
570 | detail::dijkstra_dispatch1(g, s, get_param(params, vertex_distance),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
571 | choose_const_pmap(get_param(params, edge_weight), g, edge_weight),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
572 | choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
573 | params);
| ~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:43:32: required from ‘void boost::detail::prim_mst_impl(const Graph&, typename boost::graph_traits<Graph>::vertex_descriptor, const boost::bgl_named_params<T, Tag, Base>&, Weight) [with Graph = R_adjacency_list<boost::undirectedS, double>; P = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>; T = boost::edge_weight_t; R = boost::bgl_named_params<long unsigned int*, boost::vertex_predecessor_t, boost::no_property>; Weight = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’
43 | dijkstra_shortest_paths(
| ~~~~~~~~~~~~~~~~~~~~~~~^
44 | G, s, params.distance_compare(compare).distance_combine(combine));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:77:26: required from ‘void boost::prim_minimum_spanning_tree(const VertexListGraph&, PredecessorMap) [with VertexListGraph = R_adjacency_list<undirectedS, double>; PredecessorMap = long unsigned int*]’
77 | detail::prim_mst_impl(g, *vertices(g).first,
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
78 | predecessor_map(p_map).weight_map(get(edge_weight, g)),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
79 | get(edge_weight, g));
| ~~~~~~~~~~~~~~~~~~~~
minST.cpp:89:35: required from here
89 | prim_minimum_spanning_tree(g, &parent[0]);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::BidirectionalIterator<long unsigned int*>]’
20 | ~usage_requirements() { ((Model*)0)->~Model(); }
| ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Comparable<long unsigned int*> >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:253:5: required from ‘struct boost::Comparable<long unsigned int*>’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<long unsigned int*>’
597 | BOOST_concept(RandomAccessIterator,(TT))
| ^~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<long unsigned int*>’
597 | BOOST_concept(RandomAccessIterator,(TT))
| ^~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::RandomAccessIteratorConcept<long unsigned int*>]’
32 | inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
| ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied<boost::RandomAccessIteratorConcept<long unsigned int*> >::value’
44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 10 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dijkstra_shortest_paths.hpp:528:32: required from ‘void boost::detail::dijkstra_dispatch2(const VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list<boost::undirectedS, double>; DistanceMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, double, double&>; WeightMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>; Params = boost::bgl_named_params<_project2nd<double, double>, boost::distance_combine_t, boost::bgl_named_params<std::less<double>, boost::distance_compare_t, boost::bgl_named_params<boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params<long unsigned int*, boost::vertex_predecessor_t, boost::no_property> > > >; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’
528 | dijkstra_shortest_paths(g, s,
| ~~~~~~~~~~~~~~~~~~~~~~~^~~~~~
529 | choose_param(get_param(params, vertex_predecessor), p_map),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
530 | distance, weight, index_map,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~
531 | choose_param(
| ~~~~~~~~~~~~~
532 | get_param(params, distance_compare_t()), std::less< D >()),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
533 | choose_param(
| ~~~~~~~~~~~~~
534 | get_param(params, distance_combine_t()), std::plus< D >()),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
535 | inf, choose_param(get_param(params, distance_zero_t()), D()),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
536 | choose_param(get_param(params, graph_visitor),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
537 | make_dijkstra_visitor(null_visitor())),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
538 | params);
| ~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dijkstra_shortest_paths.hpp:554:35: required from ‘void boost::detail::dijkstra_dispatch1(const VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list<boost::undirectedS, double>; DistanceMap = boost::param_not_found; WeightMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>; Params = boost::bgl_named_params<_project2nd<double, double>, boost::distance_combine_t, boost::bgl_named_params<std::less<double>, boost::distance_compare_t, boost::bgl_named_params<boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params<long unsigned int*, boost::vertex_predecessor_t, boost::no_property> > > >; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’
554 | detail::dijkstra_dispatch2(g, s,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~
555 | choose_param(distance,
| ~~~~~~~~~~~~~~~~~~~~~~
556 | make_iterator_property_map(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~
557 | distance_map.begin(), index_map, distance_map[0])),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
558 | weight, index_map, params);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dijkstra_shortest_paths.hpp:570:31: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with VertexListGraph = R_adjacency_list<undirectedS, double>; Param = detail::_project2nd<double, double>; Tag = distance_combine_t; Rest = bgl_named_params<std::less<double>, distance_compare_t, bgl_named_params<adj_list_edge_property_map<undirected_tag, double, const double&, long unsigned int, const property<edge_weight_t, double, no_property>, edge_weight_t>, edge_weight_t, bgl_named_params<long unsigned int*, vertex_predecessor_t, no_property> > >; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
570 | detail::dijkstra_dispatch1(g, s, get_param(params, vertex_distance),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
571 | choose_const_pmap(get_param(params, edge_weight), g, edge_weight),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
572 | choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
573 | params);
| ~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:43:32: required from ‘void boost::detail::prim_mst_impl(const Graph&, typename boost::graph_traits<Graph>::vertex_descriptor, const boost::bgl_named_params<T, Tag, Base>&, Weight) [with Graph = R_adjacency_list<boost::undirectedS, double>; P = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>; T = boost::edge_weight_t; R = boost::bgl_named_params<long unsigned int*, boost::vertex_predecessor_t, boost::no_property>; Weight = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’
43 | dijkstra_shortest_paths(
| ~~~~~~~~~~~~~~~~~~~~~~~^
44 | G, s, params.distance_compare(compare).distance_combine(combine));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:77:26: required from ‘void boost::prim_minimum_spanning_tree(const VertexListGraph&, PredecessorMap) [with VertexListGraph = R_adjacency_list<undirectedS, double>; PredecessorMap = long unsigned int*]’
77 | detail::prim_mst_impl(g, *vertices(g).first,
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
78 | predecessor_map(p_map).weight_map(get(edge_weight, g)),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
79 | get(edge_weight, g));
| ~~~~~~~~~~~~~~~~~~~~
minST.cpp:89:35: required from here
89 | prim_minimum_spanning_tree(g, &parent[0]);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Comparable<long unsigned int*>]’
20 | ~usage_requirements() { ((Model*)0)->~Model(); }
| ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::RandomAccessIterator<long unsigned int*> >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:601:7: required from ‘struct boost::RandomAccessIterator<long unsigned int*>’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<long unsigned int*>’
597 | BOOST_concept(RandomAccessIterator,(TT))
| ^~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::RandomAccessIteratorConcept<long unsigned int*>]’
32 | inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
| ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied<boost::RandomAccessIteratorConcept<long unsigned int*> >::value’
44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied<boost::RandomAccessIteratorConcept<long unsigned int*> >’
45 | typedef boost::integral_constant<bool, value> type;
| ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 9 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dijkstra_shortest_paths.hpp:528:32: required from ‘void boost::detail::dijkstra_dispatch2(const VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list<boost::undirectedS, double>; DistanceMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, double, double&>; WeightMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>; Params = boost::bgl_named_params<_project2nd<double, double>, boost::distance_combine_t, boost::bgl_named_params<std::less<double>, boost::distance_compare_t, boost::bgl_named_params<boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params<long unsigned int*, boost::vertex_predecessor_t, boost::no_property> > > >; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’
528 | dijkstra_shortest_paths(g, s,
| ~~~~~~~~~~~~~~~~~~~~~~~^~~~~~
529 | choose_param(get_param(params, vertex_predecessor), p_map),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
530 | distance, weight, index_map,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~
531 | choose_param(
| ~~~~~~~~~~~~~
532 | get_param(params, distance_compare_t()), std::less< D >()),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
533 | choose_param(
| ~~~~~~~~~~~~~
534 | get_param(params, distance_combine_t()), std::plus< D >()),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
535 | inf, choose_param(get_param(params, distance_zero_t()), D()),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
536 | choose_param(get_param(params, graph_visitor),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
537 | make_dijkstra_visitor(null_visitor())),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
538 | params);
| ~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dijkstra_shortest_paths.hpp:554:35: required from ‘void boost::detail::dijkstra_dispatch1(const VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list<boost::undirectedS, double>; DistanceMap = boost::param_not_found; WeightMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>; Params = boost::bgl_named_params<_project2nd<double, double>, boost::distance_combine_t, boost::bgl_named_params<std::less<double>, boost::distance_compare_t, boost::bgl_named_params<boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params<long unsigned int*, boost::vertex_predecessor_t, boost::no_property> > > >; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’
554 | detail::dijkstra_dispatch2(g, s,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~
555 | choose_param(distance,
| ~~~~~~~~~~~~~~~~~~~~~~
556 | make_iterator_property_map(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~
557 | distance_map.begin(), index_map, distance_map[0])),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
558 | weight, index_map, params);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dijkstra_shortest_paths.hpp:570:31: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with VertexListGraph = R_adjacency_list<undirectedS, double>; Param = detail::_project2nd<double, double>; Tag = distance_combine_t; Rest = bgl_named_params<std::less<double>, distance_compare_t, bgl_named_params<adj_list_edge_property_map<undirected_tag, double, const double&, long unsigned int, const property<edge_weight_t, double, no_property>, edge_weight_t>, edge_weight_t, bgl_named_params<long unsigned int*, vertex_predecessor_t, no_property> > >; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
570 | detail::dijkstra_dispatch1(g, s, get_param(params, vertex_distance),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
571 | choose_const_pmap(get_param(params, edge_weight), g, edge_weight),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
572 | choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
573 | params);
| ~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:43:32: required from ‘void boost::detail::prim_mst_impl(const Graph&, typename boost::graph_traits<Graph>::vertex_descriptor, const boost::bgl_named_params<T, Tag, Base>&, Weight) [with Graph = R_adjacency_list<boost::undirectedS, double>; P = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>; T = boost::edge_weight_t; R = boost::bgl_named_params<long unsigned int*, boost::vertex_predecessor_t, boost::no_property>; Weight = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’
43 | dijkstra_shortest_paths(
| ~~~~~~~~~~~~~~~~~~~~~~~^
44 | G, s, params.distance_compare(compare).distance_combine(combine));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:77:26: required from ‘void boost::prim_minimum_spanning_tree(const VertexListGraph&, PredecessorMap) [with VertexListGraph = R_adjacency_list<undirectedS, double>; PredecessorMap = long unsigned int*]’
77 | detail::prim_mst_impl(g, *vertices(g).first,
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
78 | predecessor_map(p_map).weight_map(get(edge_weight, g)),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
79 | get(edge_weight, g));
| ~~~~~~~~~~~~~~~~~~~~
minST.cpp:89:35: required from here
89 | prim_minimum_spanning_tree(g, &parent[0]);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::RandomAccessIterator<long unsigned int*>]’
20 | ~usage_requirements() { ((Model*)0)->~Model(); }
| ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::RandomAccessIteratorConcept<long unsigned int*>]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map<RAIter, ID, typename std::iterator_traits< <template-parameter-1-1> >::value_type, typename std::iterator_traits< <template-parameter-1-1> >::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = long unsigned int*; ID = vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>; typename std::iterator_traits< <template-parameter-1-1> >::value_type = long unsigned int; typename std::iterator_traits< <template-parameter-1-1> >::reference = long unsigned int&]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dijkstra_shortest_paths.hpp:245:46: required from ‘static boost::detail::vertex_property_map_generator_helper<Graph, IndexMap, Value, true>::type boost::detail::vertex_property_map_generator_helper<Graph, IndexMap, Value, true>::build(const Graph&, const IndexMap&, boost::scoped_array<Value>&) [with Graph = R_adjacency_list<boost::undirectedS, double>; IndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>; Value = long unsigned int; type = boost::iterator_property_map<long unsigned int*, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>]’
245 | return make_iterator_property_map(array_holder.get(), index);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dijkstra_shortest_paths.hpp:273:33: required from ‘static boost::detail::vertex_property_map_generator<Graph, IndexMap, Value>::type boost::detail::vertex_property_map_generator<Graph, IndexMap, Value>::build(const Graph&, const IndexMap&, boost::scoped_array<Value>&) [with Graph = R_adjacency_list<boost::undirectedS, double>; IndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>; Value = long unsigned int; type = boost::iterator_property_map<long unsigned int*, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>]’
273 | return helper::build(g, index, array_holder);
| ~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dijkstra_shortest_paths.hpp:377:38: required from ‘void boost::dijkstra_shortest_paths_no_init(const Graph&, SourceInputIter, SourceInputIter, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistZero, DijkstraVisitor, ColorMap) [with Graph = R_adjacency_list<undirectedS, double>; SourceInputIter = long unsigned int*; DijkstraVisitor = dijkstra_visitor<>; PredecessorMap = long unsigned int*; DistanceMap = iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > >, vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>, double, double&>; WeightMap = adj_list_edge_property_map<undirected_tag, double, const double&, long unsigned int, const property<edge_weight_t, double, no_property>, edge_weight_t>; IndexMap = vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>; Compare = std::less<double>; Combine = detail::_project2nd<double, double>; DistZero = double; ColorMap = two_bit_color_map<vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int> >]’
377 | = IndexInHeapMapHelper::build(g, index_map, index_in_heap_map_holder);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dijkstra_shortest_paths.hpp:464:36: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, SourceInputIter, SourceInputIter, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistInf, DistZero, DijkstraVisitor, ColorMap) [with VertexListGraph = R_adjacency_list<undirectedS, double>; SourceInputIter = long unsigned int*; DijkstraVisitor = dijkstra_visitor<>; PredecessorMap = long unsigned int*; DistanceMap = iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > >, vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>, double, double&>; WeightMap = adj_list_edge_property_map<undirected_tag, double, const double&, long unsigned int, const property<edge_weight_t, double, no_property>, edge_weight_t>; IndexMap = vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>; Compare = std::less<double>; Combine = detail::_project2nd<double, double>; DistInf = double; DistZero = double; ColorMap = two_bit_color_map<vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int> >]’
464 | dijkstra_shortest_paths_no_init(g, s_begin, s_end, predecessor, distance,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
465 | weight, index_map, compare, combine, zero, vis, color);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dijkstra_shortest_paths.hpp:417:28: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dijkstra_shortest_paths.hpp:528:32: required from ‘void boost::detail::dijkstra_dispatch2(const VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list<boost::undirectedS, double>; DistanceMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, double, double&>; WeightMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>; Params = boost::bgl_named_params<_project2nd<double, double>, boost::distance_combine_t, boost::bgl_named_params<std::less<double>, boost::distance_compare_t, boost::bgl_named_params<boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params<long unsigned int*, boost::vertex_predecessor_t, boost::no_property> > > >; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’
528 | dijkstra_shortest_paths(g, s,
| ~~~~~~~~~~~~~~~~~~~~~~~^~~~~~
529 | choose_param(get_param(params, vertex_predecessor), p_map),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
530 | distance, weight, index_map,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~
531 | choose_param(
| ~~~~~~~~~~~~~
532 | get_param(params, distance_compare_t()), std::less< D >()),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
533 | choose_param(
| ~~~~~~~~~~~~~
534 | get_param(params, distance_combine_t()), std::plus< D >()),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
535 | inf, choose_param(get_param(params, distance_zero_t()), D()),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
536 | choose_param(get_param(params, graph_visitor),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
537 | make_dijkstra_visitor(null_visitor())),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
538 | params);
| ~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dijkstra_shortest_paths.hpp:554:35: required from ‘void boost::detail::dijkstra_dispatch1(const VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list<boost::undirectedS, double>; DistanceMap = boost::param_not_found; WeightMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>; Params = boost::bgl_named_params<_project2nd<double, double>, boost::distance_combine_t, boost::bgl_named_params<std::less<double>, boost::distance_compare_t, boost::bgl_named_params<boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params<long unsigned int*, boost::vertex_predecessor_t, boost::no_property> > > >; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’
554 | detail::dijkstra_dispatch2(g, s,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~
555 | choose_param(distance,
| ~~~~~~~~~~~~~~~~~~~~~~
556 | make_iterator_property_map(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~
557 | distance_map.begin(), index_map, distance_map[0])),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
558 | weight, index_map, params);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dijkstra_shortest_paths.hpp:570:31: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with VertexListGraph = R_adjacency_list<undirectedS, double>; Param = detail::_project2nd<double, double>; Tag = distance_combine_t; Rest = bgl_named_params<std::less<double>, distance_compare_t, bgl_named_params<adj_list_edge_property_map<undirected_tag, double, const double&, long unsigned int, const property<edge_weight_t, double, no_property>, edge_weight_t>, edge_weight_t, bgl_named_params<long unsigned int*, vertex_predecessor_t, no_property> > >; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
570 | detail::dijkstra_dispatch1(g, s, get_param(params, vertex_distance),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
571 | choose_const_pmap(get_param(params, edge_weight), g, edge_weight),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
572 | choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
573 | params);
| ~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:43:32: required from ‘void boost::detail::prim_mst_impl(const Graph&, typename boost::graph_traits<Graph>::vertex_descriptor, const boost::bgl_named_params<T, Tag, Base>&, Weight) [with Graph = R_adjacency_list<boost::undirectedS, double>; P = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>; T = boost::edge_weight_t; R = boost::bgl_named_params<long unsigned int*, boost::vertex_predecessor_t, boost::no_property>; Weight = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’
43 | dijkstra_shortest_paths(
| ~~~~~~~~~~~~~~~~~~~~~~~^
44 | G, s, params.distance_compare(compare).distance_combine(combine));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:77:26: required from ‘void boost::prim_minimum_spanning_tree(const VertexListGraph&, PredecessorMap) [with VertexListGraph = R_adjacency_list<undirectedS, double>; PredecessorMap = long unsigned int*]’
77 | detail::prim_mst_impl(g, *vertices(g).first,
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
78 | predecessor_map(p_map).weight_map(get(edge_weight, g)),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
79 | get(edge_weight, g));
| ~~~~~~~~~~~~~~~~~~~~
minST.cpp:89:35: required from here
89 | prim_minimum_spanning_tree(g, &parent[0]);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:17: note: in a call to non-static member function ‘boost::RandomAccessIteratorConcept<long unsigned int*>::~RandomAccessIteratorConcept()’
597 | BOOST_concept(RandomAccessIterator,(TT))
| ^~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/preprocessor/cat.hpp:29:34: note: in definition of macro ‘BOOST_PP_CAT_I’
29 | # define BOOST_PP_CAT_I(a, b) a ## b
| ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/concept_def.hpp:23:12: note: in expansion of macro ‘BOOST_PP_CAT’
23 | struct BOOST_PP_CAT(name,Concept) \
| ^~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3: note: in expansion of macro ‘BOOST_concept’
597 | BOOST_concept(RandomAccessIterator,(TT))
| ^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::concepts::MultiPassInputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > >, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > >, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > >, boost::property<boost::edge_weight_t, double, boost::no_property> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:52:50: required from ‘struct boost::concepts::MultiPassInputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > >, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > >, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > >, boost::property<boost::edge_weight_t, double, 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> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::concepts::MultiPassInputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > >, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > >, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > >, boost::property<boost::edge_weight_t, double, 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);
| ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied<boost::concepts::MultiPassInputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > >, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > >, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > >, boost::property<boost::edge_weight_t, double, 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) );
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied<boost::concepts::MultiPassInputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > >, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > >, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > >, boost::property<boost::edge_weight_t, double, 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;
| ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_<void (*)(boost::concepts::MultiPassInputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > >, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > >, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > >, boost::property<boost::edge_weight_t, double, boost::no_property> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> >)>’
72 | struct requirement_<void(*)(Model)>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:89:9: [ skipping 8 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dijkstra_shortest_paths.hpp:528:32: required from ‘void boost::detail::dijkstra_dispatch2(const VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list<boost::undirectedS, double>; DistanceMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, double, double&>; WeightMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>; Params = boost::bgl_named_params<_project2nd<double, double>, boost::distance_combine_t, boost::bgl_named_params<std::less<double>, boost::distance_compare_t, boost::bgl_named_params<boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params<long unsigned int*, boost::vertex_predecessor_t, boost::no_property> > > >; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’
528 | dijkstra_shortest_paths(g, s,
| ~~~~~~~~~~~~~~~~~~~~~~~^~~~~~
529 | choose_param(get_param(params, vertex_predecessor), p_map),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
530 | distance, weight, index_map,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~
531 | choose_param(
| ~~~~~~~~~~~~~
532 | get_param(params, distance_compare_t()), std::less< D >()),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
533 | choose_param(
| ~~~~~~~~~~~~~
534 | get_param(params, distance_combine_t()), std::plus< D >()),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
535 | inf, choose_param(get_param(params, distance_zero_t()), D()),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
536 | choose_param(get_param(params, graph_visitor),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
537 | make_dijkstra_visitor(null_visitor())),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
538 | params);
| ~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dijkstra_shortest_paths.hpp:554:35: required from ‘void boost::detail::dijkstra_dispatch1(const VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list<boost::undirectedS, double>; DistanceMap = boost::param_not_found; WeightMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>; Params = boost::bgl_named_params<_project2nd<double, double>, boost::distance_combine_t, boost::bgl_named_params<std::less<double>, boost::distance_compare_t, boost::bgl_named_params<boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params<long unsigned int*, boost::vertex_predecessor_t, boost::no_property> > > >; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’
554 | detail::dijkstra_dispatch2(g, s,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~
555 | choose_param(distance,
| ~~~~~~~~~~~~~~~~~~~~~~
556 | make_iterator_property_map(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~
557 | distance_map.begin(), index_map, distance_map[0])),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
558 | weight, index_map, params);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dijkstra_shortest_paths.hpp:570:31: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with VertexListGraph = R_adjacency_list<undirectedS, double>; Param = detail::_project2nd<double, double>; Tag = distance_combine_t; Rest = bgl_named_params<std::less<double>, distance_compare_t, bgl_named_params<adj_list_edge_property_map<undirected_tag, double, const double&, long unsigned int, const property<edge_weight_t, double, no_property>, edge_weight_t>, edge_weight_t, bgl_named_params<long unsigned int*, vertex_predecessor_t, no_property> > >; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
570 | detail::dijkstra_dispatch1(g, s, get_param(params, vertex_distance),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
571 | choose_const_pmap(get_param(params, edge_weight), g, edge_weight),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
572 | choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
573 | params);
| ~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:43:32: required from ‘void boost::detail::prim_mst_impl(const Graph&, typename boost::graph_traits<Graph>::vertex_descriptor, const boost::bgl_named_params<T, Tag, Base>&, Weight) [with Graph = R_adjacency_list<boost::undirectedS, double>; P = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>; T = boost::edge_weight_t; R = boost::bgl_named_params<long unsigned int*, boost::vertex_predecessor_t, boost::no_property>; Weight = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’
43 | dijkstra_shortest_paths(
| ~~~~~~~~~~~~~~~~~~~~~~~^
44 | G, s, params.distance_compare(compare).distance_combine(combine));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:77:26: required from ‘void boost::prim_minimum_spanning_tree(const VertexListGraph&, PredecessorMap) [with VertexListGraph = R_adjacency_list<undirectedS, double>; PredecessorMap = long unsigned int*]’
77 | detail::prim_mst_impl(g, *vertices(g).first,
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
78 | predecessor_map(p_map).weight_map(get(edge_weight, g)),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
79 | get(edge_weight, g));
| ~~~~~~~~~~~~~~~~~~~~
minST.cpp:89:35: required from here
89 | prim_minimum_spanning_tree(g, &parent[0]);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::concepts::MultiPassInputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > >, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > >, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > >, boost::property<boost::edge_weight_t, double, 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(); }
| ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::MultiPassInputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > >, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > >, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > >, boost::property<boost::edge_weight_t, double, boost::no_property> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:89:9: required from ‘boost::concepts::IncidenceGraph<G>::~IncidenceGraph() [with G = R_adjacency_list<boost::undirectedS, double>]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/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<R_adjacency_list<boost::undirectedS, double> >]’
75 | BOOST_concept(IncidenceGraph, (G)) : Graph< G >
| ^~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:62:5: required from ‘void boost::breadth_first_visit(const IncidenceGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with IncidenceGraph = R_adjacency_list<undirectedS, double>; Buffer = d_ary_heap_indirect<long unsigned int, 4, iterator_property_map<long unsigned int*, vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>, iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > >, vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>, double, double&>, std::less<double>, std::vector<long unsigned int> >; BFSVisitor = detail::dijkstra_bfs_visitor<dijkstra_visitor<>, d_ary_heap_indirect<long unsigned int, 4, iterator_property_map<long unsigned int*, vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>, iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > >, vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>, double, double&>, std::less<double>, std::vector<long unsigned int> >, adj_list_edge_property_map<undirected_tag, double, const double&, long unsigned int, const property<edge_weight_t, double, no_property>, edge_weight_t>, long unsigned int*, iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > >, vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>, double, double&>, detail::_project2nd<double, double>, std::less<double> >; ColorMap = two_bit_color_map<vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int> >; SourceIterator = long unsigned int*]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dijkstra_shortest_paths.hpp:387:24: required from ‘void boost::dijkstra_shortest_paths_no_init(const Graph&, SourceInputIter, SourceInputIter, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistZero, DijkstraVisitor, ColorMap) [with Graph = R_adjacency_list<undirectedS, double>; SourceInputIter = long unsigned int*; DijkstraVisitor = dijkstra_visitor<>; PredecessorMap = long unsigned int*; DistanceMap = iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > >, vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>, double, double&>; WeightMap = adj_list_edge_property_map<undirected_tag, double, const double&, long unsigned int, const property<edge_weight_t, double, no_property>, edge_weight_t>; IndexMap = vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>; Compare = std::less<double>; Combine = detail::_project2nd<double, double>; DistZero = double; ColorMap = two_bit_color_map<vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int> >]’
387 | breadth_first_visit(g, s_begin, s_end, Q, bfs_vis, color);
| ~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dijkstra_shortest_paths.hpp:464:36: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, SourceInputIter, SourceInputIter, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistInf, DistZero, DijkstraVisitor, ColorMap) [with VertexListGraph = R_adjacency_list<undirectedS, double>; SourceInputIter = long unsigned int*; DijkstraVisitor = dijkstra_visitor<>; PredecessorMap = long unsigned int*; DistanceMap = iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > >, vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>, double, double&>; WeightMap = adj_list_edge_property_map<undirected_tag, double, const double&, long unsigned int, const property<edge_weight_t, double, no_property>, edge_weight_t>; IndexMap = vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>; Compare = std::less<double>; Combine = detail::_project2nd<double, double>; DistInf = double; DistZero = double; ColorMap = two_bit_color_map<vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int> >]’
464 | dijkstra_shortest_paths_no_init(g, s_begin, s_end, predecessor, distance,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
465 | weight, index_map, compare, combine, zero, vis, color);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dijkstra_shortest_paths.hpp:417:28: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dijkstra_shortest_paths.hpp:528:32: required from ‘void boost::detail::dijkstra_dispatch2(const VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list<boost::undirectedS, double>; DistanceMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, double, double&>; WeightMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>; Params = boost::bgl_named_params<_project2nd<double, double>, boost::distance_combine_t, boost::bgl_named_params<std::less<double>, boost::distance_compare_t, boost::bgl_named_params<boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params<long unsigned int*, boost::vertex_predecessor_t, boost::no_property> > > >; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’
528 | dijkstra_shortest_paths(g, s,
| ~~~~~~~~~~~~~~~~~~~~~~~^~~~~~
529 | choose_param(get_param(params, vertex_predecessor), p_map),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
530 | distance, weight, index_map,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~
531 | choose_param(
| ~~~~~~~~~~~~~
532 | get_param(params, distance_compare_t()), std::less< D >()),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
533 | choose_param(
| ~~~~~~~~~~~~~
534 | get_param(params, distance_combine_t()), std::plus< D >()),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
535 | inf, choose_param(get_param(params, distance_zero_t()), D()),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
536 | choose_param(get_param(params, graph_visitor),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
537 | make_dijkstra_visitor(null_visitor())),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
538 | params);
| ~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dijkstra_shortest_paths.hpp:554:35: required from ‘void boost::detail::dijkstra_dispatch1(const VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list<boost::undirectedS, double>; DistanceMap = boost::param_not_found; WeightMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>; Params = boost::bgl_named_params<_project2nd<double, double>, boost::distance_combine_t, boost::bgl_named_params<std::less<double>, boost::distance_compare_t, boost::bgl_named_params<boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params<long unsigned int*, boost::vertex_predecessor_t, boost::no_property> > > >; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’
554 | detail::dijkstra_dispatch2(g, s,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~
555 | choose_param(distance,
| ~~~~~~~~~~~~~~~~~~~~~~
556 | make_iterator_property_map(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~
557 | distance_map.begin(), index_map, distance_map[0])),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
558 | weight, index_map, params);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dijkstra_shortest_paths.hpp:570:31: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with VertexListGraph = R_adjacency_list<undirectedS, double>; Param = detail::_project2nd<double, double>; Tag = distance_combine_t; Rest = bgl_named_params<std::less<double>, distance_compare_t, bgl_named_params<adj_list_edge_property_map<undirected_tag, double, const double&, long unsigned int, const property<edge_weight_t, double, no_property>, edge_weight_t>, edge_weight_t, bgl_named_params<long unsigned int*, vertex_predecessor_t, no_property> > >; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
570 | detail::dijkstra_dispatch1(g, s, get_param(params, vertex_distance),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
571 | choose_const_pmap(get_param(params, edge_weight), g, edge_weight),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
572 | choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
573 | params);
| ~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:43:32: required from ‘void boost::detail::prim_mst_impl(const Graph&, typename boost::graph_traits<Graph>::vertex_descriptor, const boost::bgl_named_params<T, Tag, Base>&, Weight) [with Graph = R_adjacency_list<boost::undirectedS, double>; P = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>; T = boost::edge_weight_t; R = boost::bgl_named_params<long unsigned int*, boost::vertex_predecessor_t, boost::no_property>; Weight = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’
43 | dijkstra_shortest_paths(
| ~~~~~~~~~~~~~~~~~~~~~~~^
44 | G, s, params.distance_compare(compare).distance_combine(combine));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:77:26: required from ‘void boost::prim_minimum_spanning_tree(const VertexListGraph&, PredecessorMap) [with VertexListGraph = R_adjacency_list<undirectedS, double>; PredecessorMap = long unsigned int*]’
77 | detail::prim_mst_impl(g, *vertices(g).first,
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
78 | predecessor_map(p_map).weight_map(get(edge_weight, g)),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
79 | get(edge_weight, g));
| ~~~~~~~~~~~~~~~~~~~~
minST.cpp:89:35: required from here
89 | prim_minimum_spanning_tree(g, &parent[0]);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::concepts::MultiPassInputIterator<T>::~MultiPassInputIterator() [with T = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > >, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > >, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > >, boost::property<boost::edge_weight_t, double, boost::no_property> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int>]’
37 | ~model()
| ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:52:50: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
52 | BOOST_concept(MultiPassInputIterator, (T)) { BOOST_CONCEPT_USAGE(
| ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Convertible<boost::undir_adj_list_traversal_tag, boost::incidence_graph_tag> >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible<boost::undir_adj_list_traversal_tag, boost::incidence_graph_tag>’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::Convertible<boost::undir_adj_list_traversal_tag, boost::incidence_graph_tag>]’
32 | inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
| ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied<boost::Convertible<boost::undir_adj_list_traversal_tag, boost::incidence_graph_tag> >::value’
44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied<boost::Convertible<boost::undir_adj_list_traversal_tag, boost::incidence_graph_tag> >’
45 | typedef boost::integral_constant<bool, value> type;
| ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_<void (*)(boost::Convertible<boost::undir_adj_list_traversal_tag, boost::incidence_graph_tag>)>’
72 | struct requirement_<void(*)(Model)>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:93:9: [ skipping 8 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dijkstra_shortest_paths.hpp:528:32: required from ‘void boost::detail::dijkstra_dispatch2(const VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list<boost::undirectedS, double>; DistanceMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, double, double&>; WeightMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>; Params = boost::bgl_named_params<_project2nd<double, double>, boost::distance_combine_t, boost::bgl_named_params<std::less<double>, boost::distance_compare_t, boost::bgl_named_params<boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params<long unsigned int*, boost::vertex_predecessor_t, boost::no_property> > > >; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’
528 | dijkstra_shortest_paths(g, s,
| ~~~~~~~~~~~~~~~~~~~~~~~^~~~~~
529 | choose_param(get_param(params, vertex_predecessor), p_map),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
530 | distance, weight, index_map,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~
531 | choose_param(
| ~~~~~~~~~~~~~
532 | get_param(params, distance_compare_t()), std::less< D >()),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
533 | choose_param(
| ~~~~~~~~~~~~~
534 | get_param(params, distance_combine_t()), std::plus< D >()),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
535 | inf, choose_param(get_param(params, distance_zero_t()), D()),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
536 | choose_param(get_param(params, graph_visitor),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
537 | make_dijkstra_visitor(null_visitor())),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
538 | params);
| ~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dijkstra_shortest_paths.hpp:554:35: required from ‘void boost::detail::dijkstra_dispatch1(const VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list<boost::undirectedS, double>; DistanceMap = boost::param_not_found; WeightMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>; Params = boost::bgl_named_params<_project2nd<double, double>, boost::distance_combine_t, boost::bgl_named_params<std::less<double>, boost::distance_compare_t, boost::bgl_named_params<boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params<long unsigned int*, boost::vertex_predecessor_t, boost::no_property> > > >; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’
554 | detail::dijkstra_dispatch2(g, s,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~
555 | choose_param(distance,
| ~~~~~~~~~~~~~~~~~~~~~~
556 | make_iterator_property_map(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~
557 | distance_map.begin(), index_map, distance_map[0])),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
558 | weight, index_map, params);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dijkstra_shortest_paths.hpp:570:31: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with VertexListGraph = R_adjacency_list<undirectedS, double>; Param = detail::_project2nd<double, double>; Tag = distance_combine_t; Rest = bgl_named_params<std::less<double>, distance_compare_t, bgl_named_params<adj_list_edge_property_map<undirected_tag, double, const double&, long unsigned int, const property<edge_weight_t, double, no_property>, edge_weight_t>, edge_weight_t, bgl_named_params<long unsigned int*, vertex_predecessor_t, no_property> > >; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
570 | detail::dijkstra_dispatch1(g, s, get_param(params, vertex_distance),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
571 | choose_const_pmap(get_param(params, edge_weight), g, edge_weight),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
572 | choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
573 | params);
| ~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:43:32: required from ‘void boost::detail::prim_mst_impl(const Graph&, typename boost::graph_traits<Graph>::vertex_descriptor, const boost::bgl_named_params<T, Tag, Base>&, Weight) [with Graph = R_adjacency_list<boost::undirectedS, double>; P = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>; T = boost::edge_weight_t; R = boost::bgl_named_params<long unsigned int*, boost::vertex_predecessor_t, boost::no_property>; Weight = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’
43 | dijkstra_shortest_paths(
| ~~~~~~~~~~~~~~~~~~~~~~~^
44 | G, s, params.distance_compare(compare).distance_combine(combine));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:77:26: required from ‘void boost::prim_minimum_spanning_tree(const VertexListGraph&, PredecessorMap) [with VertexListGraph = R_adjacency_list<undirectedS, double>; PredecessorMap = long unsigned int*]’
77 | detail::prim_mst_impl(g, *vertices(g).first,
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
78 | predecessor_map(p_map).weight_map(get(edge_weight, g)),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
79 | get(edge_weight, g));
| ~~~~~~~~~~~~~~~~~~~~
minST.cpp:89:35: required from here
89 | prim_minimum_spanning_tree(g, &parent[0]);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Convertible<boost::undir_adj_list_traversal_tag, boost::incidence_graph_tag>]’
20 | ~usage_requirements() { ((Model*)0)->~Model(); }
| ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::Convertible<boost::undir_adj_list_traversal_tag, boost::incidence_graph_tag>]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:93:9: required from ‘boost::concepts::IncidenceGraph<G>::~IncidenceGraph() [with G = R_adjacency_list<boost::undirectedS, double>]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/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<R_adjacency_list<boost::undirectedS, double> >]’
75 | BOOST_concept(IncidenceGraph, (G)) : Graph< G >
| ^~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:62:5: required from ‘void boost::breadth_first_visit(const IncidenceGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with IncidenceGraph = R_adjacency_list<undirectedS, double>; Buffer = d_ary_heap_indirect<long unsigned int, 4, iterator_property_map<long unsigned int*, vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>, iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > >, vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>, double, double&>, std::less<double>, std::vector<long unsigned int> >; BFSVisitor = detail::dijkstra_bfs_visitor<dijkstra_visitor<>, d_ary_heap_indirect<long unsigned int, 4, iterator_property_map<long unsigned int*, vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>, iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > >, vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>, double, double&>, std::less<double>, std::vector<long unsigned int> >, adj_list_edge_property_map<undirected_tag, double, const double&, long unsigned int, const property<edge_weight_t, double, no_property>, edge_weight_t>, long unsigned int*, iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > >, vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>, double, double&>, detail::_project2nd<double, double>, std::less<double> >; ColorMap = two_bit_color_map<vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int> >; SourceIterator = long unsigned int*]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dijkstra_shortest_paths.hpp:387:24: required from ‘void boost::dijkstra_shortest_paths_no_init(const Graph&, SourceInputIter, SourceInputIter, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistZero, DijkstraVisitor, ColorMap) [with Graph = R_adjacency_list<undirectedS, double>; SourceInputIter = long unsigned int*; DijkstraVisitor = dijkstra_visitor<>; PredecessorMap = long unsigned int*; DistanceMap = iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > >, vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>, double, double&>; WeightMap = adj_list_edge_property_map<undirected_tag, double, const double&, long unsigned int, const property<edge_weight_t, double, no_property>, edge_weight_t>; IndexMap = vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>; Compare = std::less<double>; Combine = detail::_project2nd<double, double>; DistZero = double; ColorMap = two_bit_color_map<vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int> >]’
387 | breadth_first_visit(g, s_begin, s_end, Q, bfs_vis, color);
| ~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dijkstra_shortest_paths.hpp:464:36: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, SourceInputIter, SourceInputIter, PredecessorMap, DistanceMap, WeightMap, IndexMap, Compare, Combine, DistInf, DistZero, DijkstraVisitor, ColorMap) [with VertexListGraph = R_adjacency_list<undirectedS, double>; SourceInputIter = long unsigned int*; DijkstraVisitor = dijkstra_visitor<>; PredecessorMap = long unsigned int*; DistanceMap = iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > >, vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>, double, double&>; WeightMap = adj_list_edge_property_map<undirected_tag, double, const double&, long unsigned int, const property<edge_weight_t, double, no_property>, edge_weight_t>; IndexMap = vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>; Compare = std::less<double>; Combine = detail::_project2nd<double, double>; DistInf = double; DistZero = double; ColorMap = two_bit_color_map<vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int> >]’
464 | dijkstra_shortest_paths_no_init(g, s_begin, s_end, predecessor, distance,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
465 | weight, index_map, compare, combine, zero, vis, color);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dijkstra_shortest_paths.hpp:417:28: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dijkstra_shortest_paths.hpp:528:32: required from ‘void boost::detail::dijkstra_dispatch2(const VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list<boost::undirectedS, double>; DistanceMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, double, double&>; WeightMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>; Params = boost::bgl_named_params<_project2nd<double, double>, boost::distance_combine_t, boost::bgl_named_params<std::less<double>, boost::distance_compare_t, boost::bgl_named_params<boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params<long unsigned int*, boost::vertex_predecessor_t, boost::no_property> > > >; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’
528 | dijkstra_shortest_paths(g, s,
| ~~~~~~~~~~~~~~~~~~~~~~~^~~~~~
529 | choose_param(get_param(params, vertex_predecessor), p_map),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
530 | distance, weight, index_map,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~
531 | choose_param(
| ~~~~~~~~~~~~~
532 | get_param(params, distance_compare_t()), std::less< D >()),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
533 | choose_param(
| ~~~~~~~~~~~~~
534 | get_param(params, distance_combine_t()), std::plus< D >()),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
535 | inf, choose_param(get_param(params, distance_zero_t()), D()),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
536 | choose_param(get_param(params, graph_visitor),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
537 | make_dijkstra_visitor(null_visitor())),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
538 | params);
| ~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dijkstra_shortest_paths.hpp:554:35: required from ‘void boost::detail::dijkstra_dispatch1(const VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list<boost::undirectedS, double>; DistanceMap = boost::param_not_found; WeightMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>; Params = boost::bgl_named_params<_project2nd<double, double>, boost::distance_combine_t, boost::bgl_named_params<std::less<double>, boost::distance_compare_t, boost::bgl_named_params<boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params<long unsigned int*, boost::vertex_predecessor_t, boost::no_property> > > >; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’
554 | detail::dijkstra_dispatch2(g, s,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~
555 | choose_param(distance,
| ~~~~~~~~~~~~~~~~~~~~~~
556 | make_iterator_property_map(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~
557 | distance_map.begin(), index_map, distance_map[0])),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
558 | weight, index_map, params);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dijkstra_shortest_paths.hpp:570:31: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with VertexListGraph = R_adjacency_list<undirectedS, double>; Param = detail::_project2nd<double, double>; Tag = distance_combine_t; Rest = bgl_named_params<std::less<double>, distance_compare_t, bgl_named_params<adj_list_edge_property_map<undirected_tag, double, const double&, long unsigned int, const property<edge_weight_t, double, no_property>, edge_weight_t>, edge_weight_t, bgl_named_params<long unsigned int*, vertex_predecessor_t, no_property> > >; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
570 | detail::dijkstra_dispatch1(g, s, get_param(params, vertex_distance),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
571 | choose_const_pmap(get_param(params, edge_weight), g, edge_weight),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
572 | choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
573 | params);
| ~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:43:32: required from ‘void boost::detail::prim_mst_impl(const Graph&, typename boost::graph_traits<Graph>::vertex_descriptor, const boost::bgl_named_params<T, Tag, Base>&, Weight) [with Graph = R_adjacency_list<boost::undirectedS, double>; P = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>; T = boost::edge_weight_t; R = boost::bgl_named_params<long unsigned int*, boost::vertex_predecessor_t, boost::no_property>; Weight = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’
43 | dijkstra_shortest_paths(
| ~~~~~~~~~~~~~~~~~~~~~~~^
44 | G, s, params.distance_compare(compare).distance_combine(combine));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:77:26: required from ‘void boost::prim_minimum_spanning_tree(const VertexListGraph&, PredecessorMap) [with VertexListGraph = R_adjacency_list<undirectedS, double>; PredecessorMap = long unsigned int*]’
77 | detail::prim_mst_impl(g, *vertices(g).first,
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
78 | predecessor_map(p_map).weight_map(get(edge_weight, g)),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
79 | get(edge_weight, g));
| ~~~~~~~~~~~~~~~~~~~~
minST.cpp:89:35: required from here
89 | prim_minimum_spanning_tree(g, &parent[0]);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible<X, Y>::~Convertible() [with X = boost::undir_adj_list_traversal_tag; Y = boost::incidence_graph_tag]’
37 | ~model()
| ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
208 | BOOST_CONCEPT_USAGE(Convertible) {
| ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::CopyConstructible<boost::detail::dijkstra_bfs_visitor<boost::dijkstra_visitor<>, boost::d_ary_heap_indirect<long unsigned int, 4, boost::iterator_property_map<long unsigned int*, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, double, double&>, std::less<double>, std::vector<long unsigned int> >, boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>, long unsigned int*, boost::iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, double, double&>, boost::detail::_project2nd<double, double>, std::less<double> > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::CopyConstructible<boost::detail::dijkstra_bfs_visitor<boost::dijkstra_visitor<>, boost::d_ary_heap_indirect<long unsigned int, 4, boost::iterator_property_map<long unsigned int*, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, double, double&>, std::less<double>, std::vector<long unsigned int> >, boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>, long unsigned int*, boost::iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, double, double&>, boost::detail::_project2nd<double, double>, std::less<double> > > >]’
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:167:5: required from ‘struct boost::CopyConstructible<boost::detail::dijkstra_bfs_visitor<boost::dijkstra_visitor<>, boost::d_ary_heap_indirect<long unsigned int, 4, boost::iterator_property_map<long unsigned int*, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, double, double&>, std::less<double>, std::vector<long unsigned int> >, boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>, long unsigned int*, boost::iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, double, double&>, boost::detail::_project2nd<double, double>, std::less<double> > >’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:165:3: required from ‘struct boost::CopyConstructibleConcept<boost::detail::dijkstra_bfs_visitor<boost::dijkstra_visitor<>, boost::d_ary_heap_indirect<long unsigned int, 4, boost::iterator_property_map<long unsigned int*, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, double, double&>, std::less<double>, std::vector<long unsigned int> >, boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>, long unsigned int*, boost::iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, double, double&>, boost::detail::_project2nd<double, double>, std::less<double> > >’
165 | BOOST_concept(CopyConstructible,(TT))
| ^~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::CopyConstructibleConcept<boost::detail::dijkstra_bfs_visitor<boost::dijkstra_visitor<>, boost::d_ary_heap_indirect<long unsigned int, 4, boost::iterator_property_map<long unsigned int*, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, double, double&>, std::less<double>, std::vector<long unsigned int> >, boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>, long unsigned int*, boost::iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, double, double&>, boost::detail::_project2nd<double, double>, std::less<double> > >]’
32 | inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
| ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied<boost::CopyConstructibleConcept<boost::detail::dijkstra_bfs_visitor<boost::dijkstra_visitor<>, boost::d_ary_heap_indirect<long unsigned int, 4, boost::iterator_property_map<long unsigned int*, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, double, double&>, std::less<double>, std::vector<long unsigned int> >, boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>, long unsigned int*, boost::iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, double, double&>, boost::detail::_project2nd<double, double>, std::less<double> > > >::value’
44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 13 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dijkstra_shortest_paths.hpp:528:32: required from ‘void boost::detail::dijkstra_dispatch2(const VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list<boost::undirectedS, double>; DistanceMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, double, double&>; WeightMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>; Params = boost::bgl_named_params<_project2nd<double, double>, boost::distance_combine_t, boost::bgl_named_params<std::less<double>, boost::distance_compare_t, boost::bgl_named_params<boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params<long unsigned int*, boost::vertex_predecessor_t, boost::no_property> > > >; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’
528 | dijkstra_shortest_paths(g, s,
| ~~~~~~~~~~~~~~~~~~~~~~~^~~~~~
529 | choose_param(get_param(params, vertex_predecessor), p_map),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
530 | distance, weight, index_map,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~
531 | choose_param(
| ~~~~~~~~~~~~~
532 | get_param(params, distance_compare_t()), std::less< D >()),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
533 | choose_param(
| ~~~~~~~~~~~~~
534 | get_param(params, distance_combine_t()), std::plus< D >()),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
535 | inf, choose_param(get_param(params, distance_zero_t()), D()),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
536 | choose_param(get_param(params, graph_visitor),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
537 | make_dijkstra_visitor(null_visitor())),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
538 | params);
| ~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dijkstra_shortest_paths.hpp:554:35: required from ‘void boost::detail::dijkstra_dispatch1(const VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list<boost::undirectedS, double>; DistanceMap = boost::param_not_found; WeightMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>; Params = boost::bgl_named_params<_project2nd<double, double>, boost::distance_combine_t, boost::bgl_named_params<std::less<double>, boost::distance_compare_t, boost::bgl_named_params<boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params<long unsigned int*, boost::vertex_predecessor_t, boost::no_property> > > >; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’
554 | detail::dijkstra_dispatch2(g, s,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~
555 | choose_param(distance,
| ~~~~~~~~~~~~~~~~~~~~~~
556 | make_iterator_property_map(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~
557 | distance_map.begin(), index_map, distance_map[0])),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
558 | weight, index_map, params);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dijkstra_shortest_paths.hpp:570:31: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with VertexListGraph = R_adjacency_list<undirectedS, double>; Param = detail::_project2nd<double, double>; Tag = distance_combine_t; Rest = bgl_named_params<std::less<double>, distance_compare_t, bgl_named_params<adj_list_edge_property_map<undirected_tag, double, const double&, long unsigned int, const property<edge_weight_t, double, no_property>, edge_weight_t>, edge_weight_t, bgl_named_params<long unsigned int*, vertex_predecessor_t, no_property> > >; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
570 | detail::dijkstra_dispatch1(g, s, get_param(params, vertex_distance),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
571 | choose_const_pmap(get_param(params, edge_weight), g, edge_weight),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
572 | choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
573 | params);
| ~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:43:32: required from ‘void boost::detail::prim_mst_impl(const Graph&, typename boost::graph_traits<Graph>::vertex_descriptor, const boost::bgl_named_params<T, Tag, Base>&, Weight) [with Graph = R_adjacency_list<boost::undirectedS, double>; P = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>; T = boost::edge_weight_t; R = boost::bgl_named_params<long unsigned int*, boost::vertex_predecessor_t, boost::no_property>; Weight = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’
43 | dijkstra_shortest_paths(
| ~~~~~~~~~~~~~~~~~~~~~~~^
44 | G, s, params.distance_compare(compare).distance_combine(combine));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:77:26: required from ‘void boost::prim_minimum_spanning_tree(const VertexListGraph&, PredecessorMap) [with VertexListGraph = R_adjacency_list<undirectedS, double>; PredecessorMap = long unsigned int*]’
77 | detail::prim_mst_impl(g, *vertices(g).first,
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
78 | predecessor_map(p_map).weight_map(get(edge_weight, g)),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
79 | get(edge_weight, g));
| ~~~~~~~~~~~~~~~~~~~~
minST.cpp:89:35: required from here
89 | prim_minimum_spanning_tree(g, &parent[0]);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
20 | ~usage_requirements() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::CopyConstructible<TT>::~CopyConstructible() [with TT = boost::detail::dijkstra_bfs_visitor<boost::dijkstra_visitor<>, boost::d_ary_heap_indirect<long unsigned int, 4, boost::iterator_property_map<long unsigned int*, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, double, double&>, std::less<double>, std::vector<long unsigned int> >, boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>, long unsigned int*, boost::iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, double, double&>, boost::detail::_project2nd<double, double>, std::less<double> >]’
37 | ~model()
| ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:167:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
167 | BOOST_CONCEPT_USAGE(CopyConstructible) {
| ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Convertible<boost::read_write_property_map_tag, boost::readable_property_map_tag> >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible<boost::read_write_property_map_tag, boost::readable_property_map_tag>’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:206:3: required from ‘struct boost::ConvertibleConcept<boost::read_write_property_map_tag, boost::readable_property_map_tag>’
206 | BOOST_concept(Convertible,(X)(Y))
| ^~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::ConvertibleConcept<boost::read_write_property_map_tag, boost::readable_property_map_tag>]’
32 | inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
| ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied<boost::ConvertibleConcept<boost::read_write_property_map_tag, boost::readable_property_map_tag> >::value’
44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied<boost::ConvertibleConcept<boost::read_write_property_map_tag, boost::readable_property_map_tag> >’
45 | typedef boost::integral_constant<bool, value> type;
| ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 17 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dijkstra_shortest_paths.hpp:528:32: required from ‘void boost::detail::dijkstra_dispatch2(const VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list<boost::undirectedS, double>; DistanceMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, double, double&>; WeightMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>; Params = boost::bgl_named_params<_project2nd<double, double>, boost::distance_combine_t, boost::bgl_named_params<std::less<double>, boost::distance_compare_t, boost::bgl_named_params<boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params<long unsigned int*, boost::vertex_predecessor_t, boost::no_property> > > >; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’
528 | dijkstra_shortest_paths(g, s,
| ~~~~~~~~~~~~~~~~~~~~~~~^~~~~~
529 | choose_param(get_param(params, vertex_predecessor), p_map),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
530 | distance, weight, index_map,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~
531 | choose_param(
| ~~~~~~~~~~~~~
532 | get_param(params, distance_compare_t()), std::less< D >()),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
533 | choose_param(
| ~~~~~~~~~~~~~
534 | get_param(params, distance_combine_t()), std::plus< D >()),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
535 | inf, choose_param(get_param(params, distance_zero_t()), D()),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
536 | choose_param(get_param(params, graph_visitor),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
537 | make_dijkstra_visitor(null_visitor())),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
538 | params);
| ~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dijkstra_shortest_paths.hpp:554:35: required from ‘void boost::detail::dijkstra_dispatch1(const VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list<boost::undirectedS, double>; DistanceMap = boost::param_not_found; WeightMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>; Params = boost::bgl_named_params<_project2nd<double, double>, boost::distance_combine_t, boost::bgl_named_params<std::less<double>, boost::distance_compare_t, boost::bgl_named_params<boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params<long unsigned int*, boost::vertex_predecessor_t, boost::no_property> > > >; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’
554 | detail::dijkstra_dispatch2(g, s,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~
555 | choose_param(distance,
| ~~~~~~~~~~~~~~~~~~~~~~
556 | make_iterator_property_map(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~
557 | distance_map.begin(), index_map, distance_map[0])),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
558 | weight, index_map, params);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dijkstra_shortest_paths.hpp:570:31: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with VertexListGraph = R_adjacency_list<undirectedS, double>; Param = detail::_project2nd<double, double>; Tag = distance_combine_t; Rest = bgl_named_params<std::less<double>, distance_compare_t, bgl_named_params<adj_list_edge_property_map<undirected_tag, double, const double&, long unsigned int, const property<edge_weight_t, double, no_property>, edge_weight_t>, edge_weight_t, bgl_named_params<long unsigned int*, vertex_predecessor_t, no_property> > >; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
570 | detail::dijkstra_dispatch1(g, s, get_param(params, vertex_distance),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
571 | choose_const_pmap(get_param(params, edge_weight), g, edge_weight),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
572 | choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
573 | params);
| ~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:43:32: required from ‘void boost::detail::prim_mst_impl(const Graph&, typename boost::graph_traits<Graph>::vertex_descriptor, const boost::bgl_named_params<T, Tag, Base>&, Weight) [with Graph = R_adjacency_list<boost::undirectedS, double>; P = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>; T = boost::edge_weight_t; R = boost::bgl_named_params<long unsigned int*, boost::vertex_predecessor_t, boost::no_property>; Weight = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’
43 | dijkstra_shortest_paths(
| ~~~~~~~~~~~~~~~~~~~~~~~^
44 | G, s, params.distance_compare(compare).distance_combine(combine));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:77:26: required from ‘void boost::prim_minimum_spanning_tree(const VertexListGraph&, PredecessorMap) [with VertexListGraph = R_adjacency_list<undirectedS, double>; PredecessorMap = long unsigned int*]’
77 | detail::prim_mst_impl(g, *vertices(g).first,
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
78 | predecessor_map(p_map).weight_map(get(edge_weight, g)),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
79 | get(edge_weight, g));
| ~~~~~~~~~~~~~~~~~~~~
minST.cpp:89:35: required from here
89 | prim_minimum_spanning_tree(g, &parent[0]);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Convertible<boost::read_write_property_map_tag, boost::readable_property_map_tag>]’
20 | ~usage_requirements() { ((Model*)0)->~Model(); }
| ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::ConvertibleConcept<boost::read_write_property_map_tag, boost::readable_property_map_tag>]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:148:7: required from ‘void boost::ReadablePropertyMapConcept<PMap, Key>::constraints() [with PMap = boost::two_bit_color_map<boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int> >; Key = long unsigned int]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::ReadablePropertyMapConcept<boost::two_bit_color_map<boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int> >, long unsigned int>]’
32 | inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
| ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied<boost::ReadablePropertyMapConcept<boost::two_bit_color_map<boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int> >, long unsigned int> >::value’
44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied<boost::ReadablePropertyMapConcept<boost::two_bit_color_map<boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int> >, long unsigned int> >’
45 | typedef boost::integral_constant<bool, value> type;
| ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_<void (*)(boost::ReadablePropertyMapConcept<boost::two_bit_color_map<boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int> >, long unsigned int>)>’
72 | struct requirement_<void(*)(Model)>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:206:7: [ skipping 11 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dijkstra_shortest_paths.hpp:528:32: required from ‘void boost::detail::dijkstra_dispatch2(const VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list<boost::undirectedS, double>; DistanceMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, double, double&>; WeightMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>; Params = boost::bgl_named_params<_project2nd<double, double>, boost::distance_combine_t, boost::bgl_named_params<std::less<double>, boost::distance_compare_t, boost::bgl_named_params<boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params<long unsigned int*, boost::vertex_predecessor_t, boost::no_property> > > >; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’
528 | dijkstra_shortest_paths(g, s,
| ~~~~~~~~~~~~~~~~~~~~~~~^~~~~~
529 | choose_param(get_param(params, vertex_predecessor), p_map),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
530 | distance, weight, index_map,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~
531 | choose_param(
| ~~~~~~~~~~~~~
532 | get_param(params, distance_compare_t()), std::less< D >()),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
533 | choose_param(
| ~~~~~~~~~~~~~
534 | get_param(params, distance_combine_t()), std::plus< D >()),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
535 | inf, choose_param(get_param(params, distance_zero_t()), D()),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
536 | choose_param(get_param(params, graph_visitor),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
537 | make_dijkstra_visitor(null_visitor())),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
538 | params);
| ~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dijkstra_shortest_paths.hpp:554:35: required from ‘void boost::detail::dijkstra_dispatch1(const VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list<boost::undirectedS, double>; DistanceMap = boost::param_not_found; WeightMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>; Params = boost::bgl_named_params<_project2nd<double, double>, boost::distance_combine_t, boost::bgl_named_params<std::less<double>, boost::distance_compare_t, boost::bgl_named_params<boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params<long unsigned int*, boost::vertex_predecessor_t, boost::no_property> > > >; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’
554 | detail::dijkstra_dispatch2(g, s,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~
555 | choose_param(distance,
| ~~~~~~~~~~~~~~~~~~~~~~
556 | make_iterator_property_map(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~
557 | distance_map.begin(), index_map, distance_map[0])),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
558 | weight, index_map, params);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dijkstra_shortest_paths.hpp:570:31: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with VertexListGraph = R_adjacency_list<undirectedS, double>; Param = detail::_project2nd<double, double>; Tag = distance_combine_t; Rest = bgl_named_params<std::less<double>, distance_compare_t, bgl_named_params<adj_list_edge_property_map<undirected_tag, double, const double&, long unsigned int, const property<edge_weight_t, double, no_property>, edge_weight_t>, edge_weight_t, bgl_named_params<long unsigned int*, vertex_predecessor_t, no_property> > >; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
570 | detail::dijkstra_dispatch1(g, s, get_param(params, vertex_distance),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
571 | choose_const_pmap(get_param(params, edge_weight), g, edge_weight),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
572 | choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
573 | params);
| ~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:43:32: required from ‘void boost::detail::prim_mst_impl(const Graph&, typename boost::graph_traits<Graph>::vertex_descriptor, const boost::bgl_named_params<T, Tag, Base>&, Weight) [with Graph = R_adjacency_list<boost::undirectedS, double>; P = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>; T = boost::edge_weight_t; R = boost::bgl_named_params<long unsigned int*, boost::vertex_predecessor_t, boost::no_property>; Weight = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’
43 | dijkstra_shortest_paths(
| ~~~~~~~~~~~~~~~~~~~~~~~^
44 | G, s, params.distance_compare(compare).distance_combine(combine));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:77:26: required from ‘void boost::prim_minimum_spanning_tree(const VertexListGraph&, PredecessorMap) [with VertexListGraph = R_adjacency_list<undirectedS, double>; PredecessorMap = long unsigned int*]’
77 | detail::prim_mst_impl(g, *vertices(g).first,
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
78 | predecessor_map(p_map).weight_map(get(edge_weight, g)),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
79 | get(edge_weight, g));
| ~~~~~~~~~~~~~~~~~~~~
minST.cpp:89:35: required from here
89 | prim_minimum_spanning_tree(g, &parent[0]);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:206:17: note: in a call to non-static member function ‘boost::ConvertibleConcept<boost::read_write_property_map_tag, boost::readable_property_map_tag>::~ConvertibleConcept()’
206 | BOOST_concept(Convertible,(X)(Y))
| ^~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/preprocessor/cat.hpp:29:34: note: in definition of macro ‘BOOST_PP_CAT_I’
29 | # define BOOST_PP_CAT_I(a, b) a ## b
| ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/concept_def.hpp:23:12: note: in expansion of macro ‘BOOST_PP_CAT’
23 | struct BOOST_PP_CAT(name,Concept) \
| ^~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:206:3: note: in expansion of macro ‘BOOST_concept’
206 | BOOST_concept(Convertible,(X)(Y))
| ^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Convertible<boost::read_write_property_map_tag, boost::writable_property_map_tag> >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible<boost::read_write_property_map_tag, boost::writable_property_map_tag>’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:206:3: required from ‘struct boost::ConvertibleConcept<boost::read_write_property_map_tag, boost::writable_property_map_tag>’
206 | BOOST_concept(Convertible,(X)(Y))
| ^~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::ConvertibleConcept<boost::read_write_property_map_tag, boost::writable_property_map_tag>]’
32 | inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
| ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied<boost::ConvertibleConcept<boost::read_write_property_map_tag, boost::writable_property_map_tag> >::value’
44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied<boost::ConvertibleConcept<boost::read_write_property_map_tag, boost::writable_property_map_tag> >’
45 | typedef boost::integral_constant<bool, value> type;
| ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 17 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dijkstra_shortest_paths.hpp:528:32: required from ‘void boost::detail::dijkstra_dispatch2(const VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list<boost::undirectedS, double>; DistanceMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, double, double&>; WeightMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>; Params = boost::bgl_named_params<_project2nd<double, double>, boost::distance_combine_t, boost::bgl_named_params<std::less<double>, boost::distance_compare_t, boost::bgl_named_params<boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params<long unsigned int*, boost::vertex_predecessor_t, boost::no_property> > > >; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’
528 | dijkstra_shortest_paths(g, s,
| ~~~~~~~~~~~~~~~~~~~~~~~^~~~~~
529 | choose_param(get_param(params, vertex_predecessor), p_map),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
530 | distance, weight, index_map,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~
531 | choose_param(
| ~~~~~~~~~~~~~
532 | get_param(params, distance_compare_t()), std::less< D >()),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
533 | choose_param(
| ~~~~~~~~~~~~~
534 | get_param(params, distance_combine_t()), std::plus< D >()),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
535 | inf, choose_param(get_param(params, distance_zero_t()), D()),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
536 | choose_param(get_param(params, graph_visitor),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
537 | make_dijkstra_visitor(null_visitor())),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
538 | params);
| ~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dijkstra_shortest_paths.hpp:554:35: required from ‘void boost::detail::dijkstra_dispatch1(const VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list<boost::undirectedS, double>; DistanceMap = boost::param_not_found; WeightMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>; Params = boost::bgl_named_params<_project2nd<double, double>, boost::distance_combine_t, boost::bgl_named_params<std::less<double>, boost::distance_compare_t, boost::bgl_named_params<boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params<long unsigned int*, boost::vertex_predecessor_t, boost::no_property> > > >; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’
554 | detail::dijkstra_dispatch2(g, s,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~
555 | choose_param(distance,
| ~~~~~~~~~~~~~~~~~~~~~~
556 | make_iterator_property_map(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~
557 | distance_map.begin(), index_map, distance_map[0])),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
558 | weight, index_map, params);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dijkstra_shortest_paths.hpp:570:31: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with VertexListGraph = R_adjacency_list<undirectedS, double>; Param = detail::_project2nd<double, double>; Tag = distance_combine_t; Rest = bgl_named_params<std::less<double>, distance_compare_t, bgl_named_params<adj_list_edge_property_map<undirected_tag, double, const double&, long unsigned int, const property<edge_weight_t, double, no_property>, edge_weight_t>, edge_weight_t, bgl_named_params<long unsigned int*, vertex_predecessor_t, no_property> > >; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
570 | detail::dijkstra_dispatch1(g, s, get_param(params, vertex_distance),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
571 | choose_const_pmap(get_param(params, edge_weight), g, edge_weight),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
572 | choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
573 | params);
| ~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:43:32: required from ‘void boost::detail::prim_mst_impl(const Graph&, typename boost::graph_traits<Graph>::vertex_descriptor, const boost::bgl_named_params<T, Tag, Base>&, Weight) [with Graph = R_adjacency_list<boost::undirectedS, double>; P = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>; T = boost::edge_weight_t; R = boost::bgl_named_params<long unsigned int*, boost::vertex_predecessor_t, boost::no_property>; Weight = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’
43 | dijkstra_shortest_paths(
| ~~~~~~~~~~~~~~~~~~~~~~~^
44 | G, s, params.distance_compare(compare).distance_combine(combine));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:77:26: required from ‘void boost::prim_minimum_spanning_tree(const VertexListGraph&, PredecessorMap) [with VertexListGraph = R_adjacency_list<undirectedS, double>; PredecessorMap = long unsigned int*]’
77 | detail::prim_mst_impl(g, *vertices(g).first,
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
78 | predecessor_map(p_map).weight_map(get(edge_weight, g)),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
79 | get(edge_weight, g));
| ~~~~~~~~~~~~~~~~~~~~
minST.cpp:89:35: required from here
89 | prim_minimum_spanning_tree(g, &parent[0]);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Convertible<boost::read_write_property_map_tag, boost::writable_property_map_tag>]’
20 | ~usage_requirements() { ((Model*)0)->~Model(); }
| ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::ConvertibleConcept<boost::read_write_property_map_tag, boost::writable_property_map_tag>]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:180:7: required from ‘void boost::WritablePropertyMapConcept<PMap, Key>::constraints() [with PMap = boost::two_bit_color_map<boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int> >; Key = long unsigned int]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::WritablePropertyMapConcept<boost::two_bit_color_map<boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int> >, long unsigned int>]’
32 | inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
| ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied<boost::WritablePropertyMapConcept<boost::two_bit_color_map<boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int> >, long unsigned int> >::value’
44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied<boost::WritablePropertyMapConcept<boost::two_bit_color_map<boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int> >, long unsigned int> >’
45 | typedef boost::integral_constant<bool, value> type;
| ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_<void (*)(boost::WritablePropertyMapConcept<boost::two_bit_color_map<boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int> >, long unsigned int>)>’
72 | struct requirement_<void(*)(Model)>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:207:7: [ skipping 11 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dijkstra_shortest_paths.hpp:528:32: required from ‘void boost::detail::dijkstra_dispatch2(const VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list<boost::undirectedS, double>; DistanceMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, double, double&>; WeightMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>; Params = boost::bgl_named_params<_project2nd<double, double>, boost::distance_combine_t, boost::bgl_named_params<std::less<double>, boost::distance_compare_t, boost::bgl_named_params<boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params<long unsigned int*, boost::vertex_predecessor_t, boost::no_property> > > >; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’
528 | dijkstra_shortest_paths(g, s,
| ~~~~~~~~~~~~~~~~~~~~~~~^~~~~~
529 | choose_param(get_param(params, vertex_predecessor), p_map),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
530 | distance, weight, index_map,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~
531 | choose_param(
| ~~~~~~~~~~~~~
532 | get_param(params, distance_compare_t()), std::less< D >()),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
533 | choose_param(
| ~~~~~~~~~~~~~
534 | get_param(params, distance_combine_t()), std::plus< D >()),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
535 | inf, choose_param(get_param(params, distance_zero_t()), D()),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
536 | choose_param(get_param(params, graph_visitor),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
537 | make_dijkstra_visitor(null_visitor())),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
538 | params);
| ~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dijkstra_shortest_paths.hpp:554:35: required from ‘void boost::detail::dijkstra_dispatch1(const VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list<boost::undirectedS, double>; DistanceMap = boost::param_not_found; WeightMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>; Params = boost::bgl_named_params<_project2nd<double, double>, boost::distance_combine_t, boost::bgl_named_params<std::less<double>, boost::distance_compare_t, boost::bgl_named_params<boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params<long unsigned int*, boost::vertex_predecessor_t, boost::no_property> > > >; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’
554 | detail::dijkstra_dispatch2(g, s,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~
555 | choose_param(distance,
| ~~~~~~~~~~~~~~~~~~~~~~
556 | make_iterator_property_map(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~
557 | distance_map.begin(), index_map, distance_map[0])),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
558 | weight, index_map, params);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dijkstra_shortest_paths.hpp:570:31: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with VertexListGraph = R_adjacency_list<undirectedS, double>; Param = detail::_project2nd<double, double>; Tag = distance_combine_t; Rest = bgl_named_params<std::less<double>, distance_compare_t, bgl_named_params<adj_list_edge_property_map<undirected_tag, double, const double&, long unsigned int, const property<edge_weight_t, double, no_property>, edge_weight_t>, edge_weight_t, bgl_named_params<long unsigned int*, vertex_predecessor_t, no_property> > >; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
570 | detail::dijkstra_dispatch1(g, s, get_param(params, vertex_distance),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
571 | choose_const_pmap(get_param(params, edge_weight), g, edge_weight),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
572 | choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
573 | params);
| ~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:43:32: required from ‘void boost::detail::prim_mst_impl(const Graph&, typename boost::graph_traits<Graph>::vertex_descriptor, const boost::bgl_named_params<T, Tag, Base>&, Weight) [with Graph = R_adjacency_list<boost::undirectedS, double>; P = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>; T = boost::edge_weight_t; R = boost::bgl_named_params<long unsigned int*, boost::vertex_predecessor_t, boost::no_property>; Weight = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’
43 | dijkstra_shortest_paths(
| ~~~~~~~~~~~~~~~~~~~~~~~^
44 | G, s, params.distance_compare(compare).distance_combine(combine));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:77:26: required from ‘void boost::prim_minimum_spanning_tree(const VertexListGraph&, PredecessorMap) [with VertexListGraph = R_adjacency_list<undirectedS, double>; PredecessorMap = long unsigned int*]’
77 | detail::prim_mst_impl(g, *vertices(g).first,
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
78 | predecessor_map(p_map).weight_map(get(edge_weight, g)),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
79 | get(edge_weight, g));
| ~~~~~~~~~~~~~~~~~~~~
minST.cpp:89:35: required from here
89 | prim_minimum_spanning_tree(g, &parent[0]);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:206:17: note: in a call to non-static member function ‘boost::ConvertibleConcept<boost::read_write_property_map_tag, boost::writable_property_map_tag>::~ConvertibleConcept()’
206 | BOOST_concept(Convertible,(X)(Y))
| ^~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/preprocessor/cat.hpp:29:34: note: in definition of macro ‘BOOST_PP_CAT_I’
29 | # define BOOST_PP_CAT_I(a, b) a ## b
| ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/concept_def.hpp:23:12: note: in expansion of macro ‘BOOST_PP_CAT’
23 | struct BOOST_PP_CAT(name,Concept) \
| ^~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:206:3: note: in expansion of macro ‘BOOST_concept’
206 | BOOST_concept(Convertible,(X)(Y))
| ^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Convertible<boost::read_write_property_map_tag, boost::read_write_property_map_tag>]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Convertible<boost::read_write_property_map_tag, boost::read_write_property_map_tag> >]’
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible<boost::read_write_property_map_tag, boost::read_write_property_map_tag>’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:206:3: required from ‘struct boost::ConvertibleConcept<boost::read_write_property_map_tag, boost::read_write_property_map_tag>’
206 | BOOST_concept(Convertible,(X)(Y))
| ^~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::ConvertibleConcept<boost::read_write_property_map_tag, boost::read_write_property_map_tag>]’
32 | inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
| ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied<boost::ConvertibleConcept<boost::read_write_property_map_tag, boost::read_write_property_map_tag> >::value’
44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 13 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dijkstra_shortest_paths.hpp:528:32: required from ‘void boost::detail::dijkstra_dispatch2(const VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list<boost::undirectedS, double>; DistanceMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, double, double&>; WeightMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>; Params = boost::bgl_named_params<_project2nd<double, double>, boost::distance_combine_t, boost::bgl_named_params<std::less<double>, boost::distance_compare_t, boost::bgl_named_params<boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params<long unsigned int*, boost::vertex_predecessor_t, boost::no_property> > > >; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’
528 | dijkstra_shortest_paths(g, s,
| ~~~~~~~~~~~~~~~~~~~~~~~^~~~~~
529 | choose_param(get_param(params, vertex_predecessor), p_map),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
530 | distance, weight, index_map,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~
531 | choose_param(
| ~~~~~~~~~~~~~
532 | get_param(params, distance_compare_t()), std::less< D >()),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
533 | choose_param(
| ~~~~~~~~~~~~~
534 | get_param(params, distance_combine_t()), std::plus< D >()),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
535 | inf, choose_param(get_param(params, distance_zero_t()), D()),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
536 | choose_param(get_param(params, graph_visitor),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
537 | make_dijkstra_visitor(null_visitor())),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
538 | params);
| ~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dijkstra_shortest_paths.hpp:554:35: required from ‘void boost::detail::dijkstra_dispatch1(const VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list<boost::undirectedS, double>; DistanceMap = boost::param_not_found; WeightMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>; Params = boost::bgl_named_params<_project2nd<double, double>, boost::distance_combine_t, boost::bgl_named_params<std::less<double>, boost::distance_compare_t, boost::bgl_named_params<boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params<long unsigned int*, boost::vertex_predecessor_t, boost::no_property> > > >; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’
554 | detail::dijkstra_dispatch2(g, s,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~
555 | choose_param(distance,
| ~~~~~~~~~~~~~~~~~~~~~~
556 | make_iterator_property_map(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~
557 | distance_map.begin(), index_map, distance_map[0])),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
558 | weight, index_map, params);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dijkstra_shortest_paths.hpp:570:31: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with VertexListGraph = R_adjacency_list<undirectedS, double>; Param = detail::_project2nd<double, double>; Tag = distance_combine_t; Rest = bgl_named_params<std::less<double>, distance_compare_t, bgl_named_params<adj_list_edge_property_map<undirected_tag, double, const double&, long unsigned int, const property<edge_weight_t, double, no_property>, edge_weight_t>, edge_weight_t, bgl_named_params<long unsigned int*, vertex_predecessor_t, no_property> > >; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
570 | detail::dijkstra_dispatch1(g, s, get_param(params, vertex_distance),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
571 | choose_const_pmap(get_param(params, edge_weight), g, edge_weight),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
572 | choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
573 | params);
| ~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:43:32: required from ‘void boost::detail::prim_mst_impl(const Graph&, typename boost::graph_traits<Graph>::vertex_descriptor, const boost::bgl_named_params<T, Tag, Base>&, Weight) [with Graph = R_adjacency_list<boost::undirectedS, double>; P = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>; T = boost::edge_weight_t; R = boost::bgl_named_params<long unsigned int*, boost::vertex_predecessor_t, boost::no_property>; Weight = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’
43 | dijkstra_shortest_paths(
| ~~~~~~~~~~~~~~~~~~~~~~~^
44 | G, s, params.distance_compare(compare).distance_combine(combine));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:77:26: required from ‘void boost::prim_minimum_spanning_tree(const VertexListGraph&, PredecessorMap) [with VertexListGraph = R_adjacency_list<undirectedS, double>; PredecessorMap = long unsigned int*]’
77 | detail::prim_mst_impl(g, *vertices(g).first,
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
78 | predecessor_map(p_map).weight_map(get(edge_weight, g)),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
79 | get(edge_weight, g));
| ~~~~~~~~~~~~~~~~~~~~
minST.cpp:89:35: required from here
89 | prim_minimum_spanning_tree(g, &parent[0]);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
20 | ~usage_requirements() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible<X, Y>::~Convertible() [with X = boost::read_write_property_map_tag; Y = boost::read_write_property_map_tag]’
37 | ~model()
| ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
208 | BOOST_CONCEPT_USAGE(Convertible) {
| ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Assignable<long unsigned int*>]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Assignable<long unsigned int*> >]’
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:145:5: required from ‘struct boost::Assignable<long unsigned int*>’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator<long unsigned int*>’
502 | BOOST_concept(InputIterator,(TT))
| ^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:540:3: required from ‘struct boost::ForwardIterator<long unsigned int*>’
540 | BOOST_concept(ForwardIterator,(TT))
| ^~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator<long unsigned int*>’
568 | BOOST_concept(BidirectionalIterator,(TT))
| ^~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3: [ skipping 14 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dijkstra_shortest_paths.hpp:528:32: required from ‘void boost::detail::dijkstra_dispatch2(const VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list<boost::undirectedS, double>; DistanceMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, double, double&>; WeightMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>; Params = boost::bgl_named_params<_project2nd<double, double>, boost::distance_combine_t, boost::bgl_named_params<std::less<double>, boost::distance_compare_t, boost::bgl_named_params<boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params<long unsigned int*, boost::vertex_predecessor_t, boost::no_property> > > >; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’
528 | dijkstra_shortest_paths(g, s,
| ~~~~~~~~~~~~~~~~~~~~~~~^~~~~~
529 | choose_param(get_param(params, vertex_predecessor), p_map),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
530 | distance, weight, index_map,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~
531 | choose_param(
| ~~~~~~~~~~~~~
532 | get_param(params, distance_compare_t()), std::less< D >()),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
533 | choose_param(
| ~~~~~~~~~~~~~
534 | get_param(params, distance_combine_t()), std::plus< D >()),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
535 | inf, choose_param(get_param(params, distance_zero_t()), D()),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
536 | choose_param(get_param(params, graph_visitor),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
537 | make_dijkstra_visitor(null_visitor())),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
538 | params);
| ~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dijkstra_shortest_paths.hpp:554:35: required from ‘void boost::detail::dijkstra_dispatch1(const VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list<boost::undirectedS, double>; DistanceMap = boost::param_not_found; WeightMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>; Params = boost::bgl_named_params<_project2nd<double, double>, boost::distance_combine_t, boost::bgl_named_params<std::less<double>, boost::distance_compare_t, boost::bgl_named_params<boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params<long unsigned int*, boost::vertex_predecessor_t, boost::no_property> > > >; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’
554 | detail::dijkstra_dispatch2(g, s,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~
555 | choose_param(distance,
| ~~~~~~~~~~~~~~~~~~~~~~
556 | make_iterator_property_map(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~
557 | distance_map.begin(), index_map, distance_map[0])),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
558 | weight, index_map, params);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dijkstra_shortest_paths.hpp:570:31: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with VertexListGraph = R_adjacency_list<undirectedS, double>; Param = detail::_project2nd<double, double>; Tag = distance_combine_t; Rest = bgl_named_params<std::less<double>, distance_compare_t, bgl_named_params<adj_list_edge_property_map<undirected_tag, double, const double&, long unsigned int, const property<edge_weight_t, double, no_property>, edge_weight_t>, edge_weight_t, bgl_named_params<long unsigned int*, vertex_predecessor_t, no_property> > >; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
570 | detail::dijkstra_dispatch1(g, s, get_param(params, vertex_distance),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
571 | choose_const_pmap(get_param(params, edge_weight), g, edge_weight),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
572 | choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
573 | params);
| ~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:43:32: required from ‘void boost::detail::prim_mst_impl(const Graph&, typename boost::graph_traits<Graph>::vertex_descriptor, const boost::bgl_named_params<T, Tag, Base>&, Weight) [with Graph = R_adjacency_list<boost::undirectedS, double>; P = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>; T = boost::edge_weight_t; R = boost::bgl_named_params<long unsigned int*, boost::vertex_predecessor_t, boost::no_property>; Weight = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’
43 | dijkstra_shortest_paths(
| ~~~~~~~~~~~~~~~~~~~~~~~^
44 | G, s, params.distance_compare(compare).distance_combine(combine));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:77:26: required from ‘void boost::prim_minimum_spanning_tree(const VertexListGraph&, PredecessorMap) [with VertexListGraph = R_adjacency_list<undirectedS, double>; PredecessorMap = long unsigned int*]’
77 | detail::prim_mst_impl(g, *vertices(g).first,
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
78 | predecessor_map(p_map).weight_map(get(edge_weight, g)),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
79 | get(edge_weight, g));
| ~~~~~~~~~~~~~~~~~~~~
minST.cpp:89:35: required from here
89 | prim_minimum_spanning_tree(g, &parent[0]);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
20 | ~usage_requirements() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Assignable<TT>::~Assignable() [with TT = long unsigned int*]’
37 | ~model()
| ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:145:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
145 | BOOST_CONCEPT_USAGE(Assignable) {
| ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::EqualityComparable<long unsigned int*>]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::EqualityComparable<long unsigned int*> >]’
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable<long unsigned int*>’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator<long unsigned int*>’
502 | BOOST_concept(InputIterator,(TT))
| ^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:540:3: required from ‘struct boost::ForwardIterator<long unsigned int*>’
540 | BOOST_concept(ForwardIterator,(TT))
| ^~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator<long unsigned int*>’
568 | BOOST_concept(BidirectionalIterator,(TT))
| ^~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3: [ skipping 14 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dijkstra_shortest_paths.hpp:528:32: required from ‘void boost::detail::dijkstra_dispatch2(const VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list<boost::undirectedS, double>; DistanceMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, double, double&>; WeightMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>; Params = boost::bgl_named_params<_project2nd<double, double>, boost::distance_combine_t, boost::bgl_named_params<std::less<double>, boost::distance_compare_t, boost::bgl_named_params<boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params<long unsigned int*, boost::vertex_predecessor_t, boost::no_property> > > >; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’
528 | dijkstra_shortest_paths(g, s,
| ~~~~~~~~~~~~~~~~~~~~~~~^~~~~~
529 | choose_param(get_param(params, vertex_predecessor), p_map),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
530 | distance, weight, index_map,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~
531 | choose_param(
| ~~~~~~~~~~~~~
532 | get_param(params, distance_compare_t()), std::less< D >()),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
533 | choose_param(
| ~~~~~~~~~~~~~
534 | get_param(params, distance_combine_t()), std::plus< D >()),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
535 | inf, choose_param(get_param(params, distance_zero_t()), D()),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
536 | choose_param(get_param(params, graph_visitor),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
537 | make_dijkstra_visitor(null_visitor())),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
538 | params);
| ~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dijkstra_shortest_paths.hpp:554:35: required from ‘void boost::detail::dijkstra_dispatch1(const VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list<boost::undirectedS, double>; DistanceMap = boost::param_not_found; WeightMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>; Params = boost::bgl_named_params<_project2nd<double, double>, boost::distance_combine_t, boost::bgl_named_params<std::less<double>, boost::distance_compare_t, boost::bgl_named_params<boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params<long unsigned int*, boost::vertex_predecessor_t, boost::no_property> > > >; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’
554 | detail::dijkstra_dispatch2(g, s,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~
555 | choose_param(distance,
| ~~~~~~~~~~~~~~~~~~~~~~
556 | make_iterator_property_map(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~
557 | distance_map.begin(), index_map, distance_map[0])),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
558 | weight, index_map, params);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dijkstra_shortest_paths.hpp:570:31: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with VertexListGraph = R_adjacency_list<undirectedS, double>; Param = detail::_project2nd<double, double>; Tag = distance_combine_t; Rest = bgl_named_params<std::less<double>, distance_compare_t, bgl_named_params<adj_list_edge_property_map<undirected_tag, double, const double&, long unsigned int, const property<edge_weight_t, double, no_property>, edge_weight_t>, edge_weight_t, bgl_named_params<long unsigned int*, vertex_predecessor_t, no_property> > >; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
570 | detail::dijkstra_dispatch1(g, s, get_param(params, vertex_distance),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
571 | choose_const_pmap(get_param(params, edge_weight), g, edge_weight),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
572 | choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
573 | params);
| ~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:43:32: required from ‘void boost::detail::prim_mst_impl(const Graph&, typename boost::graph_traits<Graph>::vertex_descriptor, const boost::bgl_named_params<T, Tag, Base>&, Weight) [with Graph = R_adjacency_list<boost::undirectedS, double>; P = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>; T = boost::edge_weight_t; R = boost::bgl_named_params<long unsigned int*, boost::vertex_predecessor_t, boost::no_property>; Weight = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’
43 | dijkstra_shortest_paths(
| ~~~~~~~~~~~~~~~~~~~~~~~^
44 | G, s, params.distance_compare(compare).distance_combine(combine));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:77:26: required from ‘void boost::prim_minimum_spanning_tree(const VertexListGraph&, PredecessorMap) [with VertexListGraph = R_adjacency_list<undirectedS, double>; PredecessorMap = long unsigned int*]’
77 | detail::prim_mst_impl(g, *vertices(g).first,
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
78 | predecessor_map(p_map).weight_map(get(edge_weight, g)),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
79 | get(edge_weight, g));
| ~~~~~~~~~~~~~~~~~~~~
minST.cpp:89:35: required from here
89 | prim_minimum_spanning_tree(g, &parent[0]);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
20 | ~usage_requirements() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::EqualityComparable<TT>::~EqualityComparable() [with TT = long unsigned int*]’
37 | ~model()
| ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:233:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
233 | BOOST_CONCEPT_USAGE(EqualityComparable) {
| ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::InputIterator<long unsigned int*>]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::InputIterator<long unsigned int*> >]’
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:512:7: required from ‘struct boost::InputIterator<long unsigned int*>’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:540:3: required from ‘struct boost::ForwardIterator<long unsigned int*>’
540 | BOOST_concept(ForwardIterator,(TT))
| ^~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator<long unsigned int*>’
568 | BOOST_concept(BidirectionalIterator,(TT))
| ^~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<long unsigned int*>’
597 | BOOST_concept(RandomAccessIterator,(TT))
| ^~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3: [ skipping 13 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dijkstra_shortest_paths.hpp:528:32: required from ‘void boost::detail::dijkstra_dispatch2(const VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list<boost::undirectedS, double>; DistanceMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, double, double&>; WeightMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>; Params = boost::bgl_named_params<_project2nd<double, double>, boost::distance_combine_t, boost::bgl_named_params<std::less<double>, boost::distance_compare_t, boost::bgl_named_params<boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params<long unsigned int*, boost::vertex_predecessor_t, boost::no_property> > > >; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’
528 | dijkstra_shortest_paths(g, s,
| ~~~~~~~~~~~~~~~~~~~~~~~^~~~~~
529 | choose_param(get_param(params, vertex_predecessor), p_map),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
530 | distance, weight, index_map,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~
531 | choose_param(
| ~~~~~~~~~~~~~
532 | get_param(params, distance_compare_t()), std::less< D >()),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
533 | choose_param(
| ~~~~~~~~~~~~~
534 | get_param(params, distance_combine_t()), std::plus< D >()),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
535 | inf, choose_param(get_param(params, distance_zero_t()), D()),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
536 | choose_param(get_param(params, graph_visitor),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
537 | make_dijkstra_visitor(null_visitor())),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
538 | params);
| ~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dijkstra_shortest_paths.hpp:554:35: required from ‘void boost::detail::dijkstra_dispatch1(const VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list<boost::undirectedS, double>; DistanceMap = boost::param_not_found; WeightMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>; Params = boost::bgl_named_params<_project2nd<double, double>, boost::distance_combine_t, boost::bgl_named_params<std::less<double>, boost::distance_compare_t, boost::bgl_named_params<boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params<long unsigned int*, boost::vertex_predecessor_t, boost::no_property> > > >; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’
554 | detail::dijkstra_dispatch2(g, s,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~
555 | choose_param(distance,
| ~~~~~~~~~~~~~~~~~~~~~~
556 | make_iterator_property_map(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~
557 | distance_map.begin(), index_map, distance_map[0])),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
558 | weight, index_map, params);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dijkstra_shortest_paths.hpp:570:31: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with VertexListGraph = R_adjacency_list<undirectedS, double>; Param = detail::_project2nd<double, double>; Tag = distance_combine_t; Rest = bgl_named_params<std::less<double>, distance_compare_t, bgl_named_params<adj_list_edge_property_map<undirected_tag, double, const double&, long unsigned int, const property<edge_weight_t, double, no_property>, edge_weight_t>, edge_weight_t, bgl_named_params<long unsigned int*, vertex_predecessor_t, no_property> > >; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
570 | detail::dijkstra_dispatch1(g, s, get_param(params, vertex_distance),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
571 | choose_const_pmap(get_param(params, edge_weight), g, edge_weight),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
572 | choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
573 | params);
| ~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:43:32: required from ‘void boost::detail::prim_mst_impl(const Graph&, typename boost::graph_traits<Graph>::vertex_descriptor, const boost::bgl_named_params<T, Tag, Base>&, Weight) [with Graph = R_adjacency_list<boost::undirectedS, double>; P = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>; T = boost::edge_weight_t; R = boost::bgl_named_params<long unsigned int*, boost::vertex_predecessor_t, boost::no_property>; Weight = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’
43 | dijkstra_shortest_paths(
| ~~~~~~~~~~~~~~~~~~~~~~~^
44 | G, s, params.distance_compare(compare).distance_combine(combine));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:77:26: required from ‘void boost::prim_minimum_spanning_tree(const VertexListGraph&, PredecessorMap) [with VertexListGraph = R_adjacency_list<undirectedS, double>; PredecessorMap = long unsigned int*]’
77 | detail::prim_mst_impl(g, *vertices(g).first,
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
78 | predecessor_map(p_map).weight_map(get(edge_weight, g)),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
79 | get(edge_weight, g));
| ~~~~~~~~~~~~~~~~~~~~
minST.cpp:89:35: required from here
89 | prim_minimum_spanning_tree(g, &parent[0]);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
20 | ~usage_requirements() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::InputIterator<TT>::~InputIterator() [with TT = long unsigned int*]’
37 | ~model()
| ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:512:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
512 | BOOST_CONCEPT_USAGE(InputIterator)
| ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::ForwardIterator<long unsigned int*>]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::ForwardIterator<long unsigned int*> >]’
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:543:7: required from ‘struct boost::ForwardIterator<long unsigned int*>’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator<long unsigned int*>’
568 | BOOST_concept(BidirectionalIterator,(TT))
| ^~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<long unsigned int*>’
597 | BOOST_concept(RandomAccessIterator,(TT))
| ^~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<long unsigned int*>’
597 | BOOST_concept(RandomAccessIterator,(TT))
| ^~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: [ skipping 12 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dijkstra_shortest_paths.hpp:528:32: required from ‘void boost::detail::dijkstra_dispatch2(const VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list<boost::undirectedS, double>; DistanceMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, double, double&>; WeightMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>; Params = boost::bgl_named_params<_project2nd<double, double>, boost::distance_combine_t, boost::bgl_named_params<std::less<double>, boost::distance_compare_t, boost::bgl_named_params<boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params<long unsigned int*, boost::vertex_predecessor_t, boost::no_property> > > >; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’
528 | dijkstra_shortest_paths(g, s,
| ~~~~~~~~~~~~~~~~~~~~~~~^~~~~~
529 | choose_param(get_param(params, vertex_predecessor), p_map),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
530 | distance, weight, index_map,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~
531 | choose_param(
| ~~~~~~~~~~~~~
532 | get_param(params, distance_compare_t()), std::less< D >()),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
533 | choose_param(
| ~~~~~~~~~~~~~
534 | get_param(params, distance_combine_t()), std::plus< D >()),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
535 | inf, choose_param(get_param(params, distance_zero_t()), D()),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
536 | choose_param(get_param(params, graph_visitor),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
537 | make_dijkstra_visitor(null_visitor())),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
538 | params);
| ~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dijkstra_shortest_paths.hpp:554:35: required from ‘void boost::detail::dijkstra_dispatch1(const VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list<boost::undirectedS, double>; DistanceMap = boost::param_not_found; WeightMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>; Params = boost::bgl_named_params<_project2nd<double, double>, boost::distance_combine_t, boost::bgl_named_params<std::less<double>, boost::distance_compare_t, boost::bgl_named_params<boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params<long unsigned int*, boost::vertex_predecessor_t, boost::no_property> > > >; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’
554 | detail::dijkstra_dispatch2(g, s,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~
555 | choose_param(distance,
| ~~~~~~~~~~~~~~~~~~~~~~
556 | make_iterator_property_map(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~
557 | distance_map.begin(), index_map, distance_map[0])),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
558 | weight, index_map, params);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dijkstra_shortest_paths.hpp:570:31: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with VertexListGraph = R_adjacency_list<undirectedS, double>; Param = detail::_project2nd<double, double>; Tag = distance_combine_t; Rest = bgl_named_params<std::less<double>, distance_compare_t, bgl_named_params<adj_list_edge_property_map<undirected_tag, double, const double&, long unsigned int, const property<edge_weight_t, double, no_property>, edge_weight_t>, edge_weight_t, bgl_named_params<long unsigned int*, vertex_predecessor_t, no_property> > >; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
570 | detail::dijkstra_dispatch1(g, s, get_param(params, vertex_distance),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
571 | choose_const_pmap(get_param(params, edge_weight), g, edge_weight),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
572 | choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
573 | params);
| ~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:43:32: required from ‘void boost::detail::prim_mst_impl(const Graph&, typename boost::graph_traits<Graph>::vertex_descriptor, const boost::bgl_named_params<T, Tag, Base>&, Weight) [with Graph = R_adjacency_list<boost::undirectedS, double>; P = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>; T = boost::edge_weight_t; R = boost::bgl_named_params<long unsigned int*, boost::vertex_predecessor_t, boost::no_property>; Weight = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’
43 | dijkstra_shortest_paths(
| ~~~~~~~~~~~~~~~~~~~~~~~^
44 | G, s, params.distance_compare(compare).distance_combine(combine));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:77:26: required from ‘void boost::prim_minimum_spanning_tree(const VertexListGraph&, PredecessorMap) [with VertexListGraph = R_adjacency_list<undirectedS, double>; PredecessorMap = long unsigned int*]’
77 | detail::prim_mst_impl(g, *vertices(g).first,
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
78 | predecessor_map(p_map).weight_map(get(edge_weight, g)),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
79 | get(edge_weight, g));
| ~~~~~~~~~~~~~~~~~~~~
minST.cpp:89:35: required from here
89 | prim_minimum_spanning_tree(g, &parent[0]);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
20 | ~usage_requirements() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::ForwardIterator<TT>::~ForwardIterator() [with TT = long unsigned int*]’
37 | ~model()
| ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:543:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
543 | BOOST_CONCEPT_USAGE(ForwardIterator)
| ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::BidirectionalIterator<long unsigned int*>]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::BidirectionalIterator<long unsigned int*> >]’
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:571:7: required from ‘struct boost::BidirectionalIterator<long unsigned int*>’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<long unsigned int*>’
597 | BOOST_concept(RandomAccessIterator,(TT))
| ^~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<long unsigned int*>’
597 | BOOST_concept(RandomAccessIterator,(TT))
| ^~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::RandomAccessIteratorConcept<long unsigned int*>]’
32 | inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
| ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5: [ skipping 11 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dijkstra_shortest_paths.hpp:528:32: required from ‘void boost::detail::dijkstra_dispatch2(const VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list<boost::undirectedS, double>; DistanceMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, double, double&>; WeightMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>; Params = boost::bgl_named_params<_project2nd<double, double>, boost::distance_combine_t, boost::bgl_named_params<std::less<double>, boost::distance_compare_t, boost::bgl_named_params<boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params<long unsigned int*, boost::vertex_predecessor_t, boost::no_property> > > >; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’
528 | dijkstra_shortest_paths(g, s,
| ~~~~~~~~~~~~~~~~~~~~~~~^~~~~~
529 | choose_param(get_param(params, vertex_predecessor), p_map),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
530 | distance, weight, index_map,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~
531 | choose_param(
| ~~~~~~~~~~~~~
532 | get_param(params, distance_compare_t()), std::less< D >()),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
533 | choose_param(
| ~~~~~~~~~~~~~
534 | get_param(params, distance_combine_t()), std::plus< D >()),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
535 | inf, choose_param(get_param(params, distance_zero_t()), D()),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
536 | choose_param(get_param(params, graph_visitor),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
537 | make_dijkstra_visitor(null_visitor())),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
538 | params);
| ~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dijkstra_shortest_paths.hpp:554:35: required from ‘void boost::detail::dijkstra_dispatch1(const VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list<boost::undirectedS, double>; DistanceMap = boost::param_not_found; WeightMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>; Params = boost::bgl_named_params<_project2nd<double, double>, boost::distance_combine_t, boost::bgl_named_params<std::less<double>, boost::distance_compare_t, boost::bgl_named_params<boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params<long unsigned int*, boost::vertex_predecessor_t, boost::no_property> > > >; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’
554 | detail::dijkstra_dispatch2(g, s,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~
555 | choose_param(distance,
| ~~~~~~~~~~~~~~~~~~~~~~
556 | make_iterator_property_map(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~
557 | distance_map.begin(), index_map, distance_map[0])),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
558 | weight, index_map, params);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dijkstra_shortest_paths.hpp:570:31: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with VertexListGraph = R_adjacency_list<undirectedS, double>; Param = detail::_project2nd<double, double>; Tag = distance_combine_t; Rest = bgl_named_params<std::less<double>, distance_compare_t, bgl_named_params<adj_list_edge_property_map<undirected_tag, double, const double&, long unsigned int, const property<edge_weight_t, double, no_property>, edge_weight_t>, edge_weight_t, bgl_named_params<long unsigned int*, vertex_predecessor_t, no_property> > >; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
570 | detail::dijkstra_dispatch1(g, s, get_param(params, vertex_distance),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
571 | choose_const_pmap(get_param(params, edge_weight), g, edge_weight),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
572 | choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
573 | params);
| ~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:43:32: required from ‘void boost::detail::prim_mst_impl(const Graph&, typename boost::graph_traits<Graph>::vertex_descriptor, const boost::bgl_named_params<T, Tag, Base>&, Weight) [with Graph = R_adjacency_list<boost::undirectedS, double>; P = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>; T = boost::edge_weight_t; R = boost::bgl_named_params<long unsigned int*, boost::vertex_predecessor_t, boost::no_property>; Weight = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’
43 | dijkstra_shortest_paths(
| ~~~~~~~~~~~~~~~~~~~~~~~^
44 | G, s, params.distance_compare(compare).distance_combine(combine));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:77:26: required from ‘void boost::prim_minimum_spanning_tree(const VertexListGraph&, PredecessorMap) [with VertexListGraph = R_adjacency_list<undirectedS, double>; PredecessorMap = long unsigned int*]’
77 | detail::prim_mst_impl(g, *vertices(g).first,
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
78 | predecessor_map(p_map).weight_map(get(edge_weight, g)),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
79 | get(edge_weight, g));
| ~~~~~~~~~~~~~~~~~~~~
minST.cpp:89:35: required from here
89 | prim_minimum_spanning_tree(g, &parent[0]);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
20 | ~usage_requirements() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::BidirectionalIterator<TT>::~BidirectionalIterator() [with TT = long unsigned int*]’
37 | ~model()
| ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:571:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
571 | BOOST_CONCEPT_USAGE(BidirectionalIterator)
| ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Comparable<long unsigned int*>]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Comparable<long unsigned int*> >]’
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:253:5: required from ‘struct boost::Comparable<long unsigned int*>’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<long unsigned int*>’
597 | BOOST_concept(RandomAccessIterator,(TT))
| ^~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<long unsigned int*>’
597 | BOOST_concept(RandomAccessIterator,(TT))
| ^~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::RandomAccessIteratorConcept<long unsigned int*>]’
32 | inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
| ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5: [ skipping 11 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dijkstra_shortest_paths.hpp:528:32: required from ‘void boost::detail::dijkstra_dispatch2(const VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list<boost::undirectedS, double>; DistanceMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, double, double&>; WeightMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>; Params = boost::bgl_named_params<_project2nd<double, double>, boost::distance_combine_t, boost::bgl_named_params<std::less<double>, boost::distance_compare_t, boost::bgl_named_params<boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params<long unsigned int*, boost::vertex_predecessor_t, boost::no_property> > > >; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’
528 | dijkstra_shortest_paths(g, s,
| ~~~~~~~~~~~~~~~~~~~~~~~^~~~~~
529 | choose_param(get_param(params, vertex_predecessor), p_map),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
530 | distance, weight, index_map,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~
531 | choose_param(
| ~~~~~~~~~~~~~
532 | get_param(params, distance_compare_t()), std::less< D >()),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
533 | choose_param(
| ~~~~~~~~~~~~~
534 | get_param(params, distance_combine_t()), std::plus< D >()),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
535 | inf, choose_param(get_param(params, distance_zero_t()), D()),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
536 | choose_param(get_param(params, graph_visitor),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
537 | make_dijkstra_visitor(null_visitor())),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
538 | params);
| ~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dijkstra_shortest_paths.hpp:554:35: required from ‘void boost::detail::dijkstra_dispatch1(const VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list<boost::undirectedS, double>; DistanceMap = boost::param_not_found; WeightMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>; Params = boost::bgl_named_params<_project2nd<double, double>, boost::distance_combine_t, boost::bgl_named_params<std::less<double>, boost::distance_compare_t, boost::bgl_named_params<boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params<long unsigned int*, boost::vertex_predecessor_t, boost::no_property> > > >; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’
554 | detail::dijkstra_dispatch2(g, s,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~
555 | choose_param(distance,
| ~~~~~~~~~~~~~~~~~~~~~~
556 | make_iterator_property_map(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~
557 | distance_map.begin(), index_map, distance_map[0])),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
558 | weight, index_map, params);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dijkstra_shortest_paths.hpp:570:31: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with VertexListGraph = R_adjacency_list<undirectedS, double>; Param = detail::_project2nd<double, double>; Tag = distance_combine_t; Rest = bgl_named_params<std::less<double>, distance_compare_t, bgl_named_params<adj_list_edge_property_map<undirected_tag, double, const double&, long unsigned int, const property<edge_weight_t, double, no_property>, edge_weight_t>, edge_weight_t, bgl_named_params<long unsigned int*, vertex_predecessor_t, no_property> > >; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
570 | detail::dijkstra_dispatch1(g, s, get_param(params, vertex_distance),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
571 | choose_const_pmap(get_param(params, edge_weight), g, edge_weight),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
572 | choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
573 | params);
| ~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:43:32: required from ‘void boost::detail::prim_mst_impl(const Graph&, typename boost::graph_traits<Graph>::vertex_descriptor, const boost::bgl_named_params<T, Tag, Base>&, Weight) [with Graph = R_adjacency_list<boost::undirectedS, double>; P = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>; T = boost::edge_weight_t; R = boost::bgl_named_params<long unsigned int*, boost::vertex_predecessor_t, boost::no_property>; Weight = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’
43 | dijkstra_shortest_paths(
| ~~~~~~~~~~~~~~~~~~~~~~~^
44 | G, s, params.distance_compare(compare).distance_combine(combine));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:77:26: required from ‘void boost::prim_minimum_spanning_tree(const VertexListGraph&, PredecessorMap) [with VertexListGraph = R_adjacency_list<undirectedS, double>; PredecessorMap = long unsigned int*]’
77 | detail::prim_mst_impl(g, *vertices(g).first,
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
78 | predecessor_map(p_map).weight_map(get(edge_weight, g)),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
79 | get(edge_weight, g));
| ~~~~~~~~~~~~~~~~~~~~
minST.cpp:89:35: required from here
89 | prim_minimum_spanning_tree(g, &parent[0]);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
20 | ~usage_requirements() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Comparable<TT>::~Comparable() [with TT = long unsigned int*]’
37 | ~model()
| ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:253:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
253 | BOOST_CONCEPT_USAGE(Comparable) {
| ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::RandomAccessIterator<long unsigned int*>]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::RandomAccessIterator<long unsigned int*> >]’
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:601:7: required from ‘struct boost::RandomAccessIterator<long unsigned int*>’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<long unsigned int*>’
597 | BOOST_concept(RandomAccessIterator,(TT))
| ^~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::RandomAccessIteratorConcept<long unsigned int*>]’
32 | inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
| ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied<boost::RandomAccessIteratorConcept<long unsigned int*> >::value’
44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 10 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dijkstra_shortest_paths.hpp:528:32: required from ‘void boost::detail::dijkstra_dispatch2(const VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list<boost::undirectedS, double>; DistanceMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, double, double&>; WeightMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>; Params = boost::bgl_named_params<_project2nd<double, double>, boost::distance_combine_t, boost::bgl_named_params<std::less<double>, boost::distance_compare_t, boost::bgl_named_params<boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params<long unsigned int*, boost::vertex_predecessor_t, boost::no_property> > > >; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’
528 | dijkstra_shortest_paths(g, s,
| ~~~~~~~~~~~~~~~~~~~~~~~^~~~~~
529 | choose_param(get_param(params, vertex_predecessor), p_map),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
530 | distance, weight, index_map,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~
531 | choose_param(
| ~~~~~~~~~~~~~
532 | get_param(params, distance_compare_t()), std::less< D >()),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
533 | choose_param(
| ~~~~~~~~~~~~~
534 | get_param(params, distance_combine_t()), std::plus< D >()),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
535 | inf, choose_param(get_param(params, distance_zero_t()), D()),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
536 | choose_param(get_param(params, graph_visitor),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
537 | make_dijkstra_visitor(null_visitor())),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
538 | params);
| ~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dijkstra_shortest_paths.hpp:554:35: required from ‘void boost::detail::dijkstra_dispatch1(const VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list<boost::undirectedS, double>; DistanceMap = boost::param_not_found; WeightMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>; Params = boost::bgl_named_params<_project2nd<double, double>, boost::distance_combine_t, boost::bgl_named_params<std::less<double>, boost::distance_compare_t, boost::bgl_named_params<boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params<long unsigned int*, boost::vertex_predecessor_t, boost::no_property> > > >; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’
554 | detail::dijkstra_dispatch2(g, s,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~
555 | choose_param(distance,
| ~~~~~~~~~~~~~~~~~~~~~~
556 | make_iterator_property_map(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~
557 | distance_map.begin(), index_map, distance_map[0])),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
558 | weight, index_map, params);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dijkstra_shortest_paths.hpp:570:31: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with VertexListGraph = R_adjacency_list<undirectedS, double>; Param = detail::_project2nd<double, double>; Tag = distance_combine_t; Rest = bgl_named_params<std::less<double>, distance_compare_t, bgl_named_params<adj_list_edge_property_map<undirected_tag, double, const double&, long unsigned int, const property<edge_weight_t, double, no_property>, edge_weight_t>, edge_weight_t, bgl_named_params<long unsigned int*, vertex_predecessor_t, no_property> > >; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
570 | detail::dijkstra_dispatch1(g, s, get_param(params, vertex_distance),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
571 | choose_const_pmap(get_param(params, edge_weight), g, edge_weight),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
572 | choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
573 | params);
| ~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:43:32: required from ‘void boost::detail::prim_mst_impl(const Graph&, typename boost::graph_traits<Graph>::vertex_descriptor, const boost::bgl_named_params<T, Tag, Base>&, Weight) [with Graph = R_adjacency_list<boost::undirectedS, double>; P = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>; T = boost::edge_weight_t; R = boost::bgl_named_params<long unsigned int*, boost::vertex_predecessor_t, boost::no_property>; Weight = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’
43 | dijkstra_shortest_paths(
| ~~~~~~~~~~~~~~~~~~~~~~~^
44 | G, s, params.distance_compare(compare).distance_combine(combine));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:77:26: required from ‘void boost::prim_minimum_spanning_tree(const VertexListGraph&, PredecessorMap) [with VertexListGraph = R_adjacency_list<undirectedS, double>; PredecessorMap = long unsigned int*]’
77 | detail::prim_mst_impl(g, *vertices(g).first,
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
78 | predecessor_map(p_map).weight_map(get(edge_weight, g)),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
79 | get(edge_weight, g));
| ~~~~~~~~~~~~~~~~~~~~
minST.cpp:89:35: required from here
89 | prim_minimum_spanning_tree(g, &parent[0]);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
20 | ~usage_requirements() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::RandomAccessIterator<TT>::~RandomAccessIterator() [with TT = long unsigned int*]’
37 | ~model()
| ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:601:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
601 | BOOST_CONCEPT_USAGE(RandomAccessIterator)
| ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::concepts::MultiPassInputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > >, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > >, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > >, boost::property<boost::edge_weight_t, double, boost::no_property> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::concepts::MultiPassInputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > >, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > >, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > >, boost::property<boost::edge_weight_t, double, 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(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:52:50: required from ‘struct boost::concepts::MultiPassInputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > >, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > >, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > >, boost::property<boost::edge_weight_t, double, 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> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::concepts::MultiPassInputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > >, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > >, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > >, boost::property<boost::edge_weight_t, double, 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);
| ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied<boost::concepts::MultiPassInputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > >, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > >, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > >, boost::property<boost::edge_weight_t, double, 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) );
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied<boost::concepts::MultiPassInputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > >, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > >, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > >, boost::property<boost::edge_weight_t, double, 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;
| ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 9 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dijkstra_shortest_paths.hpp:528:32: required from ‘void boost::detail::dijkstra_dispatch2(const VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list<boost::undirectedS, double>; DistanceMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, double, double&>; WeightMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>; Params = boost::bgl_named_params<_project2nd<double, double>, boost::distance_combine_t, boost::bgl_named_params<std::less<double>, boost::distance_compare_t, boost::bgl_named_params<boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params<long unsigned int*, boost::vertex_predecessor_t, boost::no_property> > > >; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’
528 | dijkstra_shortest_paths(g, s,
| ~~~~~~~~~~~~~~~~~~~~~~~^~~~~~
529 | choose_param(get_param(params, vertex_predecessor), p_map),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
530 | distance, weight, index_map,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~
531 | choose_param(
| ~~~~~~~~~~~~~
532 | get_param(params, distance_compare_t()), std::less< D >()),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
533 | choose_param(
| ~~~~~~~~~~~~~
534 | get_param(params, distance_combine_t()), std::plus< D >()),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
535 | inf, choose_param(get_param(params, distance_zero_t()), D()),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
536 | choose_param(get_param(params, graph_visitor),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
537 | make_dijkstra_visitor(null_visitor())),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
538 | params);
| ~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dijkstra_shortest_paths.hpp:554:35: required from ‘void boost::detail::dijkstra_dispatch1(const VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list<boost::undirectedS, double>; DistanceMap = boost::param_not_found; WeightMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>; Params = boost::bgl_named_params<_project2nd<double, double>, boost::distance_combine_t, boost::bgl_named_params<std::less<double>, boost::distance_compare_t, boost::bgl_named_params<boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params<long unsigned int*, boost::vertex_predecessor_t, boost::no_property> > > >; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’
554 | detail::dijkstra_dispatch2(g, s,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~
555 | choose_param(distance,
| ~~~~~~~~~~~~~~~~~~~~~~
556 | make_iterator_property_map(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~
557 | distance_map.begin(), index_map, distance_map[0])),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
558 | weight, index_map, params);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dijkstra_shortest_paths.hpp:570:31: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with VertexListGraph = R_adjacency_list<undirectedS, double>; Param = detail::_project2nd<double, double>; Tag = distance_combine_t; Rest = bgl_named_params<std::less<double>, distance_compare_t, bgl_named_params<adj_list_edge_property_map<undirected_tag, double, const double&, long unsigned int, const property<edge_weight_t, double, no_property>, edge_weight_t>, edge_weight_t, bgl_named_params<long unsigned int*, vertex_predecessor_t, no_property> > >; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
570 | detail::dijkstra_dispatch1(g, s, get_param(params, vertex_distance),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
571 | choose_const_pmap(get_param(params, edge_weight), g, edge_weight),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
572 | choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
573 | params);
| ~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:43:32: required from ‘void boost::detail::prim_mst_impl(const Graph&, typename boost::graph_traits<Graph>::vertex_descriptor, const boost::bgl_named_params<T, Tag, Base>&, Weight) [with Graph = R_adjacency_list<boost::undirectedS, double>; P = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>; T = boost::edge_weight_t; R = boost::bgl_named_params<long unsigned int*, boost::vertex_predecessor_t, boost::no_property>; Weight = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’
43 | dijkstra_shortest_paths(
| ~~~~~~~~~~~~~~~~~~~~~~~^
44 | G, s, params.distance_compare(compare).distance_combine(combine));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:77:26: required from ‘void boost::prim_minimum_spanning_tree(const VertexListGraph&, PredecessorMap) [with VertexListGraph = R_adjacency_list<undirectedS, double>; PredecessorMap = long unsigned int*]’
77 | detail::prim_mst_impl(g, *vertices(g).first,
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
78 | predecessor_map(p_map).weight_map(get(edge_weight, g)),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
79 | get(edge_weight, g));
| ~~~~~~~~~~~~~~~~~~~~
minST.cpp:89:35: required from here
89 | prim_minimum_spanning_tree(g, &parent[0]);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
20 | ~usage_requirements() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::concepts::MultiPassInputIterator<T>::~MultiPassInputIterator() [with T = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > >, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > >, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > >, boost::property<boost::edge_weight_t, double, boost::no_property> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int>]’
37 | ~model()
| ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:52:50: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
52 | BOOST_concept(MultiPassInputIterator, (T)) { BOOST_CONCEPT_USAGE(
| ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Convertible<boost::undir_adj_list_traversal_tag, boost::incidence_graph_tag>]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Convertible<boost::undir_adj_list_traversal_tag, boost::incidence_graph_tag> >]’
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible<boost::undir_adj_list_traversal_tag, boost::incidence_graph_tag>’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::Convertible<boost::undir_adj_list_traversal_tag, boost::incidence_graph_tag>]’
32 | inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
| ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied<boost::Convertible<boost::undir_adj_list_traversal_tag, boost::incidence_graph_tag> >::value’
44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied<boost::Convertible<boost::undir_adj_list_traversal_tag, boost::incidence_graph_tag> >’
45 | typedef boost::integral_constant<bool, value> type;
| ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 9 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dijkstra_shortest_paths.hpp:528:32: required from ‘void boost::detail::dijkstra_dispatch2(const VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list<boost::undirectedS, double>; DistanceMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, double, double&>; WeightMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>; Params = boost::bgl_named_params<_project2nd<double, double>, boost::distance_combine_t, boost::bgl_named_params<std::less<double>, boost::distance_compare_t, boost::bgl_named_params<boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params<long unsigned int*, boost::vertex_predecessor_t, boost::no_property> > > >; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’
528 | dijkstra_shortest_paths(g, s,
| ~~~~~~~~~~~~~~~~~~~~~~~^~~~~~
529 | choose_param(get_param(params, vertex_predecessor), p_map),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
530 | distance, weight, index_map,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~
531 | choose_param(
| ~~~~~~~~~~~~~
532 | get_param(params, distance_compare_t()), std::less< D >()),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
533 | choose_param(
| ~~~~~~~~~~~~~
534 | get_param(params, distance_combine_t()), std::plus< D >()),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
535 | inf, choose_param(get_param(params, distance_zero_t()), D()),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
536 | choose_param(get_param(params, graph_visitor),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
537 | make_dijkstra_visitor(null_visitor())),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
538 | params);
| ~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dijkstra_shortest_paths.hpp:554:35: required from ‘void boost::detail::dijkstra_dispatch1(const VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list<boost::undirectedS, double>; DistanceMap = boost::param_not_found; WeightMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>; Params = boost::bgl_named_params<_project2nd<double, double>, boost::distance_combine_t, boost::bgl_named_params<std::less<double>, boost::distance_compare_t, boost::bgl_named_params<boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params<long unsigned int*, boost::vertex_predecessor_t, boost::no_property> > > >; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’
554 | detail::dijkstra_dispatch2(g, s,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~
555 | choose_param(distance,
| ~~~~~~~~~~~~~~~~~~~~~~
556 | make_iterator_property_map(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~
557 | distance_map.begin(), index_map, distance_map[0])),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
558 | weight, index_map, params);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dijkstra_shortest_paths.hpp:570:31: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with VertexListGraph = R_adjacency_list<undirectedS, double>; Param = detail::_project2nd<double, double>; Tag = distance_combine_t; Rest = bgl_named_params<std::less<double>, distance_compare_t, bgl_named_params<adj_list_edge_property_map<undirected_tag, double, const double&, long unsigned int, const property<edge_weight_t, double, no_property>, edge_weight_t>, edge_weight_t, bgl_named_params<long unsigned int*, vertex_predecessor_t, no_property> > >; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
570 | detail::dijkstra_dispatch1(g, s, get_param(params, vertex_distance),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
571 | choose_const_pmap(get_param(params, edge_weight), g, edge_weight),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
572 | choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
573 | params);
| ~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:43:32: required from ‘void boost::detail::prim_mst_impl(const Graph&, typename boost::graph_traits<Graph>::vertex_descriptor, const boost::bgl_named_params<T, Tag, Base>&, Weight) [with Graph = R_adjacency_list<boost::undirectedS, double>; P = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>; T = boost::edge_weight_t; R = boost::bgl_named_params<long unsigned int*, boost::vertex_predecessor_t, boost::no_property>; Weight = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’
43 | dijkstra_shortest_paths(
| ~~~~~~~~~~~~~~~~~~~~~~~^
44 | G, s, params.distance_compare(compare).distance_combine(combine));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:77:26: required from ‘void boost::prim_minimum_spanning_tree(const VertexListGraph&, PredecessorMap) [with VertexListGraph = R_adjacency_list<undirectedS, double>; PredecessorMap = long unsigned int*]’
77 | detail::prim_mst_impl(g, *vertices(g).first,
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
78 | predecessor_map(p_map).weight_map(get(edge_weight, g)),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
79 | get(edge_weight, g));
| ~~~~~~~~~~~~~~~~~~~~
minST.cpp:89:35: required from here
89 | prim_minimum_spanning_tree(g, &parent[0]);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
20 | ~usage_requirements() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible<X, Y>::~Convertible() [with X = boost::undir_adj_list_traversal_tag; Y = boost::incidence_graph_tag]’
37 | ~model()
| ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
208 | BOOST_CONCEPT_USAGE(Convertible) {
| ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Convertible<boost::read_write_property_map_tag, boost::readable_property_map_tag>]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Convertible<boost::read_write_property_map_tag, boost::readable_property_map_tag> >]’
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible<boost::read_write_property_map_tag, boost::readable_property_map_tag>’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:206:3: required from ‘struct boost::ConvertibleConcept<boost::read_write_property_map_tag, boost::readable_property_map_tag>’
206 | BOOST_concept(Convertible,(X)(Y))
| ^~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::ConvertibleConcept<boost::read_write_property_map_tag, boost::readable_property_map_tag>]’
32 | inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
| ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied<boost::ConvertibleConcept<boost::read_write_property_map_tag, boost::readable_property_map_tag> >::value’
44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 18 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dijkstra_shortest_paths.hpp:528:32: required from ‘void boost::detail::dijkstra_dispatch2(const VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list<boost::undirectedS, double>; DistanceMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, double, double&>; WeightMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>; Params = boost::bgl_named_params<_project2nd<double, double>, boost::distance_combine_t, boost::bgl_named_params<std::less<double>, boost::distance_compare_t, boost::bgl_named_params<boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params<long unsigned int*, boost::vertex_predecessor_t, boost::no_property> > > >; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’
528 | dijkstra_shortest_paths(g, s,
| ~~~~~~~~~~~~~~~~~~~~~~~^~~~~~
529 | choose_param(get_param(params, vertex_predecessor), p_map),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
530 | distance, weight, index_map,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~
531 | choose_param(
| ~~~~~~~~~~~~~
532 | get_param(params, distance_compare_t()), std::less< D >()),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
533 | choose_param(
| ~~~~~~~~~~~~~
534 | get_param(params, distance_combine_t()), std::plus< D >()),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
535 | inf, choose_param(get_param(params, distance_zero_t()), D()),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
536 | choose_param(get_param(params, graph_visitor),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
537 | make_dijkstra_visitor(null_visitor())),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
538 | params);
| ~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dijkstra_shortest_paths.hpp:554:35: required from ‘void boost::detail::dijkstra_dispatch1(const VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list<boost::undirectedS, double>; DistanceMap = boost::param_not_found; WeightMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>; Params = boost::bgl_named_params<_project2nd<double, double>, boost::distance_combine_t, boost::bgl_named_params<std::less<double>, boost::distance_compare_t, boost::bgl_named_params<boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params<long unsigned int*, boost::vertex_predecessor_t, boost::no_property> > > >; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’
554 | detail::dijkstra_dispatch2(g, s,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~
555 | choose_param(distance,
| ~~~~~~~~~~~~~~~~~~~~~~
556 | make_iterator_property_map(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~
557 | distance_map.begin(), index_map, distance_map[0])),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
558 | weight, index_map, params);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dijkstra_shortest_paths.hpp:570:31: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with VertexListGraph = R_adjacency_list<undirectedS, double>; Param = detail::_project2nd<double, double>; Tag = distance_combine_t; Rest = bgl_named_params<std::less<double>, distance_compare_t, bgl_named_params<adj_list_edge_property_map<undirected_tag, double, const double&, long unsigned int, const property<edge_weight_t, double, no_property>, edge_weight_t>, edge_weight_t, bgl_named_params<long unsigned int*, vertex_predecessor_t, no_property> > >; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
570 | detail::dijkstra_dispatch1(g, s, get_param(params, vertex_distance),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
571 | choose_const_pmap(get_param(params, edge_weight), g, edge_weight),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
572 | choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
573 | params);
| ~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:43:32: required from ‘void boost::detail::prim_mst_impl(const Graph&, typename boost::graph_traits<Graph>::vertex_descriptor, const boost::bgl_named_params<T, Tag, Base>&, Weight) [with Graph = R_adjacency_list<boost::undirectedS, double>; P = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>; T = boost::edge_weight_t; R = boost::bgl_named_params<long unsigned int*, boost::vertex_predecessor_t, boost::no_property>; Weight = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’
43 | dijkstra_shortest_paths(
| ~~~~~~~~~~~~~~~~~~~~~~~^
44 | G, s, params.distance_compare(compare).distance_combine(combine));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:77:26: required from ‘void boost::prim_minimum_spanning_tree(const VertexListGraph&, PredecessorMap) [with VertexListGraph = R_adjacency_list<undirectedS, double>; PredecessorMap = long unsigned int*]’
77 | detail::prim_mst_impl(g, *vertices(g).first,
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
78 | predecessor_map(p_map).weight_map(get(edge_weight, g)),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
79 | get(edge_weight, g));
| ~~~~~~~~~~~~~~~~~~~~
minST.cpp:89:35: required from here
89 | prim_minimum_spanning_tree(g, &parent[0]);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
20 | ~usage_requirements() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible<X, Y>::~Convertible() [with X = boost::read_write_property_map_tag; Y = boost::readable_property_map_tag]’
37 | ~model()
| ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
208 | BOOST_CONCEPT_USAGE(Convertible) {
| ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Convertible<boost::read_write_property_map_tag, boost::writable_property_map_tag>]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Convertible<boost::read_write_property_map_tag, boost::writable_property_map_tag> >]’
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible<boost::read_write_property_map_tag, boost::writable_property_map_tag>’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:206:3: required from ‘struct boost::ConvertibleConcept<boost::read_write_property_map_tag, boost::writable_property_map_tag>’
206 | BOOST_concept(Convertible,(X)(Y))
| ^~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::ConvertibleConcept<boost::read_write_property_map_tag, boost::writable_property_map_tag>]’
32 | inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
| ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied<boost::ConvertibleConcept<boost::read_write_property_map_tag, boost::writable_property_map_tag> >::value’
44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 18 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dijkstra_shortest_paths.hpp:528:32: required from ‘void boost::detail::dijkstra_dispatch2(const VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list<boost::undirectedS, double>; DistanceMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, double, double&>; WeightMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>; Params = boost::bgl_named_params<_project2nd<double, double>, boost::distance_combine_t, boost::bgl_named_params<std::less<double>, boost::distance_compare_t, boost::bgl_named_params<boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params<long unsigned int*, boost::vertex_predecessor_t, boost::no_property> > > >; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’
528 | dijkstra_shortest_paths(g, s,
| ~~~~~~~~~~~~~~~~~~~~~~~^~~~~~
529 | choose_param(get_param(params, vertex_predecessor), p_map),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
530 | distance, weight, index_map,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~
531 | choose_param(
| ~~~~~~~~~~~~~
532 | get_param(params, distance_compare_t()), std::less< D >()),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
533 | choose_param(
| ~~~~~~~~~~~~~
534 | get_param(params, distance_combine_t()), std::plus< D >()),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
535 | inf, choose_param(get_param(params, distance_zero_t()), D()),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
536 | choose_param(get_param(params, graph_visitor),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
537 | make_dijkstra_visitor(null_visitor())),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
538 | params);
| ~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dijkstra_shortest_paths.hpp:554:35: required from ‘void boost::detail::dijkstra_dispatch1(const VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list<boost::undirectedS, double>; DistanceMap = boost::param_not_found; WeightMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>; Params = boost::bgl_named_params<_project2nd<double, double>, boost::distance_combine_t, boost::bgl_named_params<std::less<double>, boost::distance_compare_t, boost::bgl_named_params<boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params<long unsigned int*, boost::vertex_predecessor_t, boost::no_property> > > >; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’
554 | detail::dijkstra_dispatch2(g, s,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~
555 | choose_param(distance,
| ~~~~~~~~~~~~~~~~~~~~~~
556 | make_iterator_property_map(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~
557 | distance_map.begin(), index_map, distance_map[0])),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
558 | weight, index_map, params);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dijkstra_shortest_paths.hpp:570:31: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with VertexListGraph = R_adjacency_list<undirectedS, double>; Param = detail::_project2nd<double, double>; Tag = distance_combine_t; Rest = bgl_named_params<std::less<double>, distance_compare_t, bgl_named_params<adj_list_edge_property_map<undirected_tag, double, const double&, long unsigned int, const property<edge_weight_t, double, no_property>, edge_weight_t>, edge_weight_t, bgl_named_params<long unsigned int*, vertex_predecessor_t, no_property> > >; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
570 | detail::dijkstra_dispatch1(g, s, get_param(params, vertex_distance),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
571 | choose_const_pmap(get_param(params, edge_weight), g, edge_weight),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
572 | choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
573 | params);
| ~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:43:32: required from ‘void boost::detail::prim_mst_impl(const Graph&, typename boost::graph_traits<Graph>::vertex_descriptor, const boost::bgl_named_params<T, Tag, Base>&, Weight) [with Graph = R_adjacency_list<boost::undirectedS, double>; P = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>; T = boost::edge_weight_t; R = boost::bgl_named_params<long unsigned int*, boost::vertex_predecessor_t, boost::no_property>; Weight = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’
43 | dijkstra_shortest_paths(
| ~~~~~~~~~~~~~~~~~~~~~~~^
44 | G, s, params.distance_compare(compare).distance_combine(combine));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:77:26: required from ‘void boost::prim_minimum_spanning_tree(const VertexListGraph&, PredecessorMap) [with VertexListGraph = R_adjacency_list<undirectedS, double>; PredecessorMap = long unsigned int*]’
77 | detail::prim_mst_impl(g, *vertices(g).first,
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
78 | predecessor_map(p_map).weight_map(get(edge_weight, g)),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
79 | get(edge_weight, g));
| ~~~~~~~~~~~~~~~~~~~~
minST.cpp:89:35: required from here
89 | prim_minimum_spanning_tree(g, &parent[0]);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
20 | ~usage_requirements() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible<X, Y>::~Convertible() [with X = boost::read_write_property_map_tag; Y = boost::writable_property_map_tag]’
37 | ~model()
| ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
208 | BOOST_CONCEPT_USAGE(Convertible) {
| ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Assignable<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > >, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > >, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > >, boost::property<boost::edge_weight_t, double, boost::no_property> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:145:5: required from ‘struct boost::Assignable<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > >, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > >, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > >, boost::property<boost::edge_weight_t, double, 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> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > >, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > >, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > >, boost::property<boost::edge_weight_t, double, boost::no_property> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> >’
502 | BOOST_concept(InputIterator,(TT))
| ^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::InputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > >, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > >, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > >, boost::property<boost::edge_weight_t, double, 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);
| ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied<boost::InputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > >, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > >, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > >, boost::property<boost::edge_weight_t, double, 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) );
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied<boost::InputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > >, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > >, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > >, boost::property<boost::edge_weight_t, double, 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;
| ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 11 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dijkstra_shortest_paths.hpp:528:32: required from ‘void boost::detail::dijkstra_dispatch2(const VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list<boost::undirectedS, double>; DistanceMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, double, double&>; WeightMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>; Params = boost::bgl_named_params<_project2nd<double, double>, boost::distance_combine_t, boost::bgl_named_params<std::less<double>, boost::distance_compare_t, boost::bgl_named_params<boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params<long unsigned int*, boost::vertex_predecessor_t, boost::no_property> > > >; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’
528 | dijkstra_shortest_paths(g, s,
| ~~~~~~~~~~~~~~~~~~~~~~~^~~~~~
529 | choose_param(get_param(params, vertex_predecessor), p_map),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
530 | distance, weight, index_map,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~
531 | choose_param(
| ~~~~~~~~~~~~~
532 | get_param(params, distance_compare_t()), std::less< D >()),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
533 | choose_param(
| ~~~~~~~~~~~~~
534 | get_param(params, distance_combine_t()), std::plus< D >()),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
535 | inf, choose_param(get_param(params, distance_zero_t()), D()),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
536 | choose_param(get_param(params, graph_visitor),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
537 | make_dijkstra_visitor(null_visitor())),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
538 | params);
| ~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dijkstra_shortest_paths.hpp:554:35: required from ‘void boost::detail::dijkstra_dispatch1(const VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list<boost::undirectedS, double>; DistanceMap = boost::param_not_found; WeightMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>; Params = boost::bgl_named_params<_project2nd<double, double>, boost::distance_combine_t, boost::bgl_named_params<std::less<double>, boost::distance_compare_t, boost::bgl_named_params<boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params<long unsigned int*, boost::vertex_predecessor_t, boost::no_property> > > >; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’
554 | detail::dijkstra_dispatch2(g, s,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~
555 | choose_param(distance,
| ~~~~~~~~~~~~~~~~~~~~~~
556 | make_iterator_property_map(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~
557 | distance_map.begin(), index_map, distance_map[0])),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
558 | weight, index_map, params);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dijkstra_shortest_paths.hpp:570:31: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with VertexListGraph = R_adjacency_list<undirectedS, double>; Param = detail::_project2nd<double, double>; Tag = distance_combine_t; Rest = bgl_named_params<std::less<double>, distance_compare_t, bgl_named_params<adj_list_edge_property_map<undirected_tag, double, const double&, long unsigned int, const property<edge_weight_t, double, no_property>, edge_weight_t>, edge_weight_t, bgl_named_params<long unsigned int*, vertex_predecessor_t, no_property> > >; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
570 | detail::dijkstra_dispatch1(g, s, get_param(params, vertex_distance),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
571 | choose_const_pmap(get_param(params, edge_weight), g, edge_weight),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
572 | choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
573 | params);
| ~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:43:32: required from ‘void boost::detail::prim_mst_impl(const Graph&, typename boost::graph_traits<Graph>::vertex_descriptor, const boost::bgl_named_params<T, Tag, Base>&, Weight) [with Graph = R_adjacency_list<boost::undirectedS, double>; P = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>; T = boost::edge_weight_t; R = boost::bgl_named_params<long unsigned int*, boost::vertex_predecessor_t, boost::no_property>; Weight = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’
43 | dijkstra_shortest_paths(
| ~~~~~~~~~~~~~~~~~~~~~~~^
44 | G, s, params.distance_compare(compare).distance_combine(combine));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:77:26: required from ‘void boost::prim_minimum_spanning_tree(const VertexListGraph&, PredecessorMap) [with VertexListGraph = R_adjacency_list<undirectedS, double>; PredecessorMap = long unsigned int*]’
77 | detail::prim_mst_impl(g, *vertices(g).first,
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
78 | predecessor_map(p_map).weight_map(get(edge_weight, g)),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
79 | get(edge_weight, g));
| ~~~~~~~~~~~~~~~~~~~~
minST.cpp:89:35: required from here
89 | prim_minimum_spanning_tree(g, &parent[0]);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Assignable<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > >, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > >, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > >, boost::property<boost::edge_weight_t, double, 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(); }
| ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::EqualityComparable<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > >, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > >, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > >, boost::property<boost::edge_weight_t, double, boost::no_property> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > >, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > >, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > >, boost::property<boost::edge_weight_t, double, 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> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > >, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > >, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > >, boost::property<boost::edge_weight_t, double, boost::no_property> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> >’
502 | BOOST_concept(InputIterator,(TT))
| ^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::InputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > >, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > >, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > >, boost::property<boost::edge_weight_t, double, 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);
| ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied<boost::InputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > >, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > >, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > >, boost::property<boost::edge_weight_t, double, 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) );
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied<boost::InputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > >, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > >, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > >, boost::property<boost::edge_weight_t, double, 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;
| ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 11 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dijkstra_shortest_paths.hpp:528:32: required from ‘void boost::detail::dijkstra_dispatch2(const VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list<boost::undirectedS, double>; DistanceMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, double, double&>; WeightMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>; Params = boost::bgl_named_params<_project2nd<double, double>, boost::distance_combine_t, boost::bgl_named_params<std::less<double>, boost::distance_compare_t, boost::bgl_named_params<boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params<long unsigned int*, boost::vertex_predecessor_t, boost::no_property> > > >; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’
528 | dijkstra_shortest_paths(g, s,
| ~~~~~~~~~~~~~~~~~~~~~~~^~~~~~
529 | choose_param(get_param(params, vertex_predecessor), p_map),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
530 | distance, weight, index_map,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~
531 | choose_param(
| ~~~~~~~~~~~~~
532 | get_param(params, distance_compare_t()), std::less< D >()),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
533 | choose_param(
| ~~~~~~~~~~~~~
534 | get_param(params, distance_combine_t()), std::plus< D >()),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
535 | inf, choose_param(get_param(params, distance_zero_t()), D()),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
536 | choose_param(get_param(params, graph_visitor),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
537 | make_dijkstra_visitor(null_visitor())),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
538 | params);
| ~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dijkstra_shortest_paths.hpp:554:35: required from ‘void boost::detail::dijkstra_dispatch1(const VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list<boost::undirectedS, double>; DistanceMap = boost::param_not_found; WeightMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>; Params = boost::bgl_named_params<_project2nd<double, double>, boost::distance_combine_t, boost::bgl_named_params<std::less<double>, boost::distance_compare_t, boost::bgl_named_params<boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params<long unsigned int*, boost::vertex_predecessor_t, boost::no_property> > > >; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’
554 | detail::dijkstra_dispatch2(g, s,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~
555 | choose_param(distance,
| ~~~~~~~~~~~~~~~~~~~~~~
556 | make_iterator_property_map(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~
557 | distance_map.begin(), index_map, distance_map[0])),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
558 | weight, index_map, params);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dijkstra_shortest_paths.hpp:570:31: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with VertexListGraph = R_adjacency_list<undirectedS, double>; Param = detail::_project2nd<double, double>; Tag = distance_combine_t; Rest = bgl_named_params<std::less<double>, distance_compare_t, bgl_named_params<adj_list_edge_property_map<undirected_tag, double, const double&, long unsigned int, const property<edge_weight_t, double, no_property>, edge_weight_t>, edge_weight_t, bgl_named_params<long unsigned int*, vertex_predecessor_t, no_property> > >; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
570 | detail::dijkstra_dispatch1(g, s, get_param(params, vertex_distance),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
571 | choose_const_pmap(get_param(params, edge_weight), g, edge_weight),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
572 | choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
573 | params);
| ~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:43:32: required from ‘void boost::detail::prim_mst_impl(const Graph&, typename boost::graph_traits<Graph>::vertex_descriptor, const boost::bgl_named_params<T, Tag, Base>&, Weight) [with Graph = R_adjacency_list<boost::undirectedS, double>; P = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>; T = boost::edge_weight_t; R = boost::bgl_named_params<long unsigned int*, boost::vertex_predecessor_t, boost::no_property>; Weight = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’
43 | dijkstra_shortest_paths(
| ~~~~~~~~~~~~~~~~~~~~~~~^
44 | G, s, params.distance_compare(compare).distance_combine(combine));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:77:26: required from ‘void boost::prim_minimum_spanning_tree(const VertexListGraph&, PredecessorMap) [with VertexListGraph = R_adjacency_list<undirectedS, double>; PredecessorMap = long unsigned int*]’
77 | detail::prim_mst_impl(g, *vertices(g).first,
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
78 | predecessor_map(p_map).weight_map(get(edge_weight, g)),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
79 | get(edge_weight, g));
| ~~~~~~~~~~~~~~~~~~~~
minST.cpp:89:35: required from here
89 | prim_minimum_spanning_tree(g, &parent[0]);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::EqualityComparable<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > >, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > >, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > >, boost::property<boost::edge_weight_t, double, 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(); }
| ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::InputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > >, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > >, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > >, boost::property<boost::edge_weight_t, double, boost::no_property> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:512:7: required from ‘struct boost::InputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > >, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > >, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > >, boost::property<boost::edge_weight_t, double, 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> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::InputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > >, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > >, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > >, boost::property<boost::edge_weight_t, double, 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);
| ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied<boost::InputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > >, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > >, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > >, boost::property<boost::edge_weight_t, double, 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) );
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied<boost::InputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > >, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > >, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > >, boost::property<boost::edge_weight_t, double, 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;
| ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_<void (*)(boost::InputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > >, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > >, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > >, boost::property<boost::edge_weight_t, double, boost::no_property> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> >)>’
72 | struct requirement_<void(*)(Model)>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:53:35: [ skipping 10 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dijkstra_shortest_paths.hpp:528:32: required from ‘void boost::detail::dijkstra_dispatch2(const VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list<boost::undirectedS, double>; DistanceMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, double, double&>; WeightMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>; Params = boost::bgl_named_params<_project2nd<double, double>, boost::distance_combine_t, boost::bgl_named_params<std::less<double>, boost::distance_compare_t, boost::bgl_named_params<boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params<long unsigned int*, boost::vertex_predecessor_t, boost::no_property> > > >; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’
528 | dijkstra_shortest_paths(g, s,
| ~~~~~~~~~~~~~~~~~~~~~~~^~~~~~
529 | choose_param(get_param(params, vertex_predecessor), p_map),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
530 | distance, weight, index_map,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~
531 | choose_param(
| ~~~~~~~~~~~~~
532 | get_param(params, distance_compare_t()), std::less< D >()),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
533 | choose_param(
| ~~~~~~~~~~~~~
534 | get_param(params, distance_combine_t()), std::plus< D >()),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
535 | inf, choose_param(get_param(params, distance_zero_t()), D()),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
536 | choose_param(get_param(params, graph_visitor),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
537 | make_dijkstra_visitor(null_visitor())),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
538 | params);
| ~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dijkstra_shortest_paths.hpp:554:35: required from ‘void boost::detail::dijkstra_dispatch1(const VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list<boost::undirectedS, double>; DistanceMap = boost::param_not_found; WeightMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>; Params = boost::bgl_named_params<_project2nd<double, double>, boost::distance_combine_t, boost::bgl_named_params<std::less<double>, boost::distance_compare_t, boost::bgl_named_params<boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params<long unsigned int*, boost::vertex_predecessor_t, boost::no_property> > > >; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’
554 | detail::dijkstra_dispatch2(g, s,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~
555 | choose_param(distance,
| ~~~~~~~~~~~~~~~~~~~~~~
556 | make_iterator_property_map(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~
557 | distance_map.begin(), index_map, distance_map[0])),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
558 | weight, index_map, params);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dijkstra_shortest_paths.hpp:570:31: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with VertexListGraph = R_adjacency_list<undirectedS, double>; Param = detail::_project2nd<double, double>; Tag = distance_combine_t; Rest = bgl_named_params<std::less<double>, distance_compare_t, bgl_named_params<adj_list_edge_property_map<undirected_tag, double, const double&, long unsigned int, const property<edge_weight_t, double, no_property>, edge_weight_t>, edge_weight_t, bgl_named_params<long unsigned int*, vertex_predecessor_t, no_property> > >; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
570 | detail::dijkstra_dispatch1(g, s, get_param(params, vertex_distance),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
571 | choose_const_pmap(get_param(params, edge_weight), g, edge_weight),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
572 | choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
573 | params);
| ~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:43:32: required from ‘void boost::detail::prim_mst_impl(const Graph&, typename boost::graph_traits<Graph>::vertex_descriptor, const boost::bgl_named_params<T, Tag, Base>&, Weight) [with Graph = R_adjacency_list<boost::undirectedS, double>; P = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>; T = boost::edge_weight_t; R = boost::bgl_named_params<long unsigned int*, boost::vertex_predecessor_t, boost::no_property>; Weight = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’
43 | dijkstra_shortest_paths(
| ~~~~~~~~~~~~~~~~~~~~~~~^
44 | G, s, params.distance_compare(compare).distance_combine(combine));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:77:26: required from ‘void boost::prim_minimum_spanning_tree(const VertexListGraph&, PredecessorMap) [with VertexListGraph = R_adjacency_list<undirectedS, double>; PredecessorMap = long unsigned int*]’
77 | detail::prim_mst_impl(g, *vertices(g).first,
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
78 | predecessor_map(p_map).weight_map(get(edge_weight, g)),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
79 | get(edge_weight, g));
| ~~~~~~~~~~~~~~~~~~~~
minST.cpp:89:35: required from here
89 | prim_minimum_spanning_tree(g, &parent[0]);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::InputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > >, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > >, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > >, boost::property<boost::edge_weight_t, double, 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(); }
| ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::InputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > >, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > >, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > >, boost::property<boost::edge_weight_t, double, boost::no_property> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:53:35: required from ‘boost::concepts::MultiPassInputIterator<T>::~MultiPassInputIterator() [with T = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > >, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > >, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > >, boost::property<boost::edge_weight_t, double, 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> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::MultiPassInputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > >, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > >, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > >, boost::property<boost::edge_weight_t, double, 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(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:89:9: required from ‘boost::concepts::IncidenceGraph<G>::~IncidenceGraph() [with G = R_adjacency_list<boost::undirectedS, double>]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/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<R_adjacency_list<boost::undirectedS, double> >]’
75 | BOOST_concept(IncidenceGraph, (G)) : Graph< G >
| ^~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:62:5: required from ‘void boost::breadth_first_visit(const IncidenceGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with IncidenceGraph = R_adjacency_list<undirectedS, double>; Buffer = d_ary_heap_indirect<long unsigned int, 4, iterator_property_map<long unsigned int*, vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>, iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > >, vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>, double, double&>, std::less<double>, std::vector<long unsigned int> >; BFSVisitor = detail::dijkstra_bfs_visitor<dijkstra_visitor<>, d_ary_heap_indirect<long unsigned int, 4, iterator_property_map<long unsigned int*, vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>, iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > >, vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>, double, double&>, std::less<double>, std::vector<long unsigned int> >, adj_list_edge_property_map<undirected_tag, double, const double&, long unsigned int, const property<edge_weight_t, double, no_property>, edge_weight_t>, long unsigned int*, iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > >, vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int>, double, double&>, detail::_project2nd<double, double>, std::less<double> >; ColorMap = two_bit_color_map<vec_adj_list_vertex_id_map<property<vertex_color_t, default_color_type>, long unsigned int> >; SourceIterator = long unsigned int*]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dijkstra_shortest_paths.hpp:387:24: [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dijkstra_shortest_paths.hpp:528:32: required from ‘void boost::detail::dijkstra_dispatch2(const VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list<boost::undirectedS, double>; DistanceMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, double, double&>; WeightMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>; Params = boost::bgl_named_params<_project2nd<double, double>, boost::distance_combine_t, boost::bgl_named_params<std::less<double>, boost::distance_compare_t, boost::bgl_named_params<boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params<long unsigned int*, boost::vertex_predecessor_t, boost::no_property> > > >; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’
528 | dijkstra_shortest_paths(g, s,
| ~~~~~~~~~~~~~~~~~~~~~~~^~~~~~
529 | choose_param(get_param(params, vertex_predecessor), p_map),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
530 | distance, weight, index_map,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~
531 | choose_param(
| ~~~~~~~~~~~~~
532 | get_param(params, distance_compare_t()), std::less< D >()),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
533 | choose_param(
| ~~~~~~~~~~~~~
534 | get_param(params, distance_combine_t()), std::plus< D >()),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
535 | inf, choose_param(get_param(params, distance_zero_t()), D()),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
536 | choose_param(get_param(params, graph_visitor),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
537 | make_dijkstra_visitor(null_visitor())),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
538 | params);
| ~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dijkstra_shortest_paths.hpp:554:35: required from ‘void boost::detail::dijkstra_dispatch1(const VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list<boost::undirectedS, double>; DistanceMap = boost::param_not_found; WeightMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>; Params = boost::bgl_named_params<_project2nd<double, double>, boost::distance_combine_t, boost::bgl_named_params<std::less<double>, boost::distance_compare_t, boost::bgl_named_params<boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params<long unsigned int*, boost::vertex_predecessor_t, boost::no_property> > > >; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’
554 | detail::dijkstra_dispatch2(g, s,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~
555 | choose_param(distance,
| ~~~~~~~~~~~~~~~~~~~~~~
556 | make_iterator_property_map(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~
557 | distance_map.begin(), index_map, distance_map[0])),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
558 | weight, index_map, params);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dijkstra_shortest_paths.hpp:570:31: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with VertexListGraph = R_adjacency_list<undirectedS, double>; Param = detail::_project2nd<double, double>; Tag = distance_combine_t; Rest = bgl_named_params<std::less<double>, distance_compare_t, bgl_named_params<adj_list_edge_property_map<undirected_tag, double, const double&, long unsigned int, const property<edge_weight_t, double, no_property>, edge_weight_t>, edge_weight_t, bgl_named_params<long unsigned int*, vertex_predecessor_t, no_property> > >; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
570 | detail::dijkstra_dispatch1(g, s, get_param(params, vertex_distance),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
571 | choose_const_pmap(get_param(params, edge_weight), g, edge_weight),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
572 | choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
573 | params);
| ~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:43:32: required from ‘void boost::detail::prim_mst_impl(const Graph&, typename boost::graph_traits<Graph>::vertex_descriptor, const boost::bgl_named_params<T, Tag, Base>&, Weight) [with Graph = R_adjacency_list<boost::undirectedS, double>; P = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>; T = boost::edge_weight_t; R = boost::bgl_named_params<long unsigned int*, boost::vertex_predecessor_t, boost::no_property>; Weight = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’
43 | dijkstra_shortest_paths(
| ~~~~~~~~~~~~~~~~~~~~~~~^
44 | G, s, params.distance_compare(compare).distance_combine(combine));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:77:26: required from ‘void boost::prim_minimum_spanning_tree(const VertexListGraph&, PredecessorMap) [with VertexListGraph = R_adjacency_list<undirectedS, double>; PredecessorMap = long unsigned int*]’
77 | detail::prim_mst_impl(g, *vertices(g).first,
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
78 | predecessor_map(p_map).weight_map(get(edge_weight, g)),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
79 | get(edge_weight, g));
| ~~~~~~~~~~~~~~~~~~~~
minST.cpp:89:35: required from here
89 | prim_minimum_spanning_tree(g, &parent[0]);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::InputIterator<TT>::~InputIterator() [with TT = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > >, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > >, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > >, boost::property<boost::edge_weight_t, double, boost::no_property> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int>]’
37 | ~model()
| ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:512:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
512 | BOOST_CONCEPT_USAGE(InputIterator)
| ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Assignable<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > >, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > >, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > >, boost::property<boost::edge_weight_t, double, boost::no_property> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Assignable<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > >, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > >, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > >, boost::property<boost::edge_weight_t, double, 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(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:145:5: required from ‘struct boost::Assignable<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > >, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > >, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > >, boost::property<boost::edge_weight_t, double, 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> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > >, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > >, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > >, boost::property<boost::edge_weight_t, double, boost::no_property> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> >’
502 | BOOST_concept(InputIterator,(TT))
| ^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::InputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > >, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > >, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > >, boost::property<boost::edge_weight_t, double, 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);
| ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied<boost::InputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > >, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > >, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > >, boost::property<boost::edge_weight_t, double, 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) );
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 12 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dijkstra_shortest_paths.hpp:528:32: required from ‘void boost::detail::dijkstra_dispatch2(const VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list<boost::undirectedS, double>; DistanceMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, double, double&>; WeightMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>; Params = boost::bgl_named_params<_project2nd<double, double>, boost::distance_combine_t, boost::bgl_named_params<std::less<double>, boost::distance_compare_t, boost::bgl_named_params<boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params<long unsigned int*, boost::vertex_predecessor_t, boost::no_property> > > >; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’
528 | dijkstra_shortest_paths(g, s,
| ~~~~~~~~~~~~~~~~~~~~~~~^~~~~~
529 | choose_param(get_param(params, vertex_predecessor), p_map),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
530 | distance, weight, index_map,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~
531 | choose_param(
| ~~~~~~~~~~~~~
532 | get_param(params, distance_compare_t()), std::less< D >()),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
533 | choose_param(
| ~~~~~~~~~~~~~
534 | get_param(params, distance_combine_t()), std::plus< D >()),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
535 | inf, choose_param(get_param(params, distance_zero_t()), D()),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
536 | choose_param(get_param(params, graph_visitor),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
537 | make_dijkstra_visitor(null_visitor())),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
538 | params);
| ~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dijkstra_shortest_paths.hpp:554:35: required from ‘void boost::detail::dijkstra_dispatch1(const VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list<boost::undirectedS, double>; DistanceMap = boost::param_not_found; WeightMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>; Params = boost::bgl_named_params<_project2nd<double, double>, boost::distance_combine_t, boost::bgl_named_params<std::less<double>, boost::distance_compare_t, boost::bgl_named_params<boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params<long unsigned int*, boost::vertex_predecessor_t, boost::no_property> > > >; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’
554 | detail::dijkstra_dispatch2(g, s,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~
555 | choose_param(distance,
| ~~~~~~~~~~~~~~~~~~~~~~
556 | make_iterator_property_map(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~
557 | distance_map.begin(), index_map, distance_map[0])),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
558 | weight, index_map, params);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dijkstra_shortest_paths.hpp:570:31: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with VertexListGraph = R_adjacency_list<undirectedS, double>; Param = detail::_project2nd<double, double>; Tag = distance_combine_t; Rest = bgl_named_params<std::less<double>, distance_compare_t, bgl_named_params<adj_list_edge_property_map<undirected_tag, double, const double&, long unsigned int, const property<edge_weight_t, double, no_property>, edge_weight_t>, edge_weight_t, bgl_named_params<long unsigned int*, vertex_predecessor_t, no_property> > >; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
570 | detail::dijkstra_dispatch1(g, s, get_param(params, vertex_distance),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
571 | choose_const_pmap(get_param(params, edge_weight), g, edge_weight),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
572 | choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
573 | params);
| ~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:43:32: required from ‘void boost::detail::prim_mst_impl(const Graph&, typename boost::graph_traits<Graph>::vertex_descriptor, const boost::bgl_named_params<T, Tag, Base>&, Weight) [with Graph = R_adjacency_list<boost::undirectedS, double>; P = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>; T = boost::edge_weight_t; R = boost::bgl_named_params<long unsigned int*, boost::vertex_predecessor_t, boost::no_property>; Weight = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’
43 | dijkstra_shortest_paths(
| ~~~~~~~~~~~~~~~~~~~~~~~^
44 | G, s, params.distance_compare(compare).distance_combine(combine));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:77:26: required from ‘void boost::prim_minimum_spanning_tree(const VertexListGraph&, PredecessorMap) [with VertexListGraph = R_adjacency_list<undirectedS, double>; PredecessorMap = long unsigned int*]’
77 | detail::prim_mst_impl(g, *vertices(g).first,
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
78 | predecessor_map(p_map).weight_map(get(edge_weight, g)),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
79 | get(edge_weight, g));
| ~~~~~~~~~~~~~~~~~~~~
minST.cpp:89:35: required from here
89 | prim_minimum_spanning_tree(g, &parent[0]);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
20 | ~usage_requirements() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Assignable<TT>::~Assignable() [with TT = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > >, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > >, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > >, boost::property<boost::edge_weight_t, double, boost::no_property> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int>]’
37 | ~model()
| ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:145:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
145 | BOOST_CONCEPT_USAGE(Assignable) {
| ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::EqualityComparable<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > >, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > >, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > >, boost::property<boost::edge_weight_t, double, boost::no_property> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::EqualityComparable<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > >, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > >, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > >, boost::property<boost::edge_weight_t, double, 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(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > >, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > >, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > >, boost::property<boost::edge_weight_t, double, 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> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > >, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > >, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > >, boost::property<boost::edge_weight_t, double, boost::no_property> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> >’
502 | BOOST_concept(InputIterator,(TT))
| ^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::InputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > >, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > >, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > >, boost::property<boost::edge_weight_t, double, 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);
| ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied<boost::InputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > >, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > >, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > >, boost::property<boost::edge_weight_t, double, 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) );
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 12 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dijkstra_shortest_paths.hpp:528:32: required from ‘void boost::detail::dijkstra_dispatch2(const VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list<boost::undirectedS, double>; DistanceMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, double, double&>; WeightMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>; Params = boost::bgl_named_params<_project2nd<double, double>, boost::distance_combine_t, boost::bgl_named_params<std::less<double>, boost::distance_compare_t, boost::bgl_named_params<boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params<long unsigned int*, boost::vertex_predecessor_t, boost::no_property> > > >; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’
528 | dijkstra_shortest_paths(g, s,
| ~~~~~~~~~~~~~~~~~~~~~~~^~~~~~
529 | choose_param(get_param(params, vertex_predecessor), p_map),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
530 | distance, weight, index_map,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~
531 | choose_param(
| ~~~~~~~~~~~~~
532 | get_param(params, distance_compare_t()), std::less< D >()),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
533 | choose_param(
| ~~~~~~~~~~~~~
534 | get_param(params, distance_combine_t()), std::plus< D >()),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
535 | inf, choose_param(get_param(params, distance_zero_t()), D()),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
536 | choose_param(get_param(params, graph_visitor),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
537 | make_dijkstra_visitor(null_visitor())),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
538 | params);
| ~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dijkstra_shortest_paths.hpp:554:35: required from ‘void boost::detail::dijkstra_dispatch1(const VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list<boost::undirectedS, double>; DistanceMap = boost::param_not_found; WeightMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>; Params = boost::bgl_named_params<_project2nd<double, double>, boost::distance_combine_t, boost::bgl_named_params<std::less<double>, boost::distance_compare_t, boost::bgl_named_params<boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params<long unsigned int*, boost::vertex_predecessor_t, boost::no_property> > > >; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’
554 | detail::dijkstra_dispatch2(g, s,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~
555 | choose_param(distance,
| ~~~~~~~~~~~~~~~~~~~~~~
556 | make_iterator_property_map(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~
557 | distance_map.begin(), index_map, distance_map[0])),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
558 | weight, index_map, params);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dijkstra_shortest_paths.hpp:570:31: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with VertexListGraph = R_adjacency_list<undirectedS, double>; Param = detail::_project2nd<double, double>; Tag = distance_combine_t; Rest = bgl_named_params<std::less<double>, distance_compare_t, bgl_named_params<adj_list_edge_property_map<undirected_tag, double, const double&, long unsigned int, const property<edge_weight_t, double, no_property>, edge_weight_t>, edge_weight_t, bgl_named_params<long unsigned int*, vertex_predecessor_t, no_property> > >; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
570 | detail::dijkstra_dispatch1(g, s, get_param(params, vertex_distance),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
571 | choose_const_pmap(get_param(params, edge_weight), g, edge_weight),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
572 | choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
573 | params);
| ~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:43:32: required from ‘void boost::detail::prim_mst_impl(const Graph&, typename boost::graph_traits<Graph>::vertex_descriptor, const boost::bgl_named_params<T, Tag, Base>&, Weight) [with Graph = R_adjacency_list<boost::undirectedS, double>; P = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>; T = boost::edge_weight_t; R = boost::bgl_named_params<long unsigned int*, boost::vertex_predecessor_t, boost::no_property>; Weight = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’
43 | dijkstra_shortest_paths(
| ~~~~~~~~~~~~~~~~~~~~~~~^
44 | G, s, params.distance_compare(compare).distance_combine(combine));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:77:26: required from ‘void boost::prim_minimum_spanning_tree(const VertexListGraph&, PredecessorMap) [with VertexListGraph = R_adjacency_list<undirectedS, double>; PredecessorMap = long unsigned int*]’
77 | detail::prim_mst_impl(g, *vertices(g).first,
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
78 | predecessor_map(p_map).weight_map(get(edge_weight, g)),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
79 | get(edge_weight, g));
| ~~~~~~~~~~~~~~~~~~~~
minST.cpp:89:35: required from here
89 | prim_minimum_spanning_tree(g, &parent[0]);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
20 | ~usage_requirements() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::EqualityComparable<TT>::~EqualityComparable() [with TT = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > >, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > >, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > >, boost::property<boost::edge_weight_t, double, boost::no_property> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int>]’
37 | ~model()
| ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:233:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
233 | BOOST_CONCEPT_USAGE(EqualityComparable) {
| ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::InputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > >, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > >, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > >, boost::property<boost::edge_weight_t, double, boost::no_property> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int> >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::InputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > >, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > >, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > >, boost::property<boost::edge_weight_t, double, 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(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:512:7: required from ‘struct boost::InputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > >, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > >, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > >, boost::property<boost::edge_weight_t, double, 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> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::InputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > >, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > >, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > >, boost::property<boost::edge_weight_t, double, 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);
| ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied<boost::InputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > >, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > >, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > >, boost::property<boost::edge_weight_t, double, 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) );
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied<boost::InputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > >, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > >, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > >, boost::property<boost::edge_weight_t, double, 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;
| ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 11 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dijkstra_shortest_paths.hpp:528:32: required from ‘void boost::detail::dijkstra_dispatch2(const VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list<boost::undirectedS, double>; DistanceMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, double, double&>; WeightMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>; Params = boost::bgl_named_params<_project2nd<double, double>, boost::distance_combine_t, boost::bgl_named_params<std::less<double>, boost::distance_compare_t, boost::bgl_named_params<boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params<long unsigned int*, boost::vertex_predecessor_t, boost::no_property> > > >; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’
528 | dijkstra_shortest_paths(g, s,
| ~~~~~~~~~~~~~~~~~~~~~~~^~~~~~
529 | choose_param(get_param(params, vertex_predecessor), p_map),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
530 | distance, weight, index_map,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~
531 | choose_param(
| ~~~~~~~~~~~~~
532 | get_param(params, distance_compare_t()), std::less< D >()),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
533 | choose_param(
| ~~~~~~~~~~~~~
534 | get_param(params, distance_combine_t()), std::plus< D >()),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
535 | inf, choose_param(get_param(params, distance_zero_t()), D()),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
536 | choose_param(get_param(params, graph_visitor),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
537 | make_dijkstra_visitor(null_visitor())),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
538 | params);
| ~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dijkstra_shortest_paths.hpp:554:35: required from ‘void boost::detail::dijkstra_dispatch1(const VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list<boost::undirectedS, double>; DistanceMap = boost::param_not_found; WeightMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>; Params = boost::bgl_named_params<_project2nd<double, double>, boost::distance_combine_t, boost::bgl_named_params<std::less<double>, boost::distance_compare_t, boost::bgl_named_params<boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params<long unsigned int*, boost::vertex_predecessor_t, boost::no_property> > > >; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’
554 | detail::dijkstra_dispatch2(g, s,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~
555 | choose_param(distance,
| ~~~~~~~~~~~~~~~~~~~~~~
556 | make_iterator_property_map(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~
557 | distance_map.begin(), index_map, distance_map[0])),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
558 | weight, index_map, params);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dijkstra_shortest_paths.hpp:570:31: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with VertexListGraph = R_adjacency_list<undirectedS, double>; Param = detail::_project2nd<double, double>; Tag = distance_combine_t; Rest = bgl_named_params<std::less<double>, distance_compare_t, bgl_named_params<adj_list_edge_property_map<undirected_tag, double, const double&, long unsigned int, const property<edge_weight_t, double, no_property>, edge_weight_t>, edge_weight_t, bgl_named_params<long unsigned int*, vertex_predecessor_t, no_property> > >; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
570 | detail::dijkstra_dispatch1(g, s, get_param(params, vertex_distance),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
571 | choose_const_pmap(get_param(params, edge_weight), g, edge_weight),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
572 | choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
573 | params);
| ~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:43:32: required from ‘void boost::detail::prim_mst_impl(const Graph&, typename boost::graph_traits<Graph>::vertex_descriptor, const boost::bgl_named_params<T, Tag, Base>&, Weight) [with Graph = R_adjacency_list<boost::undirectedS, double>; P = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>; T = boost::edge_weight_t; R = boost::bgl_named_params<long unsigned int*, boost::vertex_predecessor_t, boost::no_property>; Weight = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’
43 | dijkstra_shortest_paths(
| ~~~~~~~~~~~~~~~~~~~~~~~^
44 | G, s, params.distance_compare(compare).distance_combine(combine));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:77:26: required from ‘void boost::prim_minimum_spanning_tree(const VertexListGraph&, PredecessorMap) [with VertexListGraph = R_adjacency_list<undirectedS, double>; PredecessorMap = long unsigned int*]’
77 | detail::prim_mst_impl(g, *vertices(g).first,
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
78 | predecessor_map(p_map).weight_map(get(edge_weight, g)),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
79 | get(edge_weight, g));
| ~~~~~~~~~~~~~~~~~~~~
minST.cpp:89:35: required from here
89 | prim_minimum_spanning_tree(g, &parent[0]);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
20 | ~usage_requirements() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::InputIterator<TT>::~InputIterator() [with TT = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > >, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > >, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > >, boost::property<boost::edge_weight_t, double, boost::no_property> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::undirected_tag, long unsigned int>, long int>]’
37 | ~model()
| ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:512:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
512 | BOOST_CONCEPT_USAGE(InputIterator)
| ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Convertible<boost::iterators::detail::iterator_category_with_traversal<std::input_iterator_tag, boost::iterators::random_access_traversal_tag>, std::input_iterator_tag> >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/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> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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);
| ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/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) );
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/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;
| ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/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)>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:515:9: [ skipping 12 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dijkstra_shortest_paths.hpp:528:32: required from ‘void boost::detail::dijkstra_dispatch2(const VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list<boost::undirectedS, double>; DistanceMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, double, double&>; WeightMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>; Params = boost::bgl_named_params<_project2nd<double, double>, boost::distance_combine_t, boost::bgl_named_params<std::less<double>, boost::distance_compare_t, boost::bgl_named_params<boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params<long unsigned int*, boost::vertex_predecessor_t, boost::no_property> > > >; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’
528 | dijkstra_shortest_paths(g, s,
| ~~~~~~~~~~~~~~~~~~~~~~~^~~~~~
529 | choose_param(get_param(params, vertex_predecessor), p_map),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
530 | distance, weight, index_map,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~
531 | choose_param(
| ~~~~~~~~~~~~~
532 | get_param(params, distance_compare_t()), std::less< D >()),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
533 | choose_param(
| ~~~~~~~~~~~~~
534 | get_param(params, distance_combine_t()), std::plus< D >()),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
535 | inf, choose_param(get_param(params, distance_zero_t()), D()),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
536 | choose_param(get_param(params, graph_visitor),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
537 | make_dijkstra_visitor(null_visitor())),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
538 | params);
| ~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dijkstra_shortest_paths.hpp:554:35: required from ‘void boost::detail::dijkstra_dispatch1(const VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list<boost::undirectedS, double>; DistanceMap = boost::param_not_found; WeightMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>; Params = boost::bgl_named_params<_project2nd<double, double>, boost::distance_combine_t, boost::bgl_named_params<std::less<double>, boost::distance_compare_t, boost::bgl_named_params<boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params<long unsigned int*, boost::vertex_predecessor_t, boost::no_property> > > >; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’
554 | detail::dijkstra_dispatch2(g, s,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~
555 | choose_param(distance,
| ~~~~~~~~~~~~~~~~~~~~~~
556 | make_iterator_property_map(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~
557 | distance_map.begin(), index_map, distance_map[0])),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
558 | weight, index_map, params);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dijkstra_shortest_paths.hpp:570:31: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with VertexListGraph = R_adjacency_list<undirectedS, double>; Param = detail::_project2nd<double, double>; Tag = distance_combine_t; Rest = bgl_named_params<std::less<double>, distance_compare_t, bgl_named_params<adj_list_edge_property_map<undirected_tag, double, const double&, long unsigned int, const property<edge_weight_t, double, no_property>, edge_weight_t>, edge_weight_t, bgl_named_params<long unsigned int*, vertex_predecessor_t, no_property> > >; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
570 | detail::dijkstra_dispatch1(g, s, get_param(params, vertex_distance),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
571 | choose_const_pmap(get_param(params, edge_weight), g, edge_weight),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
572 | choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
573 | params);
| ~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:43:32: required from ‘void boost::detail::prim_mst_impl(const Graph&, typename boost::graph_traits<Graph>::vertex_descriptor, const boost::bgl_named_params<T, Tag, Base>&, Weight) [with Graph = R_adjacency_list<boost::undirectedS, double>; P = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>; T = boost::edge_weight_t; R = boost::bgl_named_params<long unsigned int*, boost::vertex_predecessor_t, boost::no_property>; Weight = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’
43 | dijkstra_shortest_paths(
| ~~~~~~~~~~~~~~~~~~~~~~~^
44 | G, s, params.distance_compare(compare).distance_combine(combine));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:77:26: required from ‘void boost::prim_minimum_spanning_tree(const VertexListGraph&, PredecessorMap) [with VertexListGraph = R_adjacency_list<undirectedS, double>; PredecessorMap = long unsigned int*]’
77 | detail::prim_mst_impl(g, *vertices(g).first,
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
78 | predecessor_map(p_map).weight_map(get(edge_weight, g)),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
79 | get(edge_weight, g));
| ~~~~~~~~~~~~~~~~~~~~
minST.cpp:89:35: required from here
89 | prim_minimum_spanning_tree(g, &parent[0]);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Convertible<boost::iterators::detail::iterator_category_with_traversal<std::input_iterator_tag, boost::iterators::random_access_traversal_tag>, std::input_iterator_tag>]’
20 | ~usage_requirements() { ((Model*)0)->~Model(); }
| ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::Convertible<boost::iterators::detail::iterator_category_with_traversal<std::input_iterator_tag, boost::iterators::random_access_traversal_tag>, std::input_iterator_tag>]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:515:9: required from ‘boost::InputIterator<TT>::~InputIterator() [with TT = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > >, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > >, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > >, boost::property<boost::edge_weight_t, double, 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> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::InputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > >, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > >, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > >, boost::property<boost::edge_weight_t, double, 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(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:53:35: required from ‘boost::concepts::MultiPassInputIterator<T>::~MultiPassInputIterator() [with T = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > >, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > >, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > >, boost::property<boost::edge_weight_t, double, 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> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::MultiPassInputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > >, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > >, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > >, boost::property<boost::edge_weight_t, double, 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(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:89:9: required from ‘boost::concepts::IncidenceGraph<G>::~IncidenceGraph() [with G = R_adjacency_list<boost::undirectedS, double>]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:75:1: [ skipping 7 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dijkstra_shortest_paths.hpp:528:32: required from ‘void boost::detail::dijkstra_dispatch2(const VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list<boost::undirectedS, double>; DistanceMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, double, double&>; WeightMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>; Params = boost::bgl_named_params<_project2nd<double, double>, boost::distance_combine_t, boost::bgl_named_params<std::less<double>, boost::distance_compare_t, boost::bgl_named_params<boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params<long unsigned int*, boost::vertex_predecessor_t, boost::no_property> > > >; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’
528 | dijkstra_shortest_paths(g, s,
| ~~~~~~~~~~~~~~~~~~~~~~~^~~~~~
529 | choose_param(get_param(params, vertex_predecessor), p_map),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
530 | distance, weight, index_map,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~
531 | choose_param(
| ~~~~~~~~~~~~~
532 | get_param(params, distance_compare_t()), std::less< D >()),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
533 | choose_param(
| ~~~~~~~~~~~~~
534 | get_param(params, distance_combine_t()), std::plus< D >()),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
535 | inf, choose_param(get_param(params, distance_zero_t()), D()),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
536 | choose_param(get_param(params, graph_visitor),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
537 | make_dijkstra_visitor(null_visitor())),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
538 | params);
| ~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dijkstra_shortest_paths.hpp:554:35: required from ‘void boost::detail::dijkstra_dispatch1(const VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list<boost::undirectedS, double>; DistanceMap = boost::param_not_found; WeightMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>; Params = boost::bgl_named_params<_project2nd<double, double>, boost::distance_combine_t, boost::bgl_named_params<std::less<double>, boost::distance_compare_t, boost::bgl_named_params<boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params<long unsigned int*, boost::vertex_predecessor_t, boost::no_property> > > >; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’
554 | detail::dijkstra_dispatch2(g, s,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~
555 | choose_param(distance,
| ~~~~~~~~~~~~~~~~~~~~~~
556 | make_iterator_property_map(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~
557 | distance_map.begin(), index_map, distance_map[0])),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
558 | weight, index_map, params);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dijkstra_shortest_paths.hpp:570:31: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with VertexListGraph = R_adjacency_list<undirectedS, double>; Param = detail::_project2nd<double, double>; Tag = distance_combine_t; Rest = bgl_named_params<std::less<double>, distance_compare_t, bgl_named_params<adj_list_edge_property_map<undirected_tag, double, const double&, long unsigned int, const property<edge_weight_t, double, no_property>, edge_weight_t>, edge_weight_t, bgl_named_params<long unsigned int*, vertex_predecessor_t, no_property> > >; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
570 | detail::dijkstra_dispatch1(g, s, get_param(params, vertex_distance),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
571 | choose_const_pmap(get_param(params, edge_weight), g, edge_weight),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
572 | choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
573 | params);
| ~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:43:32: required from ‘void boost::detail::prim_mst_impl(const Graph&, typename boost::graph_traits<Graph>::vertex_descriptor, const boost::bgl_named_params<T, Tag, Base>&, Weight) [with Graph = R_adjacency_list<boost::undirectedS, double>; P = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>; T = boost::edge_weight_t; R = boost::bgl_named_params<long unsigned int*, boost::vertex_predecessor_t, boost::no_property>; Weight = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’
43 | dijkstra_shortest_paths(
| ~~~~~~~~~~~~~~~~~~~~~~~^
44 | G, s, params.distance_compare(compare).distance_combine(combine));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:77:26: required from ‘void boost::prim_minimum_spanning_tree(const VertexListGraph&, PredecessorMap) [with VertexListGraph = R_adjacency_list<undirectedS, double>; PredecessorMap = long unsigned int*]’
77 | detail::prim_mst_impl(g, *vertices(g).first,
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
78 | predecessor_map(p_map).weight_map(get(edge_weight, g)),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
79 | get(edge_weight, g));
| ~~~~~~~~~~~~~~~~~~~~
minST.cpp:89:35: required from here
89 | prim_minimum_spanning_tree(g, &parent[0]);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible<X, Y>::~Convertible() [with X = boost::iterators::detail::iterator_category_with_traversal<std::input_iterator_tag, boost::iterators::random_access_traversal_tag>; Y = std::input_iterator_tag]’
37 | ~model()
| ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
208 | BOOST_CONCEPT_USAGE(Convertible) {
| ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Convertible<boost::iterators::detail::iterator_category_with_traversal<std::input_iterator_tag, boost::iterators::random_access_traversal_tag>, std::input_iterator_tag>]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/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(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/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> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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);
| ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/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) );
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/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;
| ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 13 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dijkstra_shortest_paths.hpp:528:32: required from ‘void boost::detail::dijkstra_dispatch2(const VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list<boost::undirectedS, double>; DistanceMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<double*, std::vector<double, std::allocator<double> > >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, double, double&>; WeightMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>; Params = boost::bgl_named_params<_project2nd<double, double>, boost::distance_combine_t, boost::bgl_named_params<std::less<double>, boost::distance_compare_t, boost::bgl_named_params<boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params<long unsigned int*, boost::vertex_predecessor_t, boost::no_property> > > >; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’
528 | dijkstra_shortest_paths(g, s,
| ~~~~~~~~~~~~~~~~~~~~~~~^~~~~~
529 | choose_param(get_param(params, vertex_predecessor), p_map),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
530 | distance, weight, index_map,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~
531 | choose_param(
| ~~~~~~~~~~~~~
532 | get_param(params, distance_compare_t()), std::less< D >()),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
533 | choose_param(
| ~~~~~~~~~~~~~
534 | get_param(params, distance_combine_t()), std::plus< D >()),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
535 | inf, choose_param(get_param(params, distance_zero_t()), D()),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
536 | choose_param(get_param(params, graph_visitor),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
537 | make_dijkstra_visitor(null_visitor())),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
538 | params);
| ~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dijkstra_shortest_paths.hpp:554:35: required from ‘void boost::detail::dijkstra_dispatch1(const VertexListGraph&, typename boost::graph_traits<Graph>::vertex_descriptor, DistanceMap, WeightMap, IndexMap, const Params&) [with VertexListGraph = R_adjacency_list<boost::undirectedS, double>; DistanceMap = boost::param_not_found; WeightMap = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>; IndexMap = boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>; Params = boost::bgl_named_params<_project2nd<double, double>, boost::distance_combine_t, boost::bgl_named_params<std::less<double>, boost::distance_compare_t, boost::bgl_named_params<boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>, boost::edge_weight_t, boost::bgl_named_params<long unsigned int*, boost::vertex_predecessor_t, boost::no_property> > > >; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’
554 | detail::dijkstra_dispatch2(g, s,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~
555 | choose_param(distance,
| ~~~~~~~~~~~~~~~~~~~~~~
556 | make_iterator_property_map(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~
557 | distance_map.begin(), index_map, distance_map[0])),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
558 | weight, index_map, params);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/dijkstra_shortest_paths.hpp:570:31: required from ‘void boost::dijkstra_shortest_paths(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with VertexListGraph = R_adjacency_list<undirectedS, double>; Param = detail::_project2nd<double, double>; Tag = distance_combine_t; Rest = bgl_named_params<std::less<double>, distance_compare_t, bgl_named_params<adj_list_edge_property_map<undirected_tag, double, const double&, long unsigned int, const property<edge_weight_t, double, no_property>, edge_weight_t>, edge_weight_t, bgl_named_params<long unsigned int*, vertex_predecessor_t, no_property> > >; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
570 | detail::dijkstra_dispatch1(g, s, get_param(params, vertex_distance),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
571 | choose_const_pmap(get_param(params, edge_weight), g, edge_weight),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
572 | choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
573 | params);
| ~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:43:32: required from ‘void boost::detail::prim_mst_impl(const Graph&, typename boost::graph_traits<Graph>::vertex_descriptor, const boost::bgl_named_params<T, Tag, Base>&, Weight) [with Graph = R_adjacency_list<boost::undirectedS, double>; P = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>; T = boost::edge_weight_t; R = boost::bgl_named_params<long unsigned int*, boost::vertex_predecessor_t, boost::no_property>; Weight = boost::adj_list_edge_property_map<boost::undirected_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’
43 | dijkstra_shortest_paths(
| ~~~~~~~~~~~~~~~~~~~~~~~^
44 | G, s, params.distance_compare(compare).distance_combine(combine));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/prim_minimum_spanning_tree.hpp:77:26: required from ‘void boost::prim_minimum_spanning_tree(const VertexListGraph&, PredecessorMap) [with VertexListGraph = R_adjacency_list<undirectedS, double>; PredecessorMap = long unsigned int*]’
77 | detail::prim_mst_impl(g, *vertices(g).first,
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
78 | predecessor_map(p_map).weight_map(get(edge_weight, g)),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
79 | get(edge_weight, g));
| ~~~~~~~~~~~~~~~~~~~~
minST.cpp:89:35: required from here
89 | prim_minimum_spanning_tree(g, &parent[0]);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
20 | ~usage_requirements() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible<X, Y>::~Convertible() [with X = boost::iterators::detail::iterator_category_with_traversal<std::input_iterator_tag, boost::iterators::random_access_traversal_tag>; Y = std::input_iterator_tag]’
37 | ~model()
| ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/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 /opt/ohpc/pub/compiler/gcc/14.2.0/include/c++/14.2.0/string:48,
from /opt/ohpc/pub/compiler/gcc/14.2.0/include/c++/14.2.0/bits/locale_classes.h:40,
from /opt/ohpc/pub/compiler/gcc/14.2.0/include/c++/14.2.0/bits/ios_base.h:41,
from /opt/ohpc/pub/compiler/gcc/14.2.0/include/c++/14.2.0/ios:44,
from /opt/ohpc/pub/compiler/gcc/14.2.0/include/c++/14.2.0/ostream:40,
from /opt/ohpc/pub/compiler/gcc/14.2.0/include/c++/14.2.0/iostream:41,
from RBGL.hpp:7:
In function ‘bool __gnu_cxx::operator==(const __normal_iterator<_Iterator, _Container>&, const __normal_iterator<_Iterator, _Container>&) [with _Iterator = boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >*; _Container = std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > > >]’,
inlined from ‘bool boost::iterators::iterator_adaptor<Derived, Base, Value, Traversal, Reference, Difference>::equal(const boost::iterators::iterator_adaptor<OtherDerived, OtherIterator, V, C, R, D>&) const [with OtherDerived = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int>; OtherIterator = __gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > > > >; V = boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>; C = boost::use_default; R = boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>; D = long int; Derived = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int>; Base = __gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > > > >; Value = boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>; Traversal = boost::use_default; Reference = boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>; Difference = long int]’ at /home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/iterator/iterator_adaptor.hpp:305:29,
inlined from ‘static bool boost::iterators::iterator_core_access::equal(const Facade1&, const Facade2&, mpl_::true_) [with Facade1 = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int>; Facade2 = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int>]’ at /home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/iterator/iterator_facade.hpp:649:26,
inlined from ‘typename boost::iterators::detail::enable_if_interoperable<Derived1, Derived2, typename boost::mpl::apply2<boost::iterators::detail::always_bool2, Derived1, Derived2>::type>::type boost::iterators::operator!=(const iterator_facade<Derived1, V1, TC1, Reference1, Difference1>&, const iterator_facade<Derived2, V2, TC2, Reference2, Difference2>&) [with Derived1 = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int>; V1 = boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>; TC1 = random_access_traversal_tag; Reference1 = boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>; Difference1 = long int; Derived2 = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int>; V2 = boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>; TC2 = random_access_traversal_tag; Reference2 = boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>; Difference2 = long int]’ at /home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/iterator/iterator_facade.hpp:982:3,
inlined from ‘bool boost::detail::adj_list_edge_iterator<VertexIterator, OutEdgeIterator, Graph>::operator!=(const self&) const [with VertexIterator = boost::range_detail::integer_iterator<long unsigned int>; OutEdgeIterator = boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int>; Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_color_t, boost::default_color_type>, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::no_property, boost::listS>]’ at /home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/detail/adj_list_edge_iterator.hpp:113:25,
inlined from ‘void boost::detail::kruskal_mst_impl(const Graph&, OutputIterator, Rank, Parent, Weight) [with Graph = R_adjacency_list<boost::directedS, double>; OutputIterator = std::back_insert_iterator<std::vector<edge_desc_impl<boost::directed_tag, long unsigned int> > >; Rank = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; Parent = boost::iterator_property_map<__gnu_cxx::__normal_iterator<long unsigned int*, std::vector<long unsigned int> >, boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t, boost::default_color_type>, long unsigned int>, long unsigned int, long unsigned int&>; Weight = boost::adj_list_edge_property_map<boost::directed_tag, double, const double&, long unsigned int, const boost::property<boost::edge_weight_t, double, boost::no_property>, boost::edge_weight_t>]’ at /home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:79:51,
inlined from ‘void boost::kruskal_minimum_spanning_tree(const Graph&, OutputIterator) [with Graph = R_adjacency_list<directedS, double>; OutputIterator = std::back_insert_iterator<std::vector<detail::edge_desc_impl<directed_tag, long unsigned int> > >]’ at /home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:112:29,
inlined from ‘SEXPREC* BGL_KMST_D(SEXP, SEXP, SEXP, SEXP)’ at minST.cpp:20:38:
/opt/ohpc/pub/compiler/gcc/14.2.0/include/c++/14.2.0/bits/stl_iterator.h:1219:27: warning: ‘*(boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >* const*)((char*)&eiend + offsetof(boost::detail::edge_iterator, boost::detail::adj_list_edge_iterator<boost::range_detail::integer_iterator<long unsigned int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int>, boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::property<boost::vertex_color_t, boost::default_color_type, boost::no_property>, boost::property<boost::edge_weight_t, double, boost::no_property>, boost::no_property, boost::listS> >::edges.boost::optional<std::pair<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int> > >::<unnamed>.boost::optional_detail::optional_base<std::pair<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int> > >::m_storage.boost::optional_detail::aligned_storage<std::pair<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_weight_t, double, boost::no_property> > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int> > >::dummy_))’ may be used uninitialized [-Wmaybe-uninitialized]
1219 | { return __lhs.base() == __rhs.base(); }
| ~~~~~~~~~~~~~^~~~~~~~~~~~~~~
In file included from minST.cpp:2:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/kruskal_min_spanning_tree.hpp: In function ‘SEXPREC* BGL_KMST_D(SEXP, SEXP, SEXP, SEXP)’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/kruskal_min_spanning_tree.hpp:78:59: note: ‘eiend’ declared here
78 | typename graph_traits< Graph >::edge_iterator ei, eiend;
| ^~~~~
/opt/ohpc/pub/compiler/gcc/14.2.0/bin/aarch64-unknown-linux-gnu-g++ -std=gnu++17 -I"/home/biocbuild/R/R/include" -DNDEBUG -I'/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include' -I/usr/local/include -fPIC -g -O2 -Wall -Werror=format-security -DR_NO_REMAP -c mincut.cpp -o mincut.o
In file included from mincut.cpp:1:
RBGL.hpp:41:9: warning: "R_NO_REMAP" redefined
41 | #define R_NO_REMAP
| ^~~~~~~~~~
<command-line>: note: this is the location of the previous definition
In file included from /home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:22,
from RBGL.hpp:17:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/mpl/assert.hpp:194:21: warning: unnecessary parentheses in declaration of ‘assert_arg’ [-Wparentheses]
194 | failed ************ (Pred::************
| ^~~~~~~~~~~~~~~~~~~
195 | assert_arg( void (*)(Pred), typename assert_arg_pred<Pred>::type )
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
196 | );
| ~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/mpl/assert.hpp:194:21: note: remove parentheses
194 | failed ************ (Pred::************
| ^~~~~~~~~~~~~~~~~~~
| -
195 | assert_arg( void (*)(Pred), typename assert_arg_pred<Pred>::type )
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
196 | );
| ~
| -
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/mpl/assert.hpp:199:21: warning: unnecessary parentheses in declaration of ‘assert_not_arg’ [-Wparentheses]
199 | failed ************ (boost::mpl::not_<Pred>::************
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
200 | assert_not_arg( void (*)(Pred), typename assert_arg_pred_not<Pred>::type )
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
201 | );
| ~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/mpl/assert.hpp:199:21: note: remove parentheses
199 | failed ************ (boost::mpl::not_<Pred>::************
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
| -
200 | assert_not_arg( void (*)(Pred), typename assert_arg_pred_not<Pred>::type )
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
201 | );
| ~
| -
In file included from /home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/smart_ptr/shared_ptr.hpp:17,
from /home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/vector_property_map.hpp:14,
from /home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:598:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/smart_ptr/detail/shared_count.hpp:326:33: warning: ‘template<class> class std::auto_ptr’ is deprecated: use 'std::unique_ptr' instead [-Wdeprecated-declarations]
326 | explicit shared_count( std::auto_ptr<Y> & r ): pi_( new sp_counted_impl_p<Y>( r.get() ) )
| ^~~~~~~~
In file included from /opt/ohpc/pub/compiler/gcc/14.2.0/include/c++/14.2.0/memory:78,
from /home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/smart_ptr/detail/sp_counted_impl.hpp:35,
from /home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/smart_ptr/detail/shared_count.hpp:23:
/opt/ohpc/pub/compiler/gcc/14.2.0/include/c++/14.2.0/bits/unique_ptr.h:59:28: note: declared here
59 | template<typename> class auto_ptr;
| ^~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/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()
| ^~~~~~~~
/opt/ohpc/pub/compiler/gcc/14.2.0/include/c++/14.2.0/bits/unique_ptr.h:59:28: note: declared here
59 | template<typename> class auto_ptr;
| ^~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/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()
| ^~~~~~~~
/opt/ohpc/pub/compiler/gcc/14.2.0/include/c++/14.2.0/bits/unique_ptr.h:59:28: note: declared here
59 | template<typename> class auto_ptr;
| ^~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/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 )
| ^~~~~~~~
/opt/ohpc/pub/compiler/gcc/14.2.0/include/c++/14.2.0/bits/unique_ptr.h:59:28: note: declared here
59 | template<typename> class auto_ptr;
| ^~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/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 )
| ^~~~~~~~
/opt/ohpc/pub/compiler/gcc/14.2.0/include/c++/14.2.0/bits/unique_ptr.h:59:28: note: declared here
59 | template<typename> class auto_ptr;
| ^~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/smart_ptr/shared_ptr.hpp: In member function ‘boost::shared_ptr<T>& boost::shared_ptr<T>::operator=(std::auto_ptr<_Up>&&)’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/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 );
| ^~~~~~~~
/opt/ohpc/pub/compiler/gcc/14.2.0/include/c++/14.2.0/bits/unique_ptr.h:59:28: note: declared here
59 | template<typename> class auto_ptr;
| ^~~~~~~~
In file included from /home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/scoped_ptr.hpp:13,
from /home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/adjacency_list.hpp:22,
from RBGL.hpp:38:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/smart_ptr/scoped_ptr.hpp: At global scope:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/smart_ptr/scoped_ptr.hpp:75:31: warning: ‘template<class> class std::auto_ptr’ is deprecated: use 'std::unique_ptr' instead [-Wdeprecated-declarations]
75 | explicit scoped_ptr( std::auto_ptr<T> p ) noexcept : px( p.release() )
| ^~~~~~~~
/opt/ohpc/pub/compiler/gcc/14.2.0/include/c++/14.2.0/bits/unique_ptr.h:59:28: note: declared here
59 | template<typename> class auto_ptr;
| ^~~~~~~~
In file included from /home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/assert.hpp:35,
from /home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:19:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/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<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>*, std::vector<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:145:5: required from ‘struct boost::Assignable<__gnu_cxx::__normal_iterator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>*, std::vector<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator<__gnu_cxx::__normal_iterator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>*, std::vector<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >’
502 | BOOST_concept(InputIterator,(TT))
| ^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:540:3: required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>*, std::vector<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >’
540 | BOOST_concept(ForwardIterator,(TT))
| ^~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>*, std::vector<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >’
568 | BOOST_concept(BidirectionalIterator,(TT))
| ^~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>*, std::vector<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >’
597 | BOOST_concept(RandomAccessIterator,(TT))
| ^~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3: [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_<void (*)(boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>*, std::vector<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >)>’
72 | struct requirement_<void(*)(Model)>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map<RAIter, ID, Value, Value&> boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator<detail::edge_desc_impl<directed_tag, long unsigned int>*, std::vector<detail::edge_desc_impl<directed_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<directed_tag, long unsigned int> > > >; Value = detail::edge_desc_impl<directed_tag, long unsigned int>; ID = vec_adj_list_vertex_id_map<no_property, long unsigned int>]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/edmonds_karp_max_flow.hpp:209:43: required from ‘static typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::detail::edmonds_karp_dispatch1<boost::param_not_found>::apply(Graph&, typename boost::graph_traits<Graph>::vertex_descriptor, typename boost::graph_traits<Graph>::vertex_descriptor, const boost::bgl_named_params<T, Tag, Base>&, boost::param_not_found) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value<Graph, P, T, R>::type = double; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’
209 | make_iterator_property_map(pred_vec.begin(),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~
210 | choose_const_pmap(
| ~~~~~~~~~~~~~~~~~~
211 | get_param(params, vertex_index), g, vertex_index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
212 | pred_vec[0]),
| ~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/edmonds_karp_max_flow.hpp:228:57: required from ‘typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::edmonds_karp_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with Graph = adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value<Graph, P, T, R>::type = double; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
228 | return detail::edmonds_karp_dispatch1< Pred >::apply(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
229 | g, src, sink, params, get_param(params, vertex_predecessor));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/edmonds_karp_max_flow.hpp:240:33: required from ‘typename boost::property_traits<typename boost::property_map<Graph, boost::edge_capacity_t>::const_type>::value_type boost::edmonds_karp_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > > >; 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&, long unsigned int, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_capacity_t>; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
240 | return edmonds_karp_max_flow(g, src, sink, params);
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
mincut.cpp:76:45: required from here
76 | maxflow = edmonds_karp_max_flow(flow_g, s, t);
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
In file included from /home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:31,
from /home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:20:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/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<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>*, std::vector<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >]’
20 | ~usage_requirements() { ((Model*)0)->~Model(); }
| ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/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<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>*, std::vector<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable<__gnu_cxx::__normal_iterator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>*, std::vector<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator<__gnu_cxx::__normal_iterator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>*, std::vector<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >’
502 | BOOST_concept(InputIterator,(TT))
| ^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:540:3: required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>*, std::vector<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >’
540 | BOOST_concept(ForwardIterator,(TT))
| ^~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>*, std::vector<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >’
568 | BOOST_concept(BidirectionalIterator,(TT))
| ^~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>*, std::vector<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >’
597 | BOOST_concept(RandomAccessIterator,(TT))
| ^~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3: [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_<void (*)(boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>*, std::vector<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >)>’
72 | struct requirement_<void(*)(Model)>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map<RAIter, ID, Value, Value&> boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator<detail::edge_desc_impl<directed_tag, long unsigned int>*, std::vector<detail::edge_desc_impl<directed_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<directed_tag, long unsigned int> > > >; Value = detail::edge_desc_impl<directed_tag, long unsigned int>; ID = vec_adj_list_vertex_id_map<no_property, long unsigned int>]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/edmonds_karp_max_flow.hpp:209:43: required from ‘static typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::detail::edmonds_karp_dispatch1<boost::param_not_found>::apply(Graph&, typename boost::graph_traits<Graph>::vertex_descriptor, typename boost::graph_traits<Graph>::vertex_descriptor, const boost::bgl_named_params<T, Tag, Base>&, boost::param_not_found) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value<Graph, P, T, R>::type = double; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’
209 | make_iterator_property_map(pred_vec.begin(),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~
210 | choose_const_pmap(
| ~~~~~~~~~~~~~~~~~~
211 | get_param(params, vertex_index), g, vertex_index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
212 | pred_vec[0]),
| ~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/edmonds_karp_max_flow.hpp:228:57: required from ‘typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::edmonds_karp_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with Graph = adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value<Graph, P, T, R>::type = double; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
228 | return detail::edmonds_karp_dispatch1< Pred >::apply(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
229 | g, src, sink, params, get_param(params, vertex_predecessor));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/edmonds_karp_max_flow.hpp:240:33: required from ‘typename boost::property_traits<typename boost::property_map<Graph, boost::edge_capacity_t>::const_type>::value_type boost::edmonds_karp_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > > >; 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&, long unsigned int, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_capacity_t>; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
240 | return edmonds_karp_max_flow(g, src, sink, params);
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
mincut.cpp:76:45: required from here
76 | maxflow = edmonds_karp_max_flow(flow_g, s, t);
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/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<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>*, std::vector<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >]’
20 | ~usage_requirements() { ((Model*)0)->~Model(); }
| ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/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<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>*, std::vector<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:512:7: required from ‘struct boost::InputIterator<__gnu_cxx::__normal_iterator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>*, std::vector<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:540:3: required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>*, std::vector<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >’
540 | BOOST_concept(ForwardIterator,(TT))
| ^~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>*, std::vector<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >’
568 | BOOST_concept(BidirectionalIterator,(TT))
| ^~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>*, std::vector<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >’
597 | BOOST_concept(RandomAccessIterator,(TT))
| ^~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>*, std::vector<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >’
597 | BOOST_concept(RandomAccessIterator,(TT))
| ^~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_<void (*)(boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>*, std::vector<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >)>’
72 | struct requirement_<void(*)(Model)>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map<RAIter, ID, Value, Value&> boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator<detail::edge_desc_impl<directed_tag, long unsigned int>*, std::vector<detail::edge_desc_impl<directed_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<directed_tag, long unsigned int> > > >; Value = detail::edge_desc_impl<directed_tag, long unsigned int>; ID = vec_adj_list_vertex_id_map<no_property, long unsigned int>]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/edmonds_karp_max_flow.hpp:209:43: required from ‘static typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::detail::edmonds_karp_dispatch1<boost::param_not_found>::apply(Graph&, typename boost::graph_traits<Graph>::vertex_descriptor, typename boost::graph_traits<Graph>::vertex_descriptor, const boost::bgl_named_params<T, Tag, Base>&, boost::param_not_found) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value<Graph, P, T, R>::type = double; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’
209 | make_iterator_property_map(pred_vec.begin(),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~
210 | choose_const_pmap(
| ~~~~~~~~~~~~~~~~~~
211 | get_param(params, vertex_index), g, vertex_index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
212 | pred_vec[0]),
| ~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/edmonds_karp_max_flow.hpp:228:57: required from ‘typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::edmonds_karp_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with Graph = adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value<Graph, P, T, R>::type = double; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
228 | return detail::edmonds_karp_dispatch1< Pred >::apply(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
229 | g, src, sink, params, get_param(params, vertex_predecessor));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/edmonds_karp_max_flow.hpp:240:33: required from ‘typename boost::property_traits<typename boost::property_map<Graph, boost::edge_capacity_t>::const_type>::value_type boost::edmonds_karp_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > > >; 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&, long unsigned int, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_capacity_t>; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
240 | return edmonds_karp_max_flow(g, src, sink, params);
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
mincut.cpp:76:45: required from here
76 | maxflow = edmonds_karp_max_flow(flow_g, s, t);
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/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<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>*, std::vector<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >]’
20 | ~usage_requirements() { ((Model*)0)->~Model(); }
| ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/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<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>*, std::vector<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:543:7: required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>*, std::vector<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>*, std::vector<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >’
568 | BOOST_concept(BidirectionalIterator,(TT))
| ^~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>*, std::vector<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >’
597 | BOOST_concept(RandomAccessIterator,(TT))
| ^~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>*, std::vector<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >’
597 | BOOST_concept(RandomAccessIterator,(TT))
| ^~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>*, std::vector<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >]’
32 | inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
| ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_<void (*)(boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>*, std::vector<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >)>’
72 | struct requirement_<void(*)(Model)>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map<RAIter, ID, Value, Value&> boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator<detail::edge_desc_impl<directed_tag, long unsigned int>*, std::vector<detail::edge_desc_impl<directed_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<directed_tag, long unsigned int> > > >; Value = detail::edge_desc_impl<directed_tag, long unsigned int>; ID = vec_adj_list_vertex_id_map<no_property, long unsigned int>]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/edmonds_karp_max_flow.hpp:209:43: required from ‘static typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::detail::edmonds_karp_dispatch1<boost::param_not_found>::apply(Graph&, typename boost::graph_traits<Graph>::vertex_descriptor, typename boost::graph_traits<Graph>::vertex_descriptor, const boost::bgl_named_params<T, Tag, Base>&, boost::param_not_found) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value<Graph, P, T, R>::type = double; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’
209 | make_iterator_property_map(pred_vec.begin(),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~
210 | choose_const_pmap(
| ~~~~~~~~~~~~~~~~~~
211 | get_param(params, vertex_index), g, vertex_index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
212 | pred_vec[0]),
| ~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/edmonds_karp_max_flow.hpp:228:57: required from ‘typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::edmonds_karp_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with Graph = adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value<Graph, P, T, R>::type = double; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
228 | return detail::edmonds_karp_dispatch1< Pred >::apply(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
229 | g, src, sink, params, get_param(params, vertex_predecessor));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/edmonds_karp_max_flow.hpp:240:33: required from ‘typename boost::property_traits<typename boost::property_map<Graph, boost::edge_capacity_t>::const_type>::value_type boost::edmonds_karp_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > > >; 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&, long unsigned int, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_capacity_t>; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
240 | return edmonds_karp_max_flow(g, src, sink, params);
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
mincut.cpp:76:45: required from here
76 | maxflow = edmonds_karp_max_flow(flow_g, s, t);
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/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<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>*, std::vector<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >]’
20 | ~usage_requirements() { ((Model*)0)->~Model(); }
| ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/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<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>*, std::vector<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:571:7: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>*, std::vector<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>*, std::vector<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >’
597 | BOOST_concept(RandomAccessIterator,(TT))
| ^~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>*, std::vector<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >’
597 | BOOST_concept(RandomAccessIterator,(TT))
| ^~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>*, std::vector<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >]’
32 | inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
| ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_<void (*)(boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>*, std::vector<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >)>’
72 | struct requirement_<void(*)(Model)>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map<RAIter, ID, Value, Value&> boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator<detail::edge_desc_impl<directed_tag, long unsigned int>*, std::vector<detail::edge_desc_impl<directed_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<directed_tag, long unsigned int> > > >; Value = detail::edge_desc_impl<directed_tag, long unsigned int>; ID = vec_adj_list_vertex_id_map<no_property, long unsigned int>]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/edmonds_karp_max_flow.hpp:209:43: required from ‘static typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::detail::edmonds_karp_dispatch1<boost::param_not_found>::apply(Graph&, typename boost::graph_traits<Graph>::vertex_descriptor, typename boost::graph_traits<Graph>::vertex_descriptor, const boost::bgl_named_params<T, Tag, Base>&, boost::param_not_found) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value<Graph, P, T, R>::type = double; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’
209 | make_iterator_property_map(pred_vec.begin(),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~
210 | choose_const_pmap(
| ~~~~~~~~~~~~~~~~~~
211 | get_param(params, vertex_index), g, vertex_index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
212 | pred_vec[0]),
| ~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/edmonds_karp_max_flow.hpp:228:57: required from ‘typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::edmonds_karp_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with Graph = adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value<Graph, P, T, R>::type = double; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
228 | return detail::edmonds_karp_dispatch1< Pred >::apply(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
229 | g, src, sink, params, get_param(params, vertex_predecessor));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/edmonds_karp_max_flow.hpp:240:33: required from ‘typename boost::property_traits<typename boost::property_map<Graph, boost::edge_capacity_t>::const_type>::value_type boost::edmonds_karp_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > > >; 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&, long unsigned int, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_capacity_t>; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
240 | return edmonds_karp_max_flow(g, src, sink, params);
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
mincut.cpp:76:45: required from here
76 | maxflow = edmonds_karp_max_flow(flow_g, s, t);
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/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<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>*, std::vector<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >]’
20 | ~usage_requirements() { ((Model*)0)->~Model(); }
| ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/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<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>*, std::vector<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:253:5: required from ‘struct boost::Comparable<__gnu_cxx::__normal_iterator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>*, std::vector<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>*, std::vector<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >’
597 | BOOST_concept(RandomAccessIterator,(TT))
| ^~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>*, std::vector<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >’
597 | BOOST_concept(RandomAccessIterator,(TT))
| ^~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>*, std::vector<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >]’
32 | inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
| ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_<void (*)(boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>*, std::vector<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >)>’
72 | struct requirement_<void(*)(Model)>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map<RAIter, ID, Value, Value&> boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator<detail::edge_desc_impl<directed_tag, long unsigned int>*, std::vector<detail::edge_desc_impl<directed_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<directed_tag, long unsigned int> > > >; Value = detail::edge_desc_impl<directed_tag, long unsigned int>; ID = vec_adj_list_vertex_id_map<no_property, long unsigned int>]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/edmonds_karp_max_flow.hpp:209:43: required from ‘static typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::detail::edmonds_karp_dispatch1<boost::param_not_found>::apply(Graph&, typename boost::graph_traits<Graph>::vertex_descriptor, typename boost::graph_traits<Graph>::vertex_descriptor, const boost::bgl_named_params<T, Tag, Base>&, boost::param_not_found) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value<Graph, P, T, R>::type = double; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’
209 | make_iterator_property_map(pred_vec.begin(),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~
210 | choose_const_pmap(
| ~~~~~~~~~~~~~~~~~~
211 | get_param(params, vertex_index), g, vertex_index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
212 | pred_vec[0]),
| ~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/edmonds_karp_max_flow.hpp:228:57: required from ‘typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::edmonds_karp_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with Graph = adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value<Graph, P, T, R>::type = double; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
228 | return detail::edmonds_karp_dispatch1< Pred >::apply(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
229 | g, src, sink, params, get_param(params, vertex_predecessor));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/edmonds_karp_max_flow.hpp:240:33: required from ‘typename boost::property_traits<typename boost::property_map<Graph, boost::edge_capacity_t>::const_type>::value_type boost::edmonds_karp_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > > >; 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&, long unsigned int, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_capacity_t>; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
240 | return edmonds_karp_max_flow(g, src, sink, params);
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
mincut.cpp:76:45: required from here
76 | maxflow = edmonds_karp_max_flow(flow_g, s, t);
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/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<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>*, std::vector<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >]’
20 | ~usage_requirements() { ((Model*)0)->~Model(); }
| ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/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<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>*, std::vector<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:601:7: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>*, std::vector<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>*, std::vector<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >’
597 | BOOST_concept(RandomAccessIterator,(TT))
| ^~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>*, std::vector<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >]’
32 | inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
| ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied<boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>*, std::vector<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > > >::value’
44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied<boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>*, std::vector<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > > >’
45 | typedef boost::integral_constant<bool, value> type;
| ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_<void (*)(boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>*, std::vector<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >)>’
72 | struct requirement_<void(*)(Model)>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map<RAIter, ID, Value, Value&> boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator<detail::edge_desc_impl<directed_tag, long unsigned int>*, std::vector<detail::edge_desc_impl<directed_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<directed_tag, long unsigned int> > > >; Value = detail::edge_desc_impl<directed_tag, long unsigned int>; ID = vec_adj_list_vertex_id_map<no_property, long unsigned int>]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/edmonds_karp_max_flow.hpp:209:43: required from ‘static typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::detail::edmonds_karp_dispatch1<boost::param_not_found>::apply(Graph&, typename boost::graph_traits<Graph>::vertex_descriptor, typename boost::graph_traits<Graph>::vertex_descriptor, const boost::bgl_named_params<T, Tag, Base>&, boost::param_not_found) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value<Graph, P, T, R>::type = double; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’
209 | make_iterator_property_map(pred_vec.begin(),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~
210 | choose_const_pmap(
| ~~~~~~~~~~~~~~~~~~
211 | get_param(params, vertex_index), g, vertex_index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
212 | pred_vec[0]),
| ~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/edmonds_karp_max_flow.hpp:228:57: required from ‘typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::edmonds_karp_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with Graph = adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value<Graph, P, T, R>::type = double; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
228 | return detail::edmonds_karp_dispatch1< Pred >::apply(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
229 | g, src, sink, params, get_param(params, vertex_predecessor));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/edmonds_karp_max_flow.hpp:240:33: required from ‘typename boost::property_traits<typename boost::property_map<Graph, boost::edge_capacity_t>::const_type>::value_type boost::edmonds_karp_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > > >; 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&, long unsigned int, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_capacity_t>; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
240 | return edmonds_karp_max_flow(g, src, sink, params);
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
mincut.cpp:76:45: required from here
76 | maxflow = edmonds_karp_max_flow(flow_g, s, t);
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/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<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>*, std::vector<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >]’
20 | ~usage_requirements() { ((Model*)0)->~Model(); }
| ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/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<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>*, std::vector<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map<RAIter, ID, Value, Value&> boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator<detail::edge_desc_impl<directed_tag, long unsigned int>*, std::vector<detail::edge_desc_impl<directed_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<directed_tag, long unsigned int> > > >; Value = detail::edge_desc_impl<directed_tag, long unsigned int>; ID = vec_adj_list_vertex_id_map<no_property, long unsigned int>]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/edmonds_karp_max_flow.hpp:209:43: required from ‘static typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::detail::edmonds_karp_dispatch1<boost::param_not_found>::apply(Graph&, typename boost::graph_traits<Graph>::vertex_descriptor, typename boost::graph_traits<Graph>::vertex_descriptor, const boost::bgl_named_params<T, Tag, Base>&, boost::param_not_found) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value<Graph, P, T, R>::type = double; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’
209 | make_iterator_property_map(pred_vec.begin(),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~
210 | choose_const_pmap(
| ~~~~~~~~~~~~~~~~~~
211 | get_param(params, vertex_index), g, vertex_index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
212 | pred_vec[0]),
| ~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/edmonds_karp_max_flow.hpp:228:57: required from ‘typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::edmonds_karp_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with Graph = adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value<Graph, P, T, R>::type = double; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
228 | return detail::edmonds_karp_dispatch1< Pred >::apply(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
229 | g, src, sink, params, get_param(params, vertex_predecessor));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/edmonds_karp_max_flow.hpp:240:33: required from ‘typename boost::property_traits<typename boost::property_map<Graph, boost::edge_capacity_t>::const_type>::value_type boost::edmonds_karp_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > > >; 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&, long unsigned int, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_capacity_t>; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
240 | return edmonds_karp_max_flow(g, src, sink, params);
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
mincut.cpp:76:45: required from here
76 | maxflow = edmonds_karp_max_flow(flow_g, s, t);
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
In file included from /home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/preprocessor/repetition/enum_binary_params.hpp:15,
from /home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/utility/base_from_member.hpp:15,
from /home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/utility.hpp:15,
from RBGL.hpp:16:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:17: note: in a call to non-static member function ‘boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>*, std::vector<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >::~RandomAccessIteratorConcept()’
597 | BOOST_concept(RandomAccessIterator,(TT))
| ^~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/preprocessor/cat.hpp:29:34: note: in definition of macro ‘BOOST_PP_CAT_I’
29 | # define BOOST_PP_CAT_I(a, b) a ## b
| ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/concept_def.hpp:23:12: note: in expansion of macro ‘BOOST_PP_CAT’
23 | struct BOOST_PP_CAT(name,Concept) \
| ^~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3: note: in expansion of macro ‘BOOST_concept’
597 | BOOST_concept(RandomAccessIterator,(TT))
| ^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Assignable<__gnu_cxx::__normal_iterator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>*, std::vector<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/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<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>*, std::vector<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > > >]’
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:145:5: required from ‘struct boost::Assignable<__gnu_cxx::__normal_iterator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>*, std::vector<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator<__gnu_cxx::__normal_iterator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>*, std::vector<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >’
502 | BOOST_concept(InputIterator,(TT))
| ^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:540:3: required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>*, std::vector<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >’
540 | BOOST_concept(ForwardIterator,(TT))
| ^~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>*, std::vector<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >’
568 | BOOST_concept(BidirectionalIterator,(TT))
| ^~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3: [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_<void (*)(boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>*, std::vector<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >)>’
72 | struct requirement_<void(*)(Model)>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map<RAIter, ID, Value, Value&> boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator<detail::edge_desc_impl<directed_tag, long unsigned int>*, std::vector<detail::edge_desc_impl<directed_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<directed_tag, long unsigned int> > > >; Value = detail::edge_desc_impl<directed_tag, long unsigned int>; ID = vec_adj_list_vertex_id_map<no_property, long unsigned int>]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/edmonds_karp_max_flow.hpp:209:43: required from ‘static typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::detail::edmonds_karp_dispatch1<boost::param_not_found>::apply(Graph&, typename boost::graph_traits<Graph>::vertex_descriptor, typename boost::graph_traits<Graph>::vertex_descriptor, const boost::bgl_named_params<T, Tag, Base>&, boost::param_not_found) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value<Graph, P, T, R>::type = double; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’
209 | make_iterator_property_map(pred_vec.begin(),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~
210 | choose_const_pmap(
| ~~~~~~~~~~~~~~~~~~
211 | get_param(params, vertex_index), g, vertex_index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
212 | pred_vec[0]),
| ~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/edmonds_karp_max_flow.hpp:228:57: required from ‘typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::edmonds_karp_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with Graph = adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value<Graph, P, T, R>::type = double; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
228 | return detail::edmonds_karp_dispatch1< Pred >::apply(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
229 | g, src, sink, params, get_param(params, vertex_predecessor));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/edmonds_karp_max_flow.hpp:240:33: required from ‘typename boost::property_traits<typename boost::property_map<Graph, boost::edge_capacity_t>::const_type>::value_type boost::edmonds_karp_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > > >; 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&, long unsigned int, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_capacity_t>; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
240 | return edmonds_karp_max_flow(g, src, sink, params);
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
mincut.cpp:76:45: required from here
76 | maxflow = edmonds_karp_max_flow(flow_g, s, t);
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
20 | ~usage_requirements() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/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<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>*, std::vector<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >]’
37 | ~model()
| ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:145:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
145 | BOOST_CONCEPT_USAGE(Assignable) {
| ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::EqualityComparable<__gnu_cxx::__normal_iterator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>*, std::vector<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/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<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>*, std::vector<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > > >]’
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable<__gnu_cxx::__normal_iterator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>*, std::vector<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator<__gnu_cxx::__normal_iterator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>*, std::vector<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >’
502 | BOOST_concept(InputIterator,(TT))
| ^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:540:3: required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>*, std::vector<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >’
540 | BOOST_concept(ForwardIterator,(TT))
| ^~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>*, std::vector<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >’
568 | BOOST_concept(BidirectionalIterator,(TT))
| ^~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3: [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_<void (*)(boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>*, std::vector<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >)>’
72 | struct requirement_<void(*)(Model)>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map<RAIter, ID, Value, Value&> boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator<detail::edge_desc_impl<directed_tag, long unsigned int>*, std::vector<detail::edge_desc_impl<directed_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<directed_tag, long unsigned int> > > >; Value = detail::edge_desc_impl<directed_tag, long unsigned int>; ID = vec_adj_list_vertex_id_map<no_property, long unsigned int>]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/edmonds_karp_max_flow.hpp:209:43: required from ‘static typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::detail::edmonds_karp_dispatch1<boost::param_not_found>::apply(Graph&, typename boost::graph_traits<Graph>::vertex_descriptor, typename boost::graph_traits<Graph>::vertex_descriptor, const boost::bgl_named_params<T, Tag, Base>&, boost::param_not_found) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value<Graph, P, T, R>::type = double; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’
209 | make_iterator_property_map(pred_vec.begin(),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~
210 | choose_const_pmap(
| ~~~~~~~~~~~~~~~~~~
211 | get_param(params, vertex_index), g, vertex_index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
212 | pred_vec[0]),
| ~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/edmonds_karp_max_flow.hpp:228:57: required from ‘typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::edmonds_karp_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with Graph = adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value<Graph, P, T, R>::type = double; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
228 | return detail::edmonds_karp_dispatch1< Pred >::apply(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
229 | g, src, sink, params, get_param(params, vertex_predecessor));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/edmonds_karp_max_flow.hpp:240:33: required from ‘typename boost::property_traits<typename boost::property_map<Graph, boost::edge_capacity_t>::const_type>::value_type boost::edmonds_karp_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > > >; 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&, long unsigned int, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_capacity_t>; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
240 | return edmonds_karp_max_flow(g, src, sink, params);
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
mincut.cpp:76:45: required from here
76 | maxflow = edmonds_karp_max_flow(flow_g, s, t);
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
20 | ~usage_requirements() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/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<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>*, std::vector<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >]’
37 | ~model()
| ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:233:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
233 | BOOST_CONCEPT_USAGE(EqualityComparable) {
| ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::InputIterator<__gnu_cxx::__normal_iterator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>*, std::vector<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/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<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>*, std::vector<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > > >]’
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:512:7: required from ‘struct boost::InputIterator<__gnu_cxx::__normal_iterator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>*, std::vector<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:540:3: required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>*, std::vector<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >’
540 | BOOST_concept(ForwardIterator,(TT))
| ^~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>*, std::vector<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >’
568 | BOOST_concept(BidirectionalIterator,(TT))
| ^~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>*, std::vector<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >’
597 | BOOST_concept(RandomAccessIterator,(TT))
| ^~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3: [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_<void (*)(boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>*, std::vector<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >)>’
72 | struct requirement_<void(*)(Model)>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map<RAIter, ID, Value, Value&> boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator<detail::edge_desc_impl<directed_tag, long unsigned int>*, std::vector<detail::edge_desc_impl<directed_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<directed_tag, long unsigned int> > > >; Value = detail::edge_desc_impl<directed_tag, long unsigned int>; ID = vec_adj_list_vertex_id_map<no_property, long unsigned int>]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/edmonds_karp_max_flow.hpp:209:43: required from ‘static typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::detail::edmonds_karp_dispatch1<boost::param_not_found>::apply(Graph&, typename boost::graph_traits<Graph>::vertex_descriptor, typename boost::graph_traits<Graph>::vertex_descriptor, const boost::bgl_named_params<T, Tag, Base>&, boost::param_not_found) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value<Graph, P, T, R>::type = double; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’
209 | make_iterator_property_map(pred_vec.begin(),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~
210 | choose_const_pmap(
| ~~~~~~~~~~~~~~~~~~
211 | get_param(params, vertex_index), g, vertex_index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
212 | pred_vec[0]),
| ~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/edmonds_karp_max_flow.hpp:228:57: required from ‘typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::edmonds_karp_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with Graph = adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value<Graph, P, T, R>::type = double; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
228 | return detail::edmonds_karp_dispatch1< Pred >::apply(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
229 | g, src, sink, params, get_param(params, vertex_predecessor));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/edmonds_karp_max_flow.hpp:240:33: required from ‘typename boost::property_traits<typename boost::property_map<Graph, boost::edge_capacity_t>::const_type>::value_type boost::edmonds_karp_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > > >; 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&, long unsigned int, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_capacity_t>; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
240 | return edmonds_karp_max_flow(g, src, sink, params);
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
mincut.cpp:76:45: required from here
76 | maxflow = edmonds_karp_max_flow(flow_g, s, t);
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
20 | ~usage_requirements() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/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<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>*, std::vector<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >]’
37 | ~model()
| ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:512:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
512 | BOOST_CONCEPT_USAGE(InputIterator)
| ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::ForwardIterator<__gnu_cxx::__normal_iterator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>*, std::vector<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/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<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>*, std::vector<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > > >]’
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:543:7: required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>*, std::vector<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>*, std::vector<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >’
568 | BOOST_concept(BidirectionalIterator,(TT))
| ^~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>*, std::vector<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >’
597 | BOOST_concept(RandomAccessIterator,(TT))
| ^~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>*, std::vector<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >’
597 | BOOST_concept(RandomAccessIterator,(TT))
| ^~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_<void (*)(boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>*, std::vector<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >)>’
72 | struct requirement_<void(*)(Model)>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map<RAIter, ID, Value, Value&> boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator<detail::edge_desc_impl<directed_tag, long unsigned int>*, std::vector<detail::edge_desc_impl<directed_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<directed_tag, long unsigned int> > > >; Value = detail::edge_desc_impl<directed_tag, long unsigned int>; ID = vec_adj_list_vertex_id_map<no_property, long unsigned int>]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/edmonds_karp_max_flow.hpp:209:43: required from ‘static typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::detail::edmonds_karp_dispatch1<boost::param_not_found>::apply(Graph&, typename boost::graph_traits<Graph>::vertex_descriptor, typename boost::graph_traits<Graph>::vertex_descriptor, const boost::bgl_named_params<T, Tag, Base>&, boost::param_not_found) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value<Graph, P, T, R>::type = double; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’
209 | make_iterator_property_map(pred_vec.begin(),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~
210 | choose_const_pmap(
| ~~~~~~~~~~~~~~~~~~
211 | get_param(params, vertex_index), g, vertex_index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
212 | pred_vec[0]),
| ~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/edmonds_karp_max_flow.hpp:228:57: required from ‘typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::edmonds_karp_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with Graph = adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value<Graph, P, T, R>::type = double; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
228 | return detail::edmonds_karp_dispatch1< Pred >::apply(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
229 | g, src, sink, params, get_param(params, vertex_predecessor));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/edmonds_karp_max_flow.hpp:240:33: required from ‘typename boost::property_traits<typename boost::property_map<Graph, boost::edge_capacity_t>::const_type>::value_type boost::edmonds_karp_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > > >; 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&, long unsigned int, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_capacity_t>; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
240 | return edmonds_karp_max_flow(g, src, sink, params);
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
mincut.cpp:76:45: required from here
76 | maxflow = edmonds_karp_max_flow(flow_g, s, t);
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
20 | ~usage_requirements() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/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<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>*, std::vector<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >]’
37 | ~model()
| ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:543:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
543 | BOOST_CONCEPT_USAGE(ForwardIterator)
| ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::BidirectionalIterator<__gnu_cxx::__normal_iterator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>*, std::vector<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/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<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>*, std::vector<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > > >]’
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:571:7: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>*, std::vector<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>*, std::vector<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >’
597 | BOOST_concept(RandomAccessIterator,(TT))
| ^~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>*, std::vector<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >’
597 | BOOST_concept(RandomAccessIterator,(TT))
| ^~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>*, std::vector<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >]’
32 | inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
| ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_<void (*)(boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>*, std::vector<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >)>’
72 | struct requirement_<void(*)(Model)>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map<RAIter, ID, Value, Value&> boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator<detail::edge_desc_impl<directed_tag, long unsigned int>*, std::vector<detail::edge_desc_impl<directed_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<directed_tag, long unsigned int> > > >; Value = detail::edge_desc_impl<directed_tag, long unsigned int>; ID = vec_adj_list_vertex_id_map<no_property, long unsigned int>]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/edmonds_karp_max_flow.hpp:209:43: required from ‘static typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::detail::edmonds_karp_dispatch1<boost::param_not_found>::apply(Graph&, typename boost::graph_traits<Graph>::vertex_descriptor, typename boost::graph_traits<Graph>::vertex_descriptor, const boost::bgl_named_params<T, Tag, Base>&, boost::param_not_found) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value<Graph, P, T, R>::type = double; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’
209 | make_iterator_property_map(pred_vec.begin(),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~
210 | choose_const_pmap(
| ~~~~~~~~~~~~~~~~~~
211 | get_param(params, vertex_index), g, vertex_index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
212 | pred_vec[0]),
| ~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/edmonds_karp_max_flow.hpp:228:57: required from ‘typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::edmonds_karp_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with Graph = adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value<Graph, P, T, R>::type = double; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
228 | return detail::edmonds_karp_dispatch1< Pred >::apply(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
229 | g, src, sink, params, get_param(params, vertex_predecessor));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/edmonds_karp_max_flow.hpp:240:33: required from ‘typename boost::property_traits<typename boost::property_map<Graph, boost::edge_capacity_t>::const_type>::value_type boost::edmonds_karp_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > > >; 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&, long unsigned int, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_capacity_t>; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
240 | return edmonds_karp_max_flow(g, src, sink, params);
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
mincut.cpp:76:45: required from here
76 | maxflow = edmonds_karp_max_flow(flow_g, s, t);
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
20 | ~usage_requirements() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/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<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>*, std::vector<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >]’
37 | ~model()
| ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:571:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
571 | BOOST_CONCEPT_USAGE(BidirectionalIterator)
| ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Comparable<__gnu_cxx::__normal_iterator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>*, std::vector<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/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<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>*, std::vector<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > > >]’
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:253:5: required from ‘struct boost::Comparable<__gnu_cxx::__normal_iterator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>*, std::vector<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>*, std::vector<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >’
597 | BOOST_concept(RandomAccessIterator,(TT))
| ^~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>*, std::vector<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >’
597 | BOOST_concept(RandomAccessIterator,(TT))
| ^~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>*, std::vector<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >]’
32 | inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
| ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_<void (*)(boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>*, std::vector<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >)>’
72 | struct requirement_<void(*)(Model)>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map<RAIter, ID, Value, Value&> boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator<detail::edge_desc_impl<directed_tag, long unsigned int>*, std::vector<detail::edge_desc_impl<directed_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<directed_tag, long unsigned int> > > >; Value = detail::edge_desc_impl<directed_tag, long unsigned int>; ID = vec_adj_list_vertex_id_map<no_property, long unsigned int>]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/edmonds_karp_max_flow.hpp:209:43: required from ‘static typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::detail::edmonds_karp_dispatch1<boost::param_not_found>::apply(Graph&, typename boost::graph_traits<Graph>::vertex_descriptor, typename boost::graph_traits<Graph>::vertex_descriptor, const boost::bgl_named_params<T, Tag, Base>&, boost::param_not_found) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value<Graph, P, T, R>::type = double; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’
209 | make_iterator_property_map(pred_vec.begin(),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~
210 | choose_const_pmap(
| ~~~~~~~~~~~~~~~~~~
211 | get_param(params, vertex_index), g, vertex_index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
212 | pred_vec[0]),
| ~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/edmonds_karp_max_flow.hpp:228:57: required from ‘typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::edmonds_karp_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with Graph = adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value<Graph, P, T, R>::type = double; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
228 | return detail::edmonds_karp_dispatch1< Pred >::apply(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
229 | g, src, sink, params, get_param(params, vertex_predecessor));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/edmonds_karp_max_flow.hpp:240:33: required from ‘typename boost::property_traits<typename boost::property_map<Graph, boost::edge_capacity_t>::const_type>::value_type boost::edmonds_karp_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > > >; 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&, long unsigned int, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_capacity_t>; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
240 | return edmonds_karp_max_flow(g, src, sink, params);
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
mincut.cpp:76:45: required from here
76 | maxflow = edmonds_karp_max_flow(flow_g, s, t);
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
20 | ~usage_requirements() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/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<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>*, std::vector<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >]’
37 | ~model()
| ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:253:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
253 | BOOST_CONCEPT_USAGE(Comparable) {
| ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::RandomAccessIterator<__gnu_cxx::__normal_iterator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>*, std::vector<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/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<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>*, std::vector<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > > >]’
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:601:7: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>*, std::vector<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>*, std::vector<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >’
597 | BOOST_concept(RandomAccessIterator,(TT))
| ^~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>*, std::vector<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >]’
32 | inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
| ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_<void (*)(boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>*, std::vector<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >)>’
72 | struct requirement_<void(*)(Model)>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map<RAIter, ID, Value, Value&> boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator<detail::edge_desc_impl<directed_tag, long unsigned int>*, std::vector<detail::edge_desc_impl<directed_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<directed_tag, long unsigned int> > > >; Value = detail::edge_desc_impl<directed_tag, long unsigned int>; ID = vec_adj_list_vertex_id_map<no_property, long unsigned int>]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/edmonds_karp_max_flow.hpp:209:43: required from ‘static typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::detail::edmonds_karp_dispatch1<boost::param_not_found>::apply(Graph&, typename boost::graph_traits<Graph>::vertex_descriptor, typename boost::graph_traits<Graph>::vertex_descriptor, const boost::bgl_named_params<T, Tag, Base>&, boost::param_not_found) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value<Graph, P, T, R>::type = double; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’
209 | make_iterator_property_map(pred_vec.begin(),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~
210 | choose_const_pmap(
| ~~~~~~~~~~~~~~~~~~
211 | get_param(params, vertex_index), g, vertex_index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
212 | pred_vec[0]),
| ~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/edmonds_karp_max_flow.hpp:228:57: required from ‘typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::edmonds_karp_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with Graph = adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value<Graph, P, T, R>::type = double; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
228 | return detail::edmonds_karp_dispatch1< Pred >::apply(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
229 | g, src, sink, params, get_param(params, vertex_predecessor));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/edmonds_karp_max_flow.hpp:240:33: required from ‘typename boost::property_traits<typename boost::property_map<Graph, boost::edge_capacity_t>::const_type>::value_type boost::edmonds_karp_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > > >; 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&, long unsigned int, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_capacity_t>; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
240 | return edmonds_karp_max_flow(g, src, sink, params);
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
mincut.cpp:76:45: required from here
76 | maxflow = edmonds_karp_max_flow(flow_g, s, t);
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
20 | ~usage_requirements() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/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<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>*, std::vector<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >]’
37 | ~model()
| ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:601:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
601 | BOOST_CONCEPT_USAGE(RandomAccessIterator)
| ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/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<boost::default_color_type*, std::vector<boost::default_color_type> > > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:145:5: required from ‘struct boost::Assignable<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> > >’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> > >’
502 | BOOST_concept(InputIterator,(TT))
| ^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:540:3: required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> > >’
540 | BOOST_concept(ForwardIterator,(TT))
| ^~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> > >’
568 | BOOST_concept(BidirectionalIterator,(TT))
| ^~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> > >’
597 | BOOST_concept(RandomAccessIterator,(TT))
| ^~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3: [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map<RAIter, ID, Value, Value&> boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator<default_color_type*, std::vector<default_color_type> >; Value = default_color_type; ID = vec_adj_list_vertex_id_map<no_property, long unsigned int>]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/edmonds_karp_max_flow.hpp:161:43: required from ‘static typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::detail::edmonds_karp_dispatch2<boost::param_not_found>::apply(Graph&, typename boost::graph_traits<Graph>::vertex_descriptor, typename boost::graph_traits<Graph>::vertex_descriptor, PredMap, const boost::bgl_named_params<P, T, R>&, boost::param_not_found) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >; PredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>*, std::vector<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>&>; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value<Graph, P, T, R>::type = double; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’
161 | make_iterator_property_map(color_vec.begin(),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~
162 | choose_const_pmap(
| ~~~~~~~~~~~~~~~~~~
163 | get_param(params, vertex_index), g, vertex_index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
164 | color_vec[0]),
| ~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/edmonds_karp_max_flow.hpp:208:54: required from ‘static typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::detail::edmonds_karp_dispatch1<boost::param_not_found>::apply(Graph&, typename boost::graph_traits<Graph>::vertex_descriptor, typename boost::graph_traits<Graph>::vertex_descriptor, const boost::bgl_named_params<T, Tag, Base>&, boost::param_not_found) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value<Graph, P, T, R>::type = double; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’
208 | return edmonds_karp_dispatch2< C >::apply(g, src, sink,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
209 | make_iterator_property_map(pred_vec.begin(),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
210 | choose_const_pmap(
| ~~~~~~~~~~~~~~~~~~
211 | get_param(params, vertex_index), g, vertex_index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
212 | pred_vec[0]),
| ~~~~~~~~~~~~~
213 | params, get_param(params, vertex_color));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/edmonds_karp_max_flow.hpp:228:57: required from ‘typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::edmonds_karp_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with Graph = adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value<Graph, P, T, R>::type = double; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
228 | return detail::edmonds_karp_dispatch1< Pred >::apply(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
229 | g, src, sink, params, get_param(params, vertex_predecessor));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/edmonds_karp_max_flow.hpp:240:33: required from ‘typename boost::property_traits<typename boost::property_map<Graph, boost::edge_capacity_t>::const_type>::value_type boost::edmonds_karp_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > > >; 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&, long unsigned int, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_capacity_t>; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
240 | return edmonds_karp_max_flow(g, src, sink, params);
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
mincut.cpp:76:45: required from here
76 | maxflow = edmonds_karp_max_flow(flow_g, s, t);
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/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<boost::default_color_type*, std::vector<boost::default_color_type> > >]’
20 | ~usage_requirements() { ((Model*)0)->~Model(); }
| ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/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<boost::default_color_type*, std::vector<boost::default_color_type> > > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> > >’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> > >’
502 | BOOST_concept(InputIterator,(TT))
| ^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:540:3: required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> > >’
540 | BOOST_concept(ForwardIterator,(TT))
| ^~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> > >’
568 | BOOST_concept(BidirectionalIterator,(TT))
| ^~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> > >’
597 | BOOST_concept(RandomAccessIterator,(TT))
| ^~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3: [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map<RAIter, ID, Value, Value&> boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator<default_color_type*, std::vector<default_color_type> >; Value = default_color_type; ID = vec_adj_list_vertex_id_map<no_property, long unsigned int>]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/edmonds_karp_max_flow.hpp:161:43: required from ‘static typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::detail::edmonds_karp_dispatch2<boost::param_not_found>::apply(Graph&, typename boost::graph_traits<Graph>::vertex_descriptor, typename boost::graph_traits<Graph>::vertex_descriptor, PredMap, const boost::bgl_named_params<P, T, R>&, boost::param_not_found) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >; PredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>*, std::vector<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>&>; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value<Graph, P, T, R>::type = double; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’
161 | make_iterator_property_map(color_vec.begin(),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~
162 | choose_const_pmap(
| ~~~~~~~~~~~~~~~~~~
163 | get_param(params, vertex_index), g, vertex_index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
164 | color_vec[0]),
| ~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/edmonds_karp_max_flow.hpp:208:54: required from ‘static typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::detail::edmonds_karp_dispatch1<boost::param_not_found>::apply(Graph&, typename boost::graph_traits<Graph>::vertex_descriptor, typename boost::graph_traits<Graph>::vertex_descriptor, const boost::bgl_named_params<T, Tag, Base>&, boost::param_not_found) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value<Graph, P, T, R>::type = double; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’
208 | return edmonds_karp_dispatch2< C >::apply(g, src, sink,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
209 | make_iterator_property_map(pred_vec.begin(),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
210 | choose_const_pmap(
| ~~~~~~~~~~~~~~~~~~
211 | get_param(params, vertex_index), g, vertex_index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
212 | pred_vec[0]),
| ~~~~~~~~~~~~~
213 | params, get_param(params, vertex_color));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/edmonds_karp_max_flow.hpp:228:57: required from ‘typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::edmonds_karp_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with Graph = adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value<Graph, P, T, R>::type = double; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
228 | return detail::edmonds_karp_dispatch1< Pred >::apply(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
229 | g, src, sink, params, get_param(params, vertex_predecessor));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/edmonds_karp_max_flow.hpp:240:33: required from ‘typename boost::property_traits<typename boost::property_map<Graph, boost::edge_capacity_t>::const_type>::value_type boost::edmonds_karp_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > > >; 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&, long unsigned int, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_capacity_t>; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
240 | return edmonds_karp_max_flow(g, src, sink, params);
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
mincut.cpp:76:45: required from here
76 | maxflow = edmonds_karp_max_flow(flow_g, s, t);
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/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<boost::default_color_type*, std::vector<boost::default_color_type> > >]’
20 | ~usage_requirements() { ((Model*)0)->~Model(); }
| ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/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<boost::default_color_type*, std::vector<boost::default_color_type> > > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:512:7: required from ‘struct boost::InputIterator<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> > >’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:540:3: required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> > >’
540 | BOOST_concept(ForwardIterator,(TT))
| ^~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> > >’
568 | BOOST_concept(BidirectionalIterator,(TT))
| ^~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> > >’
597 | BOOST_concept(RandomAccessIterator,(TT))
| ^~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> > >’
597 | BOOST_concept(RandomAccessIterator,(TT))
| ^~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map<RAIter, ID, Value, Value&> boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator<default_color_type*, std::vector<default_color_type> >; Value = default_color_type; ID = vec_adj_list_vertex_id_map<no_property, long unsigned int>]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/edmonds_karp_max_flow.hpp:161:43: required from ‘static typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::detail::edmonds_karp_dispatch2<boost::param_not_found>::apply(Graph&, typename boost::graph_traits<Graph>::vertex_descriptor, typename boost::graph_traits<Graph>::vertex_descriptor, PredMap, const boost::bgl_named_params<P, T, R>&, boost::param_not_found) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >; PredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>*, std::vector<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>&>; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value<Graph, P, T, R>::type = double; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’
161 | make_iterator_property_map(color_vec.begin(),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~
162 | choose_const_pmap(
| ~~~~~~~~~~~~~~~~~~
163 | get_param(params, vertex_index), g, vertex_index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
164 | color_vec[0]),
| ~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/edmonds_karp_max_flow.hpp:208:54: required from ‘static typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::detail::edmonds_karp_dispatch1<boost::param_not_found>::apply(Graph&, typename boost::graph_traits<Graph>::vertex_descriptor, typename boost::graph_traits<Graph>::vertex_descriptor, const boost::bgl_named_params<T, Tag, Base>&, boost::param_not_found) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value<Graph, P, T, R>::type = double; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’
208 | return edmonds_karp_dispatch2< C >::apply(g, src, sink,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
209 | make_iterator_property_map(pred_vec.begin(),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
210 | choose_const_pmap(
| ~~~~~~~~~~~~~~~~~~
211 | get_param(params, vertex_index), g, vertex_index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
212 | pred_vec[0]),
| ~~~~~~~~~~~~~
213 | params, get_param(params, vertex_color));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/edmonds_karp_max_flow.hpp:228:57: required from ‘typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::edmonds_karp_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with Graph = adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value<Graph, P, T, R>::type = double; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
228 | return detail::edmonds_karp_dispatch1< Pred >::apply(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
229 | g, src, sink, params, get_param(params, vertex_predecessor));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/edmonds_karp_max_flow.hpp:240:33: required from ‘typename boost::property_traits<typename boost::property_map<Graph, boost::edge_capacity_t>::const_type>::value_type boost::edmonds_karp_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > > >; 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&, long unsigned int, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_capacity_t>; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
240 | return edmonds_karp_max_flow(g, src, sink, params);
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
mincut.cpp:76:45: required from here
76 | maxflow = edmonds_karp_max_flow(flow_g, s, t);
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/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<boost::default_color_type*, std::vector<boost::default_color_type> > >]’
20 | ~usage_requirements() { ((Model*)0)->~Model(); }
| ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/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<boost::default_color_type*, std::vector<boost::default_color_type> > > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:543:7: required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> > >’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> > >’
568 | BOOST_concept(BidirectionalIterator,(TT))
| ^~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> > >’
597 | BOOST_concept(RandomAccessIterator,(TT))
| ^~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> > >’
597 | BOOST_concept(RandomAccessIterator,(TT))
| ^~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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<boost::default_color_type*, std::vector<boost::default_color_type> > >]’
32 | inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
| ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map<RAIter, ID, Value, Value&> boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator<default_color_type*, std::vector<default_color_type> >; Value = default_color_type; ID = vec_adj_list_vertex_id_map<no_property, long unsigned int>]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/edmonds_karp_max_flow.hpp:161:43: required from ‘static typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::detail::edmonds_karp_dispatch2<boost::param_not_found>::apply(Graph&, typename boost::graph_traits<Graph>::vertex_descriptor, typename boost::graph_traits<Graph>::vertex_descriptor, PredMap, const boost::bgl_named_params<P, T, R>&, boost::param_not_found) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >; PredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>*, std::vector<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>&>; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value<Graph, P, T, R>::type = double; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’
161 | make_iterator_property_map(color_vec.begin(),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~
162 | choose_const_pmap(
| ~~~~~~~~~~~~~~~~~~
163 | get_param(params, vertex_index), g, vertex_index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
164 | color_vec[0]),
| ~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/edmonds_karp_max_flow.hpp:208:54: required from ‘static typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::detail::edmonds_karp_dispatch1<boost::param_not_found>::apply(Graph&, typename boost::graph_traits<Graph>::vertex_descriptor, typename boost::graph_traits<Graph>::vertex_descriptor, const boost::bgl_named_params<T, Tag, Base>&, boost::param_not_found) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value<Graph, P, T, R>::type = double; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’
208 | return edmonds_karp_dispatch2< C >::apply(g, src, sink,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
209 | make_iterator_property_map(pred_vec.begin(),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
210 | choose_const_pmap(
| ~~~~~~~~~~~~~~~~~~
211 | get_param(params, vertex_index), g, vertex_index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
212 | pred_vec[0]),
| ~~~~~~~~~~~~~
213 | params, get_param(params, vertex_color));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/edmonds_karp_max_flow.hpp:228:57: required from ‘typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::edmonds_karp_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with Graph = adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value<Graph, P, T, R>::type = double; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
228 | return detail::edmonds_karp_dispatch1< Pred >::apply(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
229 | g, src, sink, params, get_param(params, vertex_predecessor));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/edmonds_karp_max_flow.hpp:240:33: required from ‘typename boost::property_traits<typename boost::property_map<Graph, boost::edge_capacity_t>::const_type>::value_type boost::edmonds_karp_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > > >; 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&, long unsigned int, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_capacity_t>; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
240 | return edmonds_karp_max_flow(g, src, sink, params);
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
mincut.cpp:76:45: required from here
76 | maxflow = edmonds_karp_max_flow(flow_g, s, t);
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/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<boost::default_color_type*, std::vector<boost::default_color_type> > >]’
20 | ~usage_requirements() { ((Model*)0)->~Model(); }
| ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/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<boost::default_color_type*, std::vector<boost::default_color_type> > > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:571:7: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> > >’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> > >’
597 | BOOST_concept(RandomAccessIterator,(TT))
| ^~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> > >’
597 | BOOST_concept(RandomAccessIterator,(TT))
| ^~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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<boost::default_color_type*, std::vector<boost::default_color_type> > >]’
32 | inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
| ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied<boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> > > >::value’
44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map<RAIter, ID, Value, Value&> boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator<default_color_type*, std::vector<default_color_type> >; Value = default_color_type; ID = vec_adj_list_vertex_id_map<no_property, long unsigned int>]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/edmonds_karp_max_flow.hpp:161:43: required from ‘static typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::detail::edmonds_karp_dispatch2<boost::param_not_found>::apply(Graph&, typename boost::graph_traits<Graph>::vertex_descriptor, typename boost::graph_traits<Graph>::vertex_descriptor, PredMap, const boost::bgl_named_params<P, T, R>&, boost::param_not_found) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >; PredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>*, std::vector<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>&>; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value<Graph, P, T, R>::type = double; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’
161 | make_iterator_property_map(color_vec.begin(),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~
162 | choose_const_pmap(
| ~~~~~~~~~~~~~~~~~~
163 | get_param(params, vertex_index), g, vertex_index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
164 | color_vec[0]),
| ~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/edmonds_karp_max_flow.hpp:208:54: required from ‘static typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::detail::edmonds_karp_dispatch1<boost::param_not_found>::apply(Graph&, typename boost::graph_traits<Graph>::vertex_descriptor, typename boost::graph_traits<Graph>::vertex_descriptor, const boost::bgl_named_params<T, Tag, Base>&, boost::param_not_found) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value<Graph, P, T, R>::type = double; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’
208 | return edmonds_karp_dispatch2< C >::apply(g, src, sink,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
209 | make_iterator_property_map(pred_vec.begin(),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
210 | choose_const_pmap(
| ~~~~~~~~~~~~~~~~~~
211 | get_param(params, vertex_index), g, vertex_index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
212 | pred_vec[0]),
| ~~~~~~~~~~~~~
213 | params, get_param(params, vertex_color));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/edmonds_karp_max_flow.hpp:228:57: required from ‘typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::edmonds_karp_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with Graph = adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value<Graph, P, T, R>::type = double; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
228 | return detail::edmonds_karp_dispatch1< Pred >::apply(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
229 | g, src, sink, params, get_param(params, vertex_predecessor));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/edmonds_karp_max_flow.hpp:240:33: required from ‘typename boost::property_traits<typename boost::property_map<Graph, boost::edge_capacity_t>::const_type>::value_type boost::edmonds_karp_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > > >; 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&, long unsigned int, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_capacity_t>; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
240 | return edmonds_karp_max_flow(g, src, sink, params);
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
mincut.cpp:76:45: required from here
76 | maxflow = edmonds_karp_max_flow(flow_g, s, t);
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/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<boost::default_color_type*, std::vector<boost::default_color_type> > >]’
20 | ~usage_requirements() { ((Model*)0)->~Model(); }
| ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/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<boost::default_color_type*, std::vector<boost::default_color_type> > > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:253:5: required from ‘struct boost::Comparable<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> > >’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> > >’
597 | BOOST_concept(RandomAccessIterator,(TT))
| ^~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> > >’
597 | BOOST_concept(RandomAccessIterator,(TT))
| ^~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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<boost::default_color_type*, std::vector<boost::default_color_type> > >]’
32 | inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
| ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied<boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> > > >::value’
44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map<RAIter, ID, Value, Value&> boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator<default_color_type*, std::vector<default_color_type> >; Value = default_color_type; ID = vec_adj_list_vertex_id_map<no_property, long unsigned int>]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/edmonds_karp_max_flow.hpp:161:43: required from ‘static typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::detail::edmonds_karp_dispatch2<boost::param_not_found>::apply(Graph&, typename boost::graph_traits<Graph>::vertex_descriptor, typename boost::graph_traits<Graph>::vertex_descriptor, PredMap, const boost::bgl_named_params<P, T, R>&, boost::param_not_found) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >; PredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>*, std::vector<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>&>; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value<Graph, P, T, R>::type = double; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’
161 | make_iterator_property_map(color_vec.begin(),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~
162 | choose_const_pmap(
| ~~~~~~~~~~~~~~~~~~
163 | get_param(params, vertex_index), g, vertex_index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
164 | color_vec[0]),
| ~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/edmonds_karp_max_flow.hpp:208:54: required from ‘static typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::detail::edmonds_karp_dispatch1<boost::param_not_found>::apply(Graph&, typename boost::graph_traits<Graph>::vertex_descriptor, typename boost::graph_traits<Graph>::vertex_descriptor, const boost::bgl_named_params<T, Tag, Base>&, boost::param_not_found) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value<Graph, P, T, R>::type = double; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’
208 | return edmonds_karp_dispatch2< C >::apply(g, src, sink,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
209 | make_iterator_property_map(pred_vec.begin(),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
210 | choose_const_pmap(
| ~~~~~~~~~~~~~~~~~~
211 | get_param(params, vertex_index), g, vertex_index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
212 | pred_vec[0]),
| ~~~~~~~~~~~~~
213 | params, get_param(params, vertex_color));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/edmonds_karp_max_flow.hpp:228:57: required from ‘typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::edmonds_karp_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with Graph = adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value<Graph, P, T, R>::type = double; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
228 | return detail::edmonds_karp_dispatch1< Pred >::apply(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
229 | g, src, sink, params, get_param(params, vertex_predecessor));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/edmonds_karp_max_flow.hpp:240:33: required from ‘typename boost::property_traits<typename boost::property_map<Graph, boost::edge_capacity_t>::const_type>::value_type boost::edmonds_karp_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > > >; 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&, long unsigned int, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_capacity_t>; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
240 | return edmonds_karp_max_flow(g, src, sink, params);
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
mincut.cpp:76:45: required from here
76 | maxflow = edmonds_karp_max_flow(flow_g, s, t);
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/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<boost::default_color_type*, std::vector<boost::default_color_type> > >]’
20 | ~usage_requirements() { ((Model*)0)->~Model(); }
| ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/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<boost::default_color_type*, std::vector<boost::default_color_type> > > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:601:7: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> > >’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> > >’
597 | BOOST_concept(RandomAccessIterator,(TT))
| ^~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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<boost::default_color_type*, std::vector<boost::default_color_type> > >]’
32 | inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
| ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied<boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> > > >::value’
44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map<RAIter, ID, Value, Value&> boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator<default_color_type*, std::vector<default_color_type> >; Value = default_color_type; ID = vec_adj_list_vertex_id_map<no_property, long unsigned int>]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/edmonds_karp_max_flow.hpp:161:43: required from ‘static typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::detail::edmonds_karp_dispatch2<boost::param_not_found>::apply(Graph&, typename boost::graph_traits<Graph>::vertex_descriptor, typename boost::graph_traits<Graph>::vertex_descriptor, PredMap, const boost::bgl_named_params<P, T, R>&, boost::param_not_found) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >; PredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>*, std::vector<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>&>; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value<Graph, P, T, R>::type = double; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’
161 | make_iterator_property_map(color_vec.begin(),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~
162 | choose_const_pmap(
| ~~~~~~~~~~~~~~~~~~
163 | get_param(params, vertex_index), g, vertex_index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
164 | color_vec[0]),
| ~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/edmonds_karp_max_flow.hpp:208:54: required from ‘static typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::detail::edmonds_karp_dispatch1<boost::param_not_found>::apply(Graph&, typename boost::graph_traits<Graph>::vertex_descriptor, typename boost::graph_traits<Graph>::vertex_descriptor, const boost::bgl_named_params<T, Tag, Base>&, boost::param_not_found) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value<Graph, P, T, R>::type = double; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’
208 | return edmonds_karp_dispatch2< C >::apply(g, src, sink,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
209 | make_iterator_property_map(pred_vec.begin(),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
210 | choose_const_pmap(
| ~~~~~~~~~~~~~~~~~~
211 | get_param(params, vertex_index), g, vertex_index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
212 | pred_vec[0]),
| ~~~~~~~~~~~~~
213 | params, get_param(params, vertex_color));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/edmonds_karp_max_flow.hpp:228:57: required from ‘typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::edmonds_karp_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with Graph = adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value<Graph, P, T, R>::type = double; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
228 | return detail::edmonds_karp_dispatch1< Pred >::apply(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
229 | g, src, sink, params, get_param(params, vertex_predecessor));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/edmonds_karp_max_flow.hpp:240:33: required from ‘typename boost::property_traits<typename boost::property_map<Graph, boost::edge_capacity_t>::const_type>::value_type boost::edmonds_karp_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > > >; 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&, long unsigned int, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_capacity_t>; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
240 | return edmonds_karp_max_flow(g, src, sink, params);
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
mincut.cpp:76:45: required from here
76 | maxflow = edmonds_karp_max_flow(flow_g, s, t);
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/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<boost::default_color_type*, std::vector<boost::default_color_type> > >]’
20 | ~usage_requirements() { ((Model*)0)->~Model(); }
| ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/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<boost::default_color_type*, std::vector<boost::default_color_type> > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map<RAIter, ID, Value, Value&> boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator<default_color_type*, std::vector<default_color_type> >; Value = default_color_type; ID = vec_adj_list_vertex_id_map<no_property, long unsigned int>]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/edmonds_karp_max_flow.hpp:161:43: required from ‘static typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::detail::edmonds_karp_dispatch2<boost::param_not_found>::apply(Graph&, typename boost::graph_traits<Graph>::vertex_descriptor, typename boost::graph_traits<Graph>::vertex_descriptor, PredMap, const boost::bgl_named_params<P, T, R>&, boost::param_not_found) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >; PredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>*, std::vector<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>&>; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value<Graph, P, T, R>::type = double; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’
161 | make_iterator_property_map(color_vec.begin(),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~
162 | choose_const_pmap(
| ~~~~~~~~~~~~~~~~~~
163 | get_param(params, vertex_index), g, vertex_index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
164 | color_vec[0]),
| ~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/edmonds_karp_max_flow.hpp:208:54: required from ‘static typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::detail::edmonds_karp_dispatch1<boost::param_not_found>::apply(Graph&, typename boost::graph_traits<Graph>::vertex_descriptor, typename boost::graph_traits<Graph>::vertex_descriptor, const boost::bgl_named_params<T, Tag, Base>&, boost::param_not_found) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value<Graph, P, T, R>::type = double; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’
208 | return edmonds_karp_dispatch2< C >::apply(g, src, sink,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
209 | make_iterator_property_map(pred_vec.begin(),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
210 | choose_const_pmap(
| ~~~~~~~~~~~~~~~~~~
211 | get_param(params, vertex_index), g, vertex_index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
212 | pred_vec[0]),
| ~~~~~~~~~~~~~
213 | params, get_param(params, vertex_color));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/edmonds_karp_max_flow.hpp:228:57: required from ‘typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::edmonds_karp_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with Graph = adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value<Graph, P, T, R>::type = double; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
228 | return detail::edmonds_karp_dispatch1< Pred >::apply(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
229 | g, src, sink, params, get_param(params, vertex_predecessor));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/edmonds_karp_max_flow.hpp:240:33: required from ‘typename boost::property_traits<typename boost::property_map<Graph, boost::edge_capacity_t>::const_type>::value_type boost::edmonds_karp_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > > >; 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&, long unsigned int, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_capacity_t>; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
240 | return edmonds_karp_max_flow(g, src, sink, params);
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
mincut.cpp:76:45: required from here
76 | maxflow = edmonds_karp_max_flow(flow_g, s, t);
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:17: note: in a call to non-static member function ‘boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> > >::~RandomAccessIteratorConcept()’
597 | BOOST_concept(RandomAccessIterator,(TT))
| ^~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/preprocessor/cat.hpp:29:34: note: in definition of macro ‘BOOST_PP_CAT_I’
29 | # define BOOST_PP_CAT_I(a, b) a ## b
| ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/concept_def.hpp:23:12: note: in expansion of macro ‘BOOST_PP_CAT’
23 | struct BOOST_PP_CAT(name,Concept) \
| ^~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3: note: in expansion of macro ‘BOOST_concept’
597 | BOOST_concept(RandomAccessIterator,(TT))
| ^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::concepts::Graph<boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::no_property, boost::listS>, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long unsigned int, long unsigned int&, long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all> > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:66:5: required from ‘struct boost::concepts::Graph<boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::no_property, boost::listS>, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long unsigned int, long unsigned int&, long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:75:1: required from ‘struct boost::concepts::IncidenceGraph<boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::no_property, boost::listS>, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long unsigned int, long unsigned int&, long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >’
75 | BOOST_concept(IncidenceGraph, (G)) : Graph< G >
| ^~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:75:1: required from ‘struct boost::concepts::IncidenceGraphConcept<boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::no_property, boost::listS>, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long unsigned int, long unsigned int&, long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >’
75 | BOOST_concept(IncidenceGraph, (G)) : Graph< G >
| ^~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::concepts::IncidenceGraphConcept<boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::no_property, boost::listS>, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long unsigned int, long unsigned int&, long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >]’
32 | inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
| ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied<boost::concepts::IncidenceGraphConcept<boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::no_property, boost::listS>, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long unsigned int, long unsigned int&, long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all> > >::value’
44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:62:5: required from ‘void boost::breadth_first_visit(const IncidenceGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with IncidenceGraph = filtered_graph<adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, no_property, listS>, is_residual_edge<adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_residual_capacity_t> >, keep_all>; Buffer = queue<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > >; BFSVisitor = bfs_visitor<edge_predecessor_recorder<detail::edge_desc_impl<directed_tag, long unsigned int>*, on_tree_edge> >; ColorMap = default_color_type*; SourceIterator = long unsigned int*]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:136:24: required from ‘void boost::breadth_first_search(const VertexListGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph<adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, no_property, listS>, is_residual_edge<adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_residual_capacity_t> >, keep_all>; SourceIterator = long unsigned int*; Buffer = queue<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > >; BFSVisitor = bfs_visitor<edge_predecessor_recorder<detail::edge_desc_impl<directed_tag, long unsigned int>*, on_tree_edge> >; ColorMap = default_color_type*]’
136 | breadth_first_visit(g, sources_begin, sources_end, Q, vis, color);
| ~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:147:25: required from ‘void boost::breadth_first_search(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph<adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, no_property, listS>, is_residual_edge<adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_residual_capacity_t> >, keep_all>; Buffer = queue<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > >; BFSVisitor = bfs_visitor<edge_predecessor_recorder<detail::edge_desc_impl<directed_tag, long unsigned int>*, on_tree_edge> >; ColorMap = default_color_type*; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
147 | breadth_first_search(g, sources, sources + 1, Q, vis, color);
| ~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/edmonds_karp_max_flow.hpp:101:29: required from ‘typename boost::property_traits<IndexMap>::value_type boost::edmonds_karp_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, ColorMap, PredEdgeMap) [with Graph = adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, no_property, listS>; CapacityEdgeMap = adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map<directed_tag, detail::edge_desc_impl<directed_tag, long unsigned int>, detail::edge_desc_impl<directed_tag, long unsigned int>&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_reverse_t>; ColorMap = default_color_type*; PredEdgeMap = detail::edge_desc_impl<directed_tag, long unsigned int>*; typename property_traits<IndexMap>::value_type = long unsigned int; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
101 | breadth_first_search(detail::residual_graph(g, res), src, Q,
| ~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
102 | make_bfs_visitor(record_edge_predecessors(pred, on_tree_edge())),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
103 | color);
| ~~~~~~
mincut.hpp:78:21: required from ‘typename boost::graph_traits<G>::edges_size_type boost::min_cut(VertexListGraph&, OutputIterator, OutputIterator) [with VertexListGraph = R_adjacency_list<undirectedS, double>; OutputIterator = std::back_insert_iterator<std::vector<long unsigned int> >; typename graph_traits<G>::edges_size_type = long unsigned int]’
77 | alpha_S_k = edmonds_karp_max_flow
| ~~~~~~~~~~~~~~~~~~~~~
78 | (flow_g, p, k, cap, res_cap, rev_edge, &color[0], &pred[0]);
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
mincut.cpp:128:35: required from here
128 | dst cut_capacity = min_cut(g, std::back_inserter(s_set), std::back_inserter(vs_set) );
| ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::concepts::Graph<boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::no_property, boost::listS>, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long unsigned int, long unsigned int&, long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >]’
20 | ~usage_requirements() { ((Model*)0)->~Model(); }
| ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::concepts::IncidenceGraph<boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::no_property, boost::listS>, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long unsigned int, long unsigned int&, long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all> > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:87:5: required from ‘struct boost::concepts::IncidenceGraph<boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::no_property, boost::listS>, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long unsigned int, long unsigned int&, long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:75:1: required from ‘struct boost::concepts::IncidenceGraphConcept<boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::no_property, boost::listS>, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long unsigned int, long unsigned int&, long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >’
75 | BOOST_concept(IncidenceGraph, (G)) : Graph< G >
| ^~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::concepts::IncidenceGraphConcept<boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::no_property, boost::listS>, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long unsigned int, long unsigned int&, long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >]’
32 | inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
| ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied<boost::concepts::IncidenceGraphConcept<boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::no_property, boost::listS>, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long unsigned int, long unsigned int&, long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all> > >::value’
44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:62:5: required from ‘void boost::breadth_first_visit(const IncidenceGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with IncidenceGraph = filtered_graph<adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, no_property, listS>, is_residual_edge<adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_residual_capacity_t> >, keep_all>; Buffer = queue<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > >; BFSVisitor = bfs_visitor<edge_predecessor_recorder<detail::edge_desc_impl<directed_tag, long unsigned int>*, on_tree_edge> >; ColorMap = default_color_type*; SourceIterator = long unsigned int*]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:136:24: required from ‘void boost::breadth_first_search(const VertexListGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph<adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, no_property, listS>, is_residual_edge<adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_residual_capacity_t> >, keep_all>; SourceIterator = long unsigned int*; Buffer = queue<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > >; BFSVisitor = bfs_visitor<edge_predecessor_recorder<detail::edge_desc_impl<directed_tag, long unsigned int>*, on_tree_edge> >; ColorMap = default_color_type*]’
136 | breadth_first_visit(g, sources_begin, sources_end, Q, vis, color);
| ~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:147:25: required from ‘void boost::breadth_first_search(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph<adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, no_property, listS>, is_residual_edge<adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_residual_capacity_t> >, keep_all>; Buffer = queue<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > >; BFSVisitor = bfs_visitor<edge_predecessor_recorder<detail::edge_desc_impl<directed_tag, long unsigned int>*, on_tree_edge> >; ColorMap = default_color_type*; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
147 | breadth_first_search(g, sources, sources + 1, Q, vis, color);
| ~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/edmonds_karp_max_flow.hpp:101:29: required from ‘typename boost::property_traits<IndexMap>::value_type boost::edmonds_karp_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, ColorMap, PredEdgeMap) [with Graph = adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, no_property, listS>; CapacityEdgeMap = adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map<directed_tag, detail::edge_desc_impl<directed_tag, long unsigned int>, detail::edge_desc_impl<directed_tag, long unsigned int>&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_reverse_t>; ColorMap = default_color_type*; PredEdgeMap = detail::edge_desc_impl<directed_tag, long unsigned int>*; typename property_traits<IndexMap>::value_type = long unsigned int; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
101 | breadth_first_search(detail::residual_graph(g, res), src, Q,
| ~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
102 | make_bfs_visitor(record_edge_predecessors(pred, on_tree_edge())),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
103 | color);
| ~~~~~~
mincut.hpp:78:21: required from ‘typename boost::graph_traits<G>::edges_size_type boost::min_cut(VertexListGraph&, OutputIterator, OutputIterator) [with VertexListGraph = R_adjacency_list<undirectedS, double>; OutputIterator = std::back_insert_iterator<std::vector<long unsigned int> >; typename graph_traits<G>::edges_size_type = long unsigned int]’
77 | alpha_S_k = edmonds_karp_max_flow
| ~~~~~~~~~~~~~~~~~~~~~
78 | (flow_g, p, k, cap, res_cap, rev_edge, &color[0], &pred[0]);
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
mincut.cpp:128:35: required from here
128 | dst cut_capacity = min_cut(g, std::back_inserter(s_set), std::back_inserter(vs_set) );
| ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::concepts::IncidenceGraph<boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::no_property, boost::listS>, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long unsigned int, long unsigned int&, long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >]’
20 | ~usage_requirements() { ((Model*)0)->~Model(); }
| ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::IncidenceGraphConcept<boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::no_property, boost::listS>, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long unsigned int, long unsigned int&, long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:62:5: required from ‘void boost::breadth_first_visit(const IncidenceGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with IncidenceGraph = filtered_graph<adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, no_property, listS>, is_residual_edge<adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_residual_capacity_t> >, keep_all>; Buffer = queue<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > >; BFSVisitor = bfs_visitor<edge_predecessor_recorder<detail::edge_desc_impl<directed_tag, long unsigned int>*, on_tree_edge> >; ColorMap = default_color_type*; SourceIterator = long unsigned int*]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:136:24: required from ‘void boost::breadth_first_search(const VertexListGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph<adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, no_property, listS>, is_residual_edge<adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_residual_capacity_t> >, keep_all>; SourceIterator = long unsigned int*; Buffer = queue<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > >; BFSVisitor = bfs_visitor<edge_predecessor_recorder<detail::edge_desc_impl<directed_tag, long unsigned int>*, on_tree_edge> >; ColorMap = default_color_type*]’
136 | breadth_first_visit(g, sources_begin, sources_end, Q, vis, color);
| ~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:147:25: required from ‘void boost::breadth_first_search(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph<adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, no_property, listS>, is_residual_edge<adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_residual_capacity_t> >, keep_all>; Buffer = queue<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > >; BFSVisitor = bfs_visitor<edge_predecessor_recorder<detail::edge_desc_impl<directed_tag, long unsigned int>*, on_tree_edge> >; ColorMap = default_color_type*; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
147 | breadth_first_search(g, sources, sources + 1, Q, vis, color);
| ~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/edmonds_karp_max_flow.hpp:101:29: required from ‘typename boost::property_traits<IndexMap>::value_type boost::edmonds_karp_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, ColorMap, PredEdgeMap) [with Graph = adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, no_property, listS>; CapacityEdgeMap = adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map<directed_tag, detail::edge_desc_impl<directed_tag, long unsigned int>, detail::edge_desc_impl<directed_tag, long unsigned int>&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_reverse_t>; ColorMap = default_color_type*; PredEdgeMap = detail::edge_desc_impl<directed_tag, long unsigned int>*; typename property_traits<IndexMap>::value_type = long unsigned int; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
101 | breadth_first_search(detail::residual_graph(g, res), src, Q,
| ~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
102 | make_bfs_visitor(record_edge_predecessors(pred, on_tree_edge())),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
103 | color);
| ~~~~~~
mincut.hpp:78:21: required from ‘typename boost::graph_traits<G>::edges_size_type boost::min_cut(VertexListGraph&, OutputIterator, OutputIterator) [with VertexListGraph = R_adjacency_list<undirectedS, double>; OutputIterator = std::back_insert_iterator<std::vector<long unsigned int> >; typename graph_traits<G>::edges_size_type = long unsigned int]’
77 | alpha_S_k = edmonds_karp_max_flow
| ~~~~~~~~~~~~~~~~~~~~~
78 | (flow_g, p, k, cap, res_cap, rev_edge, &color[0], &pred[0]);
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
mincut.cpp:128:35: required from here
128 | dst cut_capacity = min_cut(g, std::back_inserter(s_set), std::back_inserter(vs_set) );
| ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:75:15: note: in a call to non-static member function ‘boost::concepts::IncidenceGraphConcept<boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::no_property, boost::listS>, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long unsigned int, long unsigned int&, long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >::~IncidenceGraphConcept()’
75 | BOOST_concept(IncidenceGraph, (G)) : Graph< G >
| ^~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/preprocessor/cat.hpp:29:34: note: in definition of macro ‘BOOST_PP_CAT_I’
29 | # define BOOST_PP_CAT_I(a, b) a ## b
| ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/concept_def.hpp:23:12: note: in expansion of macro ‘BOOST_PP_CAT’
23 | struct BOOST_PP_CAT(name,Concept) \
| ^~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:75:1: note: in expansion of macro ‘BOOST_concept’
75 | BOOST_concept(IncidenceGraph, (G)) : Graph< G >
| ^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::constraint<Model>::failed() [with Model = boost::BFSVisitorConcept<boost::bfs_visitor<boost::edge_predecessor_recorder<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>*, boost::on_tree_edge> >, boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::no_property, boost::listS>, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long unsigned int, long unsigned int&, long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:65:5: required from ‘void boost::breadth_first_visit(const IncidenceGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with IncidenceGraph = filtered_graph<adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, no_property, listS>, is_residual_edge<adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_residual_capacity_t> >, keep_all>; Buffer = queue<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > >; BFSVisitor = bfs_visitor<edge_predecessor_recorder<detail::edge_desc_impl<directed_tag, long unsigned int>*, on_tree_edge> >; ColorMap = default_color_type*; SourceIterator = long unsigned int*]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:136:24: required from ‘void boost::breadth_first_search(const VertexListGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph<adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, no_property, listS>, is_residual_edge<adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_residual_capacity_t> >, keep_all>; SourceIterator = long unsigned int*; Buffer = queue<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > >; BFSVisitor = bfs_visitor<edge_predecessor_recorder<detail::edge_desc_impl<directed_tag, long unsigned int>*, on_tree_edge> >; ColorMap = default_color_type*]’
136 | breadth_first_visit(g, sources_begin, sources_end, Q, vis, color);
| ~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:147:25: required from ‘void boost::breadth_first_search(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph<adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, no_property, listS>, is_residual_edge<adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_residual_capacity_t> >, keep_all>; Buffer = queue<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > >; BFSVisitor = bfs_visitor<edge_predecessor_recorder<detail::edge_desc_impl<directed_tag, long unsigned int>*, on_tree_edge> >; ColorMap = default_color_type*; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
147 | breadth_first_search(g, sources, sources + 1, Q, vis, color);
| ~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/edmonds_karp_max_flow.hpp:101:29: required from ‘typename boost::property_traits<IndexMap>::value_type boost::edmonds_karp_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, ColorMap, PredEdgeMap) [with Graph = adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, no_property, listS>; CapacityEdgeMap = adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map<directed_tag, detail::edge_desc_impl<directed_tag, long unsigned int>, detail::edge_desc_impl<directed_tag, long unsigned int>&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_reverse_t>; ColorMap = default_color_type*; PredEdgeMap = detail::edge_desc_impl<directed_tag, long unsigned int>*; typename property_traits<IndexMap>::value_type = long unsigned int; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
101 | breadth_first_search(detail::residual_graph(g, res), src, Q,
| ~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
102 | make_bfs_visitor(record_edge_predecessors(pred, on_tree_edge())),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
103 | color);
| ~~~~~~
mincut.hpp:78:21: required from ‘typename boost::graph_traits<G>::edges_size_type boost::min_cut(VertexListGraph&, OutputIterator, OutputIterator) [with VertexListGraph = R_adjacency_list<undirectedS, double>; OutputIterator = std::back_insert_iterator<std::vector<long unsigned int> >; typename graph_traits<G>::edges_size_type = long unsigned int]’
77 | alpha_S_k = edmonds_karp_max_flow
| ~~~~~~~~~~~~~~~~~~~~~
78 | (flow_g, p, k, cap, res_cap, rev_edge, &color[0], &pred[0]);
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
mincut.cpp:128:35: required from here
128 | dst cut_capacity = min_cut(g, std::back_inserter(s_set), std::back_inserter(vs_set) );
| ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:65:52: warning: ‘this’ pointer is null [-Wnonnull]
65 | static void failed() { ((Model*)0)->constraints(); }
| ~~~~~~~~~~~~~~~~~~~~~~~~^~
In file included from /home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/edmonds_karp_max_flow.hpp:22,
from /home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/edge_connectivity.hpp:20,
from mincut.hpp:4,
from mincut.cpp:2:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:37:10: note: in a call to non-static member function ‘void boost::BFSVisitorConcept<Visitor, Graph>::constraints() [with Visitor = boost::bfs_visitor<boost::edge_predecessor_recorder<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>*, boost::on_tree_edge> >; Graph = boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::no_property, boost::listS>, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long unsigned int, long unsigned int&, long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all>]’
37 | void constraints()
| ^~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::constraint<Model>::failed() [with Model = boost::ReadWritePropertyMapConcept<boost::default_color_type*, long unsigned int>]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:66:5: required from ‘void boost::breadth_first_visit(const IncidenceGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with IncidenceGraph = filtered_graph<adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, no_property, listS>, is_residual_edge<adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_residual_capacity_t> >, keep_all>; Buffer = queue<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > >; BFSVisitor = bfs_visitor<edge_predecessor_recorder<detail::edge_desc_impl<directed_tag, long unsigned int>*, on_tree_edge> >; ColorMap = default_color_type*; SourceIterator = long unsigned int*]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:136:24: required from ‘void boost::breadth_first_search(const VertexListGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph<adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, no_property, listS>, is_residual_edge<adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_residual_capacity_t> >, keep_all>; SourceIterator = long unsigned int*; Buffer = queue<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > >; BFSVisitor = bfs_visitor<edge_predecessor_recorder<detail::edge_desc_impl<directed_tag, long unsigned int>*, on_tree_edge> >; ColorMap = default_color_type*]’
136 | breadth_first_visit(g, sources_begin, sources_end, Q, vis, color);
| ~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:147:25: required from ‘void boost::breadth_first_search(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph<adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, no_property, listS>, is_residual_edge<adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_residual_capacity_t> >, keep_all>; Buffer = queue<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > >; BFSVisitor = bfs_visitor<edge_predecessor_recorder<detail::edge_desc_impl<directed_tag, long unsigned int>*, on_tree_edge> >; ColorMap = default_color_type*; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
147 | breadth_first_search(g, sources, sources + 1, Q, vis, color);
| ~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/edmonds_karp_max_flow.hpp:101:29: required from ‘typename boost::property_traits<IndexMap>::value_type boost::edmonds_karp_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, ColorMap, PredEdgeMap) [with Graph = adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, no_property, listS>; CapacityEdgeMap = adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map<directed_tag, detail::edge_desc_impl<directed_tag, long unsigned int>, detail::edge_desc_impl<directed_tag, long unsigned int>&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_reverse_t>; ColorMap = default_color_type*; PredEdgeMap = detail::edge_desc_impl<directed_tag, long unsigned int>*; typename property_traits<IndexMap>::value_type = long unsigned int; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
101 | breadth_first_search(detail::residual_graph(g, res), src, Q,
| ~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
102 | make_bfs_visitor(record_edge_predecessors(pred, on_tree_edge())),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
103 | color);
| ~~~~~~
mincut.hpp:78:21: required from ‘typename boost::graph_traits<G>::edges_size_type boost::min_cut(VertexListGraph&, OutputIterator, OutputIterator) [with VertexListGraph = R_adjacency_list<undirectedS, double>; OutputIterator = std::back_insert_iterator<std::vector<long unsigned int> >; typename graph_traits<G>::edges_size_type = long unsigned int]’
77 | alpha_S_k = edmonds_karp_max_flow
| ~~~~~~~~~~~~~~~~~~~~~
78 | (flow_g, p, k, cap, res_cap, rev_edge, &color[0], &pred[0]);
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
mincut.cpp:128:35: required from here
128 | dst cut_capacity = min_cut(g, std::back_inserter(s_set), std::back_inserter(vs_set) );
| ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:65:52: warning: ‘this’ pointer is null [-Wnonnull]
65 | static void failed() { ((Model*)0)->constraints(); }
| ~~~~~~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/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::default_color_type*; Key = long unsigned int]’
205 | void constraints() {
| ^~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Convertible<std::random_access_iterator_tag, std::random_access_iterator_tag> >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/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> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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);
| ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/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) );
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/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;
| ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3: required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>*, std::vector<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >]’
597 | BOOST_concept(RandomAccessIterator,(TT))
| ^~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map<RAIter, ID, Value, Value&> boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator<detail::edge_desc_impl<directed_tag, long unsigned int>*, std::vector<detail::edge_desc_impl<directed_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<directed_tag, long unsigned int> > > >; Value = detail::edge_desc_impl<directed_tag, long unsigned int>; ID = vec_adj_list_vertex_id_map<no_property, long unsigned int>]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/edmonds_karp_max_flow.hpp:209:43: required from ‘static typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::detail::edmonds_karp_dispatch1<boost::param_not_found>::apply(Graph&, typename boost::graph_traits<Graph>::vertex_descriptor, typename boost::graph_traits<Graph>::vertex_descriptor, const boost::bgl_named_params<T, Tag, Base>&, boost::param_not_found) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value<Graph, P, T, R>::type = double; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’
209 | make_iterator_property_map(pred_vec.begin(),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~
210 | choose_const_pmap(
| ~~~~~~~~~~~~~~~~~~
211 | get_param(params, vertex_index), g, vertex_index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
212 | pred_vec[0]),
| ~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/edmonds_karp_max_flow.hpp:228:57: required from ‘typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::edmonds_karp_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with Graph = adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value<Graph, P, T, R>::type = double; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
228 | return detail::edmonds_karp_dispatch1< Pred >::apply(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
229 | g, src, sink, params, get_param(params, vertex_predecessor));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/edmonds_karp_max_flow.hpp:240:33: required from ‘typename boost::property_traits<typename boost::property_map<Graph, boost::edge_capacity_t>::const_type>::value_type boost::edmonds_karp_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > > >; 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&, long unsigned int, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_capacity_t>; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
240 | return edmonds_karp_max_flow(g, src, sink, params);
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
mincut.cpp:76:45: required from here
76 | maxflow = edmonds_karp_max_flow(flow_g, s, t);
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Convertible<std::random_access_iterator_tag, std::random_access_iterator_tag>]’
20 | ~usage_requirements() { ((Model*)0)->~Model(); }
| ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::Convertible<std::random_access_iterator_tag, std::random_access_iterator_tag>]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:603:11: required from ‘boost::RandomAccessIterator<TT>::~RandomAccessIterator() [with TT = __gnu_cxx::__normal_iterator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>*, std::vector<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3: required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>*, std::vector<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >]’
597 | BOOST_concept(RandomAccessIterator,(TT))
| ^~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map<RAIter, ID, Value, Value&> boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator<detail::edge_desc_impl<directed_tag, long unsigned int>*, std::vector<detail::edge_desc_impl<directed_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<directed_tag, long unsigned int> > > >; Value = detail::edge_desc_impl<directed_tag, long unsigned int>; ID = vec_adj_list_vertex_id_map<no_property, long unsigned int>]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/edmonds_karp_max_flow.hpp:209:43: required from ‘static typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::detail::edmonds_karp_dispatch1<boost::param_not_found>::apply(Graph&, typename boost::graph_traits<Graph>::vertex_descriptor, typename boost::graph_traits<Graph>::vertex_descriptor, const boost::bgl_named_params<T, Tag, Base>&, boost::param_not_found) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value<Graph, P, T, R>::type = double; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’
209 | make_iterator_property_map(pred_vec.begin(),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~
210 | choose_const_pmap(
| ~~~~~~~~~~~~~~~~~~
211 | get_param(params, vertex_index), g, vertex_index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
212 | pred_vec[0]),
| ~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/edmonds_karp_max_flow.hpp:228:57: required from ‘typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::edmonds_karp_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with Graph = adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value<Graph, P, T, R>::type = double; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
228 | return detail::edmonds_karp_dispatch1< Pred >::apply(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
229 | g, src, sink, params, get_param(params, vertex_predecessor));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/edmonds_karp_max_flow.hpp:240:33: required from ‘typename boost::property_traits<typename boost::property_map<Graph, boost::edge_capacity_t>::const_type>::value_type boost::edmonds_karp_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > > >; 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&, long unsigned int, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_capacity_t>; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
240 | return edmonds_karp_max_flow(g, src, sink, params);
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
mincut.cpp:76:45: required from here
76 | maxflow = edmonds_karp_max_flow(flow_g, s, t);
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible<X, Y>::~Convertible() [with X = std::random_access_iterator_tag; Y = std::random_access_iterator_tag]’
37 | ~model()
| ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
208 | BOOST_CONCEPT_USAGE(Convertible) {
| ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Assignable<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/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<boost::default_color_type*, std::vector<boost::default_color_type> > > >]’
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:145:5: required from ‘struct boost::Assignable<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> > >’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> > >’
502 | BOOST_concept(InputIterator,(TT))
| ^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:540:3: required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> > >’
540 | BOOST_concept(ForwardIterator,(TT))
| ^~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> > >’
568 | BOOST_concept(BidirectionalIterator,(TT))
| ^~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3: [ skipping 6 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map<RAIter, ID, Value, Value&> boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator<default_color_type*, std::vector<default_color_type> >; Value = default_color_type; ID = vec_adj_list_vertex_id_map<no_property, long unsigned int>]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/edmonds_karp_max_flow.hpp:161:43: required from ‘static typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::detail::edmonds_karp_dispatch2<boost::param_not_found>::apply(Graph&, typename boost::graph_traits<Graph>::vertex_descriptor, typename boost::graph_traits<Graph>::vertex_descriptor, PredMap, const boost::bgl_named_params<P, T, R>&, boost::param_not_found) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >; PredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>*, std::vector<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>&>; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value<Graph, P, T, R>::type = double; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’
161 | make_iterator_property_map(color_vec.begin(),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~
162 | choose_const_pmap(
| ~~~~~~~~~~~~~~~~~~
163 | get_param(params, vertex_index), g, vertex_index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
164 | color_vec[0]),
| ~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/edmonds_karp_max_flow.hpp:208:54: required from ‘static typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::detail::edmonds_karp_dispatch1<boost::param_not_found>::apply(Graph&, typename boost::graph_traits<Graph>::vertex_descriptor, typename boost::graph_traits<Graph>::vertex_descriptor, const boost::bgl_named_params<T, Tag, Base>&, boost::param_not_found) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value<Graph, P, T, R>::type = double; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’
208 | return edmonds_karp_dispatch2< C >::apply(g, src, sink,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
209 | make_iterator_property_map(pred_vec.begin(),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
210 | choose_const_pmap(
| ~~~~~~~~~~~~~~~~~~
211 | get_param(params, vertex_index), g, vertex_index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
212 | pred_vec[0]),
| ~~~~~~~~~~~~~
213 | params, get_param(params, vertex_color));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/edmonds_karp_max_flow.hpp:228:57: required from ‘typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::edmonds_karp_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with Graph = adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value<Graph, P, T, R>::type = double; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
228 | return detail::edmonds_karp_dispatch1< Pred >::apply(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
229 | g, src, sink, params, get_param(params, vertex_predecessor));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/edmonds_karp_max_flow.hpp:240:33: required from ‘typename boost::property_traits<typename boost::property_map<Graph, boost::edge_capacity_t>::const_type>::value_type boost::edmonds_karp_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > > >; 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&, long unsigned int, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_capacity_t>; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
240 | return edmonds_karp_max_flow(g, src, sink, params);
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
mincut.cpp:76:45: required from here
76 | maxflow = edmonds_karp_max_flow(flow_g, s, t);
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
20 | ~usage_requirements() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/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<boost::default_color_type*, std::vector<boost::default_color_type> >]’
37 | ~model()
| ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:145:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
145 | BOOST_CONCEPT_USAGE(Assignable) {
| ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::EqualityComparable<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/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<boost::default_color_type*, std::vector<boost::default_color_type> > > >]’
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> > >’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:502:3: required from ‘struct boost::InputIterator<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> > >’
502 | BOOST_concept(InputIterator,(TT))
| ^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:540:3: required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> > >’
540 | BOOST_concept(ForwardIterator,(TT))
| ^~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> > >’
568 | BOOST_concept(BidirectionalIterator,(TT))
| ^~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3: [ skipping 6 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map<RAIter, ID, Value, Value&> boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator<default_color_type*, std::vector<default_color_type> >; Value = default_color_type; ID = vec_adj_list_vertex_id_map<no_property, long unsigned int>]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/edmonds_karp_max_flow.hpp:161:43: required from ‘static typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::detail::edmonds_karp_dispatch2<boost::param_not_found>::apply(Graph&, typename boost::graph_traits<Graph>::vertex_descriptor, typename boost::graph_traits<Graph>::vertex_descriptor, PredMap, const boost::bgl_named_params<P, T, R>&, boost::param_not_found) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >; PredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>*, std::vector<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>&>; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value<Graph, P, T, R>::type = double; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’
161 | make_iterator_property_map(color_vec.begin(),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~
162 | choose_const_pmap(
| ~~~~~~~~~~~~~~~~~~
163 | get_param(params, vertex_index), g, vertex_index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
164 | color_vec[0]),
| ~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/edmonds_karp_max_flow.hpp:208:54: required from ‘static typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::detail::edmonds_karp_dispatch1<boost::param_not_found>::apply(Graph&, typename boost::graph_traits<Graph>::vertex_descriptor, typename boost::graph_traits<Graph>::vertex_descriptor, const boost::bgl_named_params<T, Tag, Base>&, boost::param_not_found) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value<Graph, P, T, R>::type = double; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’
208 | return edmonds_karp_dispatch2< C >::apply(g, src, sink,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
209 | make_iterator_property_map(pred_vec.begin(),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
210 | choose_const_pmap(
| ~~~~~~~~~~~~~~~~~~
211 | get_param(params, vertex_index), g, vertex_index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
212 | pred_vec[0]),
| ~~~~~~~~~~~~~
213 | params, get_param(params, vertex_color));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/edmonds_karp_max_flow.hpp:228:57: required from ‘typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::edmonds_karp_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with Graph = adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value<Graph, P, T, R>::type = double; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
228 | return detail::edmonds_karp_dispatch1< Pred >::apply(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
229 | g, src, sink, params, get_param(params, vertex_predecessor));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/edmonds_karp_max_flow.hpp:240:33: required from ‘typename boost::property_traits<typename boost::property_map<Graph, boost::edge_capacity_t>::const_type>::value_type boost::edmonds_karp_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > > >; 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&, long unsigned int, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_capacity_t>; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
240 | return edmonds_karp_max_flow(g, src, sink, params);
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
mincut.cpp:76:45: required from here
76 | maxflow = edmonds_karp_max_flow(flow_g, s, t);
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
20 | ~usage_requirements() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/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<boost::default_color_type*, std::vector<boost::default_color_type> >]’
37 | ~model()
| ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:233:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
233 | BOOST_CONCEPT_USAGE(EqualityComparable) {
| ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::InputIterator<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/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<boost::default_color_type*, std::vector<boost::default_color_type> > > >]’
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:512:7: required from ‘struct boost::InputIterator<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> > >’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:540:3: required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> > >’
540 | BOOST_concept(ForwardIterator,(TT))
| ^~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> > >’
568 | BOOST_concept(BidirectionalIterator,(TT))
| ^~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> > >’
597 | BOOST_concept(RandomAccessIterator,(TT))
| ^~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3: [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map<RAIter, ID, Value, Value&> boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator<default_color_type*, std::vector<default_color_type> >; Value = default_color_type; ID = vec_adj_list_vertex_id_map<no_property, long unsigned int>]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/edmonds_karp_max_flow.hpp:161:43: required from ‘static typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::detail::edmonds_karp_dispatch2<boost::param_not_found>::apply(Graph&, typename boost::graph_traits<Graph>::vertex_descriptor, typename boost::graph_traits<Graph>::vertex_descriptor, PredMap, const boost::bgl_named_params<P, T, R>&, boost::param_not_found) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >; PredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>*, std::vector<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>&>; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value<Graph, P, T, R>::type = double; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’
161 | make_iterator_property_map(color_vec.begin(),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~
162 | choose_const_pmap(
| ~~~~~~~~~~~~~~~~~~
163 | get_param(params, vertex_index), g, vertex_index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
164 | color_vec[0]),
| ~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/edmonds_karp_max_flow.hpp:208:54: required from ‘static typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::detail::edmonds_karp_dispatch1<boost::param_not_found>::apply(Graph&, typename boost::graph_traits<Graph>::vertex_descriptor, typename boost::graph_traits<Graph>::vertex_descriptor, const boost::bgl_named_params<T, Tag, Base>&, boost::param_not_found) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value<Graph, P, T, R>::type = double; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’
208 | return edmonds_karp_dispatch2< C >::apply(g, src, sink,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
209 | make_iterator_property_map(pred_vec.begin(),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
210 | choose_const_pmap(
| ~~~~~~~~~~~~~~~~~~
211 | get_param(params, vertex_index), g, vertex_index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
212 | pred_vec[0]),
| ~~~~~~~~~~~~~
213 | params, get_param(params, vertex_color));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/edmonds_karp_max_flow.hpp:228:57: required from ‘typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::edmonds_karp_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with Graph = adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value<Graph, P, T, R>::type = double; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
228 | return detail::edmonds_karp_dispatch1< Pred >::apply(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
229 | g, src, sink, params, get_param(params, vertex_predecessor));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/edmonds_karp_max_flow.hpp:240:33: required from ‘typename boost::property_traits<typename boost::property_map<Graph, boost::edge_capacity_t>::const_type>::value_type boost::edmonds_karp_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > > >; 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&, long unsigned int, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_capacity_t>; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
240 | return edmonds_karp_max_flow(g, src, sink, params);
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
mincut.cpp:76:45: required from here
76 | maxflow = edmonds_karp_max_flow(flow_g, s, t);
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
20 | ~usage_requirements() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/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<boost::default_color_type*, std::vector<boost::default_color_type> >]’
37 | ~model()
| ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:512:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
512 | BOOST_CONCEPT_USAGE(InputIterator)
| ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::ForwardIterator<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/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<boost::default_color_type*, std::vector<boost::default_color_type> > > >]’
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:543:7: required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> > >’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> > >’
568 | BOOST_concept(BidirectionalIterator,(TT))
| ^~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> > >’
597 | BOOST_concept(RandomAccessIterator,(TT))
| ^~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> > >’
597 | BOOST_concept(RandomAccessIterator,(TT))
| ^~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map<RAIter, ID, Value, Value&> boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator<default_color_type*, std::vector<default_color_type> >; Value = default_color_type; ID = vec_adj_list_vertex_id_map<no_property, long unsigned int>]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/edmonds_karp_max_flow.hpp:161:43: required from ‘static typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::detail::edmonds_karp_dispatch2<boost::param_not_found>::apply(Graph&, typename boost::graph_traits<Graph>::vertex_descriptor, typename boost::graph_traits<Graph>::vertex_descriptor, PredMap, const boost::bgl_named_params<P, T, R>&, boost::param_not_found) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >; PredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>*, std::vector<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>&>; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value<Graph, P, T, R>::type = double; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’
161 | make_iterator_property_map(color_vec.begin(),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~
162 | choose_const_pmap(
| ~~~~~~~~~~~~~~~~~~
163 | get_param(params, vertex_index), g, vertex_index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
164 | color_vec[0]),
| ~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/edmonds_karp_max_flow.hpp:208:54: required from ‘static typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::detail::edmonds_karp_dispatch1<boost::param_not_found>::apply(Graph&, typename boost::graph_traits<Graph>::vertex_descriptor, typename boost::graph_traits<Graph>::vertex_descriptor, const boost::bgl_named_params<T, Tag, Base>&, boost::param_not_found) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value<Graph, P, T, R>::type = double; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’
208 | return edmonds_karp_dispatch2< C >::apply(g, src, sink,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
209 | make_iterator_property_map(pred_vec.begin(),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
210 | choose_const_pmap(
| ~~~~~~~~~~~~~~~~~~
211 | get_param(params, vertex_index), g, vertex_index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
212 | pred_vec[0]),
| ~~~~~~~~~~~~~
213 | params, get_param(params, vertex_color));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/edmonds_karp_max_flow.hpp:228:57: required from ‘typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::edmonds_karp_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with Graph = adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value<Graph, P, T, R>::type = double; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
228 | return detail::edmonds_karp_dispatch1< Pred >::apply(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
229 | g, src, sink, params, get_param(params, vertex_predecessor));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/edmonds_karp_max_flow.hpp:240:33: required from ‘typename boost::property_traits<typename boost::property_map<Graph, boost::edge_capacity_t>::const_type>::value_type boost::edmonds_karp_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > > >; 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&, long unsigned int, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_capacity_t>; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
240 | return edmonds_karp_max_flow(g, src, sink, params);
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
mincut.cpp:76:45: required from here
76 | maxflow = edmonds_karp_max_flow(flow_g, s, t);
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
20 | ~usage_requirements() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/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<boost::default_color_type*, std::vector<boost::default_color_type> >]’
37 | ~model()
| ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:543:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
543 | BOOST_CONCEPT_USAGE(ForwardIterator)
| ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::BidirectionalIterator<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/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<boost::default_color_type*, std::vector<boost::default_color_type> > > >]’
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:571:7: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> > >’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> > >’
597 | BOOST_concept(RandomAccessIterator,(TT))
| ^~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> > >’
597 | BOOST_concept(RandomAccessIterator,(TT))
| ^~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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<boost::default_color_type*, std::vector<boost::default_color_type> > >]’
32 | inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
| ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map<RAIter, ID, Value, Value&> boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator<default_color_type*, std::vector<default_color_type> >; Value = default_color_type; ID = vec_adj_list_vertex_id_map<no_property, long unsigned int>]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/edmonds_karp_max_flow.hpp:161:43: required from ‘static typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::detail::edmonds_karp_dispatch2<boost::param_not_found>::apply(Graph&, typename boost::graph_traits<Graph>::vertex_descriptor, typename boost::graph_traits<Graph>::vertex_descriptor, PredMap, const boost::bgl_named_params<P, T, R>&, boost::param_not_found) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >; PredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>*, std::vector<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>&>; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value<Graph, P, T, R>::type = double; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’
161 | make_iterator_property_map(color_vec.begin(),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~
162 | choose_const_pmap(
| ~~~~~~~~~~~~~~~~~~
163 | get_param(params, vertex_index), g, vertex_index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
164 | color_vec[0]),
| ~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/edmonds_karp_max_flow.hpp:208:54: required from ‘static typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::detail::edmonds_karp_dispatch1<boost::param_not_found>::apply(Graph&, typename boost::graph_traits<Graph>::vertex_descriptor, typename boost::graph_traits<Graph>::vertex_descriptor, const boost::bgl_named_params<T, Tag, Base>&, boost::param_not_found) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value<Graph, P, T, R>::type = double; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’
208 | return edmonds_karp_dispatch2< C >::apply(g, src, sink,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
209 | make_iterator_property_map(pred_vec.begin(),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
210 | choose_const_pmap(
| ~~~~~~~~~~~~~~~~~~
211 | get_param(params, vertex_index), g, vertex_index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
212 | pred_vec[0]),
| ~~~~~~~~~~~~~
213 | params, get_param(params, vertex_color));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/edmonds_karp_max_flow.hpp:228:57: required from ‘typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::edmonds_karp_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with Graph = adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value<Graph, P, T, R>::type = double; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
228 | return detail::edmonds_karp_dispatch1< Pred >::apply(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
229 | g, src, sink, params, get_param(params, vertex_predecessor));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/edmonds_karp_max_flow.hpp:240:33: required from ‘typename boost::property_traits<typename boost::property_map<Graph, boost::edge_capacity_t>::const_type>::value_type boost::edmonds_karp_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > > >; 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&, long unsigned int, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_capacity_t>; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
240 | return edmonds_karp_max_flow(g, src, sink, params);
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
mincut.cpp:76:45: required from here
76 | maxflow = edmonds_karp_max_flow(flow_g, s, t);
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
20 | ~usage_requirements() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/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<boost::default_color_type*, std::vector<boost::default_color_type> >]’
37 | ~model()
| ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:571:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
571 | BOOST_CONCEPT_USAGE(BidirectionalIterator)
| ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Comparable<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/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<boost::default_color_type*, std::vector<boost::default_color_type> > > >]’
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:253:5: required from ‘struct boost::Comparable<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> > >’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> > >’
597 | BOOST_concept(RandomAccessIterator,(TT))
| ^~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> > >’
597 | BOOST_concept(RandomAccessIterator,(TT))
| ^~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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<boost::default_color_type*, std::vector<boost::default_color_type> > >]’
32 | inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
| ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map<RAIter, ID, Value, Value&> boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator<default_color_type*, std::vector<default_color_type> >; Value = default_color_type; ID = vec_adj_list_vertex_id_map<no_property, long unsigned int>]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/edmonds_karp_max_flow.hpp:161:43: required from ‘static typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::detail::edmonds_karp_dispatch2<boost::param_not_found>::apply(Graph&, typename boost::graph_traits<Graph>::vertex_descriptor, typename boost::graph_traits<Graph>::vertex_descriptor, PredMap, const boost::bgl_named_params<P, T, R>&, boost::param_not_found) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >; PredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>*, std::vector<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>&>; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value<Graph, P, T, R>::type = double; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’
161 | make_iterator_property_map(color_vec.begin(),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~
162 | choose_const_pmap(
| ~~~~~~~~~~~~~~~~~~
163 | get_param(params, vertex_index), g, vertex_index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
164 | color_vec[0]),
| ~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/edmonds_karp_max_flow.hpp:208:54: required from ‘static typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::detail::edmonds_karp_dispatch1<boost::param_not_found>::apply(Graph&, typename boost::graph_traits<Graph>::vertex_descriptor, typename boost::graph_traits<Graph>::vertex_descriptor, const boost::bgl_named_params<T, Tag, Base>&, boost::param_not_found) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value<Graph, P, T, R>::type = double; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’
208 | return edmonds_karp_dispatch2< C >::apply(g, src, sink,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
209 | make_iterator_property_map(pred_vec.begin(),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
210 | choose_const_pmap(
| ~~~~~~~~~~~~~~~~~~
211 | get_param(params, vertex_index), g, vertex_index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
212 | pred_vec[0]),
| ~~~~~~~~~~~~~
213 | params, get_param(params, vertex_color));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/edmonds_karp_max_flow.hpp:228:57: required from ‘typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::edmonds_karp_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with Graph = adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value<Graph, P, T, R>::type = double; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
228 | return detail::edmonds_karp_dispatch1< Pred >::apply(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
229 | g, src, sink, params, get_param(params, vertex_predecessor));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/edmonds_karp_max_flow.hpp:240:33: required from ‘typename boost::property_traits<typename boost::property_map<Graph, boost::edge_capacity_t>::const_type>::value_type boost::edmonds_karp_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > > >; 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&, long unsigned int, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_capacity_t>; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
240 | return edmonds_karp_max_flow(g, src, sink, params);
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
mincut.cpp:76:45: required from here
76 | maxflow = edmonds_karp_max_flow(flow_g, s, t);
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
20 | ~usage_requirements() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/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<boost::default_color_type*, std::vector<boost::default_color_type> >]’
37 | ~model()
| ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:253:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
253 | BOOST_CONCEPT_USAGE(Comparable) {
| ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::RandomAccessIterator<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/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<boost::default_color_type*, std::vector<boost::default_color_type> > > >]’
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:601:7: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> > >’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> > >’
597 | BOOST_concept(RandomAccessIterator,(TT))
| ^~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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<boost::default_color_type*, std::vector<boost::default_color_type> > >]’
32 | inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
| ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied<boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<boost::default_color_type*, std::vector<boost::default_color_type> > > >::value’
44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map<RAIter, ID, Value, Value&> boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator<default_color_type*, std::vector<default_color_type> >; Value = default_color_type; ID = vec_adj_list_vertex_id_map<no_property, long unsigned int>]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/edmonds_karp_max_flow.hpp:161:43: required from ‘static typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::detail::edmonds_karp_dispatch2<boost::param_not_found>::apply(Graph&, typename boost::graph_traits<Graph>::vertex_descriptor, typename boost::graph_traits<Graph>::vertex_descriptor, PredMap, const boost::bgl_named_params<P, T, R>&, boost::param_not_found) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >; PredMap = boost::iterator_property_map<__gnu_cxx::__normal_iterator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>*, std::vector<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int>, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>&>; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value<Graph, P, T, R>::type = double; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’
161 | make_iterator_property_map(color_vec.begin(),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~
162 | choose_const_pmap(
| ~~~~~~~~~~~~~~~~~~
163 | get_param(params, vertex_index), g, vertex_index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
164 | color_vec[0]),
| ~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/edmonds_karp_max_flow.hpp:208:54: required from ‘static typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::detail::edmonds_karp_dispatch1<boost::param_not_found>::apply(Graph&, typename boost::graph_traits<Graph>::vertex_descriptor, typename boost::graph_traits<Graph>::vertex_descriptor, const boost::bgl_named_params<T, Tag, Base>&, boost::param_not_found) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value<Graph, P, T, R>::type = double; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’
208 | return edmonds_karp_dispatch2< C >::apply(g, src, sink,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
209 | make_iterator_property_map(pred_vec.begin(),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
210 | choose_const_pmap(
| ~~~~~~~~~~~~~~~~~~
211 | get_param(params, vertex_index), g, vertex_index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
212 | pred_vec[0]),
| ~~~~~~~~~~~~~
213 | params, get_param(params, vertex_color));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/edmonds_karp_max_flow.hpp:228:57: required from ‘typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::edmonds_karp_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with Graph = adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value<Graph, P, T, R>::type = double; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
228 | return detail::edmonds_karp_dispatch1< Pred >::apply(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
229 | g, src, sink, params, get_param(params, vertex_predecessor));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/edmonds_karp_max_flow.hpp:240:33: required from ‘typename boost::property_traits<typename boost::property_map<Graph, boost::edge_capacity_t>::const_type>::value_type boost::edmonds_karp_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > > >; 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&, long unsigned int, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_capacity_t>; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
240 | return edmonds_karp_max_flow(g, src, sink, params);
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
mincut.cpp:76:45: required from here
76 | maxflow = edmonds_karp_max_flow(flow_g, s, t);
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
20 | ~usage_requirements() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/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<boost::default_color_type*, std::vector<boost::default_color_type> >]’
37 | ~model()
| ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:601:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
601 | BOOST_CONCEPT_USAGE(RandomAccessIterator)
| ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::concepts::Graph<boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::no_property, boost::listS>, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long unsigned int, long unsigned int&, long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::concepts::Graph<boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::no_property, boost::listS>, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long unsigned int, long unsigned int&, long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all> > >]’
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:66:5: required from ‘struct boost::concepts::Graph<boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::no_property, boost::listS>, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long unsigned int, long unsigned int&, long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:75:1: required from ‘struct boost::concepts::IncidenceGraph<boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::no_property, boost::listS>, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long unsigned int, long unsigned int&, long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >’
75 | BOOST_concept(IncidenceGraph, (G)) : Graph< G >
| ^~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:75:1: required from ‘struct boost::concepts::IncidenceGraphConcept<boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::no_property, boost::listS>, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long unsigned int, long unsigned int&, long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >’
75 | BOOST_concept(IncidenceGraph, (G)) : Graph< G >
| ^~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::concepts::IncidenceGraphConcept<boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::no_property, boost::listS>, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long unsigned int, long unsigned int&, long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >]’
32 | inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
| ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:62:5: required from ‘void boost::breadth_first_visit(const IncidenceGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with IncidenceGraph = filtered_graph<adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, no_property, listS>, is_residual_edge<adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_residual_capacity_t> >, keep_all>; Buffer = queue<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > >; BFSVisitor = bfs_visitor<edge_predecessor_recorder<detail::edge_desc_impl<directed_tag, long unsigned int>*, on_tree_edge> >; ColorMap = default_color_type*; SourceIterator = long unsigned int*]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:136:24: required from ‘void boost::breadth_first_search(const VertexListGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph<adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, no_property, listS>, is_residual_edge<adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_residual_capacity_t> >, keep_all>; SourceIterator = long unsigned int*; Buffer = queue<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > >; BFSVisitor = bfs_visitor<edge_predecessor_recorder<detail::edge_desc_impl<directed_tag, long unsigned int>*, on_tree_edge> >; ColorMap = default_color_type*]’
136 | breadth_first_visit(g, sources_begin, sources_end, Q, vis, color);
| ~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:147:25: required from ‘void boost::breadth_first_search(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph<adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, no_property, listS>, is_residual_edge<adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_residual_capacity_t> >, keep_all>; Buffer = queue<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > >; BFSVisitor = bfs_visitor<edge_predecessor_recorder<detail::edge_desc_impl<directed_tag, long unsigned int>*, on_tree_edge> >; ColorMap = default_color_type*; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
147 | breadth_first_search(g, sources, sources + 1, Q, vis, color);
| ~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/edmonds_karp_max_flow.hpp:101:29: required from ‘typename boost::property_traits<IndexMap>::value_type boost::edmonds_karp_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, ColorMap, PredEdgeMap) [with Graph = adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, no_property, listS>; CapacityEdgeMap = adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map<directed_tag, detail::edge_desc_impl<directed_tag, long unsigned int>, detail::edge_desc_impl<directed_tag, long unsigned int>&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_reverse_t>; ColorMap = default_color_type*; PredEdgeMap = detail::edge_desc_impl<directed_tag, long unsigned int>*; typename property_traits<IndexMap>::value_type = long unsigned int; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
101 | breadth_first_search(detail::residual_graph(g, res), src, Q,
| ~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
102 | make_bfs_visitor(record_edge_predecessors(pred, on_tree_edge())),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
103 | color);
| ~~~~~~
mincut.hpp:78:21: required from ‘typename boost::graph_traits<G>::edges_size_type boost::min_cut(VertexListGraph&, OutputIterator, OutputIterator) [with VertexListGraph = R_adjacency_list<undirectedS, double>; OutputIterator = std::back_insert_iterator<std::vector<long unsigned int> >; typename graph_traits<G>::edges_size_type = long unsigned int]’
77 | alpha_S_k = edmonds_karp_max_flow
| ~~~~~~~~~~~~~~~~~~~~~
78 | (flow_g, p, k, cap, res_cap, rev_edge, &color[0], &pred[0]);
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
mincut.cpp:128:35: required from here
128 | dst cut_capacity = min_cut(g, std::back_inserter(s_set), std::back_inserter(vs_set) );
| ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
20 | ~usage_requirements() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::concepts::Graph<G>::~Graph() [with G = boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::no_property, boost::listS>, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long unsigned int, long unsigned int&, long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all>]’
37 | ~model()
| ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:66:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
66 | BOOST_CONCEPT_USAGE(Graph)
| ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::concepts::IncidenceGraph<boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::no_property, boost::listS>, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long unsigned int, long unsigned int&, long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::concepts::IncidenceGraph<boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::no_property, boost::listS>, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long unsigned int, long unsigned int&, long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all> > >]’
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:87:5: required from ‘struct boost::concepts::IncidenceGraph<boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::no_property, boost::listS>, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long unsigned int, long unsigned int&, long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:75:1: required from ‘struct boost::concepts::IncidenceGraphConcept<boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::no_property, boost::listS>, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long unsigned int, long unsigned int&, long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >’
75 | BOOST_concept(IncidenceGraph, (G)) : Graph< G >
| ^~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::concepts::IncidenceGraphConcept<boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::no_property, boost::listS>, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long unsigned int, long unsigned int&, long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >]’
32 | inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
| ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied<boost::concepts::IncidenceGraphConcept<boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::no_property, boost::listS>, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long unsigned int, long unsigned int&, long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all> > >::value’
44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:62:5: required from ‘void boost::breadth_first_visit(const IncidenceGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with IncidenceGraph = filtered_graph<adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, no_property, listS>, is_residual_edge<adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_residual_capacity_t> >, keep_all>; Buffer = queue<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > >; BFSVisitor = bfs_visitor<edge_predecessor_recorder<detail::edge_desc_impl<directed_tag, long unsigned int>*, on_tree_edge> >; ColorMap = default_color_type*; SourceIterator = long unsigned int*]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:136:24: required from ‘void boost::breadth_first_search(const VertexListGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph<adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, no_property, listS>, is_residual_edge<adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_residual_capacity_t> >, keep_all>; SourceIterator = long unsigned int*; Buffer = queue<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > >; BFSVisitor = bfs_visitor<edge_predecessor_recorder<detail::edge_desc_impl<directed_tag, long unsigned int>*, on_tree_edge> >; ColorMap = default_color_type*]’
136 | breadth_first_visit(g, sources_begin, sources_end, Q, vis, color);
| ~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:147:25: required from ‘void boost::breadth_first_search(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph<adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, no_property, listS>, is_residual_edge<adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_residual_capacity_t> >, keep_all>; Buffer = queue<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > >; BFSVisitor = bfs_visitor<edge_predecessor_recorder<detail::edge_desc_impl<directed_tag, long unsigned int>*, on_tree_edge> >; ColorMap = default_color_type*; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
147 | breadth_first_search(g, sources, sources + 1, Q, vis, color);
| ~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/edmonds_karp_max_flow.hpp:101:29: required from ‘typename boost::property_traits<IndexMap>::value_type boost::edmonds_karp_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, ColorMap, PredEdgeMap) [with Graph = adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, no_property, listS>; CapacityEdgeMap = adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map<directed_tag, detail::edge_desc_impl<directed_tag, long unsigned int>, detail::edge_desc_impl<directed_tag, long unsigned int>&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_reverse_t>; ColorMap = default_color_type*; PredEdgeMap = detail::edge_desc_impl<directed_tag, long unsigned int>*; typename property_traits<IndexMap>::value_type = long unsigned int; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
101 | breadth_first_search(detail::residual_graph(g, res), src, Q,
| ~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
102 | make_bfs_visitor(record_edge_predecessors(pred, on_tree_edge())),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
103 | color);
| ~~~~~~
mincut.hpp:78:21: required from ‘typename boost::graph_traits<G>::edges_size_type boost::min_cut(VertexListGraph&, OutputIterator, OutputIterator) [with VertexListGraph = R_adjacency_list<undirectedS, double>; OutputIterator = std::back_insert_iterator<std::vector<long unsigned int> >; typename graph_traits<G>::edges_size_type = long unsigned int]’
77 | alpha_S_k = edmonds_karp_max_flow
| ~~~~~~~~~~~~~~~~~~~~~
78 | (flow_g, p, k, cap, res_cap, rev_edge, &color[0], &pred[0]);
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
mincut.cpp:128:35: required from here
128 | dst cut_capacity = min_cut(g, std::back_inserter(s_set), std::back_inserter(vs_set) );
| ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
20 | ~usage_requirements() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::concepts::IncidenceGraph<G>::~IncidenceGraph() [with G = boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::no_property, boost::listS>, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long unsigned int, long unsigned int&, long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all>]’
37 | ~model()
| ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:87:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
87 | BOOST_CONCEPT_USAGE(IncidenceGraph)
| ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/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::bfs_visitor<boost::edge_predecessor_recorder<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>*, boost::on_tree_edge> > > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:167:5: required from ‘struct boost::CopyConstructible<boost::bfs_visitor<boost::edge_predecessor_recorder<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>*, boost::on_tree_edge> > >’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:165:3: required from ‘struct boost::CopyConstructibleConcept<boost::bfs_visitor<boost::edge_predecessor_recorder<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>*, boost::on_tree_edge> > >’
165 | BOOST_concept(CopyConstructible,(TT))
| ^~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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::bfs_visitor<boost::edge_predecessor_recorder<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>*, boost::on_tree_edge> > >]’
32 | inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
| ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied<boost::CopyConstructibleConcept<boost::bfs_visitor<boost::edge_predecessor_recorder<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>*, boost::on_tree_edge> > > >::value’
44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied<boost::CopyConstructibleConcept<boost::bfs_visitor<boost::edge_predecessor_recorder<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>*, boost::on_tree_edge> > > >’
45 | typedef boost::integral_constant<bool, value> type;
| ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 6 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:65:5: required from ‘void boost::breadth_first_visit(const IncidenceGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with IncidenceGraph = filtered_graph<adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, no_property, listS>, is_residual_edge<adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_residual_capacity_t> >, keep_all>; Buffer = queue<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > >; BFSVisitor = bfs_visitor<edge_predecessor_recorder<detail::edge_desc_impl<directed_tag, long unsigned int>*, on_tree_edge> >; ColorMap = default_color_type*; SourceIterator = long unsigned int*]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:136:24: required from ‘void boost::breadth_first_search(const VertexListGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph<adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, no_property, listS>, is_residual_edge<adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_residual_capacity_t> >, keep_all>; SourceIterator = long unsigned int*; Buffer = queue<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > >; BFSVisitor = bfs_visitor<edge_predecessor_recorder<detail::edge_desc_impl<directed_tag, long unsigned int>*, on_tree_edge> >; ColorMap = default_color_type*]’
136 | breadth_first_visit(g, sources_begin, sources_end, Q, vis, color);
| ~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:147:25: required from ‘void boost::breadth_first_search(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph<adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, no_property, listS>, is_residual_edge<adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_residual_capacity_t> >, keep_all>; Buffer = queue<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > >; BFSVisitor = bfs_visitor<edge_predecessor_recorder<detail::edge_desc_impl<directed_tag, long unsigned int>*, on_tree_edge> >; ColorMap = default_color_type*; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
147 | breadth_first_search(g, sources, sources + 1, Q, vis, color);
| ~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/edmonds_karp_max_flow.hpp:101:29: required from ‘typename boost::property_traits<IndexMap>::value_type boost::edmonds_karp_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, ColorMap, PredEdgeMap) [with Graph = adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, no_property, listS>; CapacityEdgeMap = adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map<directed_tag, detail::edge_desc_impl<directed_tag, long unsigned int>, detail::edge_desc_impl<directed_tag, long unsigned int>&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_reverse_t>; ColorMap = default_color_type*; PredEdgeMap = detail::edge_desc_impl<directed_tag, long unsigned int>*; typename property_traits<IndexMap>::value_type = long unsigned int; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
101 | breadth_first_search(detail::residual_graph(g, res), src, Q,
| ~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
102 | make_bfs_visitor(record_edge_predecessors(pred, on_tree_edge())),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
103 | color);
| ~~~~~~
mincut.hpp:78:21: required from ‘typename boost::graph_traits<G>::edges_size_type boost::min_cut(VertexListGraph&, OutputIterator, OutputIterator) [with VertexListGraph = R_adjacency_list<undirectedS, double>; OutputIterator = std::back_insert_iterator<std::vector<long unsigned int> >; typename graph_traits<G>::edges_size_type = long unsigned int]’
77 | alpha_S_k = edmonds_karp_max_flow
| ~~~~~~~~~~~~~~~~~~~~~
78 | (flow_g, p, k, cap, res_cap, rev_edge, &color[0], &pred[0]);
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
mincut.cpp:128:35: required from here
128 | dst cut_capacity = min_cut(g, std::back_inserter(s_set), std::back_inserter(vs_set) );
| ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/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::bfs_visitor<boost::edge_predecessor_recorder<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>*, boost::on_tree_edge> > >]’
20 | ~usage_requirements() { ((Model*)0)->~Model(); }
| ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/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::bfs_visitor<boost::edge_predecessor_recorder<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>*, boost::on_tree_edge> > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:39:9: required from ‘void boost::BFSVisitorConcept<Visitor, Graph>::constraints() [with Visitor = boost::bfs_visitor<boost::edge_predecessor_recorder<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>*, boost::on_tree_edge> >; Graph = boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::no_property, boost::listS>, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long unsigned int, long unsigned int&, long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all>]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::BFSVisitorConcept<boost::bfs_visitor<boost::edge_predecessor_recorder<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>*, boost::on_tree_edge> >, boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::no_property, boost::listS>, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long unsigned int, long unsigned int&, long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >]’
32 | inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
| ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied<boost::BFSVisitorConcept<boost::bfs_visitor<boost::edge_predecessor_recorder<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>*, boost::on_tree_edge> >, boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::no_property, boost::listS>, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long unsigned int, long unsigned int&, long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all> > >::value’
44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied<boost::BFSVisitorConcept<boost::bfs_visitor<boost::edge_predecessor_recorder<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>*, boost::on_tree_edge> >, boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::no_property, boost::listS>, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long unsigned int, long unsigned int&, long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all> > >’
45 | typedef boost::integral_constant<bool, value> type;
| ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_<void (*)(boost::BFSVisitorConcept<boost::bfs_visitor<boost::edge_predecessor_recorder<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>*, boost::on_tree_edge> >, boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::no_property, boost::listS>, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long unsigned int, long unsigned int&, long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >)>’
72 | struct requirement_<void(*)(Model)>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:65:5: required from ‘void boost::breadth_first_visit(const IncidenceGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with IncidenceGraph = filtered_graph<adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, no_property, listS>, is_residual_edge<adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_residual_capacity_t> >, keep_all>; Buffer = queue<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > >; BFSVisitor = bfs_visitor<edge_predecessor_recorder<detail::edge_desc_impl<directed_tag, long unsigned int>*, on_tree_edge> >; ColorMap = default_color_type*; SourceIterator = long unsigned int*]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:136:24: required from ‘void boost::breadth_first_search(const VertexListGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph<adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, no_property, listS>, is_residual_edge<adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_residual_capacity_t> >, keep_all>; SourceIterator = long unsigned int*; Buffer = queue<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > >; BFSVisitor = bfs_visitor<edge_predecessor_recorder<detail::edge_desc_impl<directed_tag, long unsigned int>*, on_tree_edge> >; ColorMap = default_color_type*]’
136 | breadth_first_visit(g, sources_begin, sources_end, Q, vis, color);
| ~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:147:25: required from ‘void boost::breadth_first_search(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph<adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, no_property, listS>, is_residual_edge<adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_residual_capacity_t> >, keep_all>; Buffer = queue<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > >; BFSVisitor = bfs_visitor<edge_predecessor_recorder<detail::edge_desc_impl<directed_tag, long unsigned int>*, on_tree_edge> >; ColorMap = default_color_type*; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
147 | breadth_first_search(g, sources, sources + 1, Q, vis, color);
| ~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/edmonds_karp_max_flow.hpp:101:29: required from ‘typename boost::property_traits<IndexMap>::value_type boost::edmonds_karp_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, ColorMap, PredEdgeMap) [with Graph = adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, no_property, listS>; CapacityEdgeMap = adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map<directed_tag, detail::edge_desc_impl<directed_tag, long unsigned int>, detail::edge_desc_impl<directed_tag, long unsigned int>&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_reverse_t>; ColorMap = default_color_type*; PredEdgeMap = detail::edge_desc_impl<directed_tag, long unsigned int>*; typename property_traits<IndexMap>::value_type = long unsigned int; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
101 | breadth_first_search(detail::residual_graph(g, res), src, Q,
| ~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
102 | make_bfs_visitor(record_edge_predecessors(pred, on_tree_edge())),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
103 | color);
| ~~~~~~
mincut.hpp:78:21: required from ‘typename boost::graph_traits<G>::edges_size_type boost::min_cut(VertexListGraph&, OutputIterator, OutputIterator) [with VertexListGraph = R_adjacency_list<undirectedS, double>; OutputIterator = std::back_insert_iterator<std::vector<long unsigned int> >; typename graph_traits<G>::edges_size_type = long unsigned int]’
77 | alpha_S_k = edmonds_karp_max_flow
| ~~~~~~~~~~~~~~~~~~~~~
78 | (flow_g, p, k, cap, res_cap, rev_edge, &color[0], &pred[0]);
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
mincut.cpp:128:35: required from here
128 | dst cut_capacity = min_cut(g, std::back_inserter(s_set), std::back_inserter(vs_set) );
| ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:165:17: note: in a call to non-static member function ‘boost::CopyConstructibleConcept<boost::bfs_visitor<boost::edge_predecessor_recorder<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>*, boost::on_tree_edge> > >::~CopyConstructibleConcept()’
165 | BOOST_concept(CopyConstructible,(TT))
| ^~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/preprocessor/cat.hpp:29:34: note: in definition of macro ‘BOOST_PP_CAT_I’
29 | # define BOOST_PP_CAT_I(a, b) a ## b
| ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/concept_def.hpp:23:12: note: in expansion of macro ‘BOOST_PP_CAT’
23 | struct BOOST_PP_CAT(name,Concept) \
| ^~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:165:3: note: in expansion of macro ‘BOOST_concept’
165 | BOOST_concept(CopyConstructible,(TT))
| ^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::constraint<Model>::failed() [with Model = boost::ReadablePropertyMapConcept<boost::default_color_type*, long unsigned int>]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:206:7: required from ‘void boost::ReadWritePropertyMapConcept<PMap, Key>::constraints() [with PMap = boost::default_color_type*; Key = long unsigned int]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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::default_color_type*, long unsigned int>]’
32 | inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
| ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied<boost::ReadWritePropertyMapConcept<boost::default_color_type*, long unsigned int> >::value’
44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied<boost::ReadWritePropertyMapConcept<boost::default_color_type*, long unsigned int> >’
45 | typedef boost::integral_constant<bool, value> type;
| ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_<void (*)(boost::ReadWritePropertyMapConcept<boost::default_color_type*, long unsigned int>)>’
72 | struct requirement_<void(*)(Model)>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:66:5: required from ‘void boost::breadth_first_visit(const IncidenceGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with IncidenceGraph = filtered_graph<adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, no_property, listS>, is_residual_edge<adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_residual_capacity_t> >, keep_all>; Buffer = queue<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > >; BFSVisitor = bfs_visitor<edge_predecessor_recorder<detail::edge_desc_impl<directed_tag, long unsigned int>*, on_tree_edge> >; ColorMap = default_color_type*; SourceIterator = long unsigned int*]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:136:24: required from ‘void boost::breadth_first_search(const VertexListGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph<adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, no_property, listS>, is_residual_edge<adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_residual_capacity_t> >, keep_all>; SourceIterator = long unsigned int*; Buffer = queue<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > >; BFSVisitor = bfs_visitor<edge_predecessor_recorder<detail::edge_desc_impl<directed_tag, long unsigned int>*, on_tree_edge> >; ColorMap = default_color_type*]’
136 | breadth_first_visit(g, sources_begin, sources_end, Q, vis, color);
| ~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:147:25: required from ‘void boost::breadth_first_search(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph<adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, no_property, listS>, is_residual_edge<adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_residual_capacity_t> >, keep_all>; Buffer = queue<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > >; BFSVisitor = bfs_visitor<edge_predecessor_recorder<detail::edge_desc_impl<directed_tag, long unsigned int>*, on_tree_edge> >; ColorMap = default_color_type*; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
147 | breadth_first_search(g, sources, sources + 1, Q, vis, color);
| ~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/edmonds_karp_max_flow.hpp:101:29: required from ‘typename boost::property_traits<IndexMap>::value_type boost::edmonds_karp_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, ColorMap, PredEdgeMap) [with Graph = adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, no_property, listS>; CapacityEdgeMap = adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map<directed_tag, detail::edge_desc_impl<directed_tag, long unsigned int>, detail::edge_desc_impl<directed_tag, long unsigned int>&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_reverse_t>; ColorMap = default_color_type*; PredEdgeMap = detail::edge_desc_impl<directed_tag, long unsigned int>*; typename property_traits<IndexMap>::value_type = long unsigned int; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
101 | breadth_first_search(detail::residual_graph(g, res), src, Q,
| ~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
102 | make_bfs_visitor(record_edge_predecessors(pred, on_tree_edge())),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
103 | color);
| ~~~~~~
mincut.hpp:78:21: required from ‘typename boost::graph_traits<G>::edges_size_type boost::min_cut(VertexListGraph&, OutputIterator, OutputIterator) [with VertexListGraph = R_adjacency_list<undirectedS, double>; OutputIterator = std::back_insert_iterator<std::vector<long unsigned int> >; typename graph_traits<G>::edges_size_type = long unsigned int]’
77 | alpha_S_k = edmonds_karp_max_flow
| ~~~~~~~~~~~~~~~~~~~~~
78 | (flow_g, p, k, cap, res_cap, rev_edge, &color[0], &pred[0]);
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
mincut.cpp:128:35: required from here
128 | dst cut_capacity = min_cut(g, std::back_inserter(s_set), std::back_inserter(vs_set) );
| ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:65:52: warning: ‘this’ pointer is null [-Wnonnull]
65 | static void failed() { ((Model*)0)->constraints(); }
| ~~~~~~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/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::default_color_type*; Key = long unsigned int]’
147 | void constraints() {
| ^~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::constraint<Model>::failed() [with Model = boost::WritablePropertyMapConcept<boost::default_color_type*, long unsigned int>]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:207:7: required from ‘void boost::ReadWritePropertyMapConcept<PMap, Key>::constraints() [with PMap = boost::default_color_type*; Key = long unsigned int]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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::default_color_type*, long unsigned int>]’
32 | inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
| ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied<boost::ReadWritePropertyMapConcept<boost::default_color_type*, long unsigned int> >::value’
44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied<boost::ReadWritePropertyMapConcept<boost::default_color_type*, long unsigned int> >’
45 | typedef boost::integral_constant<bool, value> type;
| ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_<void (*)(boost::ReadWritePropertyMapConcept<boost::default_color_type*, long unsigned int>)>’
72 | struct requirement_<void(*)(Model)>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:66:5: required from ‘void boost::breadth_first_visit(const IncidenceGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with IncidenceGraph = filtered_graph<adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, no_property, listS>, is_residual_edge<adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_residual_capacity_t> >, keep_all>; Buffer = queue<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > >; BFSVisitor = bfs_visitor<edge_predecessor_recorder<detail::edge_desc_impl<directed_tag, long unsigned int>*, on_tree_edge> >; ColorMap = default_color_type*; SourceIterator = long unsigned int*]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:136:24: required from ‘void boost::breadth_first_search(const VertexListGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph<adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, no_property, listS>, is_residual_edge<adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_residual_capacity_t> >, keep_all>; SourceIterator = long unsigned int*; Buffer = queue<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > >; BFSVisitor = bfs_visitor<edge_predecessor_recorder<detail::edge_desc_impl<directed_tag, long unsigned int>*, on_tree_edge> >; ColorMap = default_color_type*]’
136 | breadth_first_visit(g, sources_begin, sources_end, Q, vis, color);
| ~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:147:25: required from ‘void boost::breadth_first_search(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph<adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, no_property, listS>, is_residual_edge<adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_residual_capacity_t> >, keep_all>; Buffer = queue<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > >; BFSVisitor = bfs_visitor<edge_predecessor_recorder<detail::edge_desc_impl<directed_tag, long unsigned int>*, on_tree_edge> >; ColorMap = default_color_type*; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
147 | breadth_first_search(g, sources, sources + 1, Q, vis, color);
| ~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/edmonds_karp_max_flow.hpp:101:29: required from ‘typename boost::property_traits<IndexMap>::value_type boost::edmonds_karp_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, ColorMap, PredEdgeMap) [with Graph = adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, no_property, listS>; CapacityEdgeMap = adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map<directed_tag, detail::edge_desc_impl<directed_tag, long unsigned int>, detail::edge_desc_impl<directed_tag, long unsigned int>&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_reverse_t>; ColorMap = default_color_type*; PredEdgeMap = detail::edge_desc_impl<directed_tag, long unsigned int>*; typename property_traits<IndexMap>::value_type = long unsigned int; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
101 | breadth_first_search(detail::residual_graph(g, res), src, Q,
| ~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
102 | make_bfs_visitor(record_edge_predecessors(pred, on_tree_edge())),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
103 | color);
| ~~~~~~
mincut.hpp:78:21: required from ‘typename boost::graph_traits<G>::edges_size_type boost::min_cut(VertexListGraph&, OutputIterator, OutputIterator) [with VertexListGraph = R_adjacency_list<undirectedS, double>; OutputIterator = std::back_insert_iterator<std::vector<long unsigned int> >; typename graph_traits<G>::edges_size_type = long unsigned int]’
77 | alpha_S_k = edmonds_karp_max_flow
| ~~~~~~~~~~~~~~~~~~~~~
78 | (flow_g, p, k, cap, res_cap, rev_edge, &color[0], &pred[0]);
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
mincut.cpp:128:35: required from here
128 | dst cut_capacity = min_cut(g, std::back_inserter(s_set), std::back_inserter(vs_set) );
| ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:65:52: warning: ‘this’ pointer is null [-Wnonnull]
65 | static void failed() { ((Model*)0)->constraints(); }
| ~~~~~~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/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::default_color_type*; Key = long unsigned int]’
179 | void constraints() {
| ^~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Convertible<boost::lvalue_property_map_tag, boost::read_write_property_map_tag> >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/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> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/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))
| ^~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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);
| ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/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) );
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/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;
| ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 6 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:66:5: required from ‘void boost::breadth_first_visit(const IncidenceGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with IncidenceGraph = filtered_graph<adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, no_property, listS>, is_residual_edge<adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_residual_capacity_t> >, keep_all>; Buffer = queue<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > >; BFSVisitor = bfs_visitor<edge_predecessor_recorder<detail::edge_desc_impl<directed_tag, long unsigned int>*, on_tree_edge> >; ColorMap = default_color_type*; SourceIterator = long unsigned int*]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:136:24: required from ‘void boost::breadth_first_search(const VertexListGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph<adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, no_property, listS>, is_residual_edge<adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_residual_capacity_t> >, keep_all>; SourceIterator = long unsigned int*; Buffer = queue<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > >; BFSVisitor = bfs_visitor<edge_predecessor_recorder<detail::edge_desc_impl<directed_tag, long unsigned int>*, on_tree_edge> >; ColorMap = default_color_type*]’
136 | breadth_first_visit(g, sources_begin, sources_end, Q, vis, color);
| ~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:147:25: required from ‘void boost::breadth_first_search(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph<adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, no_property, listS>, is_residual_edge<adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_residual_capacity_t> >, keep_all>; Buffer = queue<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > >; BFSVisitor = bfs_visitor<edge_predecessor_recorder<detail::edge_desc_impl<directed_tag, long unsigned int>*, on_tree_edge> >; ColorMap = default_color_type*; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
147 | breadth_first_search(g, sources, sources + 1, Q, vis, color);
| ~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/edmonds_karp_max_flow.hpp:101:29: required from ‘typename boost::property_traits<IndexMap>::value_type boost::edmonds_karp_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, ColorMap, PredEdgeMap) [with Graph = adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, no_property, listS>; CapacityEdgeMap = adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map<directed_tag, detail::edge_desc_impl<directed_tag, long unsigned int>, detail::edge_desc_impl<directed_tag, long unsigned int>&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_reverse_t>; ColorMap = default_color_type*; PredEdgeMap = detail::edge_desc_impl<directed_tag, long unsigned int>*; typename property_traits<IndexMap>::value_type = long unsigned int; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
101 | breadth_first_search(detail::residual_graph(g, res), src, Q,
| ~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
102 | make_bfs_visitor(record_edge_predecessors(pred, on_tree_edge())),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
103 | color);
| ~~~~~~
mincut.hpp:78:21: required from ‘typename boost::graph_traits<G>::edges_size_type boost::min_cut(VertexListGraph&, OutputIterator, OutputIterator) [with VertexListGraph = R_adjacency_list<undirectedS, double>; OutputIterator = std::back_insert_iterator<std::vector<long unsigned int> >; typename graph_traits<G>::edges_size_type = long unsigned int]’
77 | alpha_S_k = edmonds_karp_max_flow
| ~~~~~~~~~~~~~~~~~~~~~
78 | (flow_g, p, k, cap, res_cap, rev_edge, &color[0], &pred[0]);
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
mincut.cpp:128:35: required from here
128 | dst cut_capacity = min_cut(g, std::back_inserter(s_set), std::back_inserter(vs_set) );
| ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Convertible<boost::lvalue_property_map_tag, boost::read_write_property_map_tag>]’
20 | ~usage_requirements() { ((Model*)0)->~Model(); }
| ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::ConvertibleConcept<boost::lvalue_property_map_tag, boost::read_write_property_map_tag>]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:208:7: required from ‘void boost::ReadWritePropertyMapConcept<PMap, Key>::constraints() [with PMap = boost::default_color_type*; Key = long unsigned int]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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::default_color_type*, long unsigned int>]’
32 | inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
| ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied<boost::ReadWritePropertyMapConcept<boost::default_color_type*, long unsigned int> >::value’
44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied<boost::ReadWritePropertyMapConcept<boost::default_color_type*, long unsigned int> >’
45 | typedef boost::integral_constant<bool, value> type;
| ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_<void (*)(boost::ReadWritePropertyMapConcept<boost::default_color_type*, long unsigned int>)>’
72 | struct requirement_<void(*)(Model)>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:66:5: required from ‘void boost::breadth_first_visit(const IncidenceGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with IncidenceGraph = filtered_graph<adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, no_property, listS>, is_residual_edge<adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_residual_capacity_t> >, keep_all>; Buffer = queue<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > >; BFSVisitor = bfs_visitor<edge_predecessor_recorder<detail::edge_desc_impl<directed_tag, long unsigned int>*, on_tree_edge> >; ColorMap = default_color_type*; SourceIterator = long unsigned int*]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:136:24: required from ‘void boost::breadth_first_search(const VertexListGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph<adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, no_property, listS>, is_residual_edge<adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_residual_capacity_t> >, keep_all>; SourceIterator = long unsigned int*; Buffer = queue<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > >; BFSVisitor = bfs_visitor<edge_predecessor_recorder<detail::edge_desc_impl<directed_tag, long unsigned int>*, on_tree_edge> >; ColorMap = default_color_type*]’
136 | breadth_first_visit(g, sources_begin, sources_end, Q, vis, color);
| ~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:147:25: required from ‘void boost::breadth_first_search(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph<adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, no_property, listS>, is_residual_edge<adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_residual_capacity_t> >, keep_all>; Buffer = queue<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > >; BFSVisitor = bfs_visitor<edge_predecessor_recorder<detail::edge_desc_impl<directed_tag, long unsigned int>*, on_tree_edge> >; ColorMap = default_color_type*; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
147 | breadth_first_search(g, sources, sources + 1, Q, vis, color);
| ~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/edmonds_karp_max_flow.hpp:101:29: required from ‘typename boost::property_traits<IndexMap>::value_type boost::edmonds_karp_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, ColorMap, PredEdgeMap) [with Graph = adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, no_property, listS>; CapacityEdgeMap = adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map<directed_tag, detail::edge_desc_impl<directed_tag, long unsigned int>, detail::edge_desc_impl<directed_tag, long unsigned int>&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_reverse_t>; ColorMap = default_color_type*; PredEdgeMap = detail::edge_desc_impl<directed_tag, long unsigned int>*; typename property_traits<IndexMap>::value_type = long unsigned int; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
101 | breadth_first_search(detail::residual_graph(g, res), src, Q,
| ~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
102 | make_bfs_visitor(record_edge_predecessors(pred, on_tree_edge())),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
103 | color);
| ~~~~~~
mincut.hpp:78:21: required from ‘typename boost::graph_traits<G>::edges_size_type boost::min_cut(VertexListGraph&, OutputIterator, OutputIterator) [with VertexListGraph = R_adjacency_list<undirectedS, double>; OutputIterator = std::back_insert_iterator<std::vector<long unsigned int> >; typename graph_traits<G>::edges_size_type = long unsigned int]’
77 | alpha_S_k = edmonds_karp_max_flow
| ~~~~~~~~~~~~~~~~~~~~~
78 | (flow_g, p, k, cap, res_cap, rev_edge, &color[0], &pred[0]);
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
mincut.cpp:128:35: required from here
128 | dst cut_capacity = min_cut(g, std::back_inserter(s_set), std::back_inserter(vs_set) );
| ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:206:17: note: in a call to non-static member function ‘boost::ConvertibleConcept<boost::lvalue_property_map_tag, boost::read_write_property_map_tag>::~ConvertibleConcept()’
206 | BOOST_concept(Convertible,(X)(Y))
| ^~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/preprocessor/cat.hpp:29:34: note: in definition of macro ‘BOOST_PP_CAT_I’
29 | # define BOOST_PP_CAT_I(a, b) a ## b
| ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/concept_def.hpp:23:12: note: in expansion of macro ‘BOOST_PP_CAT’
23 | struct BOOST_PP_CAT(name,Concept) \
| ^~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:206:3: note: in expansion of macro ‘BOOST_concept’
206 | BOOST_concept(Convertible,(X)(Y))
| ^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::SignedInteger<long int>]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:514:9: required from ‘boost::InputIterator<TT>::~InputIterator() [with TT = __gnu_cxx::__normal_iterator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>*, std::vector<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: required from ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::InputIterator<__gnu_cxx::__normal_iterator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>*, std::vector<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >]’
20 | ~usage_requirements() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/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<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>*, std::vector<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > > >]’
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:512:7: required from ‘struct boost::InputIterator<__gnu_cxx::__normal_iterator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>*, std::vector<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:540:3: required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>*, std::vector<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >’
540 | BOOST_concept(ForwardIterator,(TT))
| ^~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:568:3: [ skipping 6 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_<void (*)(boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>*, std::vector<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >)>’
72 | struct requirement_<void(*)(Model)>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map<RAIter, ID, Value, Value&> boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator<detail::edge_desc_impl<directed_tag, long unsigned int>*, std::vector<detail::edge_desc_impl<directed_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<directed_tag, long unsigned int> > > >; Value = detail::edge_desc_impl<directed_tag, long unsigned int>; ID = vec_adj_list_vertex_id_map<no_property, long unsigned int>]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/edmonds_karp_max_flow.hpp:209:43: required from ‘static typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::detail::edmonds_karp_dispatch1<boost::param_not_found>::apply(Graph&, typename boost::graph_traits<Graph>::vertex_descriptor, typename boost::graph_traits<Graph>::vertex_descriptor, const boost::bgl_named_params<T, Tag, Base>&, boost::param_not_found) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value<Graph, P, T, R>::type = double; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’
209 | make_iterator_property_map(pred_vec.begin(),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~
210 | choose_const_pmap(
| ~~~~~~~~~~~~~~~~~~
211 | get_param(params, vertex_index), g, vertex_index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
212 | pred_vec[0]),
| ~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/edmonds_karp_max_flow.hpp:228:57: required from ‘typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::edmonds_karp_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with Graph = adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value<Graph, P, T, R>::type = double; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
228 | return detail::edmonds_karp_dispatch1< Pred >::apply(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
229 | g, src, sink, params, get_param(params, vertex_predecessor));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/edmonds_karp_max_flow.hpp:240:33: required from ‘typename boost::property_traits<typename boost::property_map<Graph, boost::edge_capacity_t>::const_type>::value_type boost::edmonds_karp_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > > >; 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&, long unsigned int, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_capacity_t>; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
240 | return edmonds_karp_max_flow(g, src, sink, params);
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
mincut.cpp:76:45: required from here
76 | maxflow = edmonds_karp_max_flow(flow_g, s, t);
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:107:22: note: in a call to non-static member function ‘boost::SignedInteger<long int>::~SignedInteger()’
107 | template <> struct SignedInteger<long> {};
| ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Convertible<std::random_access_iterator_tag, std::input_iterator_tag> >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/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> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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);
| ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/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) );
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/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;
| ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/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)>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:515:9: [ skipping 11 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_<void (*)(boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>*, std::vector<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >)>’
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map<RAIter, ID, Value, Value&> boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator<detail::edge_desc_impl<directed_tag, long unsigned int>*, std::vector<detail::edge_desc_impl<directed_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<directed_tag, long unsigned int> > > >; Value = detail::edge_desc_impl<directed_tag, long unsigned int>; ID = vec_adj_list_vertex_id_map<no_property, long unsigned int>]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/edmonds_karp_max_flow.hpp:209:43: required from ‘static typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::detail::edmonds_karp_dispatch1<boost::param_not_found>::apply(Graph&, typename boost::graph_traits<Graph>::vertex_descriptor, typename boost::graph_traits<Graph>::vertex_descriptor, const boost::bgl_named_params<T, Tag, Base>&, boost::param_not_found) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value<Graph, P, T, R>::type = double; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’
209 | make_iterator_property_map(pred_vec.begin(),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~
210 | choose_const_pmap(
| ~~~~~~~~~~~~~~~~~~
211 | get_param(params, vertex_index), g, vertex_index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
212 | pred_vec[0]),
| ~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/edmonds_karp_max_flow.hpp:228:57: required from ‘typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::edmonds_karp_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with Graph = adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value<Graph, P, T, R>::type = double; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
228 | return detail::edmonds_karp_dispatch1< Pred >::apply(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
229 | g, src, sink, params, get_param(params, vertex_predecessor));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/edmonds_karp_max_flow.hpp:240:33: required from ‘typename boost::property_traits<typename boost::property_map<Graph, boost::edge_capacity_t>::const_type>::value_type boost::edmonds_karp_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > > >; 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&, long unsigned int, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_capacity_t>; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
240 | return edmonds_karp_max_flow(g, src, sink, params);
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
mincut.cpp:76:45: required from here
76 | maxflow = edmonds_karp_max_flow(flow_g, s, t);
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Convertible<std::random_access_iterator_tag, std::input_iterator_tag>]’
20 | ~usage_requirements() { ((Model*)0)->~Model(); }
| ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::Convertible<std::random_access_iterator_tag, std::input_iterator_tag>]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:515:9: required from ‘boost::InputIterator<TT>::~InputIterator() [with TT = __gnu_cxx::__normal_iterator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>*, std::vector<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: required from ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::InputIterator<__gnu_cxx::__normal_iterator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>*, std::vector<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >]’
20 | ~usage_requirements() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/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<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>*, std::vector<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > > >]’
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:512:7: required from ‘struct boost::InputIterator<__gnu_cxx::__normal_iterator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>*, std::vector<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:540:3: required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>*, std::vector<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >’
540 | BOOST_concept(ForwardIterator,(TT))
| ^~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:568:3: [ skipping 6 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_<void (*)(boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>*, std::vector<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >)>’
72 | struct requirement_<void(*)(Model)>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map<RAIter, ID, Value, Value&> boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator<detail::edge_desc_impl<directed_tag, long unsigned int>*, std::vector<detail::edge_desc_impl<directed_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<directed_tag, long unsigned int> > > >; Value = detail::edge_desc_impl<directed_tag, long unsigned int>; ID = vec_adj_list_vertex_id_map<no_property, long unsigned int>]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/edmonds_karp_max_flow.hpp:209:43: required from ‘static typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::detail::edmonds_karp_dispatch1<boost::param_not_found>::apply(Graph&, typename boost::graph_traits<Graph>::vertex_descriptor, typename boost::graph_traits<Graph>::vertex_descriptor, const boost::bgl_named_params<T, Tag, Base>&, boost::param_not_found) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value<Graph, P, T, R>::type = double; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’
209 | make_iterator_property_map(pred_vec.begin(),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~
210 | choose_const_pmap(
| ~~~~~~~~~~~~~~~~~~
211 | get_param(params, vertex_index), g, vertex_index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
212 | pred_vec[0]),
| ~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/edmonds_karp_max_flow.hpp:228:57: required from ‘typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::edmonds_karp_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with Graph = adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value<Graph, P, T, R>::type = double; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
228 | return detail::edmonds_karp_dispatch1< Pred >::apply(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
229 | g, src, sink, params, get_param(params, vertex_predecessor));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/edmonds_karp_max_flow.hpp:240:33: required from ‘typename boost::property_traits<typename boost::property_map<Graph, boost::edge_capacity_t>::const_type>::value_type boost::edmonds_karp_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > > >; 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&, long unsigned int, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_capacity_t>; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
240 | return edmonds_karp_max_flow(g, src, sink, params);
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
mincut.cpp:76:45: required from here
76 | maxflow = edmonds_karp_max_flow(flow_g, s, t);
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible<X, Y>::~Convertible() [with X = std::random_access_iterator_tag; Y = std::input_iterator_tag]’
37 | ~model()
| ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
208 | BOOST_CONCEPT_USAGE(Convertible) {
| ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Convertible<std::random_access_iterator_tag, std::forward_iterator_tag> >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/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> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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);
| ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/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) );
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/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;
| ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/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)>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:545:11: [ skipping 10 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_<void (*)(boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>*, std::vector<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >)>’
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map<RAIter, ID, Value, Value&> boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator<detail::edge_desc_impl<directed_tag, long unsigned int>*, std::vector<detail::edge_desc_impl<directed_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<directed_tag, long unsigned int> > > >; Value = detail::edge_desc_impl<directed_tag, long unsigned int>; ID = vec_adj_list_vertex_id_map<no_property, long unsigned int>]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/edmonds_karp_max_flow.hpp:209:43: required from ‘static typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::detail::edmonds_karp_dispatch1<boost::param_not_found>::apply(Graph&, typename boost::graph_traits<Graph>::vertex_descriptor, typename boost::graph_traits<Graph>::vertex_descriptor, const boost::bgl_named_params<T, Tag, Base>&, boost::param_not_found) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value<Graph, P, T, R>::type = double; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’
209 | make_iterator_property_map(pred_vec.begin(),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~
210 | choose_const_pmap(
| ~~~~~~~~~~~~~~~~~~
211 | get_param(params, vertex_index), g, vertex_index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
212 | pred_vec[0]),
| ~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/edmonds_karp_max_flow.hpp:228:57: required from ‘typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::edmonds_karp_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with Graph = adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value<Graph, P, T, R>::type = double; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
228 | return detail::edmonds_karp_dispatch1< Pred >::apply(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
229 | g, src, sink, params, get_param(params, vertex_predecessor));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/edmonds_karp_max_flow.hpp:240:33: required from ‘typename boost::property_traits<typename boost::property_map<Graph, boost::edge_capacity_t>::const_type>::value_type boost::edmonds_karp_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > > >; 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&, long unsigned int, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_capacity_t>; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
240 | return edmonds_karp_max_flow(g, src, sink, params);
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
mincut.cpp:76:45: required from here
76 | maxflow = edmonds_karp_max_flow(flow_g, s, t);
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Convertible<std::random_access_iterator_tag, std::forward_iterator_tag>]’
20 | ~usage_requirements() { ((Model*)0)->~Model(); }
| ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::Convertible<std::random_access_iterator_tag, std::forward_iterator_tag>]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:545:11: required from ‘boost::ForwardIterator<TT>::~ForwardIterator() [with TT = __gnu_cxx::__normal_iterator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>*, std::vector<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: required from ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::ForwardIterator<__gnu_cxx::__normal_iterator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>*, std::vector<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >]’
20 | ~usage_requirements() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/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<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>*, std::vector<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > > >]’
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:543:7: required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>*, std::vector<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>*, std::vector<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >’
568 | BOOST_concept(BidirectionalIterator,(TT))
| ^~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3: [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_<void (*)(boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>*, std::vector<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >)>’
72 | struct requirement_<void(*)(Model)>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map<RAIter, ID, Value, Value&> boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator<detail::edge_desc_impl<directed_tag, long unsigned int>*, std::vector<detail::edge_desc_impl<directed_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<directed_tag, long unsigned int> > > >; Value = detail::edge_desc_impl<directed_tag, long unsigned int>; ID = vec_adj_list_vertex_id_map<no_property, long unsigned int>]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/edmonds_karp_max_flow.hpp:209:43: required from ‘static typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::detail::edmonds_karp_dispatch1<boost::param_not_found>::apply(Graph&, typename boost::graph_traits<Graph>::vertex_descriptor, typename boost::graph_traits<Graph>::vertex_descriptor, const boost::bgl_named_params<T, Tag, Base>&, boost::param_not_found) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value<Graph, P, T, R>::type = double; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’
209 | make_iterator_property_map(pred_vec.begin(),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~
210 | choose_const_pmap(
| ~~~~~~~~~~~~~~~~~~
211 | get_param(params, vertex_index), g, vertex_index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
212 | pred_vec[0]),
| ~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/edmonds_karp_max_flow.hpp:228:57: required from ‘typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::edmonds_karp_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with Graph = adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value<Graph, P, T, R>::type = double; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
228 | return detail::edmonds_karp_dispatch1< Pred >::apply(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
229 | g, src, sink, params, get_param(params, vertex_predecessor));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/edmonds_karp_max_flow.hpp:240:33: required from ‘typename boost::property_traits<typename boost::property_map<Graph, boost::edge_capacity_t>::const_type>::value_type boost::edmonds_karp_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > > >; 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&, long unsigned int, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_capacity_t>; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
240 | return edmonds_karp_max_flow(g, src, sink, params);
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
mincut.cpp:76:45: required from here
76 | maxflow = edmonds_karp_max_flow(flow_g, s, t);
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible<X, Y>::~Convertible() [with X = std::random_access_iterator_tag; Y = std::forward_iterator_tag]’
37 | ~model()
| ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
208 | BOOST_CONCEPT_USAGE(Convertible) {
| ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Convertible<std::random_access_iterator_tag, std::bidirectional_iterator_tag> >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/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> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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);
| ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/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) );
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/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;
| ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/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)>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:573:11: [ skipping 9 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_<void (*)(boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>*, std::vector<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >)>’
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map<RAIter, ID, Value, Value&> boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator<detail::edge_desc_impl<directed_tag, long unsigned int>*, std::vector<detail::edge_desc_impl<directed_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<directed_tag, long unsigned int> > > >; Value = detail::edge_desc_impl<directed_tag, long unsigned int>; ID = vec_adj_list_vertex_id_map<no_property, long unsigned int>]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/edmonds_karp_max_flow.hpp:209:43: required from ‘static typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::detail::edmonds_karp_dispatch1<boost::param_not_found>::apply(Graph&, typename boost::graph_traits<Graph>::vertex_descriptor, typename boost::graph_traits<Graph>::vertex_descriptor, const boost::bgl_named_params<T, Tag, Base>&, boost::param_not_found) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value<Graph, P, T, R>::type = double; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’
209 | make_iterator_property_map(pred_vec.begin(),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~
210 | choose_const_pmap(
| ~~~~~~~~~~~~~~~~~~
211 | get_param(params, vertex_index), g, vertex_index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
212 | pred_vec[0]),
| ~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/edmonds_karp_max_flow.hpp:228:57: required from ‘typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::edmonds_karp_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with Graph = adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value<Graph, P, T, R>::type = double; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
228 | return detail::edmonds_karp_dispatch1< Pred >::apply(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
229 | g, src, sink, params, get_param(params, vertex_predecessor));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/edmonds_karp_max_flow.hpp:240:33: required from ‘typename boost::property_traits<typename boost::property_map<Graph, boost::edge_capacity_t>::const_type>::value_type boost::edmonds_karp_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > > >; 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&, long unsigned int, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_capacity_t>; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
240 | return edmonds_karp_max_flow(g, src, sink, params);
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
mincut.cpp:76:45: required from here
76 | maxflow = edmonds_karp_max_flow(flow_g, s, t);
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Convertible<std::random_access_iterator_tag, std::bidirectional_iterator_tag>]’
20 | ~usage_requirements() { ((Model*)0)->~Model(); }
| ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::Convertible<std::random_access_iterator_tag, std::bidirectional_iterator_tag>]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:573:11: required from ‘boost::BidirectionalIterator<TT>::~BidirectionalIterator() [with TT = __gnu_cxx::__normal_iterator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>*, std::vector<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: required from ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::BidirectionalIterator<__gnu_cxx::__normal_iterator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>*, std::vector<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >]’
20 | ~usage_requirements() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/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<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>*, std::vector<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > > >]’
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:571:7: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>*, std::vector<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>*, std::vector<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >’
597 | BOOST_concept(RandomAccessIterator,(TT))
| ^~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3: [ skipping 4 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_<void (*)(boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>*, std::vector<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >)>’
72 | struct requirement_<void(*)(Model)>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map<RAIter, ID, Value, Value&> boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator<detail::edge_desc_impl<directed_tag, long unsigned int>*, std::vector<detail::edge_desc_impl<directed_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<directed_tag, long unsigned int> > > >; Value = detail::edge_desc_impl<directed_tag, long unsigned int>; ID = vec_adj_list_vertex_id_map<no_property, long unsigned int>]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/edmonds_karp_max_flow.hpp:209:43: required from ‘static typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::detail::edmonds_karp_dispatch1<boost::param_not_found>::apply(Graph&, typename boost::graph_traits<Graph>::vertex_descriptor, typename boost::graph_traits<Graph>::vertex_descriptor, const boost::bgl_named_params<T, Tag, Base>&, boost::param_not_found) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value<Graph, P, T, R>::type = double; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’
209 | make_iterator_property_map(pred_vec.begin(),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~
210 | choose_const_pmap(
| ~~~~~~~~~~~~~~~~~~
211 | get_param(params, vertex_index), g, vertex_index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
212 | pred_vec[0]),
| ~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/edmonds_karp_max_flow.hpp:228:57: required from ‘typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::edmonds_karp_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with Graph = adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value<Graph, P, T, R>::type = double; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
228 | return detail::edmonds_karp_dispatch1< Pred >::apply(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
229 | g, src, sink, params, get_param(params, vertex_predecessor));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/edmonds_karp_max_flow.hpp:240:33: required from ‘typename boost::property_traits<typename boost::property_map<Graph, boost::edge_capacity_t>::const_type>::value_type boost::edmonds_karp_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > > >; 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&, long unsigned int, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_capacity_t>; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
240 | return edmonds_karp_max_flow(g, src, sink, params);
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
mincut.cpp:76:45: required from here
76 | maxflow = edmonds_karp_max_flow(flow_g, s, t);
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible<X, Y>::~Convertible() [with X = std::random_access_iterator_tag; Y = std::bidirectional_iterator_tag]’
37 | ~model()
| ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
208 | BOOST_CONCEPT_USAGE(Convertible) {
| ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Convertible<std::random_access_iterator_tag, std::random_access_iterator_tag>]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/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(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/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> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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);
| ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/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) );
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/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;
| ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:597:3: required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>*, std::vector<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >]’
597 | BOOST_concept(RandomAccessIterator,(TT))
| ^~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map<RAIter, ID, Value, Value&> boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator<detail::edge_desc_impl<directed_tag, long unsigned int>*, std::vector<detail::edge_desc_impl<directed_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<directed_tag, long unsigned int> > > >; Value = detail::edge_desc_impl<directed_tag, long unsigned int>; ID = vec_adj_list_vertex_id_map<no_property, long unsigned int>]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/edmonds_karp_max_flow.hpp:209:43: required from ‘static typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::detail::edmonds_karp_dispatch1<boost::param_not_found>::apply(Graph&, typename boost::graph_traits<Graph>::vertex_descriptor, typename boost::graph_traits<Graph>::vertex_descriptor, const boost::bgl_named_params<T, Tag, Base>&, boost::param_not_found) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value<Graph, P, T, R>::type = double; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’
209 | make_iterator_property_map(pred_vec.begin(),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~
210 | choose_const_pmap(
| ~~~~~~~~~~~~~~~~~~
211 | get_param(params, vertex_index), g, vertex_index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
212 | pred_vec[0]),
| ~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/edmonds_karp_max_flow.hpp:228:57: required from ‘typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::edmonds_karp_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with Graph = adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value<Graph, P, T, R>::type = double; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
228 | return detail::edmonds_karp_dispatch1< Pred >::apply(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
229 | g, src, sink, params, get_param(params, vertex_predecessor));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/edmonds_karp_max_flow.hpp:240:33: required from ‘typename boost::property_traits<typename boost::property_map<Graph, boost::edge_capacity_t>::const_type>::value_type boost::edmonds_karp_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > > >; 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&, long unsigned int, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_capacity_t>; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
240 | return edmonds_karp_max_flow(g, src, sink, params);
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
mincut.cpp:76:45: required from here
76 | maxflow = edmonds_karp_max_flow(flow_g, s, t);
| ~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
20 | ~usage_requirements() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible<X, Y>::~Convertible() [with X = std::random_access_iterator_tag; Y = std::random_access_iterator_tag]’
37 | ~model()
| ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
208 | BOOST_CONCEPT_USAGE(Convertible) {
| ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::concepts::MultiPassInputIterator<boost::iterators::filter_iterator<boost::detail::out_edge_predicate<boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long unsigned int, long unsigned int&, long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::no_property, boost::listS>, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long unsigned int, long unsigned int&, long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int> > > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:52:50: required from ‘struct boost::concepts::MultiPassInputIterator<boost::iterators::filter_iterator<boost::detail::out_edge_predicate<boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long unsigned int, long unsigned int&, long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::no_property, boost::listS>, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long unsigned int, long unsigned int&, long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int> > >’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::concepts::MultiPassInputIterator<boost::iterators::filter_iterator<boost::detail::out_edge_predicate<boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long unsigned int, long unsigned int&, long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::no_property, boost::listS>, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long unsigned int, long unsigned int&, long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int> > >]’
32 | inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
| ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied<boost::concepts::MultiPassInputIterator<boost::iterators::filter_iterator<boost::detail::out_edge_predicate<boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long unsigned int, long unsigned int&, long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::no_property, boost::listS>, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long unsigned int, long unsigned int&, long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int> > > >::value’
44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied<boost::concepts::MultiPassInputIterator<boost::iterators::filter_iterator<boost::detail::out_edge_predicate<boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long unsigned int, long unsigned int&, long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::no_property, boost::listS>, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long unsigned int, long unsigned int&, long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int> > > >’
45 | typedef boost::integral_constant<bool, value> type;
| ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_<void (*)(boost::concepts::MultiPassInputIterator<boost::iterators::filter_iterator<boost::detail::out_edge_predicate<boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long unsigned int, long unsigned int&, long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::no_property, boost::listS>, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long unsigned int, long unsigned int&, long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int> > >)>’
72 | struct requirement_<void(*)(Model)>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:89:9: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:62:5: required from ‘void boost::breadth_first_visit(const IncidenceGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with IncidenceGraph = filtered_graph<adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, no_property, listS>, is_residual_edge<adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_residual_capacity_t> >, keep_all>; Buffer = queue<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > >; BFSVisitor = bfs_visitor<edge_predecessor_recorder<detail::edge_desc_impl<directed_tag, long unsigned int>*, on_tree_edge> >; ColorMap = default_color_type*; SourceIterator = long unsigned int*]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:136:24: required from ‘void boost::breadth_first_search(const VertexListGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph<adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, no_property, listS>, is_residual_edge<adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_residual_capacity_t> >, keep_all>; SourceIterator = long unsigned int*; Buffer = queue<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > >; BFSVisitor = bfs_visitor<edge_predecessor_recorder<detail::edge_desc_impl<directed_tag, long unsigned int>*, on_tree_edge> >; ColorMap = default_color_type*]’
136 | breadth_first_visit(g, sources_begin, sources_end, Q, vis, color);
| ~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:147:25: required from ‘void boost::breadth_first_search(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph<adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, no_property, listS>, is_residual_edge<adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_residual_capacity_t> >, keep_all>; Buffer = queue<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > >; BFSVisitor = bfs_visitor<edge_predecessor_recorder<detail::edge_desc_impl<directed_tag, long unsigned int>*, on_tree_edge> >; ColorMap = default_color_type*; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
147 | breadth_first_search(g, sources, sources + 1, Q, vis, color);
| ~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/edmonds_karp_max_flow.hpp:101:29: required from ‘typename boost::property_traits<IndexMap>::value_type boost::edmonds_karp_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, ColorMap, PredEdgeMap) [with Graph = adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, no_property, listS>; CapacityEdgeMap = adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map<directed_tag, detail::edge_desc_impl<directed_tag, long unsigned int>, detail::edge_desc_impl<directed_tag, long unsigned int>&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_reverse_t>; ColorMap = default_color_type*; PredEdgeMap = detail::edge_desc_impl<directed_tag, long unsigned int>*; typename property_traits<IndexMap>::value_type = long unsigned int; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
101 | breadth_first_search(detail::residual_graph(g, res), src, Q,
| ~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
102 | make_bfs_visitor(record_edge_predecessors(pred, on_tree_edge())),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
103 | color);
| ~~~~~~
mincut.hpp:78:21: required from ‘typename boost::graph_traits<G>::edges_size_type boost::min_cut(VertexListGraph&, OutputIterator, OutputIterator) [with VertexListGraph = R_adjacency_list<undirectedS, double>; OutputIterator = std::back_insert_iterator<std::vector<long unsigned int> >; typename graph_traits<G>::edges_size_type = long unsigned int]’
77 | alpha_S_k = edmonds_karp_max_flow
| ~~~~~~~~~~~~~~~~~~~~~
78 | (flow_g, p, k, cap, res_cap, rev_edge, &color[0], &pred[0]);
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
mincut.cpp:128:35: required from here
128 | dst cut_capacity = min_cut(g, std::back_inserter(s_set), std::back_inserter(vs_set) );
| ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::concepts::MultiPassInputIterator<boost::iterators::filter_iterator<boost::detail::out_edge_predicate<boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long unsigned int, long unsigned int&, long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::no_property, boost::listS>, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long unsigned int, long unsigned int&, long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int> > >]’
20 | ~usage_requirements() { ((Model*)0)->~Model(); }
| ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::MultiPassInputIterator<boost::iterators::filter_iterator<boost::detail::out_edge_predicate<boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long unsigned int, long unsigned int&, long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::no_property, boost::listS>, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long unsigned int, long unsigned int&, long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int> > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:89:9: required from ‘boost::concepts::IncidenceGraph<G>::~IncidenceGraph() [with G = boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::no_property, boost::listS>, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long unsigned int, long unsigned int&, long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all>]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:75:1: required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::IncidenceGraphConcept<boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::no_property, boost::listS>, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long unsigned int, long unsigned int&, long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >]’
75 | BOOST_concept(IncidenceGraph, (G)) : Graph< G >
| ^~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:62:5: required from ‘void boost::breadth_first_visit(const IncidenceGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with IncidenceGraph = filtered_graph<adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, no_property, listS>, is_residual_edge<adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_residual_capacity_t> >, keep_all>; Buffer = queue<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > >; BFSVisitor = bfs_visitor<edge_predecessor_recorder<detail::edge_desc_impl<directed_tag, long unsigned int>*, on_tree_edge> >; ColorMap = default_color_type*; SourceIterator = long unsigned int*]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:136:24: required from ‘void boost::breadth_first_search(const VertexListGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph<adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, no_property, listS>, is_residual_edge<adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_residual_capacity_t> >, keep_all>; SourceIterator = long unsigned int*; Buffer = queue<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > >; BFSVisitor = bfs_visitor<edge_predecessor_recorder<detail::edge_desc_impl<directed_tag, long unsigned int>*, on_tree_edge> >; ColorMap = default_color_type*]’
136 | breadth_first_visit(g, sources_begin, sources_end, Q, vis, color);
| ~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:147:25: required from ‘void boost::breadth_first_search(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph<adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, no_property, listS>, is_residual_edge<adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_residual_capacity_t> >, keep_all>; Buffer = queue<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > >; BFSVisitor = bfs_visitor<edge_predecessor_recorder<detail::edge_desc_impl<directed_tag, long unsigned int>*, on_tree_edge> >; ColorMap = default_color_type*; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
147 | breadth_first_search(g, sources, sources + 1, Q, vis, color);
| ~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/edmonds_karp_max_flow.hpp:101:29: required from ‘typename boost::property_traits<IndexMap>::value_type boost::edmonds_karp_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, ColorMap, PredEdgeMap) [with Graph = adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, no_property, listS>; CapacityEdgeMap = adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map<directed_tag, detail::edge_desc_impl<directed_tag, long unsigned int>, detail::edge_desc_impl<directed_tag, long unsigned int>&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_reverse_t>; ColorMap = default_color_type*; PredEdgeMap = detail::edge_desc_impl<directed_tag, long unsigned int>*; typename property_traits<IndexMap>::value_type = long unsigned int; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
101 | breadth_first_search(detail::residual_graph(g, res), src, Q,
| ~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
102 | make_bfs_visitor(record_edge_predecessors(pred, on_tree_edge())),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
103 | color);
| ~~~~~~
mincut.hpp:78:21: required from ‘typename boost::graph_traits<G>::edges_size_type boost::min_cut(VertexListGraph&, OutputIterator, OutputIterator) [with VertexListGraph = R_adjacency_list<undirectedS, double>; OutputIterator = std::back_insert_iterator<std::vector<long unsigned int> >; typename graph_traits<G>::edges_size_type = long unsigned int]’
77 | alpha_S_k = edmonds_karp_max_flow
| ~~~~~~~~~~~~~~~~~~~~~
78 | (flow_g, p, k, cap, res_cap, rev_edge, &color[0], &pred[0]);
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
mincut.cpp:128:35: required from here
128 | dst cut_capacity = min_cut(g, std::back_inserter(s_set), std::back_inserter(vs_set) );
| ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::concepts::MultiPassInputIterator<T>::~MultiPassInputIterator() [with T = boost::iterators::filter_iterator<boost::detail::out_edge_predicate<boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long unsigned int, long unsigned int&, long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all, boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::no_property, boost::listS>, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long unsigned int, long unsigned int&, long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >*, std::vector<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >, std::allocator<boost::detail::stored_edge_property<long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > > > > >, long unsigned int, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, long int> >]’
37 | ~model()
| ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:52:50: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
52 | BOOST_concept(MultiPassInputIterator, (T)) { BOOST_CONCEPT_USAGE(
| ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::DefaultConstructible<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:137:5: required from ‘struct boost::DefaultConstructible<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> >’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::DefaultConstructible<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> >]’
32 | inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
| ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied<boost::DefaultConstructible<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > >::value’
44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied<boost::DefaultConstructible<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > >’
45 | typedef boost::integral_constant<bool, value> type;
| ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_<void (*)(boost::DefaultConstructible<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> >)>’
72 | struct requirement_<void(*)(Model)>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:90:9: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:62:5: required from ‘void boost::breadth_first_visit(const IncidenceGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with IncidenceGraph = filtered_graph<adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, no_property, listS>, is_residual_edge<adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_residual_capacity_t> >, keep_all>; Buffer = queue<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > >; BFSVisitor = bfs_visitor<edge_predecessor_recorder<detail::edge_desc_impl<directed_tag, long unsigned int>*, on_tree_edge> >; ColorMap = default_color_type*; SourceIterator = long unsigned int*]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:136:24: required from ‘void boost::breadth_first_search(const VertexListGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph<adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, no_property, listS>, is_residual_edge<adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_residual_capacity_t> >, keep_all>; SourceIterator = long unsigned int*; Buffer = queue<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > >; BFSVisitor = bfs_visitor<edge_predecessor_recorder<detail::edge_desc_impl<directed_tag, long unsigned int>*, on_tree_edge> >; ColorMap = default_color_type*]’
136 | breadth_first_visit(g, sources_begin, sources_end, Q, vis, color);
| ~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:147:25: required from ‘void boost::breadth_first_search(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph<adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, no_property, listS>, is_residual_edge<adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_residual_capacity_t> >, keep_all>; Buffer = queue<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > >; BFSVisitor = bfs_visitor<edge_predecessor_recorder<detail::edge_desc_impl<directed_tag, long unsigned int>*, on_tree_edge> >; ColorMap = default_color_type*; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
147 | breadth_first_search(g, sources, sources + 1, Q, vis, color);
| ~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/edmonds_karp_max_flow.hpp:101:29: required from ‘typename boost::property_traits<IndexMap>::value_type boost::edmonds_karp_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, ColorMap, PredEdgeMap) [with Graph = adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, no_property, listS>; CapacityEdgeMap = adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map<directed_tag, detail::edge_desc_impl<directed_tag, long unsigned int>, detail::edge_desc_impl<directed_tag, long unsigned int>&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_reverse_t>; ColorMap = default_color_type*; PredEdgeMap = detail::edge_desc_impl<directed_tag, long unsigned int>*; typename property_traits<IndexMap>::value_type = long unsigned int; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
101 | breadth_first_search(detail::residual_graph(g, res), src, Q,
| ~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
102 | make_bfs_visitor(record_edge_predecessors(pred, on_tree_edge())),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
103 | color);
| ~~~~~~
mincut.hpp:78:21: required from ‘typename boost::graph_traits<G>::edges_size_type boost::min_cut(VertexListGraph&, OutputIterator, OutputIterator) [with VertexListGraph = R_adjacency_list<undirectedS, double>; OutputIterator = std::back_insert_iterator<std::vector<long unsigned int> >; typename graph_traits<G>::edges_size_type = long unsigned int]’
77 | alpha_S_k = edmonds_karp_max_flow
| ~~~~~~~~~~~~~~~~~~~~~
78 | (flow_g, p, k, cap, res_cap, rev_edge, &color[0], &pred[0]);
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
mincut.cpp:128:35: required from here
128 | dst cut_capacity = min_cut(g, std::back_inserter(s_set), std::back_inserter(vs_set) );
| ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::DefaultConstructible<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> >]’
20 | ~usage_requirements() { ((Model*)0)->~Model(); }
| ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::DefaultConstructible<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:90:9: required from ‘boost::concepts::IncidenceGraph<G>::~IncidenceGraph() [with G = boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::no_property, boost::listS>, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long unsigned int, long unsigned int&, long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all>]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:75:1: required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::IncidenceGraphConcept<boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::no_property, boost::listS>, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long unsigned int, long unsigned int&, long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >]’
75 | BOOST_concept(IncidenceGraph, (G)) : Graph< G >
| ^~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:62:5: required from ‘void boost::breadth_first_visit(const IncidenceGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with IncidenceGraph = filtered_graph<adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, no_property, listS>, is_residual_edge<adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_residual_capacity_t> >, keep_all>; Buffer = queue<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > >; BFSVisitor = bfs_visitor<edge_predecessor_recorder<detail::edge_desc_impl<directed_tag, long unsigned int>*, on_tree_edge> >; ColorMap = default_color_type*; SourceIterator = long unsigned int*]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:136:24: required from ‘void boost::breadth_first_search(const VertexListGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph<adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, no_property, listS>, is_residual_edge<adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_residual_capacity_t> >, keep_all>; SourceIterator = long unsigned int*; Buffer = queue<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > >; BFSVisitor = bfs_visitor<edge_predecessor_recorder<detail::edge_desc_impl<directed_tag, long unsigned int>*, on_tree_edge> >; ColorMap = default_color_type*]’
136 | breadth_first_visit(g, sources_begin, sources_end, Q, vis, color);
| ~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:147:25: required from ‘void boost::breadth_first_search(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph<adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, no_property, listS>, is_residual_edge<adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_residual_capacity_t> >, keep_all>; Buffer = queue<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > >; BFSVisitor = bfs_visitor<edge_predecessor_recorder<detail::edge_desc_impl<directed_tag, long unsigned int>*, on_tree_edge> >; ColorMap = default_color_type*; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
147 | breadth_first_search(g, sources, sources + 1, Q, vis, color);
| ~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/edmonds_karp_max_flow.hpp:101:29: required from ‘typename boost::property_traits<IndexMap>::value_type boost::edmonds_karp_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, ColorMap, PredEdgeMap) [with Graph = adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, no_property, listS>; CapacityEdgeMap = adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map<directed_tag, detail::edge_desc_impl<directed_tag, long unsigned int>, detail::edge_desc_impl<directed_tag, long unsigned int>&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_reverse_t>; ColorMap = default_color_type*; PredEdgeMap = detail::edge_desc_impl<directed_tag, long unsigned int>*; typename property_traits<IndexMap>::value_type = long unsigned int; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
101 | breadth_first_search(detail::residual_graph(g, res), src, Q,
| ~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
102 | make_bfs_visitor(record_edge_predecessors(pred, on_tree_edge())),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
103 | color);
| ~~~~~~
mincut.hpp:78:21: required from ‘typename boost::graph_traits<G>::edges_size_type boost::min_cut(VertexListGraph&, OutputIterator, OutputIterator) [with VertexListGraph = R_adjacency_list<undirectedS, double>; OutputIterator = std::back_insert_iterator<std::vector<long unsigned int> >; typename graph_traits<G>::edges_size_type = long unsigned int]’
77 | alpha_S_k = edmonds_karp_max_flow
| ~~~~~~~~~~~~~~~~~~~~~
78 | (flow_g, p, k, cap, res_cap, rev_edge, &color[0], &pred[0]);
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
mincut.cpp:128:35: required from here
128 | dst cut_capacity = min_cut(g, std::back_inserter(s_set), std::back_inserter(vs_set) );
| ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::DefaultConstructible<TT>::~DefaultConstructible() [with TT = boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>]’
37 | ~model()
| ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:137:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
137 | BOOST_CONCEPT_USAGE(DefaultConstructible) {
| ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::EqualityComparable<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> >’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::EqualityComparable<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> >]’
32 | inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
| ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied<boost::EqualityComparable<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > >::value’
44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied<boost::EqualityComparable<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > >’
45 | typedef boost::integral_constant<bool, value> type;
| ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_<void (*)(boost::EqualityComparable<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> >)>’
72 | struct requirement_<void(*)(Model)>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:91:9: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:62:5: required from ‘void boost::breadth_first_visit(const IncidenceGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with IncidenceGraph = filtered_graph<adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, no_property, listS>, is_residual_edge<adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_residual_capacity_t> >, keep_all>; Buffer = queue<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > >; BFSVisitor = bfs_visitor<edge_predecessor_recorder<detail::edge_desc_impl<directed_tag, long unsigned int>*, on_tree_edge> >; ColorMap = default_color_type*; SourceIterator = long unsigned int*]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:136:24: required from ‘void boost::breadth_first_search(const VertexListGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph<adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, no_property, listS>, is_residual_edge<adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_residual_capacity_t> >, keep_all>; SourceIterator = long unsigned int*; Buffer = queue<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > >; BFSVisitor = bfs_visitor<edge_predecessor_recorder<detail::edge_desc_impl<directed_tag, long unsigned int>*, on_tree_edge> >; ColorMap = default_color_type*]’
136 | breadth_first_visit(g, sources_begin, sources_end, Q, vis, color);
| ~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:147:25: required from ‘void boost::breadth_first_search(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph<adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, no_property, listS>, is_residual_edge<adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_residual_capacity_t> >, keep_all>; Buffer = queue<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > >; BFSVisitor = bfs_visitor<edge_predecessor_recorder<detail::edge_desc_impl<directed_tag, long unsigned int>*, on_tree_edge> >; ColorMap = default_color_type*; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
147 | breadth_first_search(g, sources, sources + 1, Q, vis, color);
| ~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/edmonds_karp_max_flow.hpp:101:29: required from ‘typename boost::property_traits<IndexMap>::value_type boost::edmonds_karp_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, ColorMap, PredEdgeMap) [with Graph = adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, no_property, listS>; CapacityEdgeMap = adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map<directed_tag, detail::edge_desc_impl<directed_tag, long unsigned int>, detail::edge_desc_impl<directed_tag, long unsigned int>&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_reverse_t>; ColorMap = default_color_type*; PredEdgeMap = detail::edge_desc_impl<directed_tag, long unsigned int>*; typename property_traits<IndexMap>::value_type = long unsigned int; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
101 | breadth_first_search(detail::residual_graph(g, res), src, Q,
| ~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
102 | make_bfs_visitor(record_edge_predecessors(pred, on_tree_edge())),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
103 | color);
| ~~~~~~
mincut.hpp:78:21: required from ‘typename boost::graph_traits<G>::edges_size_type boost::min_cut(VertexListGraph&, OutputIterator, OutputIterator) [with VertexListGraph = R_adjacency_list<undirectedS, double>; OutputIterator = std::back_insert_iterator<std::vector<long unsigned int> >; typename graph_traits<G>::edges_size_type = long unsigned int]’
77 | alpha_S_k = edmonds_karp_max_flow
| ~~~~~~~~~~~~~~~~~~~~~
78 | (flow_g, p, k, cap, res_cap, rev_edge, &color[0], &pred[0]);
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
mincut.cpp:128:35: required from here
128 | dst cut_capacity = min_cut(g, std::back_inserter(s_set), std::back_inserter(vs_set) );
| ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::EqualityComparable<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> >]’
20 | ~usage_requirements() { ((Model*)0)->~Model(); }
| ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::EqualityComparable<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:91:9: required from ‘boost::concepts::IncidenceGraph<G>::~IncidenceGraph() [with G = boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::no_property, boost::listS>, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long unsigned int, long unsigned int&, long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all>]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:75:1: required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::IncidenceGraphConcept<boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::no_property, boost::listS>, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long unsigned int, long unsigned int&, long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >]’
75 | BOOST_concept(IncidenceGraph, (G)) : Graph< G >
| ^~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:62:5: required from ‘void boost::breadth_first_visit(const IncidenceGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with IncidenceGraph = filtered_graph<adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, no_property, listS>, is_residual_edge<adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_residual_capacity_t> >, keep_all>; Buffer = queue<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > >; BFSVisitor = bfs_visitor<edge_predecessor_recorder<detail::edge_desc_impl<directed_tag, long unsigned int>*, on_tree_edge> >; ColorMap = default_color_type*; SourceIterator = long unsigned int*]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:136:24: required from ‘void boost::breadth_first_search(const VertexListGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph<adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, no_property, listS>, is_residual_edge<adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_residual_capacity_t> >, keep_all>; SourceIterator = long unsigned int*; Buffer = queue<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > >; BFSVisitor = bfs_visitor<edge_predecessor_recorder<detail::edge_desc_impl<directed_tag, long unsigned int>*, on_tree_edge> >; ColorMap = default_color_type*]’
136 | breadth_first_visit(g, sources_begin, sources_end, Q, vis, color);
| ~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:147:25: required from ‘void boost::breadth_first_search(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph<adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, no_property, listS>, is_residual_edge<adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_residual_capacity_t> >, keep_all>; Buffer = queue<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > >; BFSVisitor = bfs_visitor<edge_predecessor_recorder<detail::edge_desc_impl<directed_tag, long unsigned int>*, on_tree_edge> >; ColorMap = default_color_type*; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
147 | breadth_first_search(g, sources, sources + 1, Q, vis, color);
| ~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/edmonds_karp_max_flow.hpp:101:29: required from ‘typename boost::property_traits<IndexMap>::value_type boost::edmonds_karp_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, ColorMap, PredEdgeMap) [with Graph = adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, no_property, listS>; CapacityEdgeMap = adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map<directed_tag, detail::edge_desc_impl<directed_tag, long unsigned int>, detail::edge_desc_impl<directed_tag, long unsigned int>&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_reverse_t>; ColorMap = default_color_type*; PredEdgeMap = detail::edge_desc_impl<directed_tag, long unsigned int>*; typename property_traits<IndexMap>::value_type = long unsigned int; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
101 | breadth_first_search(detail::residual_graph(g, res), src, Q,
| ~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
102 | make_bfs_visitor(record_edge_predecessors(pred, on_tree_edge())),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
103 | color);
| ~~~~~~
mincut.hpp:78:21: required from ‘typename boost::graph_traits<G>::edges_size_type boost::min_cut(VertexListGraph&, OutputIterator, OutputIterator) [with VertexListGraph = R_adjacency_list<undirectedS, double>; OutputIterator = std::back_insert_iterator<std::vector<long unsigned int> >; typename graph_traits<G>::edges_size_type = long unsigned int]’
77 | alpha_S_k = edmonds_karp_max_flow
| ~~~~~~~~~~~~~~~~~~~~~
78 | (flow_g, p, k, cap, res_cap, rev_edge, &color[0], &pred[0]);
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
mincut.cpp:128:35: required from here
128 | dst cut_capacity = min_cut(g, std::back_inserter(s_set), std::back_inserter(vs_set) );
| ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::EqualityComparable<TT>::~EqualityComparable() [with TT = boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>]’
37 | ~model()
| ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:233:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
233 | BOOST_CONCEPT_USAGE(EqualityComparable) {
| ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Assignable<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:145:5: required from ‘struct boost::Assignable<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> >’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::Assignable<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> >]’
32 | inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
| ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied<boost::Assignable<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > >::value’
44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied<boost::Assignable<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > >’
45 | typedef boost::integral_constant<bool, value> type;
| ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_<void (*)(boost::Assignable<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> >)>’
72 | struct requirement_<void(*)(Model)>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:92:9: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:62:5: required from ‘void boost::breadth_first_visit(const IncidenceGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with IncidenceGraph = filtered_graph<adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, no_property, listS>, is_residual_edge<adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_residual_capacity_t> >, keep_all>; Buffer = queue<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > >; BFSVisitor = bfs_visitor<edge_predecessor_recorder<detail::edge_desc_impl<directed_tag, long unsigned int>*, on_tree_edge> >; ColorMap = default_color_type*; SourceIterator = long unsigned int*]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:136:24: required from ‘void boost::breadth_first_search(const VertexListGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph<adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, no_property, listS>, is_residual_edge<adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_residual_capacity_t> >, keep_all>; SourceIterator = long unsigned int*; Buffer = queue<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > >; BFSVisitor = bfs_visitor<edge_predecessor_recorder<detail::edge_desc_impl<directed_tag, long unsigned int>*, on_tree_edge> >; ColorMap = default_color_type*]’
136 | breadth_first_visit(g, sources_begin, sources_end, Q, vis, color);
| ~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:147:25: required from ‘void boost::breadth_first_search(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph<adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, no_property, listS>, is_residual_edge<adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_residual_capacity_t> >, keep_all>; Buffer = queue<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > >; BFSVisitor = bfs_visitor<edge_predecessor_recorder<detail::edge_desc_impl<directed_tag, long unsigned int>*, on_tree_edge> >; ColorMap = default_color_type*; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
147 | breadth_first_search(g, sources, sources + 1, Q, vis, color);
| ~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/edmonds_karp_max_flow.hpp:101:29: required from ‘typename boost::property_traits<IndexMap>::value_type boost::edmonds_karp_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, ColorMap, PredEdgeMap) [with Graph = adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, no_property, listS>; CapacityEdgeMap = adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map<directed_tag, detail::edge_desc_impl<directed_tag, long unsigned int>, detail::edge_desc_impl<directed_tag, long unsigned int>&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_reverse_t>; ColorMap = default_color_type*; PredEdgeMap = detail::edge_desc_impl<directed_tag, long unsigned int>*; typename property_traits<IndexMap>::value_type = long unsigned int; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
101 | breadth_first_search(detail::residual_graph(g, res), src, Q,
| ~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
102 | make_bfs_visitor(record_edge_predecessors(pred, on_tree_edge())),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
103 | color);
| ~~~~~~
mincut.hpp:78:21: required from ‘typename boost::graph_traits<G>::edges_size_type boost::min_cut(VertexListGraph&, OutputIterator, OutputIterator) [with VertexListGraph = R_adjacency_list<undirectedS, double>; OutputIterator = std::back_insert_iterator<std::vector<long unsigned int> >; typename graph_traits<G>::edges_size_type = long unsigned int]’
77 | alpha_S_k = edmonds_karp_max_flow
| ~~~~~~~~~~~~~~~~~~~~~
78 | (flow_g, p, k, cap, res_cap, rev_edge, &color[0], &pred[0]);
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
mincut.cpp:128:35: required from here
128 | dst cut_capacity = min_cut(g, std::back_inserter(s_set), std::back_inserter(vs_set) );
| ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Assignable<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> >]’
20 | ~usage_requirements() { ((Model*)0)->~Model(); }
| ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::Assignable<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:92:9: required from ‘boost::concepts::IncidenceGraph<G>::~IncidenceGraph() [with G = boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::no_property, boost::listS>, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long unsigned int, long unsigned int&, long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all>]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:75:1: required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::IncidenceGraphConcept<boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::no_property, boost::listS>, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long unsigned int, long unsigned int&, long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >]’
75 | BOOST_concept(IncidenceGraph, (G)) : Graph< G >
| ^~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:62:5: required from ‘void boost::breadth_first_visit(const IncidenceGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with IncidenceGraph = filtered_graph<adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, no_property, listS>, is_residual_edge<adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_residual_capacity_t> >, keep_all>; Buffer = queue<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > >; BFSVisitor = bfs_visitor<edge_predecessor_recorder<detail::edge_desc_impl<directed_tag, long unsigned int>*, on_tree_edge> >; ColorMap = default_color_type*; SourceIterator = long unsigned int*]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:136:24: required from ‘void boost::breadth_first_search(const VertexListGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph<adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, no_property, listS>, is_residual_edge<adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_residual_capacity_t> >, keep_all>; SourceIterator = long unsigned int*; Buffer = queue<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > >; BFSVisitor = bfs_visitor<edge_predecessor_recorder<detail::edge_desc_impl<directed_tag, long unsigned int>*, on_tree_edge> >; ColorMap = default_color_type*]’
136 | breadth_first_visit(g, sources_begin, sources_end, Q, vis, color);
| ~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:147:25: required from ‘void boost::breadth_first_search(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph<adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, no_property, listS>, is_residual_edge<adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_residual_capacity_t> >, keep_all>; Buffer = queue<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > >; BFSVisitor = bfs_visitor<edge_predecessor_recorder<detail::edge_desc_impl<directed_tag, long unsigned int>*, on_tree_edge> >; ColorMap = default_color_type*; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
147 | breadth_first_search(g, sources, sources + 1, Q, vis, color);
| ~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/edmonds_karp_max_flow.hpp:101:29: required from ‘typename boost::property_traits<IndexMap>::value_type boost::edmonds_karp_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, ColorMap, PredEdgeMap) [with Graph = adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, no_property, listS>; CapacityEdgeMap = adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map<directed_tag, detail::edge_desc_impl<directed_tag, long unsigned int>, detail::edge_desc_impl<directed_tag, long unsigned int>&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_reverse_t>; ColorMap = default_color_type*; PredEdgeMap = detail::edge_desc_impl<directed_tag, long unsigned int>*; typename property_traits<IndexMap>::value_type = long unsigned int; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
101 | breadth_first_search(detail::residual_graph(g, res), src, Q,
| ~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
102 | make_bfs_visitor(record_edge_predecessors(pred, on_tree_edge())),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
103 | color);
| ~~~~~~
mincut.hpp:78:21: required from ‘typename boost::graph_traits<G>::edges_size_type boost::min_cut(VertexListGraph&, OutputIterator, OutputIterator) [with VertexListGraph = R_adjacency_list<undirectedS, double>; OutputIterator = std::back_insert_iterator<std::vector<long unsigned int> >; typename graph_traits<G>::edges_size_type = long unsigned int]’
77 | alpha_S_k = edmonds_karp_max_flow
| ~~~~~~~~~~~~~~~~~~~~~
78 | (flow_g, p, k, cap, res_cap, rev_edge, &color[0], &pred[0]);
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
mincut.cpp:128:35: required from here
128 | dst cut_capacity = min_cut(g, std::back_inserter(s_set), std::back_inserter(vs_set) );
| ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Assignable<TT>::~Assignable() [with TT = boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>]’
37 | ~model()
| ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:145:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
145 | BOOST_CONCEPT_USAGE(Assignable) {
| ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Convertible<boost::adj_list_dir_traversal_tag, boost::incidence_graph_tag> >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/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> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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);
| ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/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) );
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/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;
| ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/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)>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:93:9: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:62:5: required from ‘void boost::breadth_first_visit(const IncidenceGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with IncidenceGraph = filtered_graph<adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, no_property, listS>, is_residual_edge<adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_residual_capacity_t> >, keep_all>; Buffer = queue<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > >; BFSVisitor = bfs_visitor<edge_predecessor_recorder<detail::edge_desc_impl<directed_tag, long unsigned int>*, on_tree_edge> >; ColorMap = default_color_type*; SourceIterator = long unsigned int*]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:136:24: required from ‘void boost::breadth_first_search(const VertexListGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph<adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, no_property, listS>, is_residual_edge<adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_residual_capacity_t> >, keep_all>; SourceIterator = long unsigned int*; Buffer = queue<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > >; BFSVisitor = bfs_visitor<edge_predecessor_recorder<detail::edge_desc_impl<directed_tag, long unsigned int>*, on_tree_edge> >; ColorMap = default_color_type*]’
136 | breadth_first_visit(g, sources_begin, sources_end, Q, vis, color);
| ~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:147:25: required from ‘void boost::breadth_first_search(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph<adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, no_property, listS>, is_residual_edge<adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_residual_capacity_t> >, keep_all>; Buffer = queue<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > >; BFSVisitor = bfs_visitor<edge_predecessor_recorder<detail::edge_desc_impl<directed_tag, long unsigned int>*, on_tree_edge> >; ColorMap = default_color_type*; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
147 | breadth_first_search(g, sources, sources + 1, Q, vis, color);
| ~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/edmonds_karp_max_flow.hpp:101:29: required from ‘typename boost::property_traits<IndexMap>::value_type boost::edmonds_karp_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, ColorMap, PredEdgeMap) [with Graph = adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, no_property, listS>; CapacityEdgeMap = adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map<directed_tag, detail::edge_desc_impl<directed_tag, long unsigned int>, detail::edge_desc_impl<directed_tag, long unsigned int>&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_reverse_t>; ColorMap = default_color_type*; PredEdgeMap = detail::edge_desc_impl<directed_tag, long unsigned int>*; typename property_traits<IndexMap>::value_type = long unsigned int; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
101 | breadth_first_search(detail::residual_graph(g, res), src, Q,
| ~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
102 | make_bfs_visitor(record_edge_predecessors(pred, on_tree_edge())),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
103 | color);
| ~~~~~~
mincut.hpp:78:21: required from ‘typename boost::graph_traits<G>::edges_size_type boost::min_cut(VertexListGraph&, OutputIterator, OutputIterator) [with VertexListGraph = R_adjacency_list<undirectedS, double>; OutputIterator = std::back_insert_iterator<std::vector<long unsigned int> >; typename graph_traits<G>::edges_size_type = long unsigned int]’
77 | alpha_S_k = edmonds_karp_max_flow
| ~~~~~~~~~~~~~~~~~~~~~
78 | (flow_g, p, k, cap, res_cap, rev_edge, &color[0], &pred[0]);
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
mincut.cpp:128:35: required from here
128 | dst cut_capacity = min_cut(g, std::back_inserter(s_set), std::back_inserter(vs_set) );
| ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Convertible<boost::adj_list_dir_traversal_tag, boost::incidence_graph_tag>]’
20 | ~usage_requirements() { ((Model*)0)->~Model(); }
| ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::Convertible<boost::adj_list_dir_traversal_tag, boost::incidence_graph_tag>]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:93:9: required from ‘boost::concepts::IncidenceGraph<G>::~IncidenceGraph() [with G = boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::no_property, boost::listS>, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long unsigned int, long unsigned int&, long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all>]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/graph_concepts.hpp:75:1: required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::IncidenceGraphConcept<boost::filtered_graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::no_property, boost::listS>, boost::is_residual_edge<boost::adj_list_edge_property_map<boost::directed_tag, long unsigned int, long unsigned int&, long unsigned int, boost::property<boost::edge_capacity_t, long unsigned int, boost::property<boost::edge_residual_capacity_t, long unsigned int, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > >, boost::edge_residual_capacity_t> >, boost::keep_all> >]’
75 | BOOST_concept(IncidenceGraph, (G)) : Graph< G >
| ^~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:62:5: required from ‘void boost::breadth_first_visit(const IncidenceGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with IncidenceGraph = filtered_graph<adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, no_property, listS>, is_residual_edge<adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_residual_capacity_t> >, keep_all>; Buffer = queue<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > >; BFSVisitor = bfs_visitor<edge_predecessor_recorder<detail::edge_desc_impl<directed_tag, long unsigned int>*, on_tree_edge> >; ColorMap = default_color_type*; SourceIterator = long unsigned int*]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:136:24: required from ‘void boost::breadth_first_search(const VertexListGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph<adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, no_property, listS>, is_residual_edge<adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_residual_capacity_t> >, keep_all>; SourceIterator = long unsigned int*; Buffer = queue<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > >; BFSVisitor = bfs_visitor<edge_predecessor_recorder<detail::edge_desc_impl<directed_tag, long unsigned int>*, on_tree_edge> >; ColorMap = default_color_type*]’
136 | breadth_first_visit(g, sources_begin, sources_end, Q, vis, color);
| ~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:147:25: required from ‘void boost::breadth_first_search(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph<adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, no_property, listS>, is_residual_edge<adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_residual_capacity_t> >, keep_all>; Buffer = queue<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > >; BFSVisitor = bfs_visitor<edge_predecessor_recorder<detail::edge_desc_impl<directed_tag, long unsigned int>*, on_tree_edge> >; ColorMap = default_color_type*; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
147 | breadth_first_search(g, sources, sources + 1, Q, vis, color);
| ~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/edmonds_karp_max_flow.hpp:101:29: required from ‘typename boost::property_traits<IndexMap>::value_type boost::edmonds_karp_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, ColorMap, PredEdgeMap) [with Graph = adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, no_property, listS>; CapacityEdgeMap = adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map<directed_tag, detail::edge_desc_impl<directed_tag, long unsigned int>, detail::edge_desc_impl<directed_tag, long unsigned int>&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_reverse_t>; ColorMap = default_color_type*; PredEdgeMap = detail::edge_desc_impl<directed_tag, long unsigned int>*; typename property_traits<IndexMap>::value_type = long unsigned int; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
101 | breadth_first_search(detail::residual_graph(g, res), src, Q,
| ~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
102 | make_bfs_visitor(record_edge_predecessors(pred, on_tree_edge())),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
103 | color);
| ~~~~~~
mincut.hpp:78:21: required from ‘typename boost::graph_traits<G>::edges_size_type boost::min_cut(VertexListGraph&, OutputIterator, OutputIterator) [with VertexListGraph = R_adjacency_list<undirectedS, double>; OutputIterator = std::back_insert_iterator<std::vector<long unsigned int> >; typename graph_traits<G>::edges_size_type = long unsigned int]’
77 | alpha_S_k = edmonds_karp_max_flow
| ~~~~~~~~~~~~~~~~~~~~~
78 | (flow_g, p, k, cap, res_cap, rev_edge, &color[0], &pred[0]);
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
mincut.cpp:128:35: required from here
128 | dst cut_capacity = min_cut(g, std::back_inserter(s_set), std::back_inserter(vs_set) );
| ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible<X, Y>::~Convertible() [with X = boost::adj_list_dir_traversal_tag; Y = boost::incidence_graph_tag]’
37 | ~model()
| ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
208 | BOOST_CONCEPT_USAGE(Convertible) {
| ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::CopyConstructible<boost::bfs_visitor<boost::edge_predecessor_recorder<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>*, boost::on_tree_edge> > >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/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::bfs_visitor<boost::edge_predecessor_recorder<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>*, boost::on_tree_edge> > > >]’
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:167:5: required from ‘struct boost::CopyConstructible<boost::bfs_visitor<boost::edge_predecessor_recorder<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>*, boost::on_tree_edge> > >’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:165:3: required from ‘struct boost::CopyConstructibleConcept<boost::bfs_visitor<boost::edge_predecessor_recorder<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>*, boost::on_tree_edge> > >’
165 | BOOST_concept(CopyConstructible,(TT))
| ^~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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::bfs_visitor<boost::edge_predecessor_recorder<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>*, boost::on_tree_edge> > >]’
32 | inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
| ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied<boost::CopyConstructibleConcept<boost::bfs_visitor<boost::edge_predecessor_recorder<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>*, boost::on_tree_edge> > > >::value’
44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 7 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:65:5: required from ‘void boost::breadth_first_visit(const IncidenceGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with IncidenceGraph = filtered_graph<adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, no_property, listS>, is_residual_edge<adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_residual_capacity_t> >, keep_all>; Buffer = queue<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > >; BFSVisitor = bfs_visitor<edge_predecessor_recorder<detail::edge_desc_impl<directed_tag, long unsigned int>*, on_tree_edge> >; ColorMap = default_color_type*; SourceIterator = long unsigned int*]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:136:24: required from ‘void boost::breadth_first_search(const VertexListGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph<adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, no_property, listS>, is_residual_edge<adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_residual_capacity_t> >, keep_all>; SourceIterator = long unsigned int*; Buffer = queue<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > >; BFSVisitor = bfs_visitor<edge_predecessor_recorder<detail::edge_desc_impl<directed_tag, long unsigned int>*, on_tree_edge> >; ColorMap = default_color_type*]’
136 | breadth_first_visit(g, sources_begin, sources_end, Q, vis, color);
| ~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:147:25: required from ‘void boost::breadth_first_search(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph<adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, no_property, listS>, is_residual_edge<adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_residual_capacity_t> >, keep_all>; Buffer = queue<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > >; BFSVisitor = bfs_visitor<edge_predecessor_recorder<detail::edge_desc_impl<directed_tag, long unsigned int>*, on_tree_edge> >; ColorMap = default_color_type*; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
147 | breadth_first_search(g, sources, sources + 1, Q, vis, color);
| ~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/edmonds_karp_max_flow.hpp:101:29: required from ‘typename boost::property_traits<IndexMap>::value_type boost::edmonds_karp_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, ColorMap, PredEdgeMap) [with Graph = adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, no_property, listS>; CapacityEdgeMap = adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map<directed_tag, detail::edge_desc_impl<directed_tag, long unsigned int>, detail::edge_desc_impl<directed_tag, long unsigned int>&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_reverse_t>; ColorMap = default_color_type*; PredEdgeMap = detail::edge_desc_impl<directed_tag, long unsigned int>*; typename property_traits<IndexMap>::value_type = long unsigned int; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
101 | breadth_first_search(detail::residual_graph(g, res), src, Q,
| ~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
102 | make_bfs_visitor(record_edge_predecessors(pred, on_tree_edge())),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
103 | color);
| ~~~~~~
mincut.hpp:78:21: required from ‘typename boost::graph_traits<G>::edges_size_type boost::min_cut(VertexListGraph&, OutputIterator, OutputIterator) [with VertexListGraph = R_adjacency_list<undirectedS, double>; OutputIterator = std::back_insert_iterator<std::vector<long unsigned int> >; typename graph_traits<G>::edges_size_type = long unsigned int]’
77 | alpha_S_k = edmonds_karp_max_flow
| ~~~~~~~~~~~~~~~~~~~~~
78 | (flow_g, p, k, cap, res_cap, rev_edge, &color[0], &pred[0]);
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
mincut.cpp:128:35: required from here
128 | dst cut_capacity = min_cut(g, std::back_inserter(s_set), std::back_inserter(vs_set) );
| ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
20 | ~usage_requirements() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::CopyConstructible<TT>::~CopyConstructible() [with TT = boost::bfs_visitor<boost::edge_predecessor_recorder<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>*, boost::on_tree_edge> >]’
37 | ~model()
| ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:167:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
167 | BOOST_CONCEPT_USAGE(CopyConstructible) {
| ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Convertible<boost::lvalue_property_map_tag, boost::readable_property_map_tag> >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/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> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/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))
| ^~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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);
| ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/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) );
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/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;
| ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 11 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:66:5: required from ‘void boost::breadth_first_visit(const IncidenceGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with IncidenceGraph = filtered_graph<adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, no_property, listS>, is_residual_edge<adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_residual_capacity_t> >, keep_all>; Buffer = queue<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > >; BFSVisitor = bfs_visitor<edge_predecessor_recorder<detail::edge_desc_impl<directed_tag, long unsigned int>*, on_tree_edge> >; ColorMap = default_color_type*; SourceIterator = long unsigned int*]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:136:24: required from ‘void boost::breadth_first_search(const VertexListGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph<adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, no_property, listS>, is_residual_edge<adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_residual_capacity_t> >, keep_all>; SourceIterator = long unsigned int*; Buffer = queue<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > >; BFSVisitor = bfs_visitor<edge_predecessor_recorder<detail::edge_desc_impl<directed_tag, long unsigned int>*, on_tree_edge> >; ColorMap = default_color_type*]’
136 | breadth_first_visit(g, sources_begin, sources_end, Q, vis, color);
| ~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:147:25: required from ‘void boost::breadth_first_search(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph<adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, no_property, listS>, is_residual_edge<adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_residual_capacity_t> >, keep_all>; Buffer = queue<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > >; BFSVisitor = bfs_visitor<edge_predecessor_recorder<detail::edge_desc_impl<directed_tag, long unsigned int>*, on_tree_edge> >; ColorMap = default_color_type*; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
147 | breadth_first_search(g, sources, sources + 1, Q, vis, color);
| ~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/edmonds_karp_max_flow.hpp:101:29: required from ‘typename boost::property_traits<IndexMap>::value_type boost::edmonds_karp_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, ColorMap, PredEdgeMap) [with Graph = adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, no_property, listS>; CapacityEdgeMap = adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map<directed_tag, detail::edge_desc_impl<directed_tag, long unsigned int>, detail::edge_desc_impl<directed_tag, long unsigned int>&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_reverse_t>; ColorMap = default_color_type*; PredEdgeMap = detail::edge_desc_impl<directed_tag, long unsigned int>*; typename property_traits<IndexMap>::value_type = long unsigned int; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
101 | breadth_first_search(detail::residual_graph(g, res), src, Q,
| ~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
102 | make_bfs_visitor(record_edge_predecessors(pred, on_tree_edge())),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
103 | color);
| ~~~~~~
mincut.hpp:78:21: required from ‘typename boost::graph_traits<G>::edges_size_type boost::min_cut(VertexListGraph&, OutputIterator, OutputIterator) [with VertexListGraph = R_adjacency_list<undirectedS, double>; OutputIterator = std::back_insert_iterator<std::vector<long unsigned int> >; typename graph_traits<G>::edges_size_type = long unsigned int]’
77 | alpha_S_k = edmonds_karp_max_flow
| ~~~~~~~~~~~~~~~~~~~~~
78 | (flow_g, p, k, cap, res_cap, rev_edge, &color[0], &pred[0]);
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
mincut.cpp:128:35: required from here
128 | dst cut_capacity = min_cut(g, std::back_inserter(s_set), std::back_inserter(vs_set) );
| ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Convertible<boost::lvalue_property_map_tag, boost::readable_property_map_tag>]’
20 | ~usage_requirements() { ((Model*)0)->~Model(); }
| ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::ConvertibleConcept<boost::lvalue_property_map_tag, boost::readable_property_map_tag>]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:148:7: required from ‘void boost::ReadablePropertyMapConcept<PMap, Key>::constraints() [with PMap = boost::default_color_type*; Key = long unsigned int]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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::default_color_type*, long unsigned int>]’
32 | inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
| ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied<boost::ReadablePropertyMapConcept<boost::default_color_type*, long unsigned int> >::value’
44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied<boost::ReadablePropertyMapConcept<boost::default_color_type*, long unsigned int> >’
45 | typedef boost::integral_constant<bool, value> type;
| ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_<void (*)(boost::ReadablePropertyMapConcept<boost::default_color_type*, long unsigned int>)>’
72 | struct requirement_<void(*)(Model)>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:206:7: [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:66:5: required from ‘void boost::breadth_first_visit(const IncidenceGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with IncidenceGraph = filtered_graph<adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, no_property, listS>, is_residual_edge<adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_residual_capacity_t> >, keep_all>; Buffer = queue<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > >; BFSVisitor = bfs_visitor<edge_predecessor_recorder<detail::edge_desc_impl<directed_tag, long unsigned int>*, on_tree_edge> >; ColorMap = default_color_type*; SourceIterator = long unsigned int*]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:136:24: required from ‘void boost::breadth_first_search(const VertexListGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph<adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, no_property, listS>, is_residual_edge<adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_residual_capacity_t> >, keep_all>; SourceIterator = long unsigned int*; Buffer = queue<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > >; BFSVisitor = bfs_visitor<edge_predecessor_recorder<detail::edge_desc_impl<directed_tag, long unsigned int>*, on_tree_edge> >; ColorMap = default_color_type*]’
136 | breadth_first_visit(g, sources_begin, sources_end, Q, vis, color);
| ~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:147:25: required from ‘void boost::breadth_first_search(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph<adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, no_property, listS>, is_residual_edge<adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_residual_capacity_t> >, keep_all>; Buffer = queue<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > >; BFSVisitor = bfs_visitor<edge_predecessor_recorder<detail::edge_desc_impl<directed_tag, long unsigned int>*, on_tree_edge> >; ColorMap = default_color_type*; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
147 | breadth_first_search(g, sources, sources + 1, Q, vis, color);
| ~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/edmonds_karp_max_flow.hpp:101:29: required from ‘typename boost::property_traits<IndexMap>::value_type boost::edmonds_karp_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, ColorMap, PredEdgeMap) [with Graph = adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, no_property, listS>; CapacityEdgeMap = adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map<directed_tag, detail::edge_desc_impl<directed_tag, long unsigned int>, detail::edge_desc_impl<directed_tag, long unsigned int>&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_reverse_t>; ColorMap = default_color_type*; PredEdgeMap = detail::edge_desc_impl<directed_tag, long unsigned int>*; typename property_traits<IndexMap>::value_type = long unsigned int; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
101 | breadth_first_search(detail::residual_graph(g, res), src, Q,
| ~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
102 | make_bfs_visitor(record_edge_predecessors(pred, on_tree_edge())),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
103 | color);
| ~~~~~~
mincut.hpp:78:21: required from ‘typename boost::graph_traits<G>::edges_size_type boost::min_cut(VertexListGraph&, OutputIterator, OutputIterator) [with VertexListGraph = R_adjacency_list<undirectedS, double>; OutputIterator = std::back_insert_iterator<std::vector<long unsigned int> >; typename graph_traits<G>::edges_size_type = long unsigned int]’
77 | alpha_S_k = edmonds_karp_max_flow
| ~~~~~~~~~~~~~~~~~~~~~
78 | (flow_g, p, k, cap, res_cap, rev_edge, &color[0], &pred[0]);
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
mincut.cpp:128:35: required from here
128 | dst cut_capacity = min_cut(g, std::back_inserter(s_set), std::back_inserter(vs_set) );
| ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:206:17: note: in a call to non-static member function ‘boost::ConvertibleConcept<boost::lvalue_property_map_tag, boost::readable_property_map_tag>::~ConvertibleConcept()’
206 | BOOST_concept(Convertible,(X)(Y))
| ^~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/preprocessor/cat.hpp:29:34: note: in definition of macro ‘BOOST_PP_CAT_I’
29 | # define BOOST_PP_CAT_I(a, b) a ## b
| ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/concept_def.hpp:23:12: note: in expansion of macro ‘BOOST_PP_CAT’
23 | struct BOOST_PP_CAT(name,Concept) \
| ^~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:206:3: note: in expansion of macro ‘BOOST_concept’
206 | BOOST_concept(Convertible,(X)(Y))
| ^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Convertible<boost::lvalue_property_map_tag, boost::writable_property_map_tag> >]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/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> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/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))
| ^~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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);
| ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/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) );
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/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;
| ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 11 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:66:5: required from ‘void boost::breadth_first_visit(const IncidenceGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with IncidenceGraph = filtered_graph<adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, no_property, listS>, is_residual_edge<adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_residual_capacity_t> >, keep_all>; Buffer = queue<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > >; BFSVisitor = bfs_visitor<edge_predecessor_recorder<detail::edge_desc_impl<directed_tag, long unsigned int>*, on_tree_edge> >; ColorMap = default_color_type*; SourceIterator = long unsigned int*]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:136:24: required from ‘void boost::breadth_first_search(const VertexListGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph<adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, no_property, listS>, is_residual_edge<adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_residual_capacity_t> >, keep_all>; SourceIterator = long unsigned int*; Buffer = queue<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > >; BFSVisitor = bfs_visitor<edge_predecessor_recorder<detail::edge_desc_impl<directed_tag, long unsigned int>*, on_tree_edge> >; ColorMap = default_color_type*]’
136 | breadth_first_visit(g, sources_begin, sources_end, Q, vis, color);
| ~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:147:25: required from ‘void boost::breadth_first_search(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph<adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, no_property, listS>, is_residual_edge<adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_residual_capacity_t> >, keep_all>; Buffer = queue<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > >; BFSVisitor = bfs_visitor<edge_predecessor_recorder<detail::edge_desc_impl<directed_tag, long unsigned int>*, on_tree_edge> >; ColorMap = default_color_type*; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
147 | breadth_first_search(g, sources, sources + 1, Q, vis, color);
| ~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/edmonds_karp_max_flow.hpp:101:29: required from ‘typename boost::property_traits<IndexMap>::value_type boost::edmonds_karp_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, ColorMap, PredEdgeMap) [with Graph = adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, no_property, listS>; CapacityEdgeMap = adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map<directed_tag, detail::edge_desc_impl<directed_tag, long unsigned int>, detail::edge_desc_impl<directed_tag, long unsigned int>&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_reverse_t>; ColorMap = default_color_type*; PredEdgeMap = detail::edge_desc_impl<directed_tag, long unsigned int>*; typename property_traits<IndexMap>::value_type = long unsigned int; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
101 | breadth_first_search(detail::residual_graph(g, res), src, Q,
| ~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
102 | make_bfs_visitor(record_edge_predecessors(pred, on_tree_edge())),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
103 | color);
| ~~~~~~
mincut.hpp:78:21: required from ‘typename boost::graph_traits<G>::edges_size_type boost::min_cut(VertexListGraph&, OutputIterator, OutputIterator) [with VertexListGraph = R_adjacency_list<undirectedS, double>; OutputIterator = std::back_insert_iterator<std::vector<long unsigned int> >; typename graph_traits<G>::edges_size_type = long unsigned int]’
77 | alpha_S_k = edmonds_karp_max_flow
| ~~~~~~~~~~~~~~~~~~~~~
78 | (flow_g, p, k, cap, res_cap, rev_edge, &color[0], &pred[0]);
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
mincut.cpp:128:35: required from here
128 | dst cut_capacity = min_cut(g, std::back_inserter(s_set), std::back_inserter(vs_set) );
| ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Convertible<boost::lvalue_property_map_tag, boost::writable_property_map_tag>]’
20 | ~usage_requirements() { ((Model*)0)->~Model(); }
| ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::ConvertibleConcept<boost::lvalue_property_map_tag, boost::writable_property_map_tag>]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:180:7: required from ‘void boost::WritablePropertyMapConcept<PMap, Key>::constraints() [with PMap = boost::default_color_type*; Key = long unsigned int]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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::default_color_type*, long unsigned int>]’
32 | inline yes has_constraints_(Model*, wrap_constraints<Model,&Model::constraints>* = 0);
| ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:42:5: required from ‘const bool boost::concepts::not_satisfied<boost::WritablePropertyMapConcept<boost::default_color_type*, long unsigned int> >::value’
44 | , value = sizeof( detail::has_constraints_((Model*)0) ) == sizeof(detail::yes) );
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied<boost::WritablePropertyMapConcept<boost::default_color_type*, long unsigned int> >’
45 | typedef boost::integral_constant<bool, value> type;
| ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_<void (*)(boost::WritablePropertyMapConcept<boost::default_color_type*, long unsigned int>)>’
72 | struct requirement_<void(*)(Model)>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:207:7: [ skipping 5 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:66:5: required from ‘void boost::breadth_first_visit(const IncidenceGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with IncidenceGraph = filtered_graph<adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, no_property, listS>, is_residual_edge<adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_residual_capacity_t> >, keep_all>; Buffer = queue<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > >; BFSVisitor = bfs_visitor<edge_predecessor_recorder<detail::edge_desc_impl<directed_tag, long unsigned int>*, on_tree_edge> >; ColorMap = default_color_type*; SourceIterator = long unsigned int*]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:136:24: required from ‘void boost::breadth_first_search(const VertexListGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph<adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, no_property, listS>, is_residual_edge<adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_residual_capacity_t> >, keep_all>; SourceIterator = long unsigned int*; Buffer = queue<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > >; BFSVisitor = bfs_visitor<edge_predecessor_recorder<detail::edge_desc_impl<directed_tag, long unsigned int>*, on_tree_edge> >; ColorMap = default_color_type*]’
136 | breadth_first_visit(g, sources_begin, sources_end, Q, vis, color);
| ~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:147:25: required from ‘void boost::breadth_first_search(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph<adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, no_property, listS>, is_residual_edge<adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_residual_capacity_t> >, keep_all>; Buffer = queue<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > >; BFSVisitor = bfs_visitor<edge_predecessor_recorder<detail::edge_desc_impl<directed_tag, long unsigned int>*, on_tree_edge> >; ColorMap = default_color_type*; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
147 | breadth_first_search(g, sources, sources + 1, Q, vis, color);
| ~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/edmonds_karp_max_flow.hpp:101:29: required from ‘typename boost::property_traits<IndexMap>::value_type boost::edmonds_karp_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, ColorMap, PredEdgeMap) [with Graph = adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, no_property, listS>; CapacityEdgeMap = adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map<directed_tag, detail::edge_desc_impl<directed_tag, long unsigned int>, detail::edge_desc_impl<directed_tag, long unsigned int>&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_reverse_t>; ColorMap = default_color_type*; PredEdgeMap = detail::edge_desc_impl<directed_tag, long unsigned int>*; typename property_traits<IndexMap>::value_type = long unsigned int; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
101 | breadth_first_search(detail::residual_graph(g, res), src, Q,
| ~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
102 | make_bfs_visitor(record_edge_predecessors(pred, on_tree_edge())),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
103 | color);
| ~~~~~~
mincut.hpp:78:21: required from ‘typename boost::graph_traits<G>::edges_size_type boost::min_cut(VertexListGraph&, OutputIterator, OutputIterator) [with VertexListGraph = R_adjacency_list<undirectedS, double>; OutputIterator = std::back_insert_iterator<std::vector<long unsigned int> >; typename graph_traits<G>::edges_size_type = long unsigned int]’
77 | alpha_S_k = edmonds_karp_max_flow
| ~~~~~~~~~~~~~~~~~~~~~
78 | (flow_g, p, k, cap, res_cap, rev_edge, &color[0], &pred[0]);
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
mincut.cpp:128:35: required from here
128 | dst cut_capacity = min_cut(g, std::back_inserter(s_set), std::back_inserter(vs_set) );
| ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:50:47: warning: ‘this’ pointer is null [-Wnonnull]
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:206:17: note: in a call to non-static member function ‘boost::ConvertibleConcept<boost::lvalue_property_map_tag, boost::writable_property_map_tag>::~ConvertibleConcept()’
206 | BOOST_concept(Convertible,(X)(Y))
| ^~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/preprocessor/cat.hpp:29:34: note: in definition of macro ‘BOOST_PP_CAT_I’
29 | # define BOOST_PP_CAT_I(a, b) a ## b
| ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/concept_def.hpp:23:12: note: in expansion of macro ‘BOOST_PP_CAT’
23 | struct BOOST_PP_CAT(name,Concept) \
| ^~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:206:3: note: in expansion of macro ‘BOOST_concept’
206 | BOOST_concept(Convertible,(X)(Y))
| ^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Convertible<boost::lvalue_property_map_tag, boost::read_write_property_map_tag>]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/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(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/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> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/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))
| ^~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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);
| ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/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) );
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:45:51: [ skipping 7 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:66:5: required from ‘void boost::breadth_first_visit(const IncidenceGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with IncidenceGraph = filtered_graph<adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, no_property, listS>, is_residual_edge<adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_residual_capacity_t> >, keep_all>; Buffer = queue<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > >; BFSVisitor = bfs_visitor<edge_predecessor_recorder<detail::edge_desc_impl<directed_tag, long unsigned int>*, on_tree_edge> >; ColorMap = default_color_type*; SourceIterator = long unsigned int*]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:136:24: required from ‘void boost::breadth_first_search(const VertexListGraph&, SourceIterator, SourceIterator, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph<adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, no_property, listS>, is_residual_edge<adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_residual_capacity_t> >, keep_all>; SourceIterator = long unsigned int*; Buffer = queue<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > >; BFSVisitor = bfs_visitor<edge_predecessor_recorder<detail::edge_desc_impl<directed_tag, long unsigned int>*, on_tree_edge> >; ColorMap = default_color_type*]’
136 | breadth_first_visit(g, sources_begin, sources_end, Q, vis, color);
| ~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/breadth_first_search.hpp:147:25: required from ‘void boost::breadth_first_search(const VertexListGraph&, typename graph_traits<Graph>::vertex_descriptor, Buffer&, BFSVisitor, ColorMap) [with VertexListGraph = filtered_graph<adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, no_property, listS>, is_residual_edge<adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_residual_capacity_t> >, keep_all>; Buffer = queue<long unsigned int, std::deque<long unsigned int, std::allocator<long unsigned int> > >; BFSVisitor = bfs_visitor<edge_predecessor_recorder<detail::edge_desc_impl<directed_tag, long unsigned int>*, on_tree_edge> >; ColorMap = default_color_type*; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
147 | breadth_first_search(g, sources, sources + 1, Q, vis, color);
| ~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/edmonds_karp_max_flow.hpp:101:29: required from ‘typename boost::property_traits<IndexMap>::value_type boost::edmonds_karp_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, ColorMap, PredEdgeMap) [with Graph = adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, no_property, listS>; CapacityEdgeMap = adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map<directed_tag, long unsigned int, long unsigned int&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map<directed_tag, detail::edge_desc_impl<directed_tag, long unsigned int>, detail::edge_desc_impl<directed_tag, long unsigned int>&, long unsigned int, property<edge_capacity_t, long unsigned int, property<edge_residual_capacity_t, long unsigned int, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_reverse_t>; ColorMap = default_color_type*; PredEdgeMap = detail::edge_desc_impl<directed_tag, long unsigned int>*; typename property_traits<IndexMap>::value_type = long unsigned int; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
101 | breadth_first_search(detail::residual_graph(g, res), src, Q,
| ~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
102 | make_bfs_visitor(record_edge_predecessors(pred, on_tree_edge())),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
103 | color);
| ~~~~~~
mincut.hpp:78:21: required from ‘typename boost::graph_traits<G>::edges_size_type boost::min_cut(VertexListGraph&, OutputIterator, OutputIterator) [with VertexListGraph = R_adjacency_list<undirectedS, double>; OutputIterator = std::back_insert_iterator<std::vector<long unsigned int> >; typename graph_traits<G>::edges_size_type = long unsigned int]’
77 | alpha_S_k = edmonds_karp_max_flow
| ~~~~~~~~~~~~~~~~~~~~~
78 | (flow_g, p, k, cap, res_cap, rev_edge, &color[0], &pred[0]);
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
mincut.cpp:128:35: required from here
128 | dst cut_capacity = min_cut(g, std::back_inserter(s_set), std::back_inserter(vs_set) );
| ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:20:48: warning: ‘this’ pointer is null [-Wnonnull]
20 | ~usage_requirements() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp:37:7: note: in a call to non-static member function ‘boost::Convertible<X, Y>::~Convertible() [with X = boost::lvalue_property_map_tag; Y = boost::read_write_property_map_tag]’
37 | ~model()
| ^
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept_check.hpp:208:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
208 | BOOST_CONCEPT_USAGE(Convertible) {
| ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Convertible<std::random_access_iterator_tag, std::input_iterator_tag>]’:
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/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(); }
| ~~~~~~~~~~~~~~~~~~~^~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/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> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/has_constraints.hpp:32:62: required 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);
| ^~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/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) );
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/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;
| ^~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 12 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/concept/detail/general.hpp:72:8: required from ‘struct boost::concepts::requirement_<void (*)(boost::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>*, std::vector<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int>, std::allocator<boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >)>’
72 | struct requirement_<void(*)(Model)>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/property_map/property_map.hpp:354:5: required from ‘boost::iterator_property_map<RAIter, ID, Value, Value&> boost::make_iterator_property_map(RAIter, ID, Value) [with RAIter = __gnu_cxx::__normal_iterator<detail::edge_desc_impl<directed_tag, long unsigned int>*, std::vector<detail::edge_desc_impl<directed_tag, long unsigned int>, std::allocator<detail::edge_desc_impl<directed_tag, long unsigned int> > > >; Value = detail::edge_desc_impl<directed_tag, long unsigned int>; ID = vec_adj_list_vertex_id_map<no_property, long unsigned int>]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/edmonds_karp_max_flow.hpp:209:43: required from ‘static typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::detail::edmonds_karp_dispatch1<boost::param_not_found>::apply(Graph&, typename boost::graph_traits<Graph>::vertex_descriptor, typename boost::graph_traits<Graph>::vertex_descriptor, const boost::bgl_named_params<T, Tag, Base>&, boost::param_not_found) [with Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::directedS, boost::no_property, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, long unsigned int> > > > >; P = int; T = boost::buffer_param_t; R = boost::no_property; typename boost::detail::edge_capacity_value<Graph, P, T, R>::type = double; typename boost::graph_traits<Graph>::vertex_descriptor = long unsigned int]’
209 | make_iterator_property_map(pred_vec.begin(),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~
210 | choose_const_pmap(
| ~~~~~~~~~~~~~~~~~~
211 | get_param(params, vertex_index), g, vertex_index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
212 | pred_vec[0]),
| ~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/edmonds_karp_max_flow.hpp:228:57: required from ‘typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::edmonds_karp_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with Graph = adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value<Graph, P, T, R>::type = double; typename graph_traits<Graph>::vertex_descriptor = long unsigned int]’
228 | return detail::edmonds_karp_dispatch1< Pred >::apply(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
229 | g, src, sink, params, get_param(params, vertex_predecessor));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/home/biocbuild/R/R-4.5.0-devel_2024-11-24/site-library/BH/include/boost/graph/edmonds_karp_max_flow.hpp:240:33: required from ‘typename boost::property_traits<typename boost::property_map<Graph, boost::edge_capacity_t>::const_type>::value_type boost::edmonds_karp_max_flow(Graph&, typename graph_traits<Graph>::vertex_descriptor, typename graph_traits<Graph>::vertex_descriptor) [with Graph = adjacency_list<vecS, vecS, directedS, no_property, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > > >; 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&, long unsigned int, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, long unsigned int> > > >, edge_capacity_t>; typename graph_traits<Graph>